Limitations of polynomial chaos expansions in the Bayesian solution of inverse problems

Abstract

Polynomial chaos expansions are used to reduce the computational cost in the Bayesian solutions of inverse problems by creating a surrogate posterior that can be evaluated inexpensively. We show, by analysis and example, that when the data contain significant information beyond what is assumed in the prior, the surrogate posterior can be very different from the posterior, and the resulting estimates become inaccurate. One can improve the accuracy by adaptively increasing the order of the polynomial chaos, but the cost may increase too fast for this to be cost effective compared to Monte Carlo sampling without a surrogate posterior.

Cited by in corpus (11)

• Adaptive multi-fidelity polynomial chaos approach to Bayesian inference in inverse problems
• An adaptive surrogate modeling based on deep neural networks for large-scale Bayesian inverse problems
• Bayesian model calibration with interpolating polynomials based on adaptively weighted Leja nodes
• Joint state-parameter estimation of a nonlinear stochastic energy balance model from sparse noisy data
• Auto-weighted Bayesian Physics-Informed Neural Networks and robust estimations for multitask inverse problems in pore-scale imaging of dissolution
• Bayesian Approach to Inverse Time-harmonic Acoustic Scattering from Sound-soft Obstacles with Phaseless Data
• Bayesian Parameter Inference and Uncertainty Quantification for a Computational Pulmonary Hemodynamics Model Using Gaussian Processes
• Probabilistic Constrained Bayesion Inversion for Transpiration Cooling
• An adaptive multi-fidelity PC-based ensemble Kalman inversion for inverse problems
• Iterative importance sampling algorithms for parameter estimation
• Estimating linear response statistics using orthogonal polynomials: An RKHS formulation