An apobayesian relative of winnow

Advances in Neural Information Processing Systems

Volumn , Issue , 1997, Pages 204-210

  Littlestone, Nick ^a   Mesterharm, Chris ^a  

^a NEC LABORATORIES AMERICA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BAYESIAN ALGORITHMS; BINARY CLASSIFICATION; LINEAR TIME; LINEAR-THRESHOLD CLASSIFIERS; ON-LINE BAYESIAN LEARNING;

ALGORITHMS;

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

References (10)

1. Nicolo Cesa-Bianchi, David P. Helmbold, and Sandra Panizza. On bayes methods for on-line boolean prediction. In Proceedings of the Ninth Annual Conference on Computational Learning Theory, pages 314-324, 1996.
2. Yoav Freund. Predicting a binary sequence almost as well as the optimal biased coin. In Proceedings of the Ninth Annual Conference on Computational Learning Theory, pages 89-98, 1996.
3. J. Kivinen and M. K. Warmuth. Additive versus exponentiated gradient updates for linear prediction. In Proc. 27th ACM Symp. on Theory of Computing, pages 209-218,1995.
4. N. Littlestone. Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning, 2:285-318, 1988.
5. N. Littlestone. Mistake Bounds and Logarithmic Linear-threshold Learning Algorithms. PhD thesis, Tech. Rept. UCSC-CRL-89-11, Univ. of Calif., Santa Cruz, 1989.
6. N. Littlestone. Redundant noisy attributes, attribute errors, and linear-threshold learning using Winnow. In Proc. 4th Annu. Workshop on Corn-put. Learning Theory, pages 147-156. Morgan Kaufmann, San Mateo, CA, 1991.
7. N. Littlestone. Comparing several linear-threshold learning algorithms on tasks involving superfluous attributes. In Proceedings of the XII International conference on Machine Learning, pages 353-361, 1995.
8. N. Littlestone. Mistake-driven bayes sports: Bounds for symmetric apobayesian learning algorithms. Technical report, NEC Research Institute, Princeton, NJ, 1996.
9. N. Littlestone and M. K. Warmuth. The weighted majority algorithm. Information and Computation, 108:212-261, 1994.
10. Volodimir G. Vovk. Aggregating strategies. In Proceedings of the 1990 Workshop on Computational Learning Theory, pages 371-383, 1990.