Learning when to stop thinking and do something!

Proceedings of the 26th International Conference On Machine Learning, ICML 2009

Volumn , Issue , 2009, Pages 825-832

  Póczos, Barnabás ^a   Yasin, Abbasi Yadkori ^a   Szepesvári, Csaba ^a   Greiner, Russell ^a   Sturtevant, Nathan ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ANYTIME ALGORITHM; AVERAGE REWARD; CROSS-ENTROPY METHOD; FACE DETECTION; GLOBAL OPTIMIZER; LOCAL GRADIENTS; PER UNIT; REAL-WORLD;

EDUCATION; ROBOT LEARNING;

LEARNING ALGORITHMS;

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

References (16)

1. Baxter, J., & Bartlett, P. (2001). Infinite-horizon policy-gradient estimation. Journal of Artificial Intelligence Research, 15, 319-350.
2. Bradski, G., & Kaehler, A. (2008). Learning OpenCV: Computer vision with the OpenCV library. O'Reilly Press.
3. Greensmith, E., Bartlett, P., & Baxter, J. (2004). Variance reduction techniques for gradient estimates in reinforcement learning. Journal of Machine Learning Research, 5, 1471-1530.
4. Greiner, R., Grove, A., & Roth, D. (2002). Learning cost-sensitive active classifiers. Artificial Intelligence, 139, 137-174.
5. Hoeffding, W. (1963). Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association, 58, 13-30.
6. Lienhart, R., Kuranov, A., & Pisarevsky, V. (2003). Empirical analysis of detection cascades of boosted classifiers for rapid object detection. DAGM'03, 25th Pattern Recognition Symposium (pp. 297-304).
7. Mnih, V., Szepesvari, C., & Audibert, J.-Y. (2008). Empirical Bernstein stopping. International Conference on Machine learning (pp. 672-679).
8. Rubinstein, R. Y., & Kroese, D. P. (2004). The cross-entropy method. Information Science and Statistics. Springer.
9. Russell, S., & Subramanian, D. (1995). Provably bounded-optimal agents. Journal of Artificial Intelligence Research, 2, 575-609.
10. Shiryaev, A. (2007). Optimal stopping rules. Springer.
11. Sutton, R., & Barto, A. (1998). Reinforcement learning: An introduction. MIT Press.
12. Turney, P. (2000). Types of cost in inductive concept learning. Workshop on Cost-Sensitive Learning (International Conference on Machine Learning).
13. Viola, P., & Jones, M. (2001). Rapid object detection using a boosted cascade of simple features. Computer Vision and Pattern Recognition (pp. 511-518).
14. Wald, A., & Wolfowitz, J. (1948). Optimum character of the sequential probability ratio test. Annals of Mathematical Statistics, 19, 326-339.
15. Williams, R. J. (1992). Simple statistical gradient-following algorithms for connectionist reinforcement learning. Machine Learning, 8, 229-256.
16. Zilberstein, S. (1996). Using anytime algorithms in intelligent systems. AI magazine, 17, 73-83.