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.
A new method uses multifidelity Gaussian process regression to solve nonlinear PDEs.
problem Efficiently solving nonlinear PDEs using kernel methods.
method Proposes a kernel learning approach based on cokriging for multifidelity simulations.
result Demonstrates improved performance on the Burgers' equation.
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.
New quantum kernels avoid overfitting by combining local and global components.
problem Exponential concentration in quantum kernels leads to overfitting.
method Local-global quantum kernels combining small subsystem and full-system measurements.
result Demonstrated benign overfitting in local-global quantum kernels.
Computational simulations with different fidelity have been widely used in engineering design. A high-fidelity (HF) model is generally more accurate but also more time-consuming than an low-fidelity (LF) model. To take advantages of both HF and LF models, multi-fidelity surrogate models that aim to integrate informatio…
Unified framework combines trace-induced quantum kernels for improved machine learning models.
problem Improving performance of quantum machine learning models using trace-induced kernels.
method Developed a unified framework combining various trace-induced quantum kernels, including global fidelity and local projected kernels, as Lego kernels.
result Local projected kernels can achieve comparable performance to global fidelity kernels with fewer quantum resources.
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.
Bayesian optimization is popular for optimizing time-consuming black-box objectives. Nonetheless, for hyperparameter tuning in deep neural networks, the time required to evaluate the validation error for even a few hyperparameter settings remains a bottleneck. Multi-fidelity optimization promises relief using cheaper p…
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.
LMGPs enable efficient, accurate data fusion across multiple data sources.
problem Data fusion across multi-fidelity data sources in engineering design.
method Latent-map Gaussian processes (LMGPs) for efficient and accurate data fusion.
result LMGPs provide increased accuracy, reduced costs, and flexibility to fuse any number of data sources.
Quantum kernels show no advantage in stock return prediction, but differ in stability metrics.
problem Determining if quantum kernels improve stock return prediction.
method Controlled horse race on Chinese A-share market with identical training subsamples and tuning budgets.
result Quantum kernels do not outperform classical RBF controls in cross-sectional stock return prediction.
New scalable GP approximation using Fourier series decomposition.
problem Scalability and accuracy in Gaussian process approximations.
method Harmonic kernel decomposition (HKD) to decompose kernels orthogonally.
result Significantly outperforms standard variational methods in scalability and accuracy.
Deep Gaussian Processes model functions on DAGs with partially observed data.
problem Reconstructing and inferring from partially observed functions on DAGs with noisy measurements.
method Place priors over functions on DAGs, theoretically study prior-collapse behavior, and offer a structured variational approximation.
result Almost-sure lower bounds on the preservation of input distinctions and interpretability of simulator hierarchies.
Enhances supervised learning speed with KT algorithm.
problem Speed up supervised learning tasks with minimal loss.
method Generalizes kernel thinning to supervised learning, combining NW and KRR with KT.
result KT-based estimators offer superior computational and statistical efficiency.
CTT compresses samples to test distributions near-linearly, outperforming existing methods.
problem Efficiently testing distributions with high power and near-linear runtime.
method Sample compression followed by permutation testing.
result CTT achieves near-linear runtime while maintaining high statistical power.
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.
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 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.
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.
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.
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.
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.
A fast method learns plasma collision kernels from simulations, improving kinetic models.
problem Improving kinetic models for plasma dynamics beyond the weakly coupled regime.
method Data-driven collisional operator, fast spectral separation method.
result Accurately captures plasma dynamics in moderately coupled regime.
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.
FNO model predicts GCS pressure fields with 81% less data, even with limited high-fidelity data.
problem Accurate prediction of complex physical behaviors in large-scale 3D geological carbon storage problems with limited data.
method Multi-fidelity Fourier Neural Operator (FNO) for efficient training with multi-fidelity datasets.
result Multi-fidelity FNO model predicts pressure fields with reasonable accuracy even with limited high-fidelity data.
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.
New method finds failures in high-fidelity simulators with fewer steps.
problem Finding failures in high-fidelity simulators is expensive and impractical.
method Adaptive stress testing with backward algorithm adaptation from low-fidelity to high-fidelity.
result Significantly fewer high-fidelity simulation steps needed to find failures.
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.
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.
Proposes a method to estimate conditional quantiles using both high-fidelity and low-fidelity data.
problem Difficulty in estimating conditional quantiles with scarce high-fidelity data.
method Two-stage, model-agnostic method using local quantile link and level function estimation.
result The method yields more accurate quantile estimates and tighter prediction intervals.
Engineering problems often involve data sources of variable fidelity with different costs of obtaining an observation. In particular, one can use both a cheap low fidelity function (e.g. a computational experiment with a CFD code) and an expensive high fidelity function (e.g. a wind tunnel experiment) to generate a dat…
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.
New neural network training method uses bi-fidelity data to reduce errors.
problem Training neural networks with limited high-fidelity data.
method Bi-fidelity ℓ1-regularization strategies. result Bi-fidelity ℓ1-regularization reduces errors by one order of magnitude. RMFGP combines multi-fidelity models for efficient uncertainty quantification.
problem Efficiently infer quantities of interest with limited high-fidelity data.
method Rotated multi-fidelity Gaussian process with dimension reduction and Bayesian active learning.
result RMFGP model improves accuracy and efficiency in high-dimensional problems.
Paper explores using bi-fidelity data to train neural networks for uncertainty quantification.
problem Training neural networks requires large amounts of data, which may not be available for computationally expensive systems.
method Transfer learning techniques using high- and low-fidelity models, including standard transfer and bi-fidelity weighted learning.
result Bi-fidelity transfer learning improves accuracy over standard training approaches.
We develop a novel multi-fidelity framework that goes far beyond the classical AR(1) Co-kriging scheme of Kennedy and O'Hagan (2000). Our method can handle general discontinuous cross-correlations among systems with different levels of fidelity. A combination of multi-fidelity Gaussian Processes (AR(1) Co-kriging) and …
Scalable Gaussian Process Operator tackles high-dimensional PDEs.
problem Scaling Gaussian Process Operators to high-dimensional, data-intensive regimes.
method Nearest-neighbor-based local kernel approximations, sparse kernel approximation, structured Kronecker factorizations, operator-aware kernel structures, task-informed mean functions.
result Consistently achieves high accuracy across varying discretization scales.
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. 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 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.
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.
This work introduces a new metric to assess the fidelity of surrogate models to the underlying data-generating signal.
problem The limitations of fidelity-based explanations in explainable AI.
method Introduces the linearity score λ(f) to quantify the extent of a regression network's linear decodability. result High-fidelity surrogates can underperform compared to simpler models and even linear baselines trained directly on the data.
In this paper, we present a new nonintrusive reduced basis method when a cheap low-fidelity model and expensive high-fidelity model are available. The method relies on proper orthogonal decomposition (POD) to generate the high-fidelity reduced basis and a shallow multilayer perceptron to learn the high-fidelity reduced…
We present a method for metric optimization in the Large Deformation Diffeomorphic Metric Mapping (LDDMM) framework, by treating the induced Riemannian metric on the space of diffeomorphisms as a kernel in a machine learning context. For simplicity, we choose the kernel Fischer Linear Discriminant Analysis (KLDA) as th…
Bayesian approach detects changepoints with cost-sensitive data fidelity.
problem Detecting abrupt shifts in time series data with limited resources.
method Bayesian approach with active, cost-sensitive data fidelity switching.
result Information-based approach reduces total cost while maintaining accuracy.
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…
New method uses low-fidelity simulations to efficiently infer parameters of high-fidelity models.
problem Challenges in inferring parameters of computationally expensive high-fidelity models.
method Multifidelity simulation-based inference using transfer learning and adaptive selection of high-fidelity parameters.
result Significant reduction in the number of high-fidelity simulations required for inference.