Fetching the paper…
Reading the bibliography…
In this paper, we consider the problem of sequentially optimizing a black-box function $f$ based on noisy samples and bandit feedback.
Theory of reproducing kernels
N. Aronszajn · 1950
Earlier work this paper cites.
On the convergence rate of generalized Fourier expansions
K. O. Mead and L. M. Delves · 1973
Earlier work this paper cites.
Gambling in a rigged casino: The adversarial multi-armed bandit problem
P. Auer, N. Cesa-Bianchi, Y. Freund, and R. E. Schapire · 1998
Earlier work this paper cites.
Nearly tight bounds for the continuum-armed bandit problem
R. D. Kleinberg · 2004
Earlier work this paper cites.
Elements of Information Theory
T. M. Cover and J. A. Thomas · 2006
Earlier work this paper cites.
Gaussian processes for machine learning
C. E. Rasmussen · 2006
Earlier work this paper cites.
Multi-armed bandits in metric spaces
R. Kleinberg, A. Slivkins, and E. Upfal · 2008
Earlier work this paper cites.
Pure exploration in multi-armed bandits problems
S. Bubeck, R. Munos, and G. Stoltz · 2009
Earlier work this paper cites.
Best arm identification in multi-armed bandits
J.-Y. Audibert and S. Bubeck · 2010
Cited alongside, same era.
Regret bounds for Gaussian process bandit problems
S. Grünewälder, J.-Y. Audibert, M. Opper, and J. Shawe-Taylor · 2010
Cited alongside, same era.
Gaussian process optimization in the bandit setting: No regret and experimental design
N. Srinivas, A. Krause, S. M. Kakade, and M. Seeger · 2010
Cited alongside, same era.
Convergence rates of efficient global optimization algorithms
A. D. Bull · 2011
Cited alongside, same era.
Regret Analysis of Stochastic and Nonstochastic Multi-Armed Bandit Problems
S. Bubeck and N. Cesa-Bianchi · 2012
Cited alongside, same era.
Exponential regret bounds for Gaussian process bandits with deterministic observations
N. de Freitas, M. Zoghi, and A. J. Smola · 2012
Early stopping and non-parametric regression: An optimal data-dependent stopping rule
G. Raskutti, M. J. Wainwright, and B. Yu · 2014
Later among the works it cites.
Theoretical analysis of Bayesian optimisation with unknown Gaussian process hyper-parameters
Z. Wang and N. de Freitas · 2014
Later among the works it cites.
Bayesian optimization with exponential convergence
K. Kawaguchi, L. P. Kaelbling, and T. Lozano-Pérez · 2015
Later among the works it cites.
Truncated variance reduction: A unified approach to Bayesian optimization and level-set estimation
I. Bogunovic, J. Scarlett, A. Krause, and V. Cevher · 2016
Later among the works it cites.
An information-theoretic analysis of Thompson sampling
D. Russo and B. Van Roy · 2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Minimax-optimal rates for sparse additive models over kernel classes via convex programming
G. Raskutti, M. J. Wainwright, and B. Yu · 2012
Cited alongside, same era.
Machine Learning and Knowledge Discovery in Databases , chapter Parallel Gaussian Process Optimization with Upper Confidence Bound and Pure Exploration, pages 225–240
E. Contal, D. Buffoni, A. Robicquet, and N. Vayatis · 2013
Cited alongside, same era.
B. Shahriari, K. Swersky, Z. Wang, R. P. Adams, and N. de Freitas · 2016
Later among the works it cites.
Optimization as estimation with Gaussian processes in bandit settings
Z. Wang, B. Zhou, and S. Jegelka · 2016
Later among the works it cites.