mlsanityData to 7 Oct 2026

Nesterov Acceleration for Ensemble Kalman Inversion and Variants

arXiv 2501.08779 ↗First posted 15 Jan 2025math.OC cs.LG stat.COcited by 1

Not on the map. Why?

Abstract (arXiv)

Ensemble Kalman inversion (EKI) is a derivative-free, particle-based optimization method for solving inverse problems. It can be shown that EKI approximates a gradient flow, which allows the application of methods for accelerating gradient descent. Here, we show that Nesterov acceleration is effective in speeding up the reduction of the EKI cost function on a variety of inverse problems. We also implement Nesterov acceleration for two EKI variants, unscented Kalman inversion and ensemble transform Kalman inversion. Our specific implementation takes the form of a particle-level nudge that is demonstrably simple to couple in a black-box fashion with any existing EKI variant algorithms, comes with no additional computational expense, and with no additional tuning hyperparameters. This work shows a pathway for future research to translate advances in gradient-based optimization into advances in gradient-free Kalman optimization.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 11 of its 33 references that are in the map. First posted on arXiv 15 Jan 2025.

Builds on

11 of 33 references.

References · 11

  1. 2015A Differential Equation for Modeling Nesterov's Accelerated Gradient Method: Theory and Insightscited by 203
  2. 2022Adan: Adaptive Nesterov Momentum Algorithm for Faster Optimizing Deep Modelscited by 172
  3. 2021Acceleration Methodscited by 48
  4. 2019Accelerated Information Gradient flowcited by 38
  5. 2018Ensemble Kalman Inversion: A Derivative-Free Technique For Machine Learning Taskscited by 36
  6. 2019Continuous Time Analysis of Momentum Methodscited by 32
  7. 2022Ensemble Kalman Methods: A Mean Field Perspectivecited by 20
  8. 2019Convergence Acceleration of Ensemble Kalman Inversion in Nonlinear Settingscited by 9
  9. 2020Adaptive regularisation for ensemble Kalman inversioncited by 7
  10. 2021An optimal gradient method for smooth strongly convex minimizationcited by 7
  11. 2022Second Order Ensemble Langevin Method for Sampling and Inverse Problemscited by 6

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.