Ajay Jasra, Kody J. H. Law, Neil Walton, Shangda Yang
{"title":"Multi-index Sequential Monte Carlo Ratio Estimators for Bayesian Inverse problems","authors":"Ajay Jasra, Kody J. H. Law, Neil Walton, Shangda Yang","doi":"10.1007/s10208-023-09612-z","DOIUrl":null,"url":null,"abstract":"Abstract We consider the problem of estimating expectations with respect to a target distribution with an unknown normalising constant, and where even the un-normalised target needs to be approximated at finite resolution. This setting is ubiquitous across science and engineering applications, for example in the context of Bayesian inference where a physics-based model governed by an intractable partial differential equation (PDE) appears in the likelihood. A multi-index sequential Monte Carlo (MISMC) method is used to construct ratio estimators which provably enjoy the complexity improvements of multi-index Monte Carlo (MIMC) as well as the efficiency of sequential Monte Carlo (SMC) for inference. In particular, the proposed method provably achieves the canonical complexity of $$\\hbox {MSE}^{-1}$$ <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"> <mml:msup> <mml:mtext>MSE</mml:mtext> <mml:mrow> <mml:mo>-</mml:mo> <mml:mn>1</mml:mn> </mml:mrow> </mml:msup> </mml:math> , while single-level methods require $$\\hbox {MSE}^{-\\xi }$$ <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"> <mml:msup> <mml:mtext>MSE</mml:mtext> <mml:mrow> <mml:mo>-</mml:mo> <mml:mi>ξ</mml:mi> </mml:mrow> </mml:msup> </mml:math> for $$\\xi >1$$ <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"> <mml:mrow> <mml:mi>ξ</mml:mi> <mml:mo>></mml:mo> <mml:mn>1</mml:mn> </mml:mrow> </mml:math> . This is illustrated on examples of Bayesian inverse problems with an elliptic PDE forward model in 1 and 2 spatial dimensions, where $$\\xi =5/4$$ <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"> <mml:mrow> <mml:mi>ξ</mml:mi> <mml:mo>=</mml:mo> <mml:mn>5</mml:mn> <mml:mo>/</mml:mo> <mml:mn>4</mml:mn> </mml:mrow> </mml:math> and $$\\xi =3/2$$ <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"> <mml:mrow> <mml:mi>ξ</mml:mi> <mml:mo>=</mml:mo> <mml:mn>3</mml:mn> <mml:mo>/</mml:mo> <mml:mn>2</mml:mn> </mml:mrow> </mml:math> , respectively. It is also illustrated on more challenging log-Gaussian process models, where single-level complexity is approximately $$\\xi =9/4$$ <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"> <mml:mrow> <mml:mi>ξ</mml:mi> <mml:mo>=</mml:mo> <mml:mn>9</mml:mn> <mml:mo>/</mml:mo> <mml:mn>4</mml:mn> </mml:mrow> </mml:math> and multilevel Monte Carlo (or MIMC with an inappropriate index set) gives $$\\xi = 5/4 + \\omega $$ <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"> <mml:mrow> <mml:mi>ξ</mml:mi> <mml:mo>=</mml:mo> <mml:mn>5</mml:mn> <mml:mo>/</mml:mo> <mml:mn>4</mml:mn> <mml:mo>+</mml:mo> <mml:mi>ω</mml:mi> </mml:mrow> </mml:math> , for any $$\\omega > 0$$ <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"> <mml:mrow> <mml:mi>ω</mml:mi> <mml:mo>></mml:mo> <mml:mn>0</mml:mn> </mml:mrow> </mml:math> , whereas our method is again canonical. We also provide novel theoretical verification of the product-form convergence results which MIMC requires for Gaussian processes built in spaces of mixed regularity defined in the spectral domain, which facilitates acceleration with fast Fourier transform methods via a cumulant embedding strategy, and may be of independent interest in the context of spatial statistics and machine learning.","PeriodicalId":55151,"journal":{"name":"Foundations of Computational Mathematics","volume":"1 1","pages":"0"},"PeriodicalIF":2.5000,"publicationDate":"2023-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Foundations of Computational Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/s10208-023-09612-z","RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0
Abstract
Abstract We consider the problem of estimating expectations with respect to a target distribution with an unknown normalising constant, and where even the un-normalised target needs to be approximated at finite resolution. This setting is ubiquitous across science and engineering applications, for example in the context of Bayesian inference where a physics-based model governed by an intractable partial differential equation (PDE) appears in the likelihood. A multi-index sequential Monte Carlo (MISMC) method is used to construct ratio estimators which provably enjoy the complexity improvements of multi-index Monte Carlo (MIMC) as well as the efficiency of sequential Monte Carlo (SMC) for inference. In particular, the proposed method provably achieves the canonical complexity of $$\hbox {MSE}^{-1}$$ MSE-1 , while single-level methods require $$\hbox {MSE}^{-\xi }$$ MSE-ξ for $$\xi >1$$ ξ>1 . This is illustrated on examples of Bayesian inverse problems with an elliptic PDE forward model in 1 and 2 spatial dimensions, where $$\xi =5/4$$ ξ=5/4 and $$\xi =3/2$$ ξ=3/2 , respectively. It is also illustrated on more challenging log-Gaussian process models, where single-level complexity is approximately $$\xi =9/4$$ ξ=9/4 and multilevel Monte Carlo (or MIMC with an inappropriate index set) gives $$\xi = 5/4 + \omega $$ ξ=5/4+ω , for any $$\omega > 0$$ ω>0 , whereas our method is again canonical. We also provide novel theoretical verification of the product-form convergence results which MIMC requires for Gaussian processes built in spaces of mixed regularity defined in the spectral domain, which facilitates acceleration with fast Fourier transform methods via a cumulant embedding strategy, and may be of independent interest in the context of spatial statistics and machine learning.
期刊介绍:
Foundations of Computational Mathematics (FoCM) will publish research and survey papers of the highest quality which further the understanding of the connections between mathematics and computation. The journal aims to promote the exploration of all fundamental issues underlying the creative tension among mathematics, computer science and application areas unencumbered by any external criteria such as the pressure for applications. The journal will thus serve an increasingly important and applicable area of mathematics. The journal hopes to further the understanding of the deep relationships between mathematical theory: analysis, topology, geometry and algebra, and the computational processes as they are evolving in tandem with the modern computer.
With its distinguished editorial board selecting papers of the highest quality and interest from the international community, FoCM hopes to influence both mathematics and computation. Relevance to applications will not constitute a requirement for the publication of articles.
The journal does not accept code for review however authors who have code/data related to the submission should include a weblink to the repository where the data/code is stored.