Statistical Finite Elements via Interacting Particle Langevin Dynamics

In this paper, we develop a class of interacting particle Langevin algorithms to solve inverse problems for partial differential equations (PDEs). In particular, we leverage the statistical finite element method (statFEM) formulation to obtain a finite-dimensional latent variable statistical model where the parameter is that of the (discretized) forward map and the latent variable is the statFEM solution of the PDE which is assumed to be partially observed. We then adapt a recently proposed expectation-maximization–like scheme, interacting particle Langevin algorithm (IPLA), for this problem and obtain a joint estimation procedure for the parameters and the latent variables. We consider three main examples: (i) estimating the forcing for a linear Poisson PDE, (ii) estimating diffusivity for a linear Poisson PDE, and (iii) estimating the forcing for a nonlinear Poisson PDE. We provide computational complexity estimates for forcing estimation in the linear case. We also provide comprehensive numerical experiments and preconditioning strategies that significantly improve the performance, showing that the proposed class of methods can be the choice for parameter inference in PDE models.

Authors

Institutions

Publication Details

Journal
SIAM/ASA Journal on Uncertainty Quantification
Published
2025-08-21
DOI
https://doi.org/10.1137/24m1693593
Citations
1
Primary Topic
Markov Chains and Monte Carlo Methods
Type
article
Field-Weighted Citation Impact
2.63

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Statistical Finite Elements via Interacting Particle Langevin Dynamics

Ö. Deniz Akyildiz, Connor Duffin, Mark Girolami, Alex Glyn-Davies et al.
1 citations
SIAM/ASA Journal on Uncertainty Quantification
Markov Chains and Monte Carlo Methods
2.63
article

Statistical Finite Elements via Interacting Particle Langevin Dynamics

Ö. Deniz Akyildiz, Connor Duffin, Mark Girolami, Alex Glyn-Davies, Ieva Kazlauskaite
article en
1 citations

Abstract

In this paper, we develop a class of interacting particle Langevin algorithms to solve inverse problems for partial differential equations (PDEs). In particular, we leverage the statistical finite element method (statFEM) formulation to obtain a finite-dimensional latent variable statistical model where the parameter is that of the (discretized) forward map and the latent variable is the statFEM solution of the PDE which is assumed to be partially observed. We then adapt a recently proposed expectation-maximization–like scheme, interacting particle Langevin algorithm (IPLA), for this problem and obtain a joint estimation procedure for the parameters and the latent variables. We consider three main examples: (i) estimating the forcing for a linear Poisson PDE, (ii) estimating diffusivity for a linear Poisson PDE, and (iii) estimating the forcing for a nonlinear Poisson PDE. We provide computational complexity estimates for forcing estimation in the linear case. We also provide comprehensive numerical experiments and preconditioning strategies that significantly improve the performance, showing that the proposed class of methods can be the choice for parameter inference in PDE models.

SIAM/ASA Journal on Uncertainty QuantificationVol. 13(3)
Turing Institute (GB), University of Cambridge (GB), Imperial College London (GB), London School of Economics and Political Science (GB)
Royal Academy of Engineering, Engineering and Physical Sciences Research Council
Openalex Percentile: Top 9%
Markov Chains and Monte Carlo Methods
2.63
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.