Sign inGet started
Paper · arXiv

Learning from the Descent Direction: Adaptive Gradient Descent under One-Sided Hölder Regularity

We study adaptive gradient descent for continuously differentiable, possibly nonconvex objectives under one-sided Hölder regularity. Unlike classical Hölder- or Lipschitz-gradient assumptions, which control the full gradient variation, our condition bounds only the directional term appearing in the descent inequality. This can allow less conservative step sizes when large gradient changes are orthogonal to, or favorable along, the update direction. We propose an adaptive scalar-step method based on an estimate of positive one-sided Hölder curvature, combined with a simple sufficient-decrease safeguard. For nonconvex objectives on a convex region containing the accepted update segments, we...

AuthorsArzu Ahmadova, Ismail Huseynov
Primary categorycs.LG
Published24 July 2026
Last updated at source24 July 2026
cs.LGmath.OC
Embed this entry
<iframe src="https://silytics.si/embed/item/ece941bb-3fc2-4105-8bf4-c15f73c62f1a" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.