{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T19:37:22Z","timestamp":1787341042118,"version":"build-2736575974"},"reference-count":37,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"1","funder":[{"DOI":"10.13039\/100005423","name":"Association of Research Libraries","doi-asserted-by":"publisher","award":["W911NF-12-2-0023"],"award-info":[{"award-number":["W911NF-12-2-0023"]}],"id":[{"id":"10.13039\/100005423","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["N660011524053"],"award-info":[{"award-number":["N660011524053"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["HR0011-17-2-0016"],"award-info":[{"award-number":["HR0011-17-2-0016"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-15-1-0467"],"award-info":[{"award-number":["FA9550-15-1-0467"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-1212806"],"award-info":[{"award-number":["IIS-1212806"]}],"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":[[2019,1]]},"abstract":"<jats:p>We propose a novel approach to allocating resources for expensive simulations of high fidelity models when used in a multifidelity framework. Allocation decisions that distribute computational resources across several simulation models become extremely important in situations where only a small number of expensive high fidelity simulations can be run. We identify this allocation decision as a problem in optimal subset selection and subsequently regularize this problem so that solutions can be computed. Our regularized formulation yields a type of group lasso problem that has been studied in the literature to accomplish subset selection. Our numerical results compare the performance of algorithms that solve the group lasso problem for algorithmic allocation against a variety of other strategies, including those based on classical linear algebraic pivoting routines and those derived from more modern machine learning--based methods. We demonstrate on well-known synthetic problems and more difficult real-world simulations that this group lasso solution to the relaxed optimal subset selection problem performs better than the alternatives.<\/jats:p>","DOI":"10.1137\/17m1144714","type":"journal-article","created":{"date-parts":[[2019,2,28]],"date-time":"2019-02-28T13:07:33Z","timestamp":1551359253000},"page":"203-231","source":"Crossref","is-referenced-by-count":8,"title":["Allocation Strategies for High Fidelity Models in the Multifidelity Regime"],"prefix":"10.1137","volume":"7","author":[{"given":"Daniel J.","family":"Perry","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Robert M.","family":"Kirby","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5914-4207","authenticated-orcid":true,"given":"Akil","family":"Narayan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ross T.","family":"Whitaker","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2019,2,28]]},"reference":[{"key":"atypb1","unstructured":"J. Altschuler, A. Bhaskara, A. Rostamizadeh, M. Zadimoghaddam, T. Fu, and V. Mirrokni,\n                      Greedy column subset selection: New bounds and distributed algorithms\n                      , in Proceedings of the 33rd International Conference on Machine Learning (ICML), 2016."},{"key":"atypb2","doi-asserted-by":"publisher","DOI":"10.1007\/s00158-010-0594-7"},{"key":"atypb3","unstructured":"F. Bach,\n                      Sharp analysis of low-rank kernel matrix approximations\n                      , in Proceedings of the 30th International Conference on Learning Theory (ICML), 2013, pp. 185-209."},{"key":"atypb4","doi-asserted-by":"publisher","DOI":"10.1137\/12086755X"},{"key":"atypb5","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973068.105"},{"key":"atypb6","unstructured":"S. Boyd,\n                      Alternating direction method of multipliers\n                      , in Proceedings of the 51st IEEE Conference on Decision and Control, Vol. 3, 2011, pp. 1-44."},{"key":"atypb7","doi-asserted-by":"publisher","DOI":"10.1561\/2200000016"},{"key":"atypb8","doi-asserted-by":"publisher","DOI":"10.1016\/j.cpc.2015.02.008"},{"key":"atypb9","doi-asserted-by":"publisher","DOI":"10.1137\/0913043"},{"key":"atypb10","doi-asserted-by":"publisher","DOI":"10.1137\/030602678"},{"key":"atypb11","unstructured":"M. B. Cohen and C. Musco,\n                      Ridge Leverage Scores for Low-Rank Approximation\n                      , preprint,https:\/\/arxiv.org\/abs\/1511.07263v1, 2015."},{"key":"atypb12","doi-asserted-by":"crossref","unstructured":"W. Deng, W. Yin, and Y. Zhang,\n                      Group Sparse Optimization by Alternating Direction Method\n                      , Proc. SPIE 8858, SPIE, Bellingham, WA, 2013,https:\/\/doi.org\/10.1117\/12.2024410.","DOI":"10.1117\/12.2024410"},{"key":"atypb13","doi-asserted-by":"publisher","DOI":"10.1007\/BF01436075"},{"key":"atypb14","unstructured":"G. H. Golub and C. F. Van Loan,\n                      Matrix Computations\n                      , Vol. 3, John Hopkins University Press, Baltimore, MD, 2012."},{"key":"atypb15","doi-asserted-by":"publisher","DOI":"10.1137\/0917055"},{"key":"atypb16","unstructured":"J. Hampton, H. Fairbanks, A. Narayan, and A. Doostan,\n                      Parametric\/Stochastic Model Reduction: Low-Rank Representation, Non-intrusive Bi-fidelity Approximation, and Convergence Analysis\n                      , preprint,http:\/\/arxiv.org\/abs\/1709.03661, 2017."},{"key":"atypb17","unstructured":"G. E. Karniadakis and S. J. Sherwin,\n                      Spectral\/hp Element Methods for CFD\n                      , Oxford University Press, New York, 2005."},{"key":"atypb19","unstructured":"L. Le Gratiet,\n                      Multi-fidelity Gaussian Process Regression for Computer Experiments\n                      , Ph.D. thesis, Universit\u00e9 Paris-Diderot-Paris VII, Paris, 2013."},{"key":"atypb20","unstructured":"C. Lozano, G. Swirszcz, and N. Abe,\n                      Group orthogonal matching pursuit for variable selection and prediction\n                      , in Proceedings of the 22nd International Conference on Neural Information Processing Systems (NIPS), 2009, pp. 1150-1158."},{"key":"atypb21","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0803205106"},{"key":"atypb22","unstructured":"B. R. Munson, D. F. Young, and T. H. Okiishi,\n                      Fundamentals of Fluid Mechanics\n                      , 3rd ed., John Wiley & Sons, New York, 1990."},{"key":"atypb23","doi-asserted-by":"publisher","DOI":"10.1137\/130929461"},{"key":"atypb24","doi-asserted-by":"crossref","unstructured":"L. W.T. Ng and M. Eldred,\n                      Multifidelity uncertainty quantification using non-intrusive polynomial chaos and stochastic collocation\n                      , in 53rd AIAA\/ASME\/ASCE\/AHS\/ASC Structures, Structural Dynamics and Materials Conference, American Institute of Aeronautics and Astronautics, Reston, VA, 2012, AIAA 2012-1852,https:\/\/doi.org\/10.2514\/6.2012-1852.","DOI":"10.2514\/6.2012-1852"},{"key":"atypb25","doi-asserted-by":"crossref","unstructured":"D. Papailiopoulos, A. Kyrillidis, and C. Boutsidis,\n                      Provable deterministic leverage score sampling\n                      , in Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), 2014, pp. 997-1006,https:\/\/doi.org\/10.1145\/2623330.2623698.","DOI":"10.1145\/2623330.2623698"},{"key":"atypb26","doi-asserted-by":"publisher","DOI":"10.1137\/15M1046472"},{"key":"atypb27","first-page":"20160751","volume":"473","author":"Perdikaris P.","year":"2017","journal-title":"Proc. A"},{"key":"atypb28","first-page":"20150018","volume":"471","author":"Perdikaris P.","year":"2015","journal-title":"Proc. A"},{"key":"atypb29","first-page":"543","author":"Perry D. J.","year":"2016","journal-title":"Heidelberg"},{"key":"atypb30","doi-asserted-by":"publisher","DOI":"10.3722\/cadaps.2010.247-256"},{"key":"atypb31","unstructured":"Y. Shitov,\n                      Column Subset Selection Is NP-Complete\n                      , preprint,https:\/\/arxiv.org\/abs\/1701.02764, 2017."},{"key":"atypb32","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1001208107"},{"key":"atypb33","doi-asserted-by":"publisher","DOI":"10.1080\/21681163.2015.1030775"},{"key":"atypb34","doi-asserted-by":"publisher","DOI":"10.1002\/nme.1152"},{"key":"atypb35","doi-asserted-by":"publisher","DOI":"10.1007\/s11222-014-9498-5"},{"key":"atypb36","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9868.2005.00532.x"},{"key":"atypb37","doi-asserted-by":"publisher","DOI":"10.1007\/s11831-015-9151-2"},{"key":"atypb38","doi-asserted-by":"publisher","DOI":"10.1137\/130949154"}],"container-title":["SIAM\/ASA Journal on Uncertainty Quantification"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/17M1144714","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T19:02:52Z","timestamp":1787338972000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/17M1144714"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,1]]}},"alternative-id":["10.1137\/17M1144714"],"URL":"https:\/\/doi.org\/10.1137\/17m1144714","relation":{},"ISSN":["2166-2525"],"issn-type":[{"value":"2166-2525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1]]}}}