Data dependent concentration bounds for sequential prediction algorithms

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

Volumn 3559 LNAI, Issue , 2005, Pages 173-187

  Zhang, Tong ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LEARNING ALGORITHMS; LEARNING SYSTEMS; PROBABILITY DISTRIBUTIONS;

DATA DEPENDENT CONCENTRATION; GENERALIZATION BEHAVIOR; PROBABILITY INEQUALITIES; SEQUENTIAL PREDICTION ALGORITHMS;

DATA REDUCTION;

EID: 26944500557     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11503415_12     Document Type: Conference Paper

References (12)

1. K. Azuma. Weighted sums of certain dependent random variables. Tohoku Math. Journal, 3:357-367, 1967.
2. George Bennett. Probability inequalities for the sum of independent random variables. Journal of the American Statistical Association, 57:33-45, 1962.
3. Avrim Blum, Adam Kalai, and John Langford. Beating the hold-out: Bounds for k-fold and progressive cross-validation. In COLT' 99, pages 203-208, 1999.
4. N. Cesa-Bianchi, A. Conconi, and C. Gentile. On the generalization ability of on-line learning algorithms. IEEE Transactions on Information Theory, pages 2050-2057, 2004.
5. Michael Collins. Discriminative training methods for hidden markov models: Theory and experiments with perceptron algorithms. In Proc. EMNLP'02, 2002.
6. Victor H. de la Pẽna. A general class of exponential inequalities for martingales and ratios. The Annals of Probability, 27:537-564, 1999.
7. David A. Freedman. On tail probabilities for martingales. The Annals of Probability, 3:100-118, 1975.
8. Y. Freund and R.E. Schapire. A decision-theoretic generalization of on-line learning and an application to boosting. J. Comput. Syst. Sci., 55(1):119-139, 1997.
9. W. Hoeffding. Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association, 58(301):13-30, March 1963.
10. Nick Littlestone. From on-line to batch learning. In COLT' 89, pages 269-284, 1989.
11. Nick Littlestone and Manfred K. Warmuth. The weighted majority algorithm. Information and Computation, 108:212-261, 1994.
12. Volodya Vovk. Aggregating strategies. In COLT' 90, pages 371-383, 1990.