Stable transductive learning

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

Volumn 4005 LNAI, Issue , 2006, Pages 35-49

  El Yaniv, Ran ^a   Pechyony, Dmitry ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

FUNCTION EVALUATION; INFORMATION ANALYSIS; LEARNING ALGORITHMS; PROBABILITY; SENSITIVITY ANALYSIS;

PERMUTATIONS; TRANSDUCTIVE LEARNING; TRANSDUCTIVE STABILITY;

LEARNING SYSTEMS;

EID: 33746089533     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11776420_6     Document Type: Conference Paper

References (21)

1. K. Azuma. Weighted sums of certain dependent random variables. Tohoku Mathematical Journal, 19:357-367, 1967.
2. M. Belkin, I. Matveeva, and P. Niyogi. Regularization and semi-supervised learning on large graphs. In COLT, pages 624-638, 2004.
3. A. Blum and J. Langford. PAC-MDL Bounds. In COLT, pages 344-357, 2003.
4. O. Bousquet and A. Elisseeff. Stability and generalization. Journal of Machine Learning Research, 2:499-526, 2002.
5. P. Derbeko, R. El-Yaniv, and R. Meir. Explicit learning curves for transduction and application to clustering and compression algorithms. Journal of Artificial Intelligence Research, 22:117-142, 2004.
6. L. Devroye, L. Györfi, and G. Lugosi. A Probabilistic Theory of Pattern Recognition. Springer Verlag, New York, 1996.
7. G.R. Grimmett and D.R. Stirzaker. Probability and Random Processes. Oxford Science Publications, 1995. Second edition.
8. T.M. Huang and V. Kecman. Performance comparisons of semi-supervised learning algorithms. In ICML Workshop "Learning with Partially Classified Training Data", pages 45-49, 2005.
9. D. Hush, C. Scovel, and I. Steinwart. Stability of unstable learning algorithms. Technical Report LA-UR-03-4845, Los Alamos National Laboratory, 2003.
10. M. Kearns and D. Ron. Algorithmic stability and sanity-check bounds for leave-one-out cross-validation. Neural Computation, 11(6):1427-1453, 1999.
11. S. Kutin. Extensions to McDiarmid's inequality when differences are bounded with high probability. Technical Report TR-2002-04, University of Chicago, 2002.
12. S. Kutin and P. Niyogi. Almost-everywhere algorithmic stability and generalization error. In UAI, pages 275-282, 2002.
13. M. Ledoux. The concentration of measure phenomenon. Number 89 in Mathematical Surveys and Monographs. American Mathematical Society, 2001.
14. G.S. Manku, S. Rajagopalan, and B.G. Lindsay. Approximate medians and other quantiles in one pass and with limited memory. In SIGMOD, volume 28, pages 426-435, 1998.
15. S. Mukherjee, P. Niyogi, T. Poggio, and R. Rifkin. Statistical learning: Stability is sufficient for generalization and necessary and sufficient for consistency of empirical risk minimization. Technical Report AI Memo 2002-024, MIT, 2004.
16. A. Rakhlin, S. Mukherjee, and T. Poggio. Stability results in learning theory. Analysis and Applications, 3(4):397-419, 2005.
17. M. Talagrand. Majorizing measures: the generic chaining. Springer Verlag, 2005.
18. V. N. Vapnik. Estimation of Dependences Based on Empirical Data. Springer Verlag, New York, 1982.
19. V. N. Vapnik. Statistical Learning Theory. Wiley Interscience, New York, 1998.
20. D. Zhou, O. Bousquet, T.N. Lal, J. Weston, and B. Scholkopf. Learning with local and global consistency. In NIPS, pages 321-328, 2003.
21. X. Zhu, Z. Ghahramani, and J.D. Lafferty. Semi-supervised learning using gaussian fields and harmonic functions. In ICML, pages 912-919, 2003.