conftrace_

bandit optimization

32 papers

Explore in graph

Co-occurring keywords

gaussian process (1200) regret bound (1926) bayesian optimization (624) reproducing kernel hilbert space (334) multi-armed bandit (1098) kernel methods (1097) upper confidence bound (197) convex optimization (1321) information gain (93) sublinear regret (88)

Papers

Quantum Non-Linear Bandit Optimization AAAI 2026
Tight Bounds for Volumetric Spanners and Applications NIPS 2023
Reward Learning as Doubly Nonparametric Bandits: Optimal Design and Scaling Laws AISTATS 2023
Lifelong bandit optimization: no prior and no regret UAI 2023
A Bayesian approach for bandit online optimization with switching cost UAI 2023
Regret Bounds for Expected Improvement Algorithms in Gaussian Process Bandit Optimization AISTATS 2022
Gaussian Process Bandit Optimization with Few Batches AISTATS 2022
Weighted Gaussian Process Bandits for Non-stationary Environments AISTATS 2022
A Lyapunov-Based Methodology for Constrained Optimization with Bandit Feedback AAAI 2022
Optimal Gradient-based Algorithms for Non-concave Bandit Optimization NIPS 2021
No-Regret Algorithms for Private Gaussian Process Bandit Optimization AISTATS 2021
Lenient Regret and Good-Action Identification in Gaussian Process Bandits ICML 2021
On Lower Bounds for Standard and Robust Gaussian Process Bandit Optimization ICML 2021
Reinforcement Learning for Constrained Markov Decision Processes AISTATS 2021
Projection-Free Bandit Optimization with Privacy Guarantees AAAI 2021
Smooth Bandit Optimization: Generalization to Holder Space AISTATS 2021
Optimal Order Simple Regret for Gaussian Process Bandits NIPS 2021
Corruption-Tolerant Gaussian Process Bandit Optimization AISTATS 2020
Bandit optimisation of functions in the Matérn kernel RKHS AISTATS 2020
Regret Bound for Safe Gaussian Process Bandit Optimization L4DC 2020
Gaussian Process Bandit Optimization of the Thermodynamic Variational Objective NIPS 2020
Non-Stochastic Control with Bandit Feedback NIPS 2020
Efficient Bandit Combinatorial Optimization Algorithm with Zero-suppressed Binary Decision Diagrams AISTATS 2018
Adaptive Sampling Probabilities for Non-Smooth Optimization ICML 2017
Fast Rates for Bandit Optimization with Upper-Confidence Frank-Wolfe NIPS 2017