Convergence acceleration of ensemble Kalman inversion in nonlinear settings

From MaRDI portal
Publication:5070540

DOI10.1090/MCOM/3709zbMATH Open1486.49049arXiv1911.02424OpenAlexW2984293866MaRDI QIDQ5070540FDOQ5070540


Authors: Neil K. Chada, Xin Thomson Tong Edit this on Wikidata


Publication date: 13 April 2022

Published in: Mathematics of Computation (Search for Journal in Brave)

Abstract: Many data-science problems can be formulated as an inverse problem, where the parameters are estimated by minimizing a proper loss function. When complicated black-box models are involved, derivative-free optimization tools are often needed. The ensemble Kalman filter (EnKF) is a particle-based derivative-free Bayesian algorithm originally designed for data assimilation. Recently, it has been applied to inverse problems for computational efficiency. The resulting algorithm, known as ensemble Kalman inversion (EKI), involves running an ensemble of particles with EnKF update rules so they can converge to a minimizer. In this article, we investigate EKI convergence in general nonlinear settings. To improve convergence speed and stability, we consider applying EKI with non-constant step-sizes and covariance inflation. We prove that EKI can hit critical points with finite steps in non-convex settings. We further prove that EKI converges to the global minimizer polynomially fast if the loss function is strongly convex. We verify the analysis presented with numerical experiments on two inverse problems.


Full work available at URL: https://arxiv.org/abs/1911.02424




Recommendations




Cites Work


Cited In (28)

Uses Software





This page was built for publication: Convergence acceleration of ensemble Kalman inversion in nonlinear settings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5070540)