Uncertainty Quantification for Linear Inverse Problems with Besov Prior: A Randomize-Then-Optimize Method

Andreas Horst, Babak Maboudi Afkham, Yiqiu Dong, Jakob Lemvig

Research output: Contribution to journalJournal articleResearchpeer-review

21 Downloads (Orbit)

Abstract

In this work, we investigate the use of Besov priors in the context of Bayesian inverse problems. The solution to Bayesian inverse problems is the posterior distribution which naturally enables us to interpret the uncertainties. Besov priors are discretization invariant and can promote sparsity in terms of wavelet coefficients. We propose the randomize-then-optimize method to draw samples from the posterior distribution with Besov priors under a general parameter setting and estimate the modes of the posterior distribution. The performance of the proposed method is studied through numerical experiments of a 1D inpainting problem, a 1D deconvolution problem, and a 2D computed tomography problem. Further, we discuss the influence of the choice of the Besov parameters and the wavelet basis in detail, and we compare the proposed method with the state-of-the-art methods. The numerical results suggest that the proposed method is an effective tool for sampling the posterior distribution equipped with general Besov priors.
Original languageEnglish
Article number101
JournalStatistics and Computing
Volume35
Number of pages16
ISSN0960-3174
DOIs
Publication statusPublished - 2025

Keywords

  • Bayesian inverse problems
  • Besov priors
  • Randomize-then-optimize method
  • Sampling methods

Fingerprint

Dive into the research topics of 'Uncertainty Quantification for Linear Inverse Problems with Besov Prior: A Randomize-Then-Optimize Method'. Together they form a unique fingerprint.

Cite this