Ensemble Kalman inversion (EKI) is a derivative-free optimization method that lies between the deterministic and the probabilistic approaches for inverse problems. EKI iterates the Kalman update of ensemble-based Kalman filters, whose ensemble converges to a minimizer of an objective function. EKI regularizes ill-posed problems by restricting the ensemble to the linear span of the initial ensemble, or by iterating regularization with early stopping. Another regularization approach for EKI, Tikhonov EKI, penalizes the objective function using the $l_2$ penalty term, preventing overfitting in the standard EKI. This paper proposes a strategy to implement $l_p, 0<p\leq 1,$ regularization for EKI to recover sparse structures in the solution. The strategy transforms a $l_p$ problem into a $l_2$ problem, which is then solved by Tikhonov EKI. The transformation is explicit, and thus the proposed approach has a computational cost comparable to Tikhonov EKI. We validate the proposed approach's effectiveness and robustness through a suite of numerical experiments, including compressive sensing and subsurface flow inverse problems.
The Bayesian approach to inverse problems is widely used in practice to infer unknown parameters from noisy observations. In this framework, the ensemble Kalman inversion has been successfully applied for the quantification of uncertainties in various areas of applications. In recent years, a complete analysis of the method has been developed for linear inverse problems adopting an optimization viewpoint. However, many applications require the incorporation of additional constraints on the parameters, e.g. arising due to physical constraints. We propose a new variant of the ensemble Kalman inv…
Ensemble Kalman inversion is a parallelizable derivative-free method to solve inverse problems. The method uses an ensemble that follows the Kalman update formula iteratively to solve an optimization problem. The ensemble size is crucial to capture the correct statistical information in estimating the unknown variable of interest. Still, the ensemble is limited to a size smaller than the unknown variable's dimension for computational efficiency. This study proposes a strategy to correct the sampling error due to a small ensemble size, which improves the performance of the ensemble Kalman inver…
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 co…
We study the use of novel techniques arising in machine learning for inverse problems. Our approach replaces the complex forward model by a neural network, which is trained simultaneously in a one-shot sense when estimating the unknown parameters from data, i.e. the neural network is trained only for the unknown parameter. By establishing a link to the Bayesian approach to inverse problems, an algorithmic framework is developed which ensures the feasibility of the parameter estimate w.r. to the forward model. We propose an efficient, derivative-free optimization method based on variants of the…
The Ensemble Kalman Filter (EnKF) belongs to the class of iterative particle filtering methods and can be used for solving control--to--observable inverse problems. In this context, the EnKF is known as Ensemble Kalman Inversion (EKI). In recent years several continuous limits in the number of iteration and particles have been performed in order to study properties of the method. In particular, a one--dimensional linear stability analysis reveals possible drawbacks in the phase space of moments provided by the continuous limits of the EKI, but observed also in the multi--dimensional setting. I…
The unscented Kalman inversion (UKI) presented in [1] is a general derivative-free approach to solving the inverse problem. UKI is particularly suitable for inverse problems where the forward model is given as a black box and may not be differentiable. The regularization strategy and convergence property of the UKI are thoroughly studied, and the method is demonstrated effectively handling noisy observation data and solving chaotic inverse problems. In this paper, we aim to make the UKI more efficient in terms of computational and memory costs for large scale inverse problems. We take advantag…
The Ensemble Kalman inversion (EKI) method is a method for the estimation of unknown parameters in the context of (Bayesian) inverse problems. The method approximates the underlying measure by an ensemble of particles and iteratively applies the ensemble Kalman update to evolve (the approximation of the) prior into the posterior measure. For the convergence analysis of the EKI it is common practice to derive a continuous version, replacing the iteration with a stochastic differential equation. In this paper we validate this approach by showing that the stochastic EKI iteration converges to pat…
We propose a new regularisation strategy for the classical ensemble Kalman inversion (EKI) framework. The strategy consists of: (i) an adaptive choice for the regularisation parameter in the update formula in EKI, and (ii) criteria for the early stopping of the scheme. In contrast to existing approaches, our parameter choice does not rely on additional tuning parameters which often have severe effects on the efficiency of EKI. We motivate our approach using the interpretation of EKI as a Gaussian approximation in the Bayesian tempering setting for inverse problems. We show that our parameter c…
Convergence Analysis of Ensemble Kalman Inversion: The Linear, Noisy Case
Institute for Mathematics, University of Mannheim（曼海姆大学数学研究所）；Department of Computing and Mathematical Sciences, California Institute of Technology（加州理工学院计算与数学科学系）
The ensemble Kalman inversion (EKI) is a particle based method which has been introduced as the application of the ensemble Kalman filter to inverse problems. In practice it has been widely used as derivative-free optimization method in order to estimate unknown parameters from noisy measurement data. For linear forward models the EKI can be viewed as gradient flow preconditioned by a certain sample covariance matrix. Through the preconditioning the resulting scheme remains in a finite dimensional subspace of the original high-dimensional (or even infinite dimensional) parameter space and can …
Ensemble Kalman Inversion as an Inertial Interacting Particle System
Institute for Geometry and Applied Mathematics, RWTH Aachen University（亚琛工业大学几何与应用数学研究所）；Department of Mathematics and Applied Mathematics, University of Pretoria（比勒陀利亚大学数学与应用数学系）；Department of Mathematics, Sapienza University of Rome（罗马第一大学数学系）
Ensemble Kalman inversion (EKI) is a derivative-free optimizer aimed at solving inverse problems, taking motivation from the celebrated ensemble Kalman filter. The purpose of this article is to consider the introduction of adaptive Tikhonov strategies for EKI. This work builds upon Tikhonov EKI (TEKI) which was proposed for a fixed regularization constant. By adaptively learning the regularization parameter, this procedure is known to improve the recovery of the underlying unknown. For the analysis, we consider a continuous-time setting where we extend known results such as well-posdeness and …
The unscented Kalman inversion (UKI) method presented in [1] is a general derivative-free approach for the inverse problem. UKI is particularly suitable for inverse problems where the forward model is given as a black box and may not be differentiable. The regularization strategies, convergence property, and speed-up strategies [1,2] of the UKI are thoroughly studied, and the method is capable of handling noisy observation data and solving chaotic inverse problems. In this paper, we study the uncertainty quantification capability of the UKI. We propose a modified UKI, which allows to well appr…
The interaction between the foundation structures and the soil has been developed for many engineering applications. For the determination of the stress in foundation structure it is needed to determine the influence of the stiffness of soil with respect to the displacement w of the deformable plate (direct problem), and viceversa, how the stiffness of the foundation structure affects the resulting subsidence (inverse problem). In this paper, we deal with the Winkler mathematical model and propose to use an efficient Ensemble Kalman Inversion scheme (EKI) that regularizes iteratively the ill-p…
This paper introduces a computational framework to incorporate flexible regularization techniques in ensemble Kalman methods for nonlinear inverse problems. The proposed methodology approximates the maximum a posteriori (MAP) estimate of a hierarchical Bayesian model characterized by a conditionally Gaussian prior and generalized gamma hyperpriors. Suitable choices of hyperparameters yield sparsity-promoting regularization. We propose an iterative algorithm for MAP estimation, which alternates between updating the unknown with an ensemble Kalman method and updating the hyperparameters in the r…
Mathematical modeling and simulation of complex physical systems based on partial differential equations (PDEs) have been widely used in engineering and industrial applications. To enable reliable predictions, it is crucial yet challenging to calibrate the model by inferring unknown parameters/fields (e.g., boundary conditions, mechanical properties, and operating parameters) from sparse and noisy measurements, which is known as a PDE-constrained inverse problem. In this work, we develop a novel bi-fidelity (BF) ensemble Kalman inversion method to tackle this challenge, leveraging the accuracy…
The ensemble Kalman inversion (EKI) for the solution of Bayesian inverse problems of type $y = A u +\varepsilon$, with $u$ being an unknown parameter, $y$ a given datum, and $\varepsilon$ measurement noise, is a powerful tool usually derived from a sequential Monte Carlo point of view. It describes the dynamics of an ensemble of particles $\{u^j(t)\}_{j=1}^J$, whose initial empirical measure is sampled from the prior, evolving over an artificial time $t$ towards an approximate solution of the inverse problem, with $t=1$ emulating the posterior, and $t\to\infty$ corresponding to the under-regul…
The spatial dependent unknown acoustic source is reconstructed according noisy multiple frequency data on a remote closed surface. Assume that the unknown function is supported on a bounded domain. To determine the support, we present a statistical inversion algorithm, which combines the ensemble Kalman filter approach with level set technique. Several numerical examples show that the proposed method give good numerical reconstruction.
This paper is focused on the optimization approach to the solution of inverse problems. We introduce a stochastic dynamical system in which the parameter-to-data map is embedded, with the goal of employing techniques from nonlinear Kalman filtering to estimate the parameter given the data. The extended Kalman filter (which we refer to as ExKI in the context of inverse problems) can be effective for some inverse problems approached this way, but is impractical when the forward map is not readily differentiable and is given as a black box, and also for high dimensional parameter spaces because o…
Frequency-domain electromagnetic instruments allow the collection of data in different configurations, that is, varying the intercoil spacing, the frequency, and the height above the ground. Their handy size makes these tools very practical for near-surface characterization in many fields of applications, for example, precision agriculture, pollution assessments, and shallow geological investigations. To this end, the inversion of either the real (in-phase) or the imaginary (quadrature) component of the signal has already been studied. Furthermore, in many situations, a regularization scheme r…
Application of the $χ^2$ principle and unbiased predictive risk estimator for determining the regularization parameter in 3D focusing gravity inversion
Institute of Geophysics, University of Tehran（德黑兰大学地球物理研究所）；School of Mathematical and Statistical Sciences, Arizona State University（亚利桑那州立大学数学与统计科学学院）
A crucial issue in two-dimensional Nuclear Magnetic Resonance (NMR) is the speed and accuracy of the data inversion. This paper proposes a multi-penalty method with locally adapted regularization parameters for fast and accurate inversion of 2DNMR data. The method solves an unconstrained optimization problem whose objective contains a data-fitting term, a single $L1$ penalty parameter and a multiple parameter $L2$ penalty. We propose an adaptation of the Fast Iterative Shrinkage and Thresholding (FISTA) method to solve the multi-penalty minimization problem, and an automatic procedure to compu…
In this work, we investigate various approaches that use learning from training data to solve inverse problems, following a bi-level learning approach. We consider a general framework for optimal inversion design, where training data can be used to learn optimal regularization parameters, data fidelity terms, and regularizers, thereby resulting in superior variational regularization methods. In particular, we describe methods to learn optimal $p$ and $q$ norms for ${\rm L}^p-{\rm L}^q$ regularization and methods to learn optimal parameters for regularization matrices defined by covariance kern…
Fibre Bragg Gratings have become widespread measurement devices in engineering and other fields of application. In all but a few cases, the relation between cause and effect is simplified to a proportional model. However, at its mathematical core lies a nonlinear inverse problem which appears not to have received much attention in the literature. In this paper, we present this core problem to the mathematical community and provide a first report on opportunities and limitations of a regularization approach. In particular, we show that difficulties arise from non-uniqueness and the absence of e…
The inversion of two-dimensional NMR data is an ill-posed problem related to the numerical computation of the inverse Laplace transform. In this paper we present the 2DUPEN algorithm that extends the Uniform Penalty (UPEN) algorithm [Borgia, Brown, Fantazzini, {\em Journal of Magnetic Resonance}, 1998] to two-dimensional data. The UPEN algorithm, defined for the inversion of one-dimensional NMR relaxation data, uses Tikhonov-like regularization and optionally non-negativity constraints in order to implement locally adapted regularization. In this paper, we analyze the regularization properties…
In this work, we develop efficient solvers for linear inverse problems based on randomized singular value decomposition (RSVD). This is achieved by combining RSVD with classical regularization methods, e.g., truncated singular value decomposition, Tikhonov regularization, and general Tikhonov regularization with a smoothness penalty. One distinct feature of the proposed approach is that it explicitly preserves the structure of the regularized solution in the sense that it always lies in the range of a certain adjoint operator. We provide error estimates between the approximation and the exact …
It has been proposed that classical filtering methods, like the Kalman filter and 3DVAR, can be used to solve linear statistical inverse problems. In the work of Iglesias, Lin, Lu, & Stuart (2017), error estimates were obtained for this approach. By optimally tuning a regularization parameter in the filters, the authors were able to show that the mean squared error could be systematically reduced. Building on the aforementioned work of Iglesias, Lin, Lu, & Stuart, we prove that by (i) considering the problem in a weaker norm and (ii) applying simple iterate averaging of the filter output, 3DVA…
During the inversion of discrete linear systems noise in data can be amplified and result in meaningless solutions. To combat this effect, characteristics of solutions that are considered desirable are mathematically implemented during inversion, which is a process called regularization. The influence of provided prior information is controlled by non-negative regularization parameter(s). There are a number of methods used to select appropriate regularization parameters, as well as a number of methods used for inversion. New methods of unbiased risk estimation and generalized cross validation …
Electromagnetic induction surveys are among the most popular techniques for non-destructive investigation of soil properties in order to detect the presence of either ground inhomogeneities or of particular substances. This work introduces a MATLAB package for the inversion of electromagnetic data collected by a ground conductivity meter. Based on a nonlinear forward model used to describe the interaction between an electromagnetic field and the soil, the software reconstructs either the electrical conductivity or the magnetic permeability of the soil with respect to depth, by a regularized da…
Reconstructing the structure of the soil using non-invasive techniques is a very relevant problem in many scientific fields, like geophysics and archaeology. This can be done, for instance, with the aid of Frequency Domain Electromagnetic (FDEM) induction devices. Inverting FDEM data is a very challenging inverse problem, as the problem is extremely ill-posed, i.e., sensible to the presence of noise in the measured data, and non-linear. Regularization methods substitute the original ill-posed problem with a well-posed one whose solution is an accurate approximation of the desired one. In this …
We study the inverse medium scattering problem to reconstruct the unknown inhomogeneous medium from the far-field patterns of scattered waves. The inverse scattering problem is generally ill-posed and nonlinear, and the iterative optimization method is often adapted. A natural iterative approach to this problem is to place all available measurements and mappings into one long vector and mapping, respectively, and to iteratively solve the linearized large system equation using the Tikhonov regularization method, which is called the Levenberg-Marquardt scheme. However, this is computationally ex…
