The Sharp Worst-Case Asymptotic Rate of the Barzilai--Borwein Method in $\mathbb R^d$ and Hilbert Spaces
arXiv:2608.07839
2026
Optimization
1 ideas extracted · analyzed Sep 1, 2026
What the math gives to ML
The paper gives a sharp spectral explanation of the Barzilai--Borwein method: on strongly convex quadratics, the worst-case asymptotic gradient factor is exactly governed by the active condition number, c_H = (kappa(H)-1)/(kappa(H)+1). Its transferable asset is the delayed Rayleigh-quotient update, which estimates curvature from consecutive gradients without explicitly forming a Hessian. A practical neural-network adaptation is a safeguarded, blockwise BB optimizer with gradient smoothing and explicit protection against noisy-minibatch denominators.
Ideas from this paper
Unverified
2026
Replace the scalar learning rate of SGD or Adam's outer update by a blockwise Barzilai--Borwein estimate computed from consecutive parameters and gradients. Use gradient smoothing, denominator checks, and clipping so that the curvature estimate remains usable with stochastic neural-network gradients.
Useful6/10
Difficulty5/10
Novelty6/10