A regularizing iterative ensemble Kalman method for PDE-constrained inverse problems
Marco A. Iglesias

TL;DR
This paper presents a derivative-free, ensemble Kalman-based iterative method for solving nonlinear PDE-constrained inverse problems, combining regularization techniques with Bayesian inference to improve stability and applicability in black-box PDE models.
Contribution
It introduces a novel regularizing ensemble Kalman method approximating Levenberg-Marquardt, suitable for black-box PDE models, with theoretical and numerical validation.
Findings
Method inherits regularizing properties of LM scheme
Performance depends on ensemble size and initial conditions
Effective in shape and parameter identification tasks
Abstract
We introduce a derivative-free computational framework for approximating solutions to nonlinear PDE-constrained inverse problems. The aim is to merge ideas from iterative regularization with ensemble Kalman methods from Bayesian inference to develop a derivative-free stable method easy to implement in applications where the PDE (forward) model is only accessible as a black box. The method can be derived as an approximation of the regularizing Levenberg-Marquardt (LM) scheme [14] in which the derivative of the forward operator and its adjoint are replaced with empirical covariances from an ensemble of elements from the admissible space of solutions. The resulting ensemble method consists of an update formula that is applied to each ensemble member and that has a regularization parameter selected in a similar fashion to the one in the LM scheme. Moreover, an early termination of the…
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.
