mlsanityData to 14 Oct 2026

ODE-based Learning to Optimize

arXiv 2406.02006 ↗First posted 4 Jun 2024math.OC cs.AIcited by 4

Not on the map. Why?

Abstract (arXiv)

Recent years have seen a growing interest in understanding acceleration methods through the lens of ordinary differential equations (ODEs). Despite the theoretical advancements, translating the rapid convergence observed in continuous-time models to discrete-time iterative methods poses significant challenges. In this paper, we present a comprehensive framework integrating the inertial systems with Hessian-driven damping equation (ISHD) and learning-based approaches for developing optimization methods through a deep synergy of theoretical insights. We first establish the convergence condition for ensuring the convergence of the solution trajectory of ISHD. Then, we show that provided the stability condition, another relaxed requirement on the coefficients of ISHD, the sequence generated through the explicit Euler discretization of ISHD converges, which gives a large family of practical optimization methods. In order to select the best optimization method in this family for certain problems, we introduce the stopping time, the time required for an optimization method derived from ISHD to achieve a predefined level of suboptimality. Then, we formulate a novel learning to optimize (L2O) problem aimed at minimizing the stopping time subject to the convergence and stability condition. To navigate this learning problem, we present an algorithm combining stochastic optimization and the penalty method (StoPM). The convergence of StoPM using the conservative gradient is proved. Empirical validation of our framework is conducted through extensive numerical experiments across a diverse set of optimization problems. These experiments showcase the superior performance of the learned optimization methods.

Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 12 of its 68 references that are in the map. First posted on arXiv 4 Jun 2024.

Builds on

12 of 68 references.

References · 12

  1. 2016Learning to learn by gradient descent by gradient descentcited by 620
  2. 2023Symbolic Discovery of Optimization Algorithmscited by 434
  3. 2019Why gradient clipping accelerates training: A theoretical justification for adaptivitycited by 341
  4. 2021Learning to Optimize: A Primer and A Benchmarkcited by 208
  5. 2018Theoretical Linear Convergence of Unfolded ISTA and its Practical Weights and Thresholdscited by 85
  6. 2018Understanding the Acceleration Phenomenon via High-Resolution Differential Equationscited by 69
  7. 2018Direct Runge-Kutta Discretization Achieves Accelerationcited by 21
  8. 2023Towards Constituting Mathematical Structures for Learning to Optimizecited by 13
  9. 2021Accelerated Forward-Backward Optimization using Deep Learningcited by 11
  10. 2016Learning to Learn without Gradient Descent by Gradient Descentcited by 9
  11. 2019Accelerating Rescaled Gradient Descent: Fast Optimization of Smooth Functionscited by 8
  12. 2021Revisiting the Role of Euler Numerical Integration on Acceleration and Stability in Convex Optimizationcited by 6

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 1; 2025: 2; 2026: 1.

4 papers.