Certified coordinate selection for high-dimensional Bayesian inversion with Laplace prior
-
Published:2024-06-15
Issue:4
Volume:34
Page:
-
ISSN:0960-3174
-
Container-title:Statistics and Computing
-
language:en
-
Short-container-title:Stat Comput
Author:
Flock Rafael,Dong Yiqiu,Uribe Felipe,Zahm Olivier
Abstract
AbstractWe consider high-dimensional Bayesian inverse problems with arbitrary likelihood and product-form Laplace prior for which we provide a certified approximation of the posterior in the Hellinger distance. The approximate posterior differs from the prior only in a small number of relevant coordinates that contribute the most to the update from the prior to the posterior. We propose and analyze a gradient-based diagnostic to identify these relevant coordinates. Although this diagnostic requires computing an expectation with respect to the posterior, we propose tractable methods for the classical case of a linear forward model with Gaussian likelihood. Our methods can be employed to estimate the diagnostic before solving the Bayesian inverse problem via, e.g., Markov chain Monte Carlo (MCMC) methods. After selecting the coordinates, the approximate posterior can be efficiently inferred since most of its coordinates are only informed by the prior. Moreover, specialized MCMC methods, such as the pseudo-marginal MCMC algorithm, can be used to obtain less correlated samples when sampling the exact posterior. We show the applicability of our method using a 1D signal deblurring problem and a high-dimensional 2D super-resolution problem.
Funder
Technical University of Denmark
Publisher
Springer Science and Business Media LLC
Reference39 articles.
1. Agrawal, A., Verschueren, R., Diamond, S., Boyd, S.: A rewriting system for convex optimization problems. J. Control Decis. 5(1), 42–60 (2018) 2. Andrieu, C., Roberts, G.O.: The pseudo-marginal approach for efficient Monte Carlo computations (2009) 3. Bakry, D., Gentil, I., Ledoux, M.: Analysis and Geometry of Markov Diffusion Operators, vol. 348. Springer International Publishing, Cham (2014). https://doi.org/10.1007/978-3-319-00227-9 4. Bingham, E., Chen, J.P., Jankowiak, M., Obermeyer, F., Pradhan, N., Karaletsos, T., Singh, R., Szerlip, P., Horsfall, P., Goodman, N.D.: Pyro: deep universal probabilistic programming. J. Mach. Learn. Res. 2019(20), 1–6 (2018) 5. Brennan, M.C., Bigoni, D., Zahm, O., Spantini, A., Marzouk, Y.: Greedy Inference with Structure-Exploiting Lazy Maps. Adv. Neural. Inf. Process. Syst. 33, 8330–8342 (2020)
|
|