Paper optimizes multi-fidelity function with fast learning rates.
problem Optimizing a locally smooth function with limited budget and varying fidelity approximations.
method Kometo algorithm that achieves simple regret rates without knowing function smoothness or fidelity assumptions.
result Kometo algorithm outperforms previous methods empirically.
Paper presents MF-PIDNN for physics-informed deep learning with low-fidelity data.
problem Challenges in systems with unknown or approximate governing differential equations and limited high-fidelity data.
method Transfer learning between physics-informed and data-driven deep learning models.
result Model provides accurate predictions even in data-scarce regions.
A new MCMC method combines low and high-fidelity models to reduce computation.
problem Inefficient computation of expensive target densities in scientific applications.
method Pseudo-marginal MCMC approach using a telescoping series of low-fidelity models.
result Asymptotically exact multi-fidelity MCMC algorithms for reduced computational cost.
Bandit methods for black-box optimisation, such as Bayesian optimisation, are used in a variety of applications including hyper-parameter tuning and experiment design. Recently, \emph{multi-fidelity} methods have garnered considerable attention since function evaluations have become increasingly expensive in such appli…
New methods combine low and high-fidelity data for accurate surrogate modeling.
problem Challenges in surrogate modeling for high-dimensional outputs with limited training data.
method Projection-based multifidelity linear regression methods integrating low-fidelity and high-fidelity data.
result Multifidelity methods achieve up to 12% improvement in median accuracy compared to single-fidelity methods.
We study the problem of black-box optimization of a noisy function in the presence of low-cost approximations or fidelities, which is motivated by problems like hyper-parameter tuning. In hyper-parameter tuning evaluating the black-box function at a point involves training a learning algorithm on a large data-set at a …
Deep Gaussian Processes (DGPs) were proposed as an expressive Bayesian model capable of a mathematically grounded estimation of uncertainty. The expressivity of DPGs results from not only the compositional character but the distribution propagation within the hierarchy. Recently, [1] pointed out that the hierarchical s…
In many scientific and engineering applications, we are tasked with the maximisation of an expensive to evaluate black box function f. Traditional settings for this problem assume just the availability of this single function. However, in many cases, cheap approximations to f may be obtainable. For example, the exp…
Researchers develop methods to reduce simulation costs for cardiovascular modeling.
problem High computational cost of high-fidelity simulations in cardiovascular modeling.
method Use low-fidelity approximations, neural networks, and normalizing flows to construct surrogates.
result Validated methods reduce computational cost while maintaining accuracy.
Enhances multi-fidelity modeling with DGPs for different input domains.
problem Improving prediction accuracy with multi-fidelity models using different input domains.
method Extends Deep Gaussian Processes (DGPs) to handle different input domains for high and low-fidelity models.
result Demonstrates improved performance on real-world physical problems.
Machine learning techniques typically rely on large datasets to create accurate classifiers. However, there are situations when data is scarce and expensive to acquire. This is the case of studies that rely on state-of-the-art computational models which typically take days to run, thus hindering the potential of machin…
This work improves surrogate models for balancing accuracy and cost in multi-fidelity methods.
problem Balancing accuracy and computational cost in multi-fidelity methods.
method Develops context-aware surrogate models for multi-fidelity importance sampling and Bayesian inverse problems.
result Context-aware surrogate models can lead to runtime speedups of up to one order of magnitude.
Combines multi-fidelity and asynchronous batch methods for faster experimental design.
problem Designing optimal experimental setups for battery performance.
method Algorithm combining multi-fidelity and asynchronous batch Bayesian Optimization.
result Algorithm outperforms single-fidelity batch and multi-fidelity sequential methods.
rMFBO improves MFBO by making it robust to unreliable low-fidelity sources.
problem Optimizing expensive functions with unreliable low-fidelity approximations.
method rMFBO (robust MFBO) integrates a theoretical guarantee to make GP-based MFBO robust to unreliable sources.
result rMFBO outperforms earlier MFBO methods on unreliable sources.
Efficiently predicts high-fidelity PDE solutions using multi-fidelity Gaussian processes.
problem Expensive high-fidelity solutions for PDEs on discretized domains.
method Multi-Fidelity High-Order Gaussian Process (MFHoGP) that integrates multi-fidelity examples and scales to large numbers of outputs.
result Significantly reduces the cost of high-fidelity PDE solutions through efficient Gaussian process modeling.
Accelerates MCMC sampling for large-scale problems using machine learning.
problem Efficiently sampling large-scale Bayesian inference problems with high computational cost.
method Integrates low-fidelity machine learning models into a multilevel MCMC framework.
result Significantly accelerates multilevel sampling by a factor of two with similar accuracy.
Engineers widely use Gaussian process regression framework to construct surrogate models aimed to replace computationally expensive physical models while exploring design space. Thanks to Gaussian process properties we can use both samples generated by a high fidelity function (an expensive and accurate representation …
Enhances Gaussian process regression with multi-fidelity models and active subspaces for high-dimensional problems.
problem Data scarcity and high-dimensional input spaces with low intrinsic dimensionality.
method Employ Gaussian processes in a Bayesian setting, augmenting with low-fidelity models, and exploiting active subspaces.
result Improves model accuracy through multi-fidelity Gaussian process regression with active subspaces.
New approach uses low-fidelity data to train ML models efficiently.
problem Training ML models with scarce high-fidelity data leads to high variance and poor generalization.
method Multifidelity linear regression using approximate control variates.
result Multifidelity training achieves similar accuracy with reduced high-fidelity data.
In statistical modeling with Gaussian Process regression, it has been shown that combining (few) high-fidelity data with (many) low-fidelity data can enhance prediction accuracy, compared to prediction based on the few high-fidelity data only. Such information fusion techniques for multifidelity data commonly approach …
Deep learning improves low-fidelity dynamical models with scarce high-fidelity data.
problem Improving low-fidelity models with limited high-fidelity data.
method Transfer learning using a deep neural network to correct a low-fidelity model.
result An improved DNN model with high accuracy to underlying dynamics.
GAR generalizes autoregression for efficient multi-fidelity fusion.
problem Efficiently combining low-fidelity and high-fidelity simulation results.
method Generalized autoregression (GAR) using tensor formulation and latent features.
result GAR outperforms state-of-the-art methods with a large margin in RMSE.
DeepONet models system discrepancies with low data.
problem Modeling complex systems with limited data.
method Bi-fidelity modeling using DeepONet for uncertain and partially unknown systems.
result DeepONet effectively models complex systems with parametric uncertainty and partial unknownness.
BF-VAE estimates uncertainty from LF and HF QoI samples.
problem Balancing computational efficiency and numerical accuracy in uncertainty quantification.
method Bi-fidelity formulation of VAEs in latent space.
result BF-VAE improves accuracy with limited HF data.
A novel multi-fidelity HMC algorithm improves efficiency and accuracy.
problem High computational cost and gradient inaccessibility in HMC.
method Two-stage HMC with surrogate model for gradient approximation.
result Significantly improved computational and statistical efficiency.
iMOCA optimizes multiple objectives with continuous approximations for resource efficiency.
problem Optimizing multiple objectives with continuous function approximations that balance accuracy and evaluation cost.
method Information-Theoretic Multi-Objective Bayesian Optimization with Continuous Approximations (iMOCA) selects input and function approximations to maximize information gain per unit cost.
result iMOCA significantly improves over existing single-fidelity methods in approximating the optimal Pareto set.
We present a novel approximate graph matching algorithm that incorporates seeded data into the graph matching paradigm. Our Joint Optimization of Fidelity and Commensurability (JOFC) algorithm embeds two graphs into a common Euclidean space where the matching inference task can be performed. Through real and simulated …
New method learns PDE solutions from low-fidelity data.
problem Challenges in learning PDE surrogates with scarce data.
method Flow matching in infinite-dimensional space with conditional neural operators.
result Accurately learns PDE solutions across different resolutions and fidelities.
This paper develops mfEGRA, a multifidelity active learning method using data-driven adaptively refined surrogates for failure boundary location in reliability analysis. This work addresses the issue of prohibitive cost of reliability analysis using Monte Carlo sampling for expensive-to-evaluate high-fidelity models by…
Inertial confinement fusion (ICF) experiments are designed using computer simulations that are approximations of reality, and therefore must be calibrated to accurately predict experimental observations. In this work, we propose a novel nonlinear technique for calibrating from simulations to experiments, or from low fi…
GLIME improves LIME's stability and local fidelity.
problem LIME's instability and low local fidelity.
method Introducing GLIME, an enhanced framework that derives an equivalent formulation of LIME with faster convergence and improved stability.
result GLIME generates explanations with higher local fidelity and is independent of reference choice.
PCTS optimizes noisy, delayed, multi-fidelity feedbacks in black-box optimization.
problem Optimizing unknown functions with noisy, delayed, and multi-fidelity feedbacks.
method ProCrastinated Tree Search (PCTS) with DUCB1 and DUCBV algorithms.
result PCTS achieves better regret bounds for delayed, noisy, and multi-fidelity feedbacks.
Understanding black-box machine learning models is crucial for their widespread adoption. Learning globally interpretable models is one approach, but achieving high performance with them is challenging. An alternative approach is to explain individual predictions using locally interpretable models. For locally interpre…
A new EVI framework improves ParVI methods by maintaining variational structure and reducing KL-divergence.
problem Improving variational inference methods for better approximation of target distributions.
method EVI framework that minimizes the VI objective function based on an energy-dissipation law, including a new 'Approximation-then-Variation' scheme.
result The new scheme significantly decreases KL-divergence and outperforms existing ParVI methods in fidelity.
CAGES optimizes expensive RL problems by efficiently learning gradients from multiple sources.
problem Optimizing expensive-to-evaluate functions in high-dimensional spaces.
method Cost-Aware Gradient Entropy Search (CAGES) for multi-fidelity Bayesian optimization.
result Significant performance improvements on synthetic and RL benchmark problems.
Enhanced Gaussian process regression for multi-fidelity data fusion.
problem Combining data of varying fidelity levels for accurate predictions.
method Gradient-enhanced Cokriging method (GE-Cokriging) for QoI and its gradients.
result GE-Cokriging outperforms conventional multi-fidelity Cokriging in predicting QoI and gradients.
Gradient-enhanced deep GPs improve multifidelity model accuracy.
problem Improving accuracy in multifidelity models using gradient data.
method Extending deep Gaussian processes to incorporate gradient data.
result Gradient-enhanced deep GP outperforms other models in predicting aerodynamic coefficients.
High-fidelity quantum simulations demonstrated on short-coherence hardware.
problem Short coherence times limit the depth of quantum algorithms.
method Fixed State Variational Fast Forwarding (fsVFF) algorithm.
result Simulations of 600 time steps possible, 150x longer than previous methods.
Proposes a multi-fidelity machine learning strategy integrating low-fidelity deterministic and high-fidelity Bayesian models.
problem Addressing the accuracy-efficiency trade-off in machine learning with scarce high-fidelity data.
method Integrates a non-probabilistic regression model for low-fidelity with a Bayesian model for high-fidelity, trained in a staggered scheme.
result Achieves comparable performance in mean and uncertainty estimation with reduced training time and effective mitigation of overfitting.
A new BO framework reduces costs by using low-fidelity data.
problem Optimizing expensive experiments with low-fidelity data.
method Developed a multi-fidelity cost-aware Bayesian optimization framework.
result Significantly outperforms state-of-the-art BO methods.
This paper reviews Gaussian process-based multi-fidelity techniques for different fidelity relationships.
problem Combining accurate and cheap models for complex system design.
method Gaussian process-based multi-fidelity modeling techniques for varying fidelity relationships.
result Comparison of techniques on analytical and aerospace engineering problems.
Paper introduces a bandit-learning method for multifidelity approximations.
problem Efficiently using data of varying fidelities in scientific computation.
method Formulates multifidelity approximation as a modified stochastic bandit problem and proposes AETC algorithm.
result Established optimality of AETC algorithm for multifidelity approximation.
This paper presents a physics-based data-driven method to learn predictive reduced-order models (ROMs) from high-fidelity simulations, and illustrates it in the challenging context of a single-injector combustion process. The method combines the perspectives of model reduction and machine learning. Model reduction brin…
Machine learning combines high- and low-fidelity models for efficient uncertainty quantification and optimization.
problem Efficiently combining high- and low-fidelity models for uncertainty quantification and optimization.
method Machine learning-based multi-fidelity methods for uncertainty quantification and optimization.
result Unified perspective on multi-fidelity priors for optimization.
This paper improves surrogate modeling for noisy data.
problem Uncertainty in high-fidelity models due to noise.
method Comprehensive framework for multi-fidelity surrogate modeling.
result Estimates uncertainty in high-fidelity model predictions.
MAGT generates data efficiently by aligning to manifold structure.
problem Efficiently generating data near a low-dimensional structure embedded in high-dimensional space.
method MAGT is a flow-like generator that learns a one-shot, manifold-aligned transport from a low-dimensional base distribution to the data space, using a fixed Gaussian smoothing level and self-normalized importance sampling.
result MAGT samples in a single forward pass, concentrates probability near the learned support, and induces an intrinsic density with respect to the manifold volume measure, enabling principled likelihood evaluation for generated samples.
This paper presents a method to efficiently estimate rare event probabilities using a combination of high and low-fidelity models.
problem Estimating the probability of failure for complex systems using high-fidelity models is expensive and inaccurate for rare events.
method The paper introduces a multi-fidelity surrogate modeling strategy using active learning and subset simulation to merge high and low-fidelity models.
result The method significantly reduces computational cost while maintaining high accuracy in estimating rare event probabilities.
The paper compares multi-fidelity methods for Gaussian process surrogates in physics.
problem Limited availability of data due to expensive simulations.
method Extending non-linear autoregressive methods to multi-fidelity models and incorporating delay terms.
result Multi-fidelity methods generally have smaller prediction error for the same computational cost.