A bandit-learning approach to multifidelity approximation

03/29/2021
by   Yiming Xu, et al.
0

Multifidelity approximation is an important technique in scientific computation and simulation. In this paper, we introduce a bandit-learning approach for leveraging data of varying fidelities to achieve precise estimates of the parameters of interest. Under a linear model assumption, we formulate a multifidelity approximation as a modified stochastic bandit, and analyze the loss for a class of policies that uniformly explore each model before exploiting. Utilizing the estimated conditional mean-squared error, we propose a consistent algorithm, adaptive Explore-Then-Commit (AETC), and establish a corresponding trajectory-wise optimality result. These results are then extended to the case of vector-valued responses, where we demonstrate that the algorithm is efficient without the need to worry about estimating high-dimensional parameters. The main advantage of our approach is that we require neither hierarchical model structure nor a priori knowledge of statistical information (e.g., correlations) about or between models. Instead, the AETC algorithm requires only knowledge of which model is a trusted high-fidelity model, along with (relative) computational cost estimates of querying each model. Numerical experiments are provided at the end to support our theoretical findings.

READ FULL TEXT

page 33

page 34

07/09/2020

Provably-Efficient Double Q-Learning

In this paper, we establish a theoretical comparison between the asympto...
05/10/2021

Budget-limited distribution learning in multifidelity problems

Multifidelity methods are widely used for statistical estimation of quan...
03/15/2021

A FOM/ROM Hybrid Approach for Accelerating Numerical Simulations

The basis generation in reduced order modeling usually requires multiple...
02/08/2021

Correlated Bandits for Dynamic Pricing via the ARC algorithm

The Asymptotic Randomised Control (ARC) algorithm provides a rigorous ap...
07/20/2021

Active operator inference for learning low-dimensional dynamical-system models from noisy data

Noise poses a challenge for learning dynamical-system models because alr...
09/04/2019

Multifidelity Computer Model Emulation with High-Dimensional Output

Hurricane-driven storm surge is one of the most deadly and costly natura...
07/30/2020

A PAC algorithm in relative precision for bandit problem with costly sampling

This paper considers the problem of maximizing an expectation function o...