A decision-theoretic generalization of on-line learning and an application to boosting

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 904, Issue , 1995, Pages 23-37

  Freund, Yoav ^a   Schapire, Robert E ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; E-LEARNING; FORECASTING;

BOOSTING ALGORITHM; DECISION-THEORETIC; LEARNING PROBLEM; ONLINE LEARNING; ONLINE PREDICTION; OUTCOME PREDICTION; PRIOR KNOWLEDGE; REPEATED GAMES;

LEARNING ALGORITHMS;

EID: 84983110889     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-59119-2_166     Document Type: Conference Paper

References (12)

1. Nicoló Cesa-Bianchi, Yoav Freund, David P. Helmbold, David Haussler, Robert E. Schapire, and Manfred K. Warmuth. How to use expert advice. In Proceedings of the Twenty-Fifth Annual ACM Symposium on the Theory of Computing, pages 382-391, May 1993.
2. Thomas H. Chung. Approximate methods for sequential decision making using expert advice. In Proceedings of the Seventh Annual ACM Conference on Computational Learning Theory, pages 183-189, 1994.
3. Thomas M. Cover. Universal portfolios. Mathematics of Finance, 1(1):1-29, January 1991.
4. Harris Drucker, Robert Schapire, and Patrice Simard. Boosting performance in neural networks. International Journal of Pattern Recognition and Artificial Intelligence, 7(4):705-719, 1993.
5. Yoav Freund. Data Filtering and Distribution Modeling Algorithms for Machine Learning. PhD thesis, University of California at Santa Cruz, 1993. Retrievable from: ftp.cse.ucsc.edu/pub/tr/ucsc-crl-93-37.ps.Z.
6. Yoav Freund. Boosting a weak learning algorithm by majority. Information and Computation, To appear.
7. James Hannah. Approximation to Bayes risk in repeated play. In M. Dresher, A. W. Tucker, and P. Wolfe, editors, Contributions to the Theory of Games, volume III, pages 97-139. Princeton University Press, 1957.
8. David Haussler, Jyrki Kivinen, and Manfred K. Warmuth. Tight worst-case loss bounds for predicting with expert advice. In Proceedings of the Second European Conference on Computational Learning Theory, 1995.
9. Jyrki Kivinen and Manfred K. Warmuth. Using experts for predicting continuous outcomes. In Computational Learning Theory: EuroCOLT '93, pages 109-120, 1994.
10. Nick Littlestone and Manfred K. Warmuth. The weighted majority algorithm. Information and Computation, 108:212-261, 1994.
11. Robert E. Schapire. The strength of weak leamability. Machine Learning, 5(2): 197-227, 1990.
12. Volodimir G. Vovk. Aggregating strategies. In Proceedings of the Third Annual Workshop on Computational Learning Theory, pages 371-383, 1990.