{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,15]],"date-time":"2026-10-15T18:09:16Z","timestamp":1792087756703,"version":"4.4.0"},"reference-count":69,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"1","funder":[{"DOI":"10.13039\/100000015","name":"U.S. Department of Energy","doi-asserted-by":"publisher","award":["DE-SC0019303"],"award-info":[{"award-number":["DE-SC0019303"]}],"id":[{"id":"10.13039\/100000015","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000015","name":"U.S. Department of Energy","doi-asserted-by":"publisher","award":["DE-SC0021239"],"award-info":[{"award-number":["DE-SC0021239"]}],"id":[{"id":"10.13039\/100000015","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100014036","name":"Multidisciplinary University Research Initiative","doi-asserted-by":"publisher","award":["FA9550-21-1-0084"],"award-info":[{"award-number":["FA9550-21-1-0084"]}],"id":[{"id":"10.13039\/100014036","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-2012453"],"award-info":[{"award-number":["DMS-2012453"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM\/ASA J. Uncertainty Quantification"],"published-print":{"date-parts":[[2023,3,31]]},"abstract":"<jats:p>Abstract.<\/jats:p>\n                  <jats:p>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.<\/jats:p>","DOI":"10.1137\/21m1466499","type":"journal-article","created":{"date-parts":[[2023,3,3]],"date-time":"2023-03-03T09:51:16Z","timestamp":1677837076000},"page":"235-261","source":"Crossref","is-referenced-by-count":38,"title":["A Fast and Scalable Computational Framework for Large-Scale High-Dimensional Bayesian Optimal Experimental Design"],"prefix":"10.1137","volume":"11","author":[{"given":"Keyi","family":"Wu","sequence":"first","affiliation":[{"name":"Department of Mathematics, The University of Texas at Austin, Austin, TX 78705 USA."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peng","family":"Chen","sequence":"additional","affiliation":[{"name":"School of Computational Science and Engineering, Georgia Institute of Technology, Atlanta, GA 30308 USA."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Omar","family":"Ghattas","sequence":"additional","affiliation":[{"name":"Departments of Geological Sciences and Mechanical Engineering and Oden Institute for Computational Engineering and Sciences, The University of Texas at Austin, Austin, TX 78705 USA."}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2023,3,3]]},"reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1214\/15-BA969"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/130933381"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/140992564"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/16M106306X"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/17M115712X"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1029\/2020WR027391"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1029\/2021WR029775"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/19M1270367"},{"key":"ref9","doi-asserted-by":"crossref","unstructured":"N. Aretz-Nellesen , \nP. Chen , \nM. A. Grepl , and \nK. Veroy , A-optimal experimental design for hyper-parameterized linear Bayesian inverse problems, in Numerical Mathematics and Advanced Applications ENUMATH 2019, Lect. Notes Comput. Sci. Eng. 139, 2020, pp. 489\u2013497.","DOI":"10.1007\/978-3-030-55874-1_48"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s10444-019-09713-w"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1093\/oso\/9780198522546.001.0001"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1088\/1361-6420\/aad210"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1561\/2200000039"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.cma.2018.01.053"},{"key":"ref15","unstructured":"A. A. Bian , \nJ. M. Buhmann , \nA. Krause , and \nS. Tschiatschek , Guarantees for greedy maximization of non-submodular functions with applications, in Proceedings of the 34th International Conference on Machine Learning, Proc. Mach. Learn. Res. 70, 2017, pp. 498\u2013507."},{"key":"ref16","doi-asserted-by":"crossref","unstructured":"C. Boutsidis , \nM. W. Mahoney , and \nP. Drineas , An Improved Approximation Algorithm for the Column Subset Selection Problem, http:\/\/arxiv.org\/abs\/0812.4293, 2008.","DOI":"10.1137\/1.9781611973068.105"},{"key":"ref17","doi-asserted-by":"crossref","unstructured":"T. Bui-Thanh , \nC. Burstedde , \nO. Ghattas , \nJ. Martin , \nG. Stadler , and \nL. C. Wilcox , Extreme-scale UQ for Bayesian inverse problems governed by PDEs, in Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, 2012.","DOI":"10.1109\/SC.2012.56"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1088\/0266-5611\/28\/5\/055001"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1088\/0266-5611\/28\/5\/055002"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.3934\/ipi.2013.7.1139"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/12089586X"},{"key":"ref22","series-title":"Wiley Ser. Probab. Stat. 327","volume-title":"Sensitivity Analysis in Linear Regression","author":"Chatterjee S.","year":"2009"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1615\/Int.J.UncertaintyQuantification.2019028753"},{"key":"ref24","volume-title":"Proceedings of Advances in Neural Information Processing Systems","author":"Chen P.","year":"2020"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1137\/20M1381381"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcp.2021.110114"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.cma.2017.08.016"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcp.2019.01.047"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.cma.2021.114020"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1088\/1361-6420\/aa6d8e"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1088\/1361-6420\/aaf129"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.3934\/ipi.2018045"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1137\/090780717"},{"key":"ref34","series-title":"Ann. Discrete Math. 58","volume-title":"Submodular Functions and Optimization","author":"Fujishige S.","year":"2005"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1137\/090771806"},{"key":"ref36","unstructured":"I. Han , \nP. Kambadur , \nK. Park , and \nJ. Shin , Faster greedy map inference for determinantal point processes, in Proceedings of the 34th International Conference on Machine Learning, Proc. Mach. Learn. Res. 70, 2017, pp. 1384\u20131393."},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1002\/2013JB010272"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcp.2012.08.013"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1615\/Int.J.UncertaintyQuantification.2014006730"},{"key":"ref40","unstructured":"X. Huan  and \nY. M. Marzouk , Sequential Bayesian Optimal Experimental Design via Approximate Dynamic Programming, preprint, arXiv:1604.08320, 2016."},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcp.2015.04.047"},{"key":"ref42","unstructured":"J. Jagalur-Mohan  and \nY. Marzouk , Batch Greedy Maximization of Non-Submodular Functions: Guarantees and Applications to Experimental Design, preprint, arXiv:2006.04554, 2020."},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1137\/130925311"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1088\/0266-5611\/26\/5\/055008"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139177801.004"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1016\/j.cma.2015.03.021"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1016\/j.cma.2013.02.017"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/MCS.2018.2810460"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1137\/110845598"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588971"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1016\/j.cma.2021.114199"},{"key":"ref52","doi-asserted-by":"crossref","unstructured":"D. Papailiopoulos , \nA. Kyrillidis , and \nC. Boutsidis , Provable deterministic leverage score sampling, in Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2014, pp. 997\u20131006.","DOI":"10.1145\/2623330.2623698"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1137\/130934805"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.3189\/2012JoG11J182"},{"key":"ref55","volume-title":"An Introduction to Grids, Graphs, and Networks","author":"Pozrikidis C.","year":"2014"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719109"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1007\/s00211-017-0880-z"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1016\/j.advwatres.2015.04.012"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1017\/S0962492910000061"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1088\/1361-6420\/ab649c"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1145\/3428447"},{"key":"ref62","unstructured":"K. Wei , \nR. Iyer , and \nJ. Bilmes , Submodularity in data subset selection and active learning, in Proceedings of the 32nd International Conference on Machine Learning, Lille, France, Proc. Mach. Learn. Res. \nF. Bach  and \nD. Blei , eds. 2015, pp. 1954\u20131963."},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1016\/j.pepi.2014.06.006"},{"key":"ref64","doi-asserted-by":"crossref","unstructured":"K. Wu , \nP. Chen , and \nO. Ghattas , An efficient method for goal-oriented linear Bayesian optimal experimental design: Application to optimal sensor placement, SIAM\/ASA J. Uncertain. Quantif., to appear; also available online from, preprint, arXiv:2102.06627, 2022.","DOI":"10.1137\/21M1466542"},{"key":"ref65","doi-asserted-by":"crossref","unstructured":"K. Wu , \nT. O\u2019Leary-Roseberry , \nP. Chen , and \nO. Ghattas , Large-scale Bayesian optimal experimental design with derivative-informed projected neural network, J. Sci. Comput., to appear; also available online from, preprint, arXiv:2201.07925, 2022.","DOI":"10.1007\/s10915-023-02145-1"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1137\/100796789"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1016\/j.jprocont.2017.03.011"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1190\/geo2015-0641.1"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.5194\/tc-10-1477-2016"}],"container-title":["SIAM\/ASA Journal on Uncertainty Quantification"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/21M1466499","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T19:11:01Z","timestamp":1787339461000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/21M1466499"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,3]]},"references-count":69,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,3,31]]}},"alternative-id":["10.1137\/21M1466499"],"URL":"https:\/\/doi.org\/10.1137\/21m1466499","relation":{},"ISSN":["2166-2525"],"issn-type":[{"value":"2166-2525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,3]]}}}