Statistical Finite Elements via Langevin Dynamics

被引:4
作者
Akyildiz, Omer Deniz [1 ,2 ]
Duffin, Connor [2 ]
Sabanis, Sotirios [1 ,3 ,4 ]
Girolami, Mark [1 ,2 ]
机构
[1] Alan Turing Inst, London NW1 2DB, England
[2] Univ Cambridge, Cambridge CB2 1PZ, England
[3] Univ Edinburgh, Edinburgh EH8 9YL, Midlothian, Scotland
[4] Natl Tech Univ Athens, Athens 15780, Greece
基金
英国工程与自然科学研究理事会;
关键词
uncertainty quantification; finite element methods; inverse problems; Langevin dynamics; INVERSE PROBLEMS; MCMC;
D O I
10.1137/21M1463094
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
The recent statistical finite element method (statFEM) provides a coherent statistical framework to synthesize 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 characterization 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, to demonstrate the efficacy of the sampler, with a Python package also included.
引用
收藏
页码:1560 / 1585
页数:26
相关论文
共 51 条
[41]   Optimal scaling for various Metropolis-Hastings algorithms [J].
Roberts, GO ;
Rosenthal, JS .
STATISTICAL SCIENCE, 2001, 16 (04) :351-367
[42]  
Saatci Y., 2011, Scalable Inference for Structured Gaussian Process Models
[43]   A Feynman-Kac approach for logarithmic Sobolev inequalities [J].
Steiner, Clement .
ELECTRONIC JOURNAL OF PROBABILITY, 2021, 26
[44]  
Stuart AM, 2010, ACTA NUMER, V19, P451, DOI 10.1017/S0962492910000061
[45]  
Vempala SS, 2019, ADV NEUR IN, V32
[46]   STRONG AND WEAK CONVEXITY OF SETS AND FUNCTIONS [J].
VIAL, JP .
MATHEMATICS OF OPERATIONS RESEARCH, 1983, 8 (02) :231-259
[47]  
Villani C, 2009, GRUNDLEHR MATH WISS, V338, P5
[48]  
Wibisono Andre, 2018, P MACHINE LEARNING, P2093
[49]  
Zhang Y., Appl. Math. Optim.
[50]  
Zhang Z, 2017, APPL MATH SCI, V196, P1, DOI 10.1007/978-3-319-57511-7