Portfolio allocation for Bayesian optimization

Proceedings of the 27th Conference on Uncertainty in Artificial Intelligence, UAI 2011

Volumn , Issue , 2011, Pages 327-336

  Hoffman, Matthew ^a   Brochu, Eric ^a   De Freitas, Nando ^a  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; BAYESIAN NETWORKS; MERGERS AND ACQUISITIONS; OPTIMIZATION;

ALGORITHM'S PERFORMANCE; BAYESIAN OPTIMIZATION; EXPENSIVE BLACK-BOX OPTIMIZATIONS; MACHINE LEARNING COMMUNITIES; MULTI ARMED BANDIT; OBJECTIVE FUNCTIONS; PORTFOLIO STRATEGIES; THEORETICAL BOUNDS;

FINANCIAL MARKETS;

EID: 80053160717     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (39)

1. J. Audibert, S. Bubeck, and R. Munos. Best arm identification in multi-armed bandits. In Proceedings of the Conference on Learning Theory, 2010.
2. P. Auer, N. Cesa-Bianchi, Y. Freund, and R. E. Schapire. Gambling in a rigged casino: the adversarial multi-armed bandit problem. Technical Report NC2-TR-1998-025, NeuroCOLT2 Technical Report Series, 1998.
3. P. Boyle. Gaussian Processes for Regression and Optimisation. PhD thesis, Victoria University of Wellington, Wellington, New Zealand, 2007.
4. E. Brochu, T. Brochu, and N. de Freitas. A Bayesian interactive optimization approach to procedural animation design. In Eurographics/ACM SIGGRAPH Symposium on Computer Animation, 2010.
5. 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. eprint arXiv:1012.2599, arXiv, 2010.
6. E. Brochu, N. de Freitas, and A. Ghosh. Active preference learning with discrete choice data. In Advances in Neural Information Processing Systems, 2007.
7. E. Brochu, M. Hoffman, and N. de Freitas. Technical Report arXiv:1009.5419, arXiv.
8. S. Bubeck, R. Munos, and G. Stoltz. Pure exploration in multi-armed bandits problems. In Algorithmic Learning Theory, pages 23-37. Springer, 2009.
9. A. D. Bull. Convergence rates of efficient global optimization algorithms. Technical Report arXiv:1101.3501v2, 2011.
10. N. Cesa-Bianchi and G. Lugosi. Prediction, Learning, and Games. Cambridge University Press, New York, 2006.
11. K. Chaudhuri, Y. Freund, and D. Hsu. A parameterfree hedging algorithm. In Advances in Neural Information Processing Systems, 2009.
12. W. Chu and Z. Ghahramani. Preference learning with Gaussian processes. In Proc. 22nd International Conf. on Machine Learning, 2005.
13. D. D. Cox and S. John. SDO: A statistical method for global optimization. In M. N. Alexandrov and M. Y. Hussaini, editors, Multidisciplinary Design Optimization: State of the Art, pages 315-329. SIAM, 1997.
14. P. J. Diggle, J. A. Tawn, and R. A. Moyeed. Modelbased geostatistics. Journal of the Royal Statistical Society. Series C, 47(3):299-350, 1998.
15. L. Dixon and G. Szegö. The global optimization problem: an introduction. Towards Global Optimization, 2, 1978.
16. J. M. Gablonsky. Modification of the DIRECT Algorithm. PhD thesis, Department of Mathematics, North Carolina State University, Raleigh, 2001.
17. S. Grunewalder, J. Audibert, M. Opper, and J. Shawe-Taylor. Regret bounds for Gaussian process bandit problems. In Proceedings of the Conference on Artificial Intelligence and Statistics, 2010.
18. M. Hoffman, H. Kück, N. de Freitas, and A. Doucet. New inference strategies for solving Markov decision processes using reversible jump MCMC. In Uncertainty in Artificial Intelligence, 2009.
19. D. Huang, T. T. Allen, W. I. Notz, and N. Zheng. Global optimization of stochastic black-box systems via sequential Kriging meta-models. J. Global Optimization, 3(34):441-466, March 2006. (Pubitemid 43352177)
20. F. Hutter. Automating the Conffguration of Algorithms for Solving Hard Computational Problems. PhD thesis, University of British Columbia, Vancouver, Canada, August 2009.
21. D. R. Jones. A taxonomy of global optimization methods based on response surfaces. J. Global Optimization, 21:345-383, 2001. (Pubitemid 33672374)
22. D. R. Jones, C. D. Perttunen, and B. E. Stuckman. Lipschitzian optimization without the Lipschitz constant. J. Optimization Theory and Apps, 79(1):157-181, 1993.
23. D. R. Jones, M. Schonlau, and W. J. Welch. Effcient global optimization of expensive black-box functions. J. Global Optimization, 13(4):455-492, 1998. (Pubitemid 128507405)
24. H. J. Kushner. A new method of locating the maximum of an arbitrary multipeak curve in the presence of noise. J. Basic Engineering, 86:97-106, 1964.
25. D. Lizotte. Practical Bayesian Optimization. PhD thesis, University of Alberta, Edmonton, Alberta, Canada, 2008.
26. D. Lizotte, T.Wang, M. Bowling, and D. Schuurmans. Automatic gait optimization with Gaussian process regression. In Proc. Intl. Joint Conf. on Artificial Intelligence (IJCAI), 2007.
27. M. Locatelli. Bayesian algorithms for one-dimensional global optimization. J. Global Optimization, 1997.
28. R. Martinez-Cantin, N. de Freitas, E. Brochu, J. Castellanos, and A. Doucet. A Bayesian exploration-exploitation approach for optimal online sensing and planning with a visually guided mobile robot. Autonomous Robots, 27(2):93-103, 2009.
29. R. Martinez-Cantin, N. de Freitas, A. Doucet, and J. A. Castellanos. Active policy learning for robot planning and exploration under uncertainty. Robotics: Science and Systems (RSS), 2007.
30. J. Moc̄kus, V. Tiesis, and A. Žilinskas. Toward Global Optimization, volume 2, chapter The Application of Bayesian Methods for Seeking the Extremum, pages 117-128. Elsevier, 1978.
31. A. Y. Ng and M. I. Jordan. PEGASUS: A policy search method for large MDPs and POMDPs. In Uncertainty in Artificial Intelligence (UAI2000), 2000.
32. J. Nocedal and S. Wright. Numerical optimization. Springer Verlag, 1999.
33. M. Osborne. Bayesian Gaussian Processes for Sequential Prediction, Optimization and Quadrature. PhD thesis, University of Oxford, 2010.
34. C. E. Rasmussen. Gaussian processes to speed up hybrid Monte Carlo for expensive Bayesian integrals. In Bayesian Statistics 7, pages 651-659. Oxford University Press, 2003.
35. C. E. Rasmussen and C. K. I. Williams. Gaussian Processes for Machine Learning. MIT Press, Cambridge, Massachusetts, 2006.
36. H. Rue, S. Martino, and N. Chopin. Approximate Bayesian inference for latent Gaussian models by using integrated nested Laplace approximations. Journal Of The Royal Statistical Society Series B, 71(2):319-392, 2009.
37. M. Schonlau, W. J. Welch, and D. R. Jones. Global versus local search in constrained optimization of computer models. Lecture Notes-Monograph Series, 34:11-25, 1998.
38. N. Srinivas, A. Krause, S. M. Kakade, and M. Seeger. Gaussian process optimization in the bandit setting: No regret and experimental design. In Proc. Intl. Conf. on Machine Learning (ICML), 2010.
39. E. Vasquez and J. Bect. Convergence properties of the expected improvement algorithm. ArXiv, (0712.3744v4), Dec 2007.