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.
Improves Bayesian optimization for multi-fidelity functions.
problem Inefficient estimation of black-box functions due to ignored or oversimplified correlations between fidelities.
method Proposes DNN-MFBO using deep neural networks to capture complex relationships between fidelities.
result Shows significant improvement in optimization performance on synthetic and real-world datasets.
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.
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.
Proposes efficient multi-fidelity Bayesian optimization for deep neural network hyperparameter tuning.
problem Time-consuming validation error evaluation for hyperparameter tuning in deep neural networks.
method Introduces trace-aware knowledge-gradient acquisition function and a provably convergent optimization method.
result Outperforms state-of-the-art alternatives for hyperparameter tuning of deep neural networks.
Enhances inverse design optimization with machine learning and reduced fidelity simulations.
problem Limited compute resources in inverse design optimization.
method Synergy of multi-fidelity simulations, machine learning, and search space reduction.
result Significant computational resource savings and improved optimization performance.
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.
New method optimizes aircraft design with reduced computation using multi-fidelity models.
problem Efficiently solve complex aircraft design problems with limited computational resources.
method Proposes novel multi-fidelity selection strategies that consider both objective and constraint information.
result Shows 86% to 200% more constraint compliant solutions with a limited budget. Paper calculates optimal use of cheap and expensive data for model accuracy.
problem Optimal design of experiments for variable fidelity data.
method Minimax error analysis for Gaussian process regression.
result Variable fidelity data can improve model accuracy within budget constraints.
BMBO-DARN optimizes expensive functions with varying fidelities.
problem Optimizing expensive, multi-fidelity functions efficiently.
method Batch Multi-fidelity Bayesian Optimization with Deep Auto-Regressive Networks.
result BMBO-DARN improves surrogate learning and optimization performance.
New method tackles constrained optimization in multi-fidelity Bayesian optimization.
problem Efficiently identifying feasible regions in constrained optimization problems.
method Proposes CMFBO method with novel acquisition functions.
result Demonstrates effectiveness on synthetic problems and real-world ICF and joint design problems.
Optimizes plasmonic mirror filters using multi-fidelity Gaussian processes.
problem Optimizing transmission properties of plasmonic mirror color filters.
method Combining numerical methods with FDTD simulations and multi-fidelity Gaussian processes.
result Demonstrates improved optimization performance with multi-fidelity Gaussian processes.
A new algorithm optimizes complex systems by intelligently using different levels of information.
problem Optimizing systems with multiple, cost-dependent information sources.
method Proposes MF-MI-Greedy, a principled algorithm using additive Gaussian processes and cost-sensitive mutual information gain.
result MF-MI-Greedy achieves low regret and demonstrates strong empirical performance.
Optimal multi-fidelity best-arm identification reduces cost with better accuracy.
problem Finding the best arm with highest mean reward at minimum cost.
method Gradient-based approach with asymptotically optimal cost complexity.
result Asymptotically optimal cost complexity compared to existing methods.
Tree-search algorithm optimizes noisy black-box functions with multi-fidelity queries.
problem Optimizing noisy functions with expensive evaluations and low-cost approximations.
method Tree-like hierarchical partitions and multi-fidelity bandit tree-search algorithm.
result Simple regret bounds for the proposed algorithm.
A new method for faster expensive function evaluations using multi-fidelity Bayesian optimization.
problem Expensive function evaluations in Bayesian optimization.
method Max-value entropy search (MES) for multi-fidelity Bayesian optimization (MFBO), with parallelization.
result Significant reduction in computational complexity for multi-fidelity Bayesian optimization.
Proposes a method to improve surrogate modeling and design optimization using latent variables.
problem Improving efficiency in multi-fidelity adaptive sampling without hierarchical assumptions.
method A framework using a latent variable Gaussian process to capture correlations between different fidelity models and optimize adaptive sampling.
result Demonstrates superior performance in convergence rate and robustness compared to existing 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.
A method to improve surrogate model accuracy using multiple fidelity models.
problem Efficiently combining models of varying accuracy and computational cost.
method Multifidelity Gaussian process models and leave-one-out cross-validation.
result Reduced LOO-CV error at the highest fidelity through adaptive learning.
Paper proposes S-BOMM for optimization with multiple models, focusing on consistency.
problem Optimization challenges with multiple models of varying fidelity and accuracy.
method Set-Based Optimization with Multiple Models (S-BOMM) focusing on model consistency.
result Empirical results show S-BOMM's effectiveness in identifying good solutions across multiple models.
Develops a framework for cost-efficient Bayesian optimization with constraints.
problem Optimizing designs with minimal cost in constrained search spaces.
method Constrained multi-fidelity Bayesian optimization (CMFBO) with automatic stopping criterion.
result Minimizes overall sampling costs while ensuring feasibility.
BOAH optimizes expensive hyperparameter searches quickly.
problem Expensive hyperparameter optimization for neural networks.
method Multi-fidelity Bayesian optimization and HyperBand integration.
result Efficient optimization of complex design spaces.
SMAC optimizes wildfire suppression policies quickly and effectively.
problem Managing conflicts among stakeholders in wildfire suppression policies.
method Applied SMAC to optimize MDP policies in a high-fidelity simulation environment.
result SMAC finds good policies that stakeholders can understand and validate.
Investigates long-term performance of multi-fidelity Bayesian optimization.
problem Potential long-term under-performance of multi-fidelity Bayesian optimization.
method Simple benchmark study to investigate long-term performance.
result Under-performance of multi-fidelity Bayesian optimization in certain scenarios.
New method improves multi-fidelity Bayesian optimization by accounting for local correlations and varying noise.
problem Existing multi-fidelity Bayesian optimization methods assume global correlation and constant noise, which limits performance.
method Proposes an MF emulation method that learns noise models for each data source and leverages locally correlated LF sources.
result Improves performance of multi-fidelity Bayesian optimization by accounting for local correlations and varying noise.
Improved quantum control fidelity for noisy systems using differential evolution.
problem Stagnation in non-convex optimization for noisy quantum dynamics.
method Employed differential evolution algorithms to optimize quantum control parameters.
result Achieved superior fidelity and scalability in quantum phase estimation and gate design.
A cost-efficient method for hyperparameter tuning using multi-fidelity Bayesian optimization.
problem Expensive hyperparameter tuning with limited knowledge transfer methods.
method Amortized Auto-Tuning (AT2) framework for multi-task, multi-fidelity Bayesian optimization.
result AT2 leads to the best hyperparameter recommendation and is more cost-efficient.
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.
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.
Develops Co_SVR for multi-fidelity modeling combining HF and LF models.
problem Combining high-fidelity and low-fidelity models for efficient design.
method Support vector regression with kernel function and heuristic algorithm.
result Co_SVR outperforms other multi-fidelity surrogate models in prediction accuracy.
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.
The study optimizes wind farm yaw control using Gaussian process regression and high-fidelity simulations.
problem Improving yaw control inputs for maximum power production in wind farms.
method Gaussian process regression and modifier adaptation scheme based on high-fidelity simulation data.
result Both modifier adaptation and Bayesian optimization improve power production with smaller yaw misalignments.
Bayesian optimization speeds up bioprocess development across scales.
problem Costly and complex bioprocess development across scales and biocatalyst selection.
method Multi-fidelity batch Bayesian optimization framework integrating Gaussian Processes and mixed-variable optimization.
result Reduction in experimental costs and increased yield in bioprocess optimization.
Develops deep Gaussian processes for combining cheap and expensive data.
problem Combining cheap, potentially biased data with expensive true data for reliable models.
method Uses variational inference in a deep Gaussian process with layers as fidelities.
result Improves uncertainty quantification and decision making in multi-fidelity setups.
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.
Scout-Nd optimizes parameters of stochastic simulators efficiently.
problem Optimizing parameters of stochastic, computationally expensive simulators.
method Scout-Nd algorithm, reducing gradient noise, multi-fidelity schemes.
result Demonstrates better performance compared to existing methods.
A method for faster neural architecture search using low-fidelity training.
problem Time-consuming evaluations in neural architecture search.
method Bayesian multi-fidelity method with knowledge distillation.
result Training for a few epochs with knowledge distillation leads to better architecture selection.
Two multifidelity trust-region methods use low-fidelity models for efficient optimization.
problem Efficiently solving complex optimization problems with limited data.
method Sketched Trust-Region (STR) and SVD Trust-Region (SVDTR) methods using low-fidelity models.
result Potential gain in efficiency demonstrated through numerical examples.
Proposes new measures and methods for evaluating and improving explanations of machine learning models.
problem Evaluating and improving explanations of complex machine learning models.
method Introduces two new measures: infidelity and sensitivity, and proposes methods to optimize these measures.
result Optimal explanations for infidelity involve a novel combination of two methods, and can outperform existing explanations.
This work improves surrogate models using low-fidelity data to enhance accuracy and efficiency.
problem Limited training data makes high-fidelity models unreliable.
method Uses low-fidelity data to augment input space and condition high-fidelity models.
result Increased predictive accuracy and reduced computational cost compared to existing methods.
Conditional DGP learns effective kernels from low-fidelity data.
problem Learning effective kernels for multi-fidelity regression.
method Conditional DGP with moment matching for implicit kernel approximation.
result Effective kernels are learned from lower-fidelity data, improving multi-fidelity regression.
This work improves adaptive sampling for multi-fidelity Gaussian processes by considering cost and uncertainty.
problem Adaptive sampling for multi-fidelity Gaussian processes is computationally demanding and complex.
method The authors extend the design of experiment framework by partitioning prediction uncertainty based on fidelity level and cost, and utilize the Believer concept.
result The proposed framework effectively reduces predictive uncertainty in multi-fidelity Gaussian processes.
BOCA optimizes expensive functions using a spectrum of approximations.
problem Optimizing expensive functions with a continuous spectrum of approximations.
method Develops BOCA, a Bayesian optimization method for multi-fidelity problems with a continuous approximation spectrum.
result BOCA achieves better regret than methods ignoring approximations.
Two approaches reduce computational costs for Gaussian process regression with large datasets.
problem High computational costs in Gaussian process regression for large datasets.
method Nyström approximation and intelligent usage of low-fidelity function evaluations.
result Proposed approaches significantly reduce computational burden for Gaussian process regression.
Develops a method to optimize expensive functions using cheap approximations.
problem Optimizing expensive functions with limited evaluations.
method Multi-fidelity Gaussian Process Bandit Optimisation (MF-GP-UCB)
result MF-GP-UCB outperforms naive strategies and other multi-fidelity methods.
Certified algorithms optimize functions with varying costs, providing error bounds.
problem Optimizing functions with varying evaluation costs and error bounds.
method Formalized as a min-max game, proposed certified MFDOO algorithm with cost complexity bound.
result Proposed certified MFDOO algorithm has near-optimal cost complexity for Lipschitz functions.
New models for bandit problems with fidelity rewards are introduced and analyzed.
problem Fidelity rewards in bandit problems to incentivize loyalty.
method Two models (loyalty-points and subscription) for fidelity rewards; stochastic and adversarial settings considered.
result Sublinear regret bounds for some models, worst case lower bounds for others.
New method for reliability analysis using multi-fidelity models.
problem Reliability analysis of complex systems with high computational costs.
method Adaptive Multi-fidelity Gaussian Process for Reliability Analysis (AMGPRA) with collective learning function (CLF).
result AMGPRA achieves similar or higher accuracy with reduced computational costs compared to state-of-the-art methods.