Statistical Finite Elements via Langevin Dynamics
Not on the map. Why?
Abstract (arXiv)
The recent statistical finite element method (statFEM) provides a coherent statistical framework to synthesise finite element models with observed data. Through embedding uncertainty inside of the governing equations, finite element solutions are updated to give a posterior distribution which quantifies all sources of uncertainty associated with the model. However to incorporate all sources of uncertainty, one must integrate over the uncertainty associated with the model parameters, the known forward problem of uncertainty quantification. In this paper, we make use of Langevin dynamics to solve the statFEM forward problem, studying the utility of the unadjusted Langevin algorithm (ULA), a Metropolis-free Markov chain Monte Carlo sampler, to build a sample-based characterisation of this otherwise intractable measure. Due to the structure of the statFEM problem, these methods are able to solve the forward problem without explicit full PDE solves, requiring only sparse matrix-vector products. ULA is also gradient-based, and hence provides a scalable approach up to high degrees-of-freedom. Leveraging the theory behind Langevin-based samplers, we provide theoretical guarantees on sampler performance, demonstrating convergence, for both the prior and posterior, in the Kullback-Leibler divergence, and, in Wasserstein-2, with further results on the effect of preconditioning. Numerical experiments are also provided, for both the prior and posterior, to demonstrate the efficacy of the sampler, with a Python package also included.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 9 of its 47 references that are in the map. First posted on arXiv 21 Oct 2021.
Builds on
9 of 47 references.
References · 9
- 2019Rapid Convergence of the Unadjusted Langevin Algorithm: Isoperimetry Sufficescited by 227
- 2015Non-asymptotic convergence analysis for the Unadjusted Langevin Algorithmcited by 197
- 2016High-dimensional Bayesian inference via the Unadjusted Langevin Algorithmcited by 146
- 2018Sampling as optimization in the space of measures: The Langevin dynamics as a composite optimization problemcited by 123
- 2017User-friendly guarantees for the Langevin Monte Carlo with inaccurate gradientcited by 116
- 2019Nonasymptotic estimates for Stochastic Gradient Langevin Dynamics under local conditions in nonconvex optimizationcited by 38
- 2020Taming neural networks with TUSLA: Non-convex learning via adaptive stochastic gradient Langevin algorithmscited by 21
- 2020Nonasymptotic analysis of Stochastic Gradient Hamiltonian Monte Carlo under local conditions for nonconvex optimizationcited by 13
- 2021Low-rank statistical finite elements for scalable model-data synthesiscited by 3
Built on by
Citing papers per year: 2022: 2; 2023: 1; 2024: 1.
4 papers.
- 2022Fully probabilistic deep models for forward and inverse problems in parametric PDEscited by 19
- 2024Kinetic Interacting Particle Langevin Monte Carlocited by 7
- 2022Phi-DVAE: Physics-Informed Dynamical Variational Autoencoders for Unstructured Data Assimilationcited by 5
- 2023Stochastic PDE representation of random fields for large-scale Gaussian process regression and statistical finite element analysiscited by 1
- 2024Kinetic Interacting Particle Langevin Monte Carlo8 Jul 2024
- 2023Stochastic PDE representation of random fields for large-scale Gaussian process regression and statistical finite element analysis23 May 2023
- 2022Phi-DVAE: Physics-Informed Dynamical Variational Autoencoders for Unstructured Data Assimilation30 Sep 2022
- 2022Fully probabilistic deep models for forward and inverse problems in parametric PDEs9 Aug 2022