Multilevel delayed acceptance MCMC

• Verfasst von: Lykkegaard, Mikkel [VerfasserIn]
• Verfasst von: Dodwell, T. J. [VerfasserIn]
• Verfasst von: Fox, C. [VerfasserIn]
• Verfasst von: Mingas, G. [VerfasserIn]
• Verfasst von: Scheichl, Robert [VerfasserIn]
• Titel: Multilevel delayed acceptance MCMC
• Verf.angabe: M.B. Lykkegaard, T.J. Dodwell, C. Fox, G. Mingas, and R. Scheichl
• E-Jahr: 2023
• Jahr: January 25, 2023
• Umfang: 30 S.
• Fussnoten: Gesehen am 17.05.2023
• Titel Quelle: Enthalten in: Society for Industrial and Applied MathematicsSIAM ASA journal on uncertainty quantification
• Ort Quelle: Philadelphia, Pa. : SIAM, 2013
• Jahr Quelle: 2023
• Band/Heft Quelle: 11(2023), 1, Seite 1-30
• ISSN Quelle: 2166-2525
• DOI: doi:10.1137/22M1476770
• Datenträger: Online-Ressource
• Sprache: eng
• K10plus-PPN: 1845610938

Abstract

.We develop a fast and scalable computational framework to solve Bayesian optimal experimental design problems governed by partial differential equations (PDEs) with application to optimal sensor placement by maximizing expected information gain (EIG). Such problems are particularly challenging due to the curse of dimensionality for high-dimensional parameters and the expensive solution of large-scale PDEs. To address these challenges, we exploit two fundamental properties: (1) the low-rank structure of the Jacobian of the parameter-to-observable map, to extract the intrinsically low-dimensional data-informed subspace, and (2) a series of approximations of the EIG that reduce the number of PDE solves while retaining high correlation with the true EIG. Based on these properties, we propose an efficient offline-online decomposition for the optimization problem. The offline stage dominates the cost and entails precomputing all components that require PDE solves. The online stage optimizes sensor placement and does not require any PDE solves. For the online stage, we propose a new greedy algorithm that first places an initial set of sensors using leverage scores and then swaps the selected sensors with other candidates until certain convergence criteria are met, which we call a swapping greedy algorithm. We demonstrate the efficiency and scalability of the proposed method by both linear and nonlinear inverse problems. In particular, we show that the number of required PDE solves is small, independent of the parameter dimension, and only weakly dependent on the data dimension for both problems.