Globally aware optimization with resurgence
Not on the map. Why?
Abstract (arXiv)
Modern optimization faces a fundamental challenge: local gradient-based methods provide no global information about the objective function L landscape, often leading to suboptimal convergence and sensitivity to initialization. We introduce a novel optimization framework that leverages resurgence theory from complex analysis to extract global structural information from divergent asymptotic series. Our key insight is that the factorially divergent perturbative expansions of parameter space partition functions encode precise information about all critical objective function value in the landscape through their Borel transform singularities. The algorithm works by computing the statistical mechanical partition function Z(g) = int e-L(θ)/g dθ for small coupling gll 1, extracting its asymptotic series coefficients, and identifying Borel plane singularities that correspond one-to-one with critical objective function values. These target values provide global guidance to local optimizers, enabling principled learning rate adaptation and escape from suboptimal regions. Unlike heuristic adaptive methods, targets are theoretically grounded in the geometry of the optimization landscape.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 5 of its 18 references that are in the map. First posted on arXiv 1 Sep 2025.
Builds on
5 of 18 references.
References · 5
- 2014Identifying and attacking the saddle point problem in high-dimensional non-convex optimizationcited by 289
- 2018On the Convergence of A Class of Adam-Type Algorithms for Non-Convex Optimizationcited by 174
- 2018Convergence guarantees for RMSProp and ADAM in non-convex optimization and an empirical comparison to Nesterov accelerationcited by 39
- 2021Towards Practical Adam: Non-Convexity, Convergence Theory, and Mini-Batch Accelerationcited by 25
- 2024Review Non-convex Optimization Method for Machine Learningcited by 5
Built on by
Not cited yet.