首页> 外文期刊>SIAM Journal on Scientific Computing >A COMPUTATIONAL FRAMEWORK FOR INFINITE-DIMENSIONAL BAYESIAN INVERSE PROBLEMS, PART II: STOCHASTIC NEWTON MCMC WITH APPLICATION TO ICE SHEET FLOW INVERSE PROBLEMS
【24h】

A COMPUTATIONAL FRAMEWORK FOR INFINITE-DIMENSIONAL BAYESIAN INVERSE PROBLEMS, PART II: STOCHASTIC NEWTON MCMC WITH APPLICATION TO ICE SHEET FLOW INVERSE PROBLEMS

机译:无限维贝叶斯逆问题的计算框架,第二部分:随机牛顿MCMC及其在冰片流逆问题中的应用

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

We address the numerical solution of infinite-dimensional inverse problems in the framework of Bayesian inference. In Part I of this paper [T. Bui-Thanh, O. Ghattas, J. Martin, and G. Stadler, SIAM J. Sci. Comput., 35 (2013), pp. A2494-A2523] we considered the linearized infinitedimensional inverse problem. In Part II, we relax the linearization assumption and consider the fully nonlinear infinite-dimensional inverse problem using a Markov chain Monte Carlo (MCMC) sampling method. To address the challenges of sampling high-dimensional probability density functions (pdfs) arising upon discretization of Bayesian inverse problems governed by PDEs, we build upon the stochastic Newton MCMC method. This method exploits problem structure by taking as a proposal density a local Gaussian approximation of the posterior pdf, whose covariance operator is given by the inverse of the local Hessian of the negative log posterior pdf. The construction of the covariance is made tractable by invoking a low-rank approximation of the data misfit component of the Hessian. Here we introduce an approximation of the stochastic Newton proposal in which we compute the low-rank-based Hessian at just the maximum a posteriori (MAP) point, and then reuse this Hessian at each MCMC step. We compare the performance of the proposed method to the original stochastic Newton MCMC method and to an independence sampler. The comparison of the three methods is conducted on a synthetic ice sheet inverse problem. For this problem, the stochastic Newton MCMC method with a MAP-based Hessian converges at least as rapidly as the original stochastic Newton MCMC method, but is far cheaper since it avoids recomputing the Hessian at each step. On the other hand, it is more expensive per sample than the independence sampler; however, its convergence is significantly more rapid, and thus overall it is much cheaper. Finally, we present extensive analysis and interpretation of the posterior distribution and classify directions in parameter space based on the extent to which they are informed by the prior or the observations.
机译:我们在贝叶斯推理的框架内解决无限维反问题的数值解。在本文的第一部分[T. Bui-Thanh,O。Ghattas,J。Martin和G.Stadler,SIAM J. Sci。计算(35)(2013),第A2494-A2523页],我们考虑了线性化的无限维逆问题。在第二部分中,我们放宽了线性化假设,并使用Markov链蒙特卡洛(MCMC)采样方法考虑了完全非线性的无限维逆问题。为了解决在由PDE控制的贝叶斯逆问题离散化过程中采样高维概率密度函数(pdf)的挑战,我们建立在随机牛顿MCMC方法的基础上。该方法通过将后pdf的局部高斯近似作为建议密度来利用问题结构,其协方差算子由负对数后pdf的局部Hessian的逆给出。通过调用Hessian的数据失配分量的低秩近似,可以使协方差的构造易于处理。在这里,我们介绍一种随机牛顿提议的近似值,在该提议中,我们仅在最大后验(MAP)点处计算基于低秩的Hessian,然后在每个MCMC步骤中重复使用此Hessian。我们将提出的方法与原始随机牛顿MCMC方法和独立采样器的性能进行了比较。三种方法的比较是针对合成冰盖反问题进行的。对于此问题,具有基于MAP的Hessian的随机牛顿MCMC方法的收敛速度至少与原始的随机牛顿MCMC方法收敛速度相同,但价格便宜得多,因为它避免了在每个步骤中重新计算Hessian。另一方面,每个样本比独立采样器昂贵。但是,它的收敛速度要快得多,因此总体上便宜得多。最后,我们对后验分布进行广泛的分析和解释,并根据先验或观测结果告知后验的程度对参数空间中的方向进行分类。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号