Optimistic optimization of a deterministic function without the knowledge of its smoothness

Advances in Neural Information Processing Systems 24: 25th Annual Conference on Neural Information Processing Systems 2011, NIPS 2011

Volumn , Issue , 2011, Pages

  Munos, Rémi ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BUDGET CONTROL; SAMPLING;

DETERMINISTIC FUNCTIONS; FINITE SAMPLE PERFORMANCE; GLOBAL MAXIMUM; GLOBAL OPTIMIZATION PROBLEMS; HIERARCHICAL PARTITIONING; NEAR-OPTIMAL; OPTIMAL STATE; OPTIMISATIONS; OPTIMISTICS; PERFORMANCE BOUNDS;

GLOBAL OPTIMIZATION;

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

References (27)

1. J.-Y. Audibert, S. Bubeck, and R. Munos. Best arm identification in multi-armed bandits. In Conference on Learning Theory, 2010.
2. P. Auer, N. Cesa-Bianchi, and P. Fischer. Finite-time analysis of the multiarmed bandit problem. Machine Learning Journal, 47(2-3):235-256, 2002.
3. P. Auer, R. Ortner, and Cs. Szepesvári. Improved rates for the stochastic continuum-armed bandit problem. 20th Conference on Learning Theory, pages 454-468, 2007.
4. S. Bubeck and R. Munos. Open loop optimistic planning. In Conference on Learning Theory, 2010.
5. S. Bubeck, R. Munos, and G. Stoltz. Pure exploration in multi-armed bandits problems. In Proc. of the 20th International Conference on Algorithmic Learning Theory, pages 23-37, 2009.
6. L. Busoniu, R. Munos, B. De Schutter, and R. Babuska. Optimistic planning for sparsely stochastic systems. In IEEE International Symposium on Adaptive Dynamic Programming and Reinforcement Learning, 2011.
7. S. Bubeck, R. Munos, G. Stoltz, and Cs. Szepesvári. Online optimization of X-armed bandits. In D. Koller, D. Schuurmans, Y. Bengio, and L. Bottou, editors, Advances in Neural Information Processing Systems, volume 22, pages 201-208. MIT Press, 2008.
8. S. Bubeck, R. Munos, G. Stoltz, and Cs. Szepesvári. X-armed bandits. Journal of Machine Learning Research, 12:1655-1695, 2011.
9. S. Bubeck, G. Stoltz, and J. Y. Yu. Lipschitz bandits without the Lipschitz constant. In Proceedings of the 22nd International Conference on Algorithmic Learning Theory, 2011.
10. P.-A. Coquelin and R. Munos. Bandit algorithms for tree search. In Uncertainty in Artificial Intelligence, 2007.
11. D. E. Finkel and C. T. Kelley. Convergence analysis of the direct algorithm. Technical report, North Carolina State University, Center for, 2004.
12. C.A. Floudas. Deterministic Global Optimization: Theory, Algorithms and Applications. Kluwer Academic Publishers, Dordrecht / Boston / London, 1999.
13. J. M. X. Gablonsky. Modifications of the direct algorithm. PhD thesis, 2001.
14. S. Gelly, Y. Wang, R. Munos, and O. Teytaud. Modification of UCT with patterns in monte-carlo go. Technical report, INRIA RR-6062, 2006.
15. E.R. Hansen. Global Optimization Using Interval Analysis. Marcel Dekker, New York, 1992.
16. J-F. Hren and R.Munos. Optimistic planning of deterministic systems. In European Workshop on Reinforcement Learning Springer LNAI 5323, editor, Recent Advances in Reinforcement Learning, pages 151-164, 2008.
17. R. Horst and H. Tuy. Global Optimization ? Deterministic Approaches. Springer, Berlin / Heidelberg / New York, 3rd edition, 1996.
18. D. R. Jones, C. D. Perttunen, and B. E. Stuckman. Lipschitzian optimization without the lipschitz constant. Journal of Optimization Theory and Applications, 79(1):157-181, 1993.
19. R. B. Kearfott. Rigorous Global Search: Continuous Problems. Kluwer Academic Publishers, Dordrecht / Boston / London, 1996.
20. R. Kleinberg. Nearly tight bounds for the continuum-armed bandit problem. In 18th Advances in Neural Information Processing Systems, 2004.
21. L. Kocsis and Cs. Szepesvári. Bandit based Monte-Carlo planning. In Proceedings of the 15th European Conference on Machine Learning, pages 282-293, 2006.
22. R. Kleinberg, A. Slivkins, and E. Upfal. Multi-armed bandits in metric spaces. In Proceedings of the 40th ACM Symposium on Theory of Computing, 2008.
23. Neumaier. Interval Methods for Systems of Equations. Cambridge University Press, 1990.
24. J.D. Pintér. Global Optimization in Action (Continuous and Lipschitz Optimization: Algorithms, Implementations and Applications). Kluwer Academic Publishers, 1996.
25. Niranjan Srinivas, Andreas Krause, Sham Kakade, and Matthias Seeger. Gaussian process optimization in the bandit setting: No regret and experimental design. In International Conference on Machine Learning, pages 1015-1022, 2010.
26. A. Slivkins. Multi-armed bandits on implicit metric spaces. In Advances in Neural Information Processing Systems, 2011.
27. R.G. Strongin and Ya.D. Sergeyev. Global Optimization with Non-Convex Constraints: Sequential and Parallel Algorithms. Kluwer Academic Publishers, Dordrecht / Boston / London, 2000.