Negative-Curvature-Informed L-BFGS via Minimal Secant Corrections for Finite Minimax Problems
arXiv:2608.29300
2026
Optimization
1 ideas extracted · analyzed Sep 1, 2026
What the math gives to ML
The paper provides a practical way to make limited-memory quasi-Newton training robust to locally indefinite curvature without eigendecompositions, Krylov searches, or costly isotropic damping. Its key transferable asset is a minimal correction of only those secant pairs whose curvature is genuinely negative, while retaining the standard positive-definite BFGS update and two-loop recursion. This is especially relevant for optimizing finite worst-case objectives such as maxima over tasks, augmentations, experts, or adversarial scenarios, where nonsmoothness and negative curvature are common. The most direct neural-network test is full-batch or large-batch L-BFGS fine-tuning with an adaptive negative-curvature pair correction.
Ideas from this paper
✗ Failed on benchmark
2026
Modify an L-BFGS curvature pair only when the observed secant curvature is negative. Replace the gradient-difference vector by the smallest Euclidean or inverse-metric correction that enforces positive curvature, then use the unmodified BFGS update and two-loop recursion. This avoids the computational and conditioning cost of adding a large isotropic damping term to the whole inverse-Hessian approximation.
Useful7/10
Difficulty5/10
Novelty7/10