Bayesian D-Optimal Experimental Designs via Column Subset Selection

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: Eswar, Srinivas, Rao, Vishwas, Saibaba, Arvind K.
Formato: Preprint
Publicado: 2024
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866912307764789248
author Eswar, Srinivas
Rao, Vishwas
Saibaba, Arvind K.
author_facet Eswar, Srinivas
Rao, Vishwas
Saibaba, Arvind K.
contents This paper tackles optimal sensor placement for Bayesian linear inverse problems, a popular version of the more general Optimal Experimental Design (OED) problem, using the D-optimality criterion. This is done by establishing connections between sensor placement and Column Subset Selection Problem (CSSP), which is a well-studied problem in Numerical Linear Algebra (NLA). In particular, we use the Golub-Klema-Stewart (GKS) approach which involves computing the truncated Singular Value Decomposition (SVD) followed by a pivoted QR factorization on the right singular vectors. The algorithms are further accelerated by using randomization to compute the low-rank approximation as well as for sampling the indices. The resulting algorithms are robust, computationally efficient, amenable to parallelization, require virtually no parameter tuning, and come with strong theoretical guarantees. One of the proposed algorithms is also adjoint-free which is beneficial in situations, where the adjoint is expensive to evaluate or is not available. Additionally, we develop a method for data completion without solving the inverse problem. Numerical experiments on model inverse problems involving the heat equation and seismic tomography in two spatial dimensions demonstrate the performance of our approaches.
format Preprint
id arxiv_https___arxiv_org_abs_2402_16000
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Bayesian D-Optimal Experimental Designs via Column Subset Selection
Eswar, Srinivas
Rao, Vishwas
Saibaba, Arvind K.
Numerical Analysis
35R30, 62K05, 68W20, 65C60, 62F15
This paper tackles optimal sensor placement for Bayesian linear inverse problems, a popular version of the more general Optimal Experimental Design (OED) problem, using the D-optimality criterion. This is done by establishing connections between sensor placement and Column Subset Selection Problem (CSSP), which is a well-studied problem in Numerical Linear Algebra (NLA). In particular, we use the Golub-Klema-Stewart (GKS) approach which involves computing the truncated Singular Value Decomposition (SVD) followed by a pivoted QR factorization on the right singular vectors. The algorithms are further accelerated by using randomization to compute the low-rank approximation as well as for sampling the indices. The resulting algorithms are robust, computationally efficient, amenable to parallelization, require virtually no parameter tuning, and come with strong theoretical guarantees. One of the proposed algorithms is also adjoint-free which is beneficial in situations, where the adjoint is expensive to evaluate or is not available. Additionally, we develop a method for data completion without solving the inverse problem. Numerical experiments on model inverse problems involving the heat equation and seismic tomography in two spatial dimensions demonstrate the performance of our approaches.
title Bayesian D-Optimal Experimental Designs via Column Subset Selection
topic Numerical Analysis
35R30, 62K05, 68W20, 65C60, 62F15
url https://arxiv.org/abs/2402.16000