WIAS Preprint No. 2363, (2016)

Bayesian inversion with a hierarchical tensor representation



Authors

  • Eigel, Martin
  • Marschall, Manuel
    ORCID: 0000-0003-0648-1936
  • Schneider, Reinhold

2010 Mathematics Subject Classification

  • 35R60 47B80 60H35 65C20 65N12 65N22 65J10

Keywords

  • partial differential equations with random coefficients, tensor representation, tensor train, uncertainty quantification, stochastic finite element methods, operator equations, adaptive methods, low-rank

DOI

10.20347/WIAS.PREPRINT.2363

Abstract

The statistical Bayesian approach is a natural setting to resolve the ill-posedness of inverse problems by assigning probability densities to the considered calibration parameters. Based on a parametric deterministic representation of the forward model, a sampling-free approach to Bayesian inversion with an explicit representation of the parameter densities is developed. The approximation of the involved randomness inevitably leads to several high dimensional expressions, which are often tackled with classical sampling methods such as MCMC. To speed up these methods, the use of a surrogate model is beneficial since it allows for faster evaluation with respect to calibration parameters. However, the inherently slow convergence can not be remedied by this. As an alternative, a complete functional treatment of the inverse problem is feasible as demonstrated in this work, with functional representations of the parametric forward solution as well as the probability densities of the calibration parameters, determined by Bayesian inversion. The proposed sampling-free approach is discussed in the context of hierarchical tensor representations, which are employed for the adaptive evaluation of a random PDE (the forward problem) in generalized chaos polynomials and the subsequent high-dimensional quadrature of the log-likelihood. This modern compression technique alleviates the curse of dimensionality by hierarchical subspace approximations of the involved low rank (solution) manifolds. All required computations can be carried out efficiently in the low-rank format. A priori convergence is examined, considering all approximations that occur in the method. Numerical experiments demonstrate the performance and verify the theoretical results.

Appeared in

  • Inverse Problems, 34 (2018) pp. 035010/1--035010/29, DOI 10.1088/1361-6420/aaa998; changed title: Sampling-free Bayesian inversion with adaptive hierarchical tensor representations.

Download Documents

  • PDF Version of December 22, 2016 (812 kByte)
  • PDF Version of February 23, 2017 (744 kByte)