Bayesian multi-scale optimistic optimization

Journal of Machine Learning Research

Volumn 33, Issue , 2014, Pages 1005-1014

  Wang, Ziyu ^a   Shakibi, Babak ^b   Jin, Lin ^c   De Freitas, Nando ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^c Rocket Gaming Systems   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; BENCHMARKING; GAUSSIAN DISTRIBUTION; GAUSSIAN NOISE (ELECTRONIC); GLOBAL OPTIMIZATION; MERGERS AND ACQUISITIONS;

AUTOMATIC INFORMATION EXTRACTION; BAYESIAN OPTIMIZATION; BLACK-BOX FUNCTIONS; CONVERGENCE RESULTS; EFFICIENT GLOBAL OPTIMIZATION; FINITE-TIME CONVERGENCE; GAUSSIAN PROCESSES; GLOBAL OPTIMIZATION TECHNIQUES;

ITERATIVE METHODS;

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

References (42)

1. Adler, R. J. and Taylor, J. E. Random Fields and Geometry. Springer, 2007.
2. Agrawal, S. and Goyal, N. Thompson sampling for contextual bandits with linear payoffs. In International Conference on Machine Learning, 2013.
3. Bardenet, R. and Kégl, B. Surrogating the surrogate: accelerating Gaussian-process-based global optimization with a mixture cross-entropy algorithm. In International Conference on Machine Learning, pp. 55-62, 2010.
4. Bergstra, J., Bardenet, R., Bengio, Y., and Kégl, B. Algorithms for hyper-parameter optimization. In Advances in Neural Information Processing Systems, pp. 2546-2554, 2011.
5. Brochu, E., de Freitas, N., and Ghosh, A. Active preference learning with discrete choice data. In Advances in Neural Information Processing Systems, pp. 409-416, 2007.
6. Brochu, E., and Cora, V. M., and de Freitas, N. A tutorial on Bayesian optimization of expensive cost functions, with application to active user modeling and hierarchical reinforcement learning. Technical Report UBC TR-2009-23 and arXiv:1012.2599v1, Dept. of Computer Science, University of British Columbia, 2009.
7. Brochu, E., Brochu, T., and de Freitas, N. A Bayesian interactive optimization approach to procedural animation design. In Proceedings of the 2010 ACM SIGGRAPH/Eurographics Symposium on Computer Animation, pp. 103-112, 2010.
8. Bubeck, S., Munos, R., Stoltz, G., and Szepesvari, C. X-armed bandits. Journal of Machine Learning Research, 12:1655-1695, 2011.
9. Bull, A. D. Convergence rates of efficient global optimization algorithms. Journal of Machine Learning Research, 12:2879-2904, 2011.
10. Chen, B., Castro, R.M., and Krause, A. Joint optimization and variable selection of high-dimensional Gaussian processes. In International Conference on Machine Learning, 2012.
11. Coquelin, P.A. and Munos, R. Bandit algorithms for tree search. In Uncertainty in Artificial Intelligence, pp. 67-74, 2007.
12. de Freitas, N., Smola, A., and Zoghi, M. Exponential regret bounds for Gaussian process bandits with deterministic observations. In International Conference on Machine Learning, 2012.
13. Garnett, R., and Osborne, M. A., and Roberts, S. J. Bayesian optimization for sensor set selection. In ACM/IEEE International Conference on Information Processing in Sensor Networks, pp. 209-219. ACM, 2010.
14. Ghosal, S. and Roy, A. Posterior consistency of Gaussian process prior for nonparametric binary regression. The Annals of Statistics, 34:2413-2429, 2006.
15. Hansen, N. and Ostermeier, A. Completely derandomized self-adaptation in evolution strategies. Evol. Comput., 9(2):159-195, 2001.
16. Hennig, P. and Schuler, C.J. Entropy search for information-efficient global optimization. The Journal of Machine Learning Research, 98888:1809-1837, 2012.
17. Hoffman, M., Kueck, H., de Freitas, N., and Doucet, A. New inference strategies for solving Markov decision processes using reversible jump MCMC. In Uncertainty in Artificial Intelligence, pp. 223-231, 2009.
18. Hoffman, M., Brochu, E., and de Freitas, N. Portfolio allocation for Bayesian optimization. In Uncertainty in Artificial Intelligence, pp. 327-336, 2011.
19. Hoffman, M.W., Shahriari, B., and de Freitas, N. On correlation and budget constraints in model-based multi-armed-bandit optimization with application to automatic machine learning. In AI and Statistics, 2014.
20. Hutter, F., and Hoos, H. H., and Leyton-Brown, K. Sequential model-based optimization for general algorithm configuration. In Proceedings of LION-5, pp. 507-523, 2011.
21. Jones, D. R., and Perttunen, C. D., and Stuckman, B. E. Lipschitzian optimization without the Lipschitz constant. Journal of Optimization Theory and Applications, 79(1): 157-181, 1993.
22. Jones, D.R. A taxonomy of global optimization methods based on response surfaces. J. of Global Optimization, 21(4):345-383, 2001.
23. Kaufmann, E., Korda, N., and Munos, R. Thompson sampling: An asymptotically optimal finite-time analysis. In Algorithmic Learning Theory, Volume 7568 of Lecture Notes in Computer Science, pp. 199-213. Springer Berlin Heidelberg, 2012.
24. Kim, J., Ohta, T., Tateisi, Y., and ichi Tsujii, J. GENIA corpus - a semantically annotated corpus for bio-textmining. In ISMB (Supplement of Bioinformatics), pp. 180-182, 2003.
25. Kocsis, L. and Szepesvári, C. Bandit based Monte-Carlo planning. In European Conference on Machine Learning, pp. 282-293. 2006.
26. Kueck, H., de Freitas, N., and Doucet, A. SMC samplers for Bayesian optimal nonlinear design. In IEEE Nonlinear Statistical Signal Processing Workshop, pp. 99-102, 2006.
27. Kueck, H., Hoffman, M., Doucet, A., and de Freitas, N. Inference and learning for active sensing, experimental design and control. In Araujo, H., Mendonca, A., Pinho, A., and Torres, M. (eds.), Pattern Recognition and Image Analysis, Volume 5524, pp. 1-10. Springer Berlin Heidelberg, 2009.
28. Lizotte, D., Greiner, R., and Schuurmans, D. An experimental methodology for response surface optimization methods. J. of Global Optimization, pp. 1-38, 2011.
29. Mahendran, N., Wang, Z., Hamze, F., and de Freitas, N. Adaptive MCMC with Bayesian optimization. Journal of Machine Learning Research - Proceedings Track, 22: 751-760, 2012.
30. Martinez-Cantin, R., de Freitas, N., Doucet, A., and Castellanos, J. A. Active policy learning for robot planning and exploration under uncertainty. Robotics Science and Systems, 2007.
31. May, B. C., Korda, N., Lee, A., and Leslie, D. S. Optimistic Bayesian sampling in contextual bandit problems. Technical Report 11:01 Statistics Group, School of Mathematics, University of Bristol, 2011.
32. Močkus, J. The Bayesian approach to global optimization. In Systems Modeling and Optimization, Volume 38, pp. 473-481. Springer, 1982.
33. Munos, R. Optimistic optimization of a deterministic function without the knowledge of its smoothness. In Advances in Neural Information Processing Systems, pp. 783-791, 2011.
34. Munos, R. From Bandits to Monte-Carlo Tree Search: The Optimistic Principle Applied to Optimization and Planning. Technical Report hal-00747575, INRIA Lille, 2014.
35. Parameswaran, A., Garcia-Molina, H., and Rajaraman, A. Towards the web of concepts: Extracting concepts from large datasets. Proceedings of the VLDB Endowment, 3 (1-2):566-577, 2010.
36. Rasmussen, C. E. and Williams, C. K. I. Gaussian Processes for Machine Learning. The MIT Press, 2006.
37. Snoek, J., Larochelle, H., and Adams, R. P. Practical Bayesian optimization of machine learning algorithms. In Advances in Neural Information Processing Systems, 2012.
38. Srinivas, N., Krause, A., Kakade, S. M., and Seeger, M. Gaussian process optimization in the bandit setting: No regret and experimental design. In International Conference on Machine Learning, pp. 1015-1022, 2010.
39. Stein, M. L. Interpolation of Spatial Data: Some Theory for Kriging. Springer, 1999.
40. Valko, M., Carpentier, A., and Munos, R. Stochastic simultaneous optimistic optimization. In International Conference on Machine Learning, 2013.
41. Vazquez, E. and Bect, J. Convergence properties of the expected improvement algorithm with fixed mean and covariance functions. J. of Statistical Planning and Inference, 140:3088-3095, 2010.
42. Wang, Z., Zoghi, M., Matheson, D., Hutter, F., and de Freitas, N. Bayesian optimization in high dimensions via random embeddings. In International Joint Conference on Artificial Intelligence, 2013.