On correlation and budget constraints in model-based bandit optimization with application to automatic machine learning

Journal of Machine Learning Research

Volumn 33, Issue , 2014, Pages 365-374

  Hoffman, Matthew W ^a   Shahriari, Bobak ^b   De Freitas, Nando ^c  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^b UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^c UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; BAYESIAN NETWORKS; BUDGET CONTROL; FUNCTION EVALUATION;

AUTOMATIC MACHINES; BAYESIAN APPROACHES; BAYESIAN OPTIMIZATION; BUDGET CONSTRAINT; COMPREHENSIVE COMPARISONS; MODEL-BASED OPC; NONLINEAR FUNCTIONS; OPTIMIZATION TECHNIQUES;

LEARNING SYSTEMS;

EID: 84955516630     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (44)

1. S. Agrawal and N. Goyal. Thompson sampling for contextual bandits with linear payoffs. In ICML, 2013.
2. S. Arlot and A. Celisse. A survey of cross-validation procedures for model selection. Statistics Surveys, 4:40-79, 2010.
3. J.-Y. Audibert, S. Bubeck, and R. Munos. Best arm identification in multi-armed bandits. In CoLT, 2010.
4. P. Auer, N. Cesa-Bianchi, and P. Fischer. Finite-time analysis of the multiarmed bandit problem. Machine Learning, 47(2):235-256, 2002.
5. J. Azimi, A. Fern, and X. Fern. Budgeted optimization with concurrent stochastic-duration experiments. In NIPS, pages 1098-1106, 2011.
6. J. Bergstra, R. Bardenet, Y. Bengio, and B. Kégl. Algorithms for hyper-parameter optimization. In NIPS, pages 2546-2554, 2011.
7. E. Brochu, N. de Freitas, and A. Ghosh. Active preference learning with discrete choice data. In NIPS, pages 409-416, 2007.
8. E. Brochu, T. Brochu, and N. de Freitas. A Bayesian interactive optimization approach to procedural animation design. In ACM SIGGRAPH/Eurographics Symposium on Computer Animation, pages 103-112, 2010a.
9. E. Brochu, V. Cora, and N. de Freitas. A tutorial on Bayesian optimization of expensive cost functions. Technical Report arXiv:1012.2599, 2010b.
10. S. Bubeck, R. Munos, and G. Stoltz. Pure exploration in multi-armed bandits problems. In International Conference on Algorithmic Learning Theory, 2009.
11. P. Burman. A comparative study of ordinary cross-validation, v-fold cross-validation and the repeated learning-testing methods. Biometrika, 76(3):pp. 503-514, 1989.
12. N. Cesa-Bianchi and G. Lugosi. Prediction, Learning, and Games. Cambridge University Press, New York, 2006.
13. O. Chapelle and L. Li. An empirical evaluation of Thompson sampling. In NIPS, 2012.
14. N. de Freitas, A. Smola, and M. Zoghi. Exponential Regret Bounds for Gaussian Process Bandits with Deterministic Observations. In ICML, 2012.
15. V. Gabillon, M. Ghavamzadeh, A. Lazaric, and S. Bubeck. Multi-bandit best arm identification. In NIPS, 2011.
16. V. Gabillon, M. Ghavamzadeh, and A. Lazaric. Best arm identification: A unified approach to fixed budget and fixed confidence. In NIPS, 2012.
17. F. Hamze, Z. Wang, and N. de Freitas. Self-avoiding random dynamics on integer complex systems. ACM Transactions on Modelling and Computer Simulation, 23(1): 9:1-9:25, 2013.
18. P. Hennig and C. Schuler. Entropy search for information-efficient global optimization. JMLR, 13:1809-1837, 2012.
19. M. W. Hoffman, E. Brochu, and N. de Freitas. Portfolio allocation for Bayesian optimization. In UAI, pages 327-336, 2011.
20. F. Hutter, H. H. Hoos, and K. Leyton-Brown. Sequential model-based optimization for general algorithm configuration. In Proceedings of LION-5, page 507-523, 2011.
21. D. Jones. A taxonomy of global optimization methods based on response surfaces. J. of Global Optimization, 21(4):345-383, 2001.
22. E. Kaufmann and S. Kalyanakrishnan. Information complexity in bandit subset selection. In Conference on Learning Theory, pages 228-251, 2013.
23. E. Kaufmann, O. Cappé, and A. Garivier. On Bayesian upper conf. bounds for bandit problems. In AIStats, 2012a.
24. E. Kaufmann, N. Korda, and R. Munos. Thompson sampling: an asymptotically optimal finite-time analysis. In International Conference on Algorithmic Learning Theory, 2012b.
25. R. Kohavi, R. Longbotham, D. Sommerfield, and R. Henne. Controlled experiments on the web: survey and practical guide. Data Mining and Knowledge Discovery, 18:140-181, 2009.
26. H. Kueck, N. de Freitas, and A. Doucet. SMC samplers for Bayesian optimal nonlinear design. In IEEE Nonlinear Statistical Signal Processing Workshop, pages 99-102, 2006.
27. H. Kueck, M. Hoffman, A. Doucet, and N. de Freitas. Inference and learning for active sensing, experimental design and control. In H. Araujo, A. Mendonca, A. Pinho, and M. Torres, editors, Pattern Recognition and Image Analysis, Volume 5524, pages 1-10. Springer Berlin Heidelberg, 2009.
28. D. J. Lizotte, R. Greiner, and D. Schuurmans. An experimental methodology for response surface optimization methods. Journal of Global Optimization, 53(4):699-736, 2012.
29. N. Mahendran, Z. Wang, F. Hamze, and N. de Freitas. Adaptive MCMC with Bayesian optimization. Journal of Machine Learning Research - Proceedings Track, 22: 751-760, 2012.
30. O. Maron and A. W. Moore. Hoeffding races: Accelerating model selection search for classification and function approximation. In NIPS, pages 59-66, 1994.
31. R. Martinez-Cantin, N. de Freitas, A. Doucet, and J. A. Castellanos. Active policy learning for robot planning and exploration under uncertainty. 2007.
32. J. Močkus. The Bayesian approach to global optimization. In Systems Modeling and Optimization, Volume 38, pages 473-481. Springer, 1982.
33. R. Munos. Optimistic optimization of a deterministic function without the knowledge of its smoothness. In NIPS, pages 783-791, 2011.
34. K. P. Murphy. Machine learning: A probabilistic perspective. Cambridge, MA, 2012.
35. S. Scott. A modern Bayesian look at the multi-armed bandit. Applied Stochastic Models in Business and Industry, 26(6), 2010.
36. J. Snoek, H. Larochelle, and R. P. Adams. Opportunity cost in Bayesian optimization. In Neural Information Processing Systems Workshop on Bayesian Optimization, 2011.
37. J. Snoek, H. Larochelle, and R. Adams. Practical Bayesian optimization of machine learning algorithms. In NIPS, pages 2960-2968, 2012.
38. N. Srinivas, A. Krause, S. M. Kakade, and M. Seeger. Gaussian process optimization in the bandit setting: No regret and experimental design. In ICML, 2010.
39. K. Swersky, J. Snoek, and R. P. Adams. Multi-task Bayesian optimization. In Neural Information Processing Systems, 2013.
40. C. Thornton, F. Hutter, H. H. Hoos, and K. Leyton-Brown. Auto-WEKA: Combined selection and hyperparameter optimization of classification algorithms. In KDD, pages 847-855, 2013.
41. M. Valko, A. Carpentier, and R. Munos. Stochastic simultaneous optimistic optimization. In ICML, 2013.
42. J. Villemonteix, E. Vazquez, and E. Walter. An informational approach to the global optimization of expensive-to-evaluate functions. Journal of Global Optimization, 44(4):509-534, 2009.
43. Z. Wang, S. Mohamed, and N. de Freitas. Adaptive Hamiltonian and Riemann manifold Monte Carlo samplers. In ICML, 2013a.
44. Z. Wang, M. Zoghi, D. Matheson, F. Hutter, and N. de Freitas. Bayesian optimization in high dimensions via random embeddings. In IJCAI, 2013b.