Fetching the paper…
Reading the bibliography…
In this paper, we consider algorithm-independent lower bounds for the problem of black-box optimization of functions having a bounded norm is some Reproducing Kernel Hilbert Space (RKHS), which can be viewed as a non-Bayesian Gaussian process bandit problem.
Theory of reproducing kernels
Aronszajn, N · 1950
Earlier work this paper cites.
Gambling in a rigged casino: The adversarial multi-armed bandit problem
Auer, P., Cesa-Bianchi, N., Freund, Y., and Schapire, R. E · 1995
Earlier work this paper cites.
Gaussian processes for machine learning
Rasmussen, C. E · 2006
Earlier work this paper cites.
Nonconvex robust optimization for problems with constraints
Bertsimas, D., Nohadani, O., and Teo, K. M · 2010
Earlier work this paper cites.
Regret bounds for Gaussian process bandit problems
Grünewälder, S., Audibert, J.-Y., Opper, M., and Shawe-Taylor, J · 2010
Earlier work this paper cites.
Gaussian process optimization in the bandit setting: No regret and experimental design
Srinivas, N., Krause, A., Kakade, S. M., and Seeger, M · 2010
Earlier work this paper cites.
Convergence rates of efficient global optimization algorithms
Bull, A. D · 2011
Earlier work this paper cites.
Exponential regret bounds for Gaussian process bandits with deterministic observations
De Freitas, N., Smola, A. J., and Zoghi, M · 2012
Earlier work this paper cites.
Best arm identification: A unified approach to fixed budget and fixed confidence
Gabillon, V., Ghavamzadeh, M., and Lazaric, A · 2012
Earlier work this paper cites.
Machine Learning and Knowledge Discovery in Databases , chapter Parallel Gaussian Process Optimization with Upper Confidence Bound and Pure Exploration, pp. 225–240
Contal, E., Buffoni, D., Robicquet, A., and Vayatis, N · 2013
Earlier work this paper cites.
Finite-time analysis of kernelised contextual bandits
Valko, M., Korda, N., Munos, R., Flaounas, I., and Cristianini, N · 2013
Earlier work this paper cites.
Lecture notes on information theory
Polyanskiy, Y. and Wu, Y · 2014
Earlier work this paper cites.
Bayesian optimization with exponential convergence
Kawaguchi, K., Kaelbling, L. P., and Lozano-Pérez, T · 2015
Earlier work this paper cites.
Truncated variance reduction: A unified approach to Bayesian optimization and level-set estimation
Bogunovic, I., Scarlett, J., Krause, A., and Cevher, V · 2016
Earlier work this paper cites.
On the complexity of best-arm identification in multi-armed bandit models
Kaufmann, E., Cappé, O., and Garivier, A · 2016
Earlier work this paper cites.
Unscented Bayesian optimization for safe robot grasping
Nogueira, J., Martinez-Cantin, R., Bernardino, A., and Jamone, L · 2016
Cited alongside, same era.
Optimization as estimation with Gaussian processes in bandit settings
Wang, Z., Zhou, B., and Jegelka, S · 2016
Cited alongside, same era.
Bayesian optimization under uncertainty
Beland, J. J. and Nair, P. B · 2017
Cited alongside, same era.
On kernelized multi-armed bandits
Chowdhury, S. R. and Gopalan, A · 2017
Cited alongside, same era.
Stable Bayesian optimization
Dai Nguyen, T., Gupta, S., Rana, S., and Venkatesh, S · 2017
Cited alongside, same era.
Lower bounds on regret for noisy Gaussian process bandit optimization
Scarlett, J., Bogunovic, I., and Cevher, V · 2017
Cited alongside, same era.
Bayesian optimization under heavy-tailed payoffs
Chowdhury, S. R. and Gopalan, A · 2019
Later among the works it cites.
Better algorithms for stochastic bandits with adversarial corruptions
Gupta, A., Koren, T., and Talwar, K · 2019
Later among the works it cites.
Stochastic linear optimization with adversarial corruption
Li, Y., Lou, E. Y., and Shan, L · 2019
Later among the works it cites.
Efficient batch black-box optimization with deterministic regret bounds
Lyu, Y., Yuan, Y., and Tsang, I. W · 2019
Later among the works it cites.
Corruption-tolerant Gaussian process bandit optimization
Bogunovic, I., Krause, A., and Scarlett, J · 2020
Closest in time.
Bandit optimisation of functions in the Matérn kernel RKHS
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Max-value entropy search for efficient Bayesian optimization
Wang, Z. and Jegelka, S · 2017
Cited alongside, same era.
Pure exploration in infinitely-armed bandit models with fixed-confidence
Aziz, M., Anderton, J., .Kaufmann, E., and .Aslam, J · 2018
Cited alongside, same era.
Optimistic optimization of a Brownian
Grill, J.-B., Valko, M., and Munos, R · 2018
Cited alongside, same era.
Stochastic bandits robust to adversarial corruptions
Lykouris, T., Mirrokni, V., and Paes Leme, R · 2018
Cited alongside, same era.
Practical Bayesian optimization in the presence of outliers
Martinez-Cantin, R., Tee, K., and McCourt, M · 2018
Cited alongside, same era.
Tight regret bounds for Bayesian optimization in one dimension
Scarlett, J · 2018
Cited alongside, same era.
Janz, D., Burt, D. R., and González, J · 2020
Closest in time.
Distributionally robust Bayesian optimization
Kirschner, J., Bogunovic, I., Jegelka, S., and Krause, A · 2020
Closest in time.
Distributionally robust bayesian quadrature optimization
Nguyen, T. T., Gupta, S., Ha, H., Rana, S., and Venkatesh, S · 2020
Closest in time.
Mixed strategies for robust optimization of unknown objectives
Sessa, P. G., Bogunovic, I., Kamgarpour, M., and Krause, A · 2020
Closest in time.
Multi-scale zero-order optimization of smooth functions in an RKHS
Shekhar, S. and Javidi, T · 2020
Closest in time.
Regret bounds for noise-free Bayesian optimization
Vakili, S., Picheny, V., and Durrande, N · 2020
Closest in time.
Stochastic linear bandits robust to adversarial attacks
Bogunovic, I., Losalka, A., Krause, A., and Scarlett, J · 2021
Closest in time.
On information gain and regret bounds in Gaussian process bandits
Vakili, S., Khezeli, K., and Picheny, V · 2021
Closest in time.
Tight regret bounds for noisy optimization of a Brownian motion
Wang, Z., Tan, V. Y. F., and Scarlett, J · 2021
Closest in time.