Subsampling in ensemble Kalman inversion

DOI10.1088/1361-6420/ACE64BarXiv2302.11323MaRDI QIDQ6171602FDOQ6171602

Authors: Jonas Latz, Claudia Schillings 

Publication date: 14 August 2023

Published in: Inverse Problems (Search for Journal in Brave)

Abstract: We consider the Ensemble Kalman Inversion which has been recently introduced as an efficient, gradient-free optimisation method to estimate unknown parameters in an inverse setting. In the case of large data sets, the Ensemble Kalman Inversion becomes computationally infeasible as the data misfit needs to be evaluated for each particle in each iteration. Here, randomised algorithms like stochastic gradient descent have been demonstrated to successfully overcome this issue by using only a random subset of the data in each iteration, so-called subsampling techniques. Based on a recent analysis of a continuous-time representation of stochastic gradient methods, we propose, analyse, and apply subsampling-techniques within Ensemble Kalman Inversion. Indeed, we propose two different subsampling techniques: either every particle observes the same data subset (single subsampling) or every particle observes a different data subset (batch subsampling).

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

zbMATH Keywords

inverse problemspiecewise-deterministic Markov processparticle systemstochastic optimisationdata subsampling

Mathematics Subject Classification ID

Parametric inference (62Fxx) Numerical methods for partial differential equations, boundary value problems (65Nxx) Mathematical programming (90Cxx)

Cites Work

• Title not available (Why is that?)
• A Stochastic Approximation Method
• Continuous-time Markov chains. An applications-oriented approach
• Separability and completeness for the Wasserstein distance
• Quantitative ergodicity for some switched dynamical systems
• Nonlinear stability of the ensemble Kalman filter with adaptive covariance inflation
• Ensemble Kalman methods for inverse problems
• A Matrix Differential Equation of Riccati Type
• Nonlinear stability and ergodicity of ensemble based Kalman filters
• Analysis of the ensemble Kalman filter for inverse problems
• Iterative regularization for ensemble data assimilation in reservoir models
• Convergence analysis of ensemble Kalman inversion: the linear, noisy case
• Optimization methods for large-scale machine learning
• Analysis of stochastic gradient descent in continuous time
• Stochastic modified equations and dynamics of stochastic gradient algorithms. I: Mathematical foundations
• A regularizing iterative ensemble Kalman method for PDE-constrained inverse problems
• Adaptive Tikhonov strategies for stochastic ensemble Kalman inversion
• Ensemble Kalman inversion: mean-field limit and convergence analysis
• Interacting Langevin diffusions: gradient structure and ensemble Kalman sampler
• Well posedness and convergence analysis of the ensemble Kalman inversion
• Ensemble Kalman inversion: a derivative-free technique for machine learning tasks
• Consistency analysis of bilevel data-driven learning in inverse problems
• Tikhonov regularization within ensemble Kalman inversion
• Continuous Time Limit of the Stochastic Ensemble Kalman Inversion: Strong Convergence Analysis
• Complete Deterministic Dynamics and Spectral Decomposition of the Linear Ensemble Kalman Inversion

Cited In (1)

• On the ensemble Kalman inversion under inequality constraints

This page was built for publication: Subsampling in ensemble Kalman inversion

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