Time-Varying Gaussian Process Bandit Optimization

T. Lai and H. Robbins, “Asymptotically efficient adaptive allocation rules,” Adv. App. Math. , vol. 6, no. 1, pp. 4 – 22, 1985

1985

Earlier work this paper cites.

P. Whittle, “Restless bandits: Activity allocation in a changing world,” J. App. Prob. , vol. 25, pp. 287–298, 1988

1988

Earlier work this paper cites.

D. Bertsimas and J. Niño-Mora, “Restless bandits, linear programming relaxations, and a primal-dual index heuristic,” Operations Research , vol. 48, no. 1, pp. 80–90, 2000

2000

Earlier work this paper cites.

T. M. Cover and J. A. Thomas, Elements of Information Theory . John Wiley & Sons, Inc., 2001

2001

Earlier work this paper cites.

C. E. Rasmussen, “Gaussian processes for machine learning.” MIT Press, 2006

2006

Earlier work this paper cites.

R. P. Adams and D. J. MacKay, “Bayesian online changepoint detection,” 2007, http://arxiv.org/abs/0710.3742

Original

2007

Earlier work this paper cites.

A. Slivkins and E. Upfal, “Adapting to a changing environment: the Brownian restless bandits,” in Conf. Learn. Theory , 2008

2008

Earlier work this paper cites.

M. A. Osborne, S. Roberts, A. Rogers, S. Ramchurn, and N. R. Jennings, “Towards real-time information processing of sensor network data using computationally efficient multi-output gaussian processes,” in Proc. Int. Conf. Inf. Proc. Sens. Net. , 2008, pp. 109–120

2008

Earlier work this paper cites.

R. Garnett, M. A. Osborne, and S. J. Roberts, “Sequential bayesian prediction in the presence of changepoints,” in Proc. Inf. Conf. Mach. Learn. , 2009

2009

Earlier work this paper cites.

E. Brochu, V. M. Cora, and N. de Freitas, “A tutorial on bayesian optimization of expensive cost functions, with application to active user modeling and hierarchical reinforcement learning,” 2010, http://arxiv.org/abs/1012.2599

Original

2010

Cited alongside, same era.

A. Krause and C. S. Ong, “Contextual Gaussian process bandit optimization,” in Adv. Neur. Inf. Proc. Sys. Curran Associates, Inc., 2011, pp. 2447–2455

2011

Cited alongside, same era.

N. Srinivas, A. Krause, S. Kakade, and M. Seeger, “Information-theoretic regret bounds for Gaussian process optimization in the bandit setting,” IEEE Trans. Inf. Theory , vol. 58, no. 5, pp. 3250–3265, May 2012

2012

Cited alongside, same era.

S. Bubeck and N. Cesa-Bianchi, Regret Analysis of Stochastic and Nonstochastic Multi-Armed Bandit Problems , ser. Found. Trend. Mach. Learn. Now Publishers, 2012

2012

Cited alongside, same era.

R. A. Horn and C. R. Johnson, Matrix Analysis , 2nd ed. New York, NY, USA: Cambridge University Press, 2012

2012

Later among the works it cites.

J. Djolonga, A. Krause, and V. Cevher, “High-dimensional Gaussian process bandits,” in Adv. Neur. Inf. Proc. Sys. , C. Burges, L. Bottou, M. Welling, Z. Ghahramani, and K. Weinberger, Eds. Curran Associates, Inc., 2013, pp. 1025–1033

2013

Later among the works it cites.

Z. Wang, M. Zoghi, F. Hutter, D. Matheson, and N. de Freitas, “Bayesian optimization in high dimensions via random embeddings,” in Int. Joint. Conf. Art. Int. , 2013

2013

Later among the works it cites.

H. Liu, K. Liu, and Q. Zhao, “Learning in a changing world: Restless multiarmed bandit with unknown dynamics,” IEEE Trans. Inf. Theory , vol. 59, no. 3, pp. 1902–1916, March 2013

2013

Later among the works it cites.