The Ensemble Kalman Filter for Inverse Problems
Marco A. Iglesias, Kody J.H. Law, and Andrew M. Stuart

TL;DR
This paper applies an iterative ensemble Kalman method to inverse problems, demonstrating it as a derivative-free optimization approach with accuracy comparable to traditional least-squares methods across various applications.
Contribution
It introduces an iterative ensemble Kalman method for inverse problems, showing its effectiveness and error bounds compared to traditional approaches.
Findings
Ensemble Kalman method estimates lie in a subspace spanned by the initial ensemble.
The method provides accuracy comparable to traditional least-squares approaches.
Numerical experiments demonstrate the method's effectiveness in diverse inverse problems.
Abstract
The Ensemble Kalman filter (EnKF) was introduced by Evensen in 1994 [10] as a novel method for data assimilation: state estimation for noisily observed time-dependent problems. Since that time it has had enormous impact in many application domains because of its robustness and ease of implementation, and numerical evidence of its accuracy. In this paper we propose the application of an iterative ensemble Kalman method for the solution of a wide class of inverse problems. In this context we show that the estimate of the unknown function that we obtain with the ensemble Kalman method lies in a subspace A spanned by the initial ensemble. Hence the resulting error may be bounded above by the error found from the best approximation in this subspace. We provide numerical experiments which compare the error incurred by the ensemble Kalman method for inverse problems with the error of the best…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
