Abstract
Least squares regression is a ubiquitous tool for building emulators (a.k.a. surrogate models) of problems across science and engineering for purposes such as design space exploration and uncertainty quantification. When the regression data are generated using an experimental design process (e.g., a quadrature grid) involving computationally expensive models, or when the data size is large, sketching techniques have shown promise at reducing the cost of the construction of the regression model while ensuring accuracy comparable to that of the full data. However, random sketching strategies, such as those based on leverage scores, lead to regression errors that are random and may exhibit large variability. To mitigate this issue, we present a novel boosting approach that leverages cheaper, lower-fidelity data of the problem at hand to identify the best sketch among a set of candidate sketches. This in turn specifies the sketch of the intended high-fidelity model and the associated data. We provide theoretical analyses of this bifidelity boosting (BFB) approach and discuss the conditions the low- and high-fidelity data must satisfy for a successful boosting. In doing so, we derive a bound on the residual norm of the BFB sketched solution relating it to its ideal, but computationally expensive, high-fidelity boosted counterpart. Empirical results on both manufactured and PDE data corroborate the theoretical analyses and illustrate the efficacy of the BFB solution in reducing the regression error, as compared to the nonboosted solution.
Original language | English |
---|---|
Pages (from-to) | 213-241 |
Number of pages | 29 |
Journal | SIAM-ASA Journal on Uncertainty Quantification |
Volume | 12 |
Issue number | 2 |
DOIs | |
State | Published - Jun 2024 |
Bibliographical note
Publisher Copyright:© 2024 Society for Industrial and Applied Mathematics and American Statistical Association.
Funding
This work was supported by AFOSR awards FA9550-20-1-0138 and FA9550-20-1-0188 with Dr. Fariba Fahroo as the program manager, and by DOE ASCR MMICC grant DE-SC0023346. The views expressed in the article do not necessarily represent the views of the AFOSR, DOE, or the U.S. Government. \\ast Received by the editors September 27, 2022; accepted for publication (in revised form) November 13, 2023; published electronically April 4, 2024. https://doi.org/10.1137/22M1524989 Funding: This work was supported by AFOSR awards FA9550-20-1-0138 and FA9550-20-1-0188 with Dr. Fariba Fahroo as the program manager, and by DOE ASCR MMICC grant DE-SC0023346. The views expressed in the article do not necessarily represent the views of the AFOSR, DOE, or the U.S. Government. \\dagger Department of Applied Mathematics, University of Colorado at Boulder, Boulder, CO 80309-0526 USA ([email protected], [email protected]). \\ddagger Applied Mathematics \\& Computational Research Division, Lawrence Berkeley National Laboratory, Berkeley, CA 94720 USA ([email protected]). \\S Department of Statistics and Actuarial Science, University of Waterloo, Waterloo, ON N2L 3G1, Canada ([email protected]). \\P Sead Aerospace Engineering Sciences Department, University of Colorado at Boulder, Boulder, CO 80309 USA ([email protected]). \\| Scientific Computing and Imaging Institute, and Department of Mathematics, University of Utah, Salt Lake City, UT 84112 USA ([email protected]).
Funders | Funder number |
---|---|
U.S. Department of Energy EPSCoR | |
Air Force Office of Scientific Research, United States Air Force | FA9550-20-1-0188, FA9550-20-1-0138 |
Air Force Office of Scientific Research, United States Air Force | |
DOE ASCR MMICC | DE-SC0023346 |
Keywords
- boosting
- least squares
- multifidelity
- polynomial chaos
- randomized sketching
- uncertainty quantification
ASJC Scopus subject areas
- Statistics and Probability
- Modeling and Simulation
- Statistics, Probability and Uncertainty
- Discrete Mathematics and Combinatorics
- Applied Mathematics