Y. Abbasi-yadkori, D. Pál, and C. Szepesvári, Improved algorithms for linear stochastic bandits, Neural Information Processing Systems, 2011.

A. E. Alaoui and M. W. Mahoney, Fast randomized kernel methods with statistical guarantees, Neural Information Processing Systems, 2015.

D. Calandriello and L. Rosasco, Statistical and computational trade-offs in kernel k-means, Neural Information Processing Systems, 2018.

D. Calandriello, A. Lazaric, and M. Valko, Distributed adaptive sampling for kernel matrix approximation, International Conference on Artificial Intelligence and Statistics, 2017.

D. Calandriello, A. Lazaric, and M. Valko, Second-order kernel online convex optimization with adaptive sketching, International Conference on Machine Learning, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01537799

R. Sayak, A. Chowdhury, and . Gopalan, On kernelized multi-armed bandits, International Conference on Machine Learning, 2017.

R. Sayak, A. Chowdhury, and . Gopalan, Online learning in kernelized Markov decision processes, International Conference on Artificial Intelligence and Statistics, 2019.

V. Dani, P. Thomas, . Hayes, M. Sham, and . Kakade, Stochastic linear optimization under bandit feedback, Conference on Learning Theory, 2008.

M. Ghashami, E. Liberty, J. M. Phillips, and D. P. Woodruff, Frequent directions: Simple and deterministic matrix sketching, The SIAM Journal of Computing, pp.1-28, 2016.

A. Ghosh, A. Sayak-ray-chowdhury, and . Gopalan, Misspecified linear bandits, AAAI Conference on Artificial Intelligence, 2017.

E. Hazan, A. T. Kalai, A. Agarwal, and S. Kale, Logarithmic regret algorithms for online convex optimization, Conference on Learning Theory, 2006.

J. H. Huggins, T. Campbell, M. Kasprzak, and T. Broderick, Scalable Gaussian process inference with finite-data mean and variance guarantees, International Conference on Artificial Intelligence and Statistics, 2019.

I. Kuzborskij, L. Cella, and N. Cesa-bianchi, Efficient linear bandits through matrix sketching, International Conference on Artificial Intelligence and Statistics, 2019.

T. Lattimore and C. Szepesvári, Bandit algorithms, 2019.

L. Li, W. Chu, J. Langford, and R. E. Schapire, A contextual-bandit approach to personalized news article recommendation, International World Wide Web Conference, 2010.

H. Liu, Y. Ong, X. Shen, and J. Cai, When Gaussian process meets big data: A Review of scalable GPs, 2018.

J. Mockus, Global optimization and the Bayesian approach, 1989.

M. Mutný and A. Krause, Efficient high-dimensional Bayesian optimization with additivity and quadrature Fourier features, Neural Information Processing Systems, 2018.

M. Pelikan, Hierarchical Bayesian optimization algorithm, Studies in Fuzziness and Soft Computing, pp.105-129, 2005.

J. Quinonero-candela, C. E. Rasmussen, and C. K. Williams, Approximation methods for gaussian process regression. Large-scale kernel machines, pp.203-224, 2007.

A. Rahimi and B. Recht, Random features for large-scale kernel machines, Neural Information Processing Systems, 2007.

C. E. Rasmussen and C. K. Williams, Gaussian processes for machine learning, 2006.

H. Robbins, Some aspects of the sequential design of experiments, Bulletin of the American Mathematics Society, vol.58, pp.527-535, 1952.

J. Scarlett, I. Bogunovic, and V. Cevher, Lower bounds on regret for noisy Gaussian process bandit optimization, Conference on Learning Theory, 2017.

M. Seeger, C. Williams, and N. Lawrence, Fast forward selection to speed up sparse Gaussian process regression, International Conference on Artificial Intelligence and Statistics, 2003.

J. Snoek, H. Larochelle, and R. P. Adams, Practical bayesian optimization of machine learning algorithms, Neural Information Processing Systems, 2012.

N. Srinivas, A. Krause, M. Sham, M. Kakade, and . Seeger, Gaussian process optimization in the bandit setting: No regret and experimental design, International Conference on Machine Learning, 2010.

J. A. Tropp, An introduction to matrix concentration inequalities. Foundations and Trends in Machine Learning, vol.8, pp.1-230, 2015.

M. Valko, N. Korda, and R. Munos, Ilias Flaounas, and Nelo Cristianini. Finite-time analysis of kernelised contextual bandits, Uncertainty in Artificial Intelligence, 2013.