Search arXiv⌕ Search

arXiv · 2610.38434

Optimal approximation error approach in Bayesian inverse problems

Abstract

In many inverse problems, evaluating the forward operator is computationally expensive, making it common practice to accelerate inference with a less costly approximate model. However, such approximations introduce unwanted bias and must be carefully accounted for to ensure the reliability of the solution. This phenomenon is particularly pronounced in Bayesian inference, where accurate posterior characterisation typically requires a large number of forward model evaluations. In this paper, we focus on the approximation error model (AEM), which compensates for the modelling error by adjusting the likelihood density. More precisely, AEM incorporates the model error into the additive Gaussian noise distribution. A central challenge in this approach is how to choose the modified noise mean and covariance in a principled way. To address this, we propose a new framework, optimal approximation error (OAE) which determines the noise model by minimising the expected information loss, measured via the Kullback-Leibler (KL) divergence between the true and approximate posterior distributions. We show that the standard enhanced error approach (EEA) is recovered as the minimiser of the expected divergence between likelihoods rather than posteriors and develop OAE as a direct alternative targeting posterior accuracy. We establish bi-convexity of the OAE objective, introduce a regularised, provably convergent proximal alternating minimisation scheme, and derive closed-form expressions in the Gaussian linear setting. We further show that OAE estimates computed from empirical training data are statistically consistent. Numerical experiments on a linear CT problem and a nonlinear Darcy-flow problem show that OAE improves posterior accuracy relative to both the uncorrected and EEA-corrected likelihoods.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Fabian Schneider, Tapio Helin. 2026-10-28. Optimal approximation error approach in Bayesian inverse problems. https://arxiv.org/abs/2610.38434

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

A continuous scale space of diffeomorphisms

In this paper, we define and study a nested family of reproducing kernel Hilbert spaces of vector fields that is indexed by a range of scales, from which we construct a reproducing kernel Hilbert space of scale-dependent vector fields. We provide a characterization of the reproducing kernel of that space, with numerical approximations ensuring quick evaluations when this kernel does not have a closed form. We then introduce a multiscale version of the large deformation diffeomorphic metric mapping (LDDMM) problem and prove the existence of solutions. Finally, we provide numerical experiments performing landmark matching using multiscale LDDMM.

math.NA↗

Hierarchical Matrices with Tucker Blocks: Construction and Forward Evaluation

In this paper, we introduce hierarchical matrices with Tucker blocks (HMTB) for data-sparse approximation of matrices arising from nonoscillatory and mildly oscillatory kernels. Building on the hierarchical matrix framework, HMTB matrices replace conventional low-rank blocks with Tucker representations. Using high-dimensional interpolation and tensor compression and contractions, we develop algorithms for constructing HMTB matrices and performing matrix-vector multiplication. For an $N \times N$ matrix, these algorithms have linear and quasi-linear complexities in $N$, respectively. Numerical comparisons with an interpolation-based $\mathcal{H}$-matrix implementation demonstrate storage savings and, in several cases, reduced construction times, while maintaining competitive forward-evaluation costs. The framework is also applicable to quasi-uniform grids.

math.NA↗

Data-driven model order reduction for wave propagation in materials with damage and nonlinearities

In this work, we consider wave propagation in materials characterized by nonlinear properties or damage. To accelerate the simulations of the resulting high-dimensional problems, we apply model order reduction methods. Depending on the knowledge of the underlying equations and the availability of their discrete operators, intrusive methods (here projection-based approaches based on proper orthogonal decomposition (POD)) or non-instrusive methods (here data-driven approaches including dynamic mode decomposition (DMD) and operator inference (OpInf)) can be used. We recall the theoretical foundations of the methods and apply them to the problem of wave propagation. In three different numerical examples, we evaluate the performance of the reduction techniques.

math.NA↗