SCALABLE OPTIMIZATION-BASED SAMPLING ON FUNCTION SPACE

Johnathan M. Bardsley

doi:10.1137/19M1245220

SCALABLE OPTIMIZATION-BASED SAMPLING ON FUNCTION SPACE

2020-04-27

11

OA

AI

J

Johnathan M. Bardsley

DOI：10.1137/19M1245220

原文链接

查看原文

摘要

En 中文

Optimization-based samplers such as randomize-then-optimize (RTO) [J. M. Bardsley et al., SIAM J. Sci. Comput., 36 (2014), pp. A1895-A1910] provide an efficient and parallellizable approach to solving large-scale Bayesian inverse problems. These methods solve randomly perturbed optimization problems to draw samples from an approximate posterior distribution. Correcting these samples, either by Metropolization or importance sampling, enables characterization of the original posterior distribution. This paper focuses on the scalability of RTO to problems with high- or infinite-dimensional parameters. In particular, we introduce a new subspace strategy to reformulate RTO. For problems with intrinsic low-rank structures, this subspace acceleration makes the computational complexity of RTO scale linearly with the parameter dimension. Furthermore, this subspace perspective suggests a natural extension of RTO to a function space setting. We thus formalize a function space version of RTO and establish sufficient conditions for it to produce a valid Metropolis-Hastings proposal, yielding dimension-independent sampling performance. Numerical examples corroborate the dimension independence of RTO and demonstrate sampling performance that is also robust to small observational noise.

Keyword:

Markov chain Monte Carlo

Metropolis independence sampling

Bayesian inference

infinite-dimensional inverse problems

transport maps

SCALABLE OPTIMIZATION-BASED SAMPLING ON FUNCTION SPACE

摘要

AI总结

期刊

机构