We consider the use of Gaussian process (GP) priors for solving inverse problems in a Bayesian framework. As is well known, the computational complexity of GPs scales cubically in the number of datapoints. We here show that in the context of inverse problems involving integral operators, one faces additional difficulties that hinder inversion on large grids. Furthermore, in that context, covariance matrices can become too large to be stored. By leveraging results about sequential disintegrations of Gaussian measures, we are able to introduce an implicit representation of posterior covariance matrices that reduces the memory footprint by only storing low rank intermediate matrices, while allowing individual elements to be accessed on-the-fly without needing to build full posterior covariance matrices. Moreover, it allows for fast sequential inclusion of new observations. These features are crucial when considering sequential experimental design tasks. We demonstrate our approach by computing sequential data collection plans for excursion set recovery for a gravimetric inverse problem, where the goal is to provide fine resolution estimates of high density regions inside the Stromboli volcano, Italy. Sequential data collection plans are computed by extending the weighted integrated variance reduction (wIVR) criterion to inverse problems. Our results show that this criterion is able to significantly reduce the uncertainty on the excursion volume, reaching close to minimal levels of residual uncertainty. Overall, our techniques allow the advantages of probabilistic models to be brought to bear on large-scale inverse problems arising in the natural sciences.
翻译:我们考虑使用高斯进程(GP)前缀来解决巴伊西亚框架中的反问题。众所周知,GP的计算复杂性在数据点数量上是相隔的。我们在这里表明,在涉及一体化操作者的反向问题中,还面临阻碍大型电网倒置的额外困难。此外,在这方面,共变矩阵可能变得过于庞大而无法储存。通过利用关于高斯测量措施相继解体的结果,我们能够引入后方变异矩阵的隐含代表性,仅储存低级中间矩阵,从而减少记忆足迹,同时允许单个元素在飞行上访问,而无需建立完整的后方变异矩阵。此外,在考虑连续实验设计任务时,这些特征至关重要。我们通过计算顺序数据收集计划,为重度反常度的恢复设定,我们的目标是提供高密度区域的精确分辨率估计,同时只储存低级中间矩阵,同时允许单个元素在飞行上访问,而无需建立完整的后方位变量矩阵矩阵。此外,通过将我们数据收集的大规模变异性标准推低至精确度标准。