Gaussian process models simplify neural network behavior for easier understanding.
problem Understanding and predicting the behavior of deep learning systems.
method Constructing surrogate models using Gaussian processes from finite neural networks.
result Surrogate models capture phenomena like spectral bias and predict generalization well.
Deep Gaussian Processes improve likelihood-free inference for complex distributions.
problem Limited flexibility of Bayesian Optimization with GPs for multimodal distributions.
method Proposes Deep Gaussian Processes (DGPs) as a surrogate model for likelihood-free inference.
result DGPs outperform GPs on multimodal distributions while maintaining comparable performance on unimodal cases.
Bayesian surrogate models reduce uncertainty in high-dimensional design optimisation problems.
problem Uncertainty in high-dimensional inputs for complex computational models.
method Variational Bayesian inference for constructing statistical surrogates with Gaussian process priors and KL divergence for approximation.
result The RDVGP surrogate provides accurate and versatile approximations for robust structural optimisation.
BITS for GAPS uses Bayesian methods to improve surrogate model accuracy in complex systems.
problem Improving surrogate model accuracy in complex physical systems with uncertainty.
method Bayesian Information-Theoretic Sampling for hierarchical Gaussian Process Surrogates.
result Increased expected information gain and predictive accuracy by targeting high-uncertainty regions.
DeepICMGP surrogate models multiple outputs efficiently.
problem Challenges in modeling dependencies between multiple outputs using traditional multi-output GPs.
method Introduces hierarchical coregionalization structures across layers in DGPs.
result Demonstrates competitive performance and active learning strategies.
New scalable methods for log determinant computations speed up Gaussian process kernel learning.
problem Prohibitive computational cost of log determinant calculations for Gaussian process kernel learning.
method Stochastic approximations based on Chebyshev, Lanczos, and surrogate models.
result Lanczos method is superior for kernel learning, and surrogate models are highly efficient and accurate.
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.
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.
Adaptive Gaussian process models for efficient Bayesian inference.
problem Expensive forward models in Bayesian inference.
method Fully Bayesian approach with adaptive training designs maximizing expected improvement.
result Adaptive designs lead to more accurate posterior estimation at lower cost.
Adapts Gaussian process surrogate evaluation with conformal prediction for better coverage guarantees.
problem Uncertainty quantification and model specification issues in Gaussian process surrogate models.
method Adaptive cross-conformal prediction intervals using posterior standard deviation weighting.
result Conformal prediction intervals provide significant correlation with surrogate model error and frequentist coverage guarantees.
Bayesian framework predicts aerodynamic uncertainty from sparse measurements.
problem Calibrating aerodynamic models with sparse and uncertain measurements.
method Bayesian latent Gaussian process for surrogate model calibration.
result Calibrated surrogate model accurately predicts aerodynamic uncertainty.
Generative Bayesian Computation improves surrogates for expensive simulations.
problem Limitations of Gaussian process surrogates in handling complex, non-stationary data.
method Generative Bayesian Computation via Implicit Quantile Networks (IQNs).
result Generative Bayesian Computation outperforms traditional Gaussian process methods across various benchmarks.
Gaussian process regression helps approximate Bayesian inverse problems efficiently.
problem Computational intractability of Bayesian posterior distributions in inverse problems.
method Gaussian process regression to build a surrogate model for the likelihood.
result Error between true and approximate posterior can be bounded by weighted L2-norm error between true and approximate likelihood. Optimizes functions on manifolds using Gaussian processes and graph models.
problem Optimizing functions on unknown manifolds with limited data.
method Graph Gaussian process surrogate model for sequential optimization.
result Established regret bounds for the proposed algorithm.
Enhanced Gaussian process models accelerate optimization and posterior approximation.
problem Improving the accuracy and speed of Gaussian process models for optimization and inference.
method Introduces a random exploration step to classical GP-UCB algorithms, facilitating faster convergence.
result New algorithms achieve nearly optimal convergence rates and provide bounds for Hellinger distance.
The paper proposes a method to model non-smooth functions using clustering, classification, and Gaussian process modeling.
problem Modeling discontinuities and non-smoothness in expensive computational models.
method Three-stage approach combining clustering, classification, and Gaussian process modeling.
result The approach successfully models discontinuities and non-smoothness in various functions.
Develops active learning for Jump Gaussian Process models.
problem Optimizing experimental designs and steering data acquisition in complex systems.
method Active learning of piecewise Jump Gaussian Process (Jump GP) models, accounting for model bias.
result Demonstrates the importance of accounting for model bias in Jump GP models.
Improves Bayesian optimization by focusing on well-behaved structure in objectives.
problem Bayesian optimization struggles with real-world objectives that are often poorly behaved.
method Proposes surrogate models that focus on well-behaved structure, absorbing challenging structures as irreducible uncertainty.
result Surrogate models with appropriate noise distributions improve reliability and performance in challenging objective functions.
Bayesian Gaussian process models handle uncertain data locations in PDE approximations.
problem Handling uncertainties in data locations for PDE approximations.
method Bayesian inference of uncertain inputs integrated into Gaussian process predictions.
result Substantial reduction in predictive uncertainties achieved through Bayesian inference.
Deep Jump Gaussian Processes model high-dimensional piecewise functions.
problem Modeling high-dimensional piecewise continuous functions with limited accuracy.
method Integrates region-specific locally linear projections with Jump Gaussian Processes (JGP) to capture local low-dimensional subspace structures.
result DJGP achieves superior predictive accuracy and more reliable uncertainty quantification compared to existing methods.
LOL-GP model improves surrogate modeling of expensive simulators.
problem Costly computer simulations for complex systems.
method Local transfer learning Gaussian process.
result Improved surrogate performance over existing methods.
Bayesian deep learning improves building energy simulation accuracy.
problem Uncertainty in surrogate models for building energy performance.
method Training dropout neural networks and stochastic variational Gaussian Processes.
result Surrogate models reduce errors by up to 30% with uncertainty-aware sampling.
Parallel Gaussian process surrogate for noisy likelihood evaluations in Bayesian inference.
problem Bayesian inference with limited noisy log-likelihood evaluations from complex models.
method Hierarchical Gaussian process surrogate model for log-likelihood, batch-sequential design strategies.
result Robust, highly parallelizable, and sample-efficient method.
Bayesian optimization for binomial outputs with multifidelity.
problem Optimizing functions with binomial outputs that don't fit Gaussian process assumptions.
method General Gaussian process model for binomial data, Expected Improvement acquisition function, heuristic sample selection.
result Improves optimization performance for binomial target functions.
GPdoemd optimizes experiments for model discrimination using Gaussian processes.
problem Discriminating between competing models when data is limited.
method Developed a new design criterion and Gaussian process surrogate method for black-box models.
result Demonstrated improved model discrimination using Gaussian process surrogates.
This paper proposes an ensemble of Gaussian processes for Bayesian optimization.
problem Optimizing expensive black-box functions with limited evaluations.
method An ensemble of Gaussian processes (EGP) for adaptive surrogate modeling, combined with Thompson sampling (TS) for function sampling.
result The proposed EGP-TS method achieves better optimization results than single-GP approaches.
Efficiently trains deep Gaussian processes with sparse approximations.
problem High computational complexity in training and inference for DGP models.
method Tensor Markov Gaussian Processes (TMGP) and hierarchical expansion to create DTMGP model.
result DTMGP model achieves superior computational efficiency compared to existing DGP models.
A new error bound improves safety in Bayesian optimization.
problem Ensuring safety in Bayesian optimization with probabilistic models.
method Introducing a novel error bound using Wiener kernel regression for Gaussian processes and noise.
result The new error bound provides larger safety regions than previous methods.
Bayesian inverse problems solved with Gaussian models for PDEs.
problem Solving inverse problems with limited data for PDEs.
method Constructing PDE-informed Gaussian priors for Bayesian inversion.
result PDE-informed Gaussian priors outperform traditional priors.
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.
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.
This study proposes an efficient surrogate for Darcy flow inverse problems.
problem Efficiently constructing accurate surrogate models for high-dimensional complex inverse problems.
method Sequential Bayesian design strategy to acquire a locally accurate surrogate model focusing on high-probability regions.
result The proposed method accelerates inversion accuracy and computational speed.
Bayesian optimization with Gaussian processes speeds up searches for stationary points.
problem Accelerating searches for stationary points on potential energy surfaces.
method Unified Bayesian optimization view using Gaussian process regression with derivative observations, inverse-distance kernels, and active learning.
result Surrogates can reduce the number of expensive electronic structure evaluations by an order of magnitude.
This research develops efficient surrogate models for predicting crack growth in metal structures.
problem Accurately predicting crack growth in metal structures under uncertainty.
method Employing Gaussian Process (GP) regression models for latent variable modeling to create probabilistic surrogate models.
result Surrogate models successfully encode material and load-related uncertainties in stochastic crack growth processes.
Method quantifies sensitivity of reliability analysis to uncertainty sources.
problem Computational expense in reliability analysis of complex models.
method Gaussian process surrogate model, active learning, sensitivity analysis.
result Reduces main source of error in estimating rare event probabilities.
KrigHedge uses Gaussian processes to approximate option Greeks efficiently.
problem Computing option Greeks in complex models is computationally expensive or inexact.
method Gaussian process surrogates trained on noisy option prices, with analytical differentiation for sensitivities.
result The method provides accurate Delta approximations and quantifies hedging loss.
Improved ABC method using Gaussian processes for more efficient simulations and uncertainty quantification.
problem Efficiently simulate and quantify uncertainty in ABC methods.
method Batch-sequential Bayesian experimental design, numerical method for uncertainty quantification, improved GP modeling assumptions.
result Improved framework for ABC methods that quantifies uncertainty and parallelizes simulations.
This paper improves parameter estimation in cardiac models using Gaussian process-based MH sampling.
problem Uncertainty in estimating patient-specific model parameters from sparse and noisy clinical data.
method Integrates surrogate modeling into Metropolis-Hastings sampling to improve computational efficiency and accuracy.
result Significant gain in computational efficiency without compromising accuracy, and insights into tissue heterogeneity.
We propose a novel method for maximum likelihood-based parameter inference in nonlinear and/or non-Gaussian state space models. The method is an iterative procedure with three steps. At each iteration a particle filter is used to estimate the value of the log-likelihood function at the current parameter iterate. Using …
Bayesian optimization on networks using Gaussian process models.
problem Optimizing expensive black-box functions on network structures.
method Developed Bayesian optimization algorithms with Gaussian process surrogates tailored to network geometry.
result Established regret bounds for smooth objective functions and analyzed practical cases.
Novel framework for efficient Gaussian process models with monotonicity constraints.
problem Improving predictive accuracy and reducing uncertainty in high-dimensional problems with monotonicity constraints.
method Virtual point-based framework using regularized linear randomize-then-optimize (RLRTO) and No U-Turn Sampler (NUTS) for efficient sampling.
result Significant improvements in computational efficiency with the RLRTO method and NUTS enhancements.
Bayesian optimization tackles non-smooth tuning problems.
problem Optimizing black-box functions with non-smoothness and limited samples.
method Proposed a clustered Gaussian process (cGP) model for non-smooth optimization.
result Improvement of up to 90% in performance for repetitive experiments.
Adaptive batching improves Gaussian process surrogates for noisy level set estimation.
problem Learning the level set of noisy simulator responses.
method Developed four novel adaptive batching schemes for Gaussian process metamodels.
result Adaptive batching brings significant computational speed-ups with minimal loss of modeling fidelity.
Improved surrogate model for field-valued QoIs using LF and HF simulations.
problem Accurate and efficient modeling of field-valued quantities under uncertain inputs.
method Bifidelity Karhunen-Loève expansion with active learning.
result Consistent improvements in predictive accuracy and sample efficiency.
AI learns to optimize dog-fighting performance using Bayesian optimization.
problem Optimizing AI decision-making in dynamic, volatile combat environments.
method Developed Gaussian process Bayesian optimization (GPBO) techniques with RS and HRMS to improve surrogate model accuracy.
result HRMS improves surrogate model accuracy, allowing AI to more accurately predict and optimize performance.
Enhances DGP surrogates for efficient active learning.
problem Efficiently learning from expensive simulations with abrupt changes.
method Novel elliptical slice sampling for uncertainty quantification and active learning.
result Smaller training sets lead to effective and computationally tractable models.
New model improves QGP simulation efficiency and accuracy.
problem Limited QGP simulation runs due to high computational cost.
method Additive Multi-Index Gaussian process (AdMIn-GP) model.
result Significantly improved surrogate modeling performance.
Survey of Gaussian process constraints for modeling expensive data.
problem Modeling expensive data with physical constraints.
method Overview of various Gaussian process constraints and their implementation.
result Discussion of computational challenges introduced by constraints.