# A07 – Model order reduction for Bayesian inference

This project started with the second funding period in July 2021.

## Objectives

When compared to classical methods that rely exclusively on point estimates or regularisation techniques, Bayesian inference provides a richer description of uncertainty. However, this richer description comes at a price: Bayesian methods tend to be computationally more costly. The high computational cost is often due to expensive evaluations of the likelihood or forward model. In addition, in many inverse problems where the unknown is a function, accurate discretisations of the unknown lead to high-dimensional spaces. In high dimensions, sampling algorithms tend to perform poorly, and covariance matrices can be too large to store or compute with. There is therefore a need for methods for Bayesian inference based on computationally efficient approximate forward models or likelihoods, for a rigorous analysis of the associated approximate posteriors and for fast effective numerical linear algebra techniques.

The aim of this project is to tackle the challenge of analysing and designing computationally efficient algorithms for Bayesian inference, by using ideas and approaches from dimension reduction and model order reduction (MOR). We will consider both linear and nonlinear inverse problems, and address both theoretical and algorithmic problems. In doing so, we aim to strengthen the bridge between Bayesian inference and MOR. This will make a wider range of computationally efficient algorithms available for Bayesian inference, and thus improve the applicability of Bayesian methods for inverse problems.

This project concentrates on both theoretical and algorithmic aspects.

- We will develop a theory of approximate Bayesian inference using dimension reduction based on low-rank updates and approximate forward models obtained by MOR. In particular, we aim to prove bounds on the error in the approximate posterior with respect to suitable measures of the error associated to the MOR method.
- We will develop and analyse computationally efficient algorithms based on low-rank approximations and MOR algorithms. A guiding principle will be to exploit the structure of specific inverse problems and problems of numerical linear algebra associated to these algorithms.

## Preprints

König, J. and Freitag, M. (2022). Time-limited Balanced Truncation for Data Assimilation Problems. arXiv 2212.07719.

## Publications

Alqahtani, A., Mach, T., and Reichel, L. (2022). Solution of Ill-posed Problems with Chebfun. Numerical Algorithms, in press (2022). doi:10.1007/s11075-022-01390-z arXiv 2007.16137

Mach, T., Reichel, L., and Van Barel, M. (2022). Adaptive cross approximation for Tikhonov regularization in general form. Numerical Algorithms, in press (2022). doi:10.1007/s11075-022-01395-8 arXiv 2204.05740