Learning from the Descent Direction: Adaptive Gradient Descent under One-Sided Hölder Regularity
arXiv:2607.22906
2026
Optimization
1 ideas extracted · analyzed Aug 30, 2026
What the math gives to ML
The paper replaces global gradient-Lipschitz control with a one-sided Hölder curvature signal measured only along the actually proposed descent direction. This is transferable as an optimizer step-size rule: estimate the positive Taylor remainder produced by a trial update, then choose the largest step justified by that directional curvature rather than by the worst variation of the full gradient. The most promising first test is a full-batch or large-batch optimizer wrapper around SGD that uses function-value probes and a sufficient-decrease safeguard, with the paper's nonconvex best-iterate rate providing a stability target.
Ideas from this paper
✓✓ Beats tuned baseline
2026
Replace a fixed SGD learning rate with a per-update step selected from the positive curvature observed along the proposed direction. The controller estimates the directional Taylor remainder using one or two function evaluations, increases the step when the observed direction is benign, and backtracks only when the update fails a sufficient-decrease test.
Useful7/10
Difficulty5/10
Novelty6/10