Glocal smoothness enables iterate-independent complexity bounds showing line search and adaptive steps outperform fixed steps, with GD+line search sometimes beating accelerated GD.
Multinomial logistic regression algorithm.Ann
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.OC 2verdicts
UNVERDICTED 2representative citing papers
AAMD combines preconditioning, acceleration, and adaptivity in mirror descent using a Lyapunov budget to achieve O(1/k^2) rates under dual relative smoothness and bounded sublevel sets.
citing papers explorer
-
Glocal Smoothness: Line search and adaptive step sizes can help in theory too!
Glocal smoothness enables iterate-independent complexity bounds showing line search and adaptive steps outperform fixed steps, with GD+line search sometimes beating accelerated GD.
-
Adaptive Accelerated Mirror Descent in Primal and Dual Spaces
AAMD combines preconditioning, acceleration, and adaptivity in mirror descent using a Lyapunov budget to achieve O(1/k^2) rates under dual relative smoothness and bounded sublevel sets.