Agnostic online learning

COLT 2009 - The 22nd Conference on Learning Theory

Volumn , Issue , 2009, Pages

  Ben David, Shai ^a   Pál, Dávid ^a   Shalev Shwartz, Shai ^b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b TOYOTA TECHNOLOGICAL INSTITUTE AT CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONFIDENCE VALUES; LINEAR SEPARATORS; ONLINE LEARNING; ONLINE MODELING; ONLINE PREDICTION; PAC LEARNING MODEL; SAMPLE COMPLEXITY; UPPER AND LOWER BOUNDS;

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

References (16)

1. D. Blackwell. An analog of the minimax theorem for vector payoffs. Pacific Journal of Mathematics, 6(1): 1-8, Spring 1956.
2. S. Boucheron, O. Bousquet, and G. Lugosi. Theory of classification: a survey of recent advances. ESAIM: Probability and Statistics, 9: 323-375, 2005.
3. N. Cesa-Bianchi and G. Lugosi. Prediction, learning, and games. Cambridge University Press, 2006.
4. T.M. Cover. Behavior of sequential predictors of binary sequences. Trans. 4th Prague Conf. Information Theory Statistical Decision Functions, Random Processes, 1965.
5. T.M. Cover and A. Shenhar. Compound Bayes predictors for sequences with apparent Markov structure. IEEE Transactions on Systems, Man, and Cybernetics, SMC-7(6): 421-424, June 1977.
6. M. Feder, N. Merhav, and M. Gutman. Universal prediction of individual sequences. IEEE Transactions on Information Theory, 38: 1258-1270, 1992.
7. M. Frances and A. Litman. Optimal mistake bound learning is hard. Inf. Comput, 144(1): 66-82, 1998.
8. J. Hannan. 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.
9. D. Haussler. Decision theoretic generalizations of the PAC model for neural net and other learning applications. Information and Computation, 100(1): 78-150, 1992.
10. N. Littlestone. Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning, 2: 285-318, 1988.
11. N. Littlestone and Manfred K. Warmuth. The weighted majority algorithm. Information and Computation, 108: 212-261, 1994.
12. A. B. J. Novikoff. On convergence proofs on perceptrons. In Proceedings of the Symposium on the Mathematical Theory of Automata, Volume XII, pages 615-622, 1962.
13. H. Robbins. Asymptotically subminimax solutions of compound statistical decision problems. In Proceedings of the 2nd Berkeley symposium on mathematical statistics and probability, pages 131-148, 1951.
14. L. G. Valiant. A theory of the learnable. Communications of the ACM, 27(11): 1134-1142, November 1984.
15. T. Weissman and N. Merhav. Universal prediction of binary individual sequences in the presence of noise. IEEE Trans. Inform. Theory, 47(6): 2151-2173, 2001.
16. T. Weissman, N. Merhav, and A. Somekh-Baruch. Twofold universal prediction schemes for achieving the finite state predictability of a noisy individual binary sequence. IEEE Trans. Inform. Theory, 47(5): 1849-1866, 2001.