arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1707.04246stat.MEmath.PR
收藏

贝叶斯反演模型误差的迭代修正

Iterative Updating of Model Error for Bayesian Inversion

Daniela Calvetti, Matthew M. Dunlop, Erkki Somersalo, Andrew M. Stuart

摘要:

在计算逆问题中,通常用计算难度较小的替代模型来近似详细而准确的正演模型。当使用优化算法来找到单个估计时,模型简化可能是满足计算时间的约束所必需的,或者是为了加速贝叶斯框架中的马尔可夫链蒙特卡罗(MCMC)计算。近似模型的使用引入了差异或建模误差,这可能对不适定逆问题的解产生不利影响,或者可能严重扭曲后验分布的估计。在贝叶斯范例中,建模误差可以被认为是随机变量,并且通过使用未知的概率分布的估计,可以估计建模误差的概率分布并将其并入反演中。我们引入了一个算法,迭代这个想法,更新模型误差的分布,从而导致一系列的后验分布,经验证明,以捕获潜在的真相,越来越准确。由于该算法不是基于拒绝,它只需要有限的完整模型评估。我们分析表明,在线性高斯的情况下,该算法收敛的几何速度快的迭代次数。对于更一般的模型,我们引入粒子近似的迭代生成的序列的分布,我们还证明了每个元素的序列收敛在大粒子的限制。我们数值表明,在线性的情况下,快速收敛相对于迭代次数发生。此外,我们通过计算实例表明,从这种迭代算法得到的点估计优于忽略模型误差得到的。

英文摘要:

In computational inverse problems, it is common that a detailed and accurate forward model is approximated by a computationally less challenging substitute. The model reduction may be necessary to meet constraints in computing time when optimization algorithms are used to find a single estimate, or to speed up Markov chain Monte Carlo (MCMC) calculations in the Bayesian framework. The use of an approximate model introduces a discrepancy, or modeling error, that may have a detrimental effect on the solution of the ill-posed inverse problem, or it may severely distort the estimate of the posterior distribution. In the Bayesian paradigm, the modeling error can be considered as a random variable, and by using an estimate of the probability distribution of the unknown, one may estimate the probability distribution of the modeling error and incorporate it into the inversion. We introduce an algorithm which iterates this idea to update the distribution of the model error, leading to a sequence of posterior distributions that are demonstrated empirically to capture the underlying truth with increasing accuracy. Since the algorithm is not based on rejections, it requires only limited full model evaluations. We show analytically that, in the linear Gaussian case, the algorithm converges geometrically fast with respect to the number of iterations. For more general models, we introduce particle approximations of the iteratively generated sequence of distributions; we also prove that each element of the sequence converges in the large particle limit. We show numerically that, as in the linear case, rapid convergence occurs with respect to the number of iterations. Additionally, we show through computed examples that point estimates obtained from this iterative algorithm are superior to those obtained by neglecting the model error.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑