Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting
From MaRDI portal
Publication:5271985
Cited in
(86)- Likelihood-free inference with deep Gaussian processes
- pBO-2GP-3B: a batch parallel known/unknown constrained Bayesian optimization with feasibility classification and its applications in computational fluid dynamics
- Learning-based symbolic abstractions for nonlinear control systems
- \texttt{CAMERA}: a method for cost-aware, adaptive, multifidelity, efficient reliability analysis
- Hyperband: a novel bandit-based approach to hyperparameter optimization
- Efficient constitutive parameter identification through optimisation-based techniques: a comparative analysis and novel composite Bayesian optimisation strategy
- A taxonomy of weight learning methods for statistical relational learning
- On the equivalence of probability spaces
- Safe trajectory tracking for underactuated vehicles with partially unknown dynamics
- An experimental methodology for response surface optimization methods
- Deterministic error bounds for kernel-based learning techniques under bounded noise
- FlexiBO: A Decoupled Cost-Aware Multi-Objective Optimization Approach for Deep Neural Networks
- Analyzing stochastic computer models: a review with opportunities
- An asynchronous parallel high-throughput model calibration framework for crystal plasticity finite element constitutive models
- A tutorial on Gaussian process regression: modelling, exploring, and exploiting functions
- Stable Gaussian process based tracking control of Euler-Lagrange systems
- Modeling and Active Learning for Experiments with Quantitative-Sequence Factors
- Learning to optimize via information-directed sampling
- Sequential design for ranking response surfaces
- Learning-based iterative modular adaptive control for nonlinear systems
- Knowledge-based modeling of simulation behavior for Bayesian optimization
- Streaming kernel regression with provably adaptive mean, variance, and regularization
- Residual Gaussian process: a tractable nonparametric Bayesian emulator for multi-fidelity simulations
- Output Space Entropy Search Framework for Multi-Objective Bayesian Optimization
- Kernel-based identification with frequency domain side-information
- Navigating the protein fitness landscape with Gaussian processes
- scientific article; zbMATH DE number 7306857 (Why is no real title available?)
- An active learning approach for improving the performance of equilibrium based chemical simulations
- On Bayesian index policies for sequential resource allocation
- A supermartingale approach to Gaussian process based sequential design of experiments
- Warped Gaussian processes and derivative-based sequential designs for functions with heterogeneous variations
- Probabilistic line searches for stochastic optimization
- Deterministic global optimization with Gaussian processes embedded
- Bayesian optimization with safety constraints: safe and automatic parameter tuning in robotics
- Online learning‐based model predictive control with Gaussian process models and stability guarantees
- Uncertainty quantification for sparse spectral variational approximations in Gaussian process regression
- No-regret Bayesian optimization with unknown hyperparameters
- A characterization of amenable groups by Besicovitch pseudodistances
- Adaptive-treed bandits
- Modelling human active search in optimizing black-box functions
- Learning Enabled Constrained Black-Box Optimization
- Bayesian optimization with partially specified queries
- System design of stochastic models using robustness of temporal properties
- Contextual bandits with continuous actions: smoothing, zooming, and adapting
- Automated Reinforcement Learning (AutoRL): A Survey and Open Problems
- Quantifying uncertainty with ensembles of surrogates for blackbox optimization
- Finite-time analysis for the knowledge-gradient policy
- Personalized optimization with user's feedback
- A Bayesian optimization approach to find Nash equilibria
- Adaptive confidence bound based Bayesian optimization via potentially optimal Lipschitz conditions
- A model‐and data‐driven predictive control approach for tracking of stochastic nonlinear systems using Gaussian processes
- Moderate deviations inequalities for Gaussian process regression
- Efficient hybrid Bayesian optimization algorithm with adaptive expected improvement acquisition function
- Nonlinear learning‐based model predictive control supporting state and input dependent model uncertainty estimates
- scientific article; zbMATH DE number 7306856 (Why is no real title available?)
- Strategy synthesis for partially-known switched stochastic systems
- scientific article; zbMATH DE number 7370521 (Why is no real title available?)
- MSO: a framework for bound-constrained black-box global optimization algorithms
- Constrained Bayesian Optimization with Lower Confidence Bound
- A derivative-free optimization algorithm for the efficient minimization of functions obtained via statistical averaging
- Simple Bayesian algorithms for best-arm identification
- Evaluating Gaussian process metamodels and sequential designs for noisy level set estimation
- Multi-fidelity Bayesian optimization to solve the inverse Stefan problem
- TREGO: a trust-region framework for efficient global optimization
- Technical note -- A note on the equivalence of upper confidence bounds and Gittins indices for patient agents
- Using simulation to improve sample-efficiency of Bayesian optimization for bipedal robots
- Learning to optimize via posterior sampling
- Bayesian policy reuse
- scientific article; zbMATH DE number 7626750 (Why is no real title available?)
- Constrained, global optimization of unknown functions with Lipschitz continuous gradients
- Using the knowledge gradient acquisition function in Bayesian optimization when searching for robust solutions
- Query efficient posterior estimation in scientific experiments via Bayesian active learning
- \textsc{GoSafeOpt}: scalable safe exploration for global optimization of dynamical systems
- Non-parametric probabilistic load flow using Gaussian process learning
- Noisy kriging-based optimization methods: a unified implementation within the DiceOptim package
- Regularized identification with internal positivity side-information
- Tracking control of uncertain nonlinear systems via adaptive Gaussian process prediction and real-time optimisation
- A composite Bayesian optimisation framework for material and structural design
- On the use of Wasserstein distance in the distributional analysis of human decision making under uncertainty
- Gaussian processes for computer experiments
- Truthful mechanisms with implicit payment computation
- Lower bounds on the noiseless worst-case complexity of efficient global optimization
- Gaussian process bandits with adaptive discretization
- Multi-fidelity cost-aware Bayesian optimization
- Inverse Bayesian optimization: learning human acquisition functions in an exploration vs exploitation search task
- High-probability stable Gaussian process-supported model predictive control for Lur'e systems
This page was built for publication: Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5271985)
