Generalization error bounds using unlabeled data

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

Volumn 3559 LNAI, Issue , 2005, Pages 127-142

  Kääriäinen, Matti ^a  

^a UNIVERSITY OF HELSINKI   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; CLASSIFIERS; DATA REDUCTION; LEARNING SYSTEMS; MATHEMATICAL TRANSFORMATIONS; PROBABILITY;

ACTIVE LEARNING; CROSS-VALIDATION; DETERMINISTIC CLASSIFIERS; SEMI-SUPERVISED BOUND;

ERROR ANALYSIS;

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

References (19)

1. Madani, O., Pennock, D.M., Flake, G.W.: Co-validation: Using model disagreement to validate classification algorithms. In: NIPS 2004 Preproceedings. (2004)
2. Balcan, M.F., Blum, A.: A PAC-style model for learning from labeled and unlabeled data (2004) Draft.
3. Castelli, V., Cover, T.M.: On the exponential value of labeled samples. Pattern Recognition Letters 16 (1995) 105-111
4. Ratsaby, J., Venkatesh, S.S.: Learning from a mixture of labeled and unlabeled examples with parametric side information. In: Proceedings of the 8th Annual Conference on Computational Learning Theory (COLT'95), New York, NY, USA, ACM Press (1995) 412-417
5. Vapnik, V.N.: Statistical Learning Theory. John Wiley and Sons, New York (1998)
6. Schuurmans, D., Southey, F.: Metric-based methods for adaptive model selection and regularization. Machine Learning 42 (2002) 51-84
7. Bengio, Y., Chapados, N.: Extensions to metric-based model selection. Journal of Machine Learning Research 3 (2003) 1209-1227
8. Ben-David, S., Itai, A., Kushilevitz, E.: Learning by distances. Information and Computation 117 (1995) 240-250
9. Bartlett, P.L., Mendelson, S.: Rademacher and Gaussian complexities: Risk bounds and structural results. Journal of Machine Learning Research 3 (2002) 463-482
10. Kääriäinen, M.: Relating the Rademacher and VC bounds. Technical Report Report C-2004-57, Department of Computer Science, Series of Publications C (2004)
11. Valiant, L.G.: A theory of the learnable. Communications of the ACM 27 (1984) 1134-1142
12. McAllester, D.A.: PAC-Bayesian stochastic model selection. Machine Learning 51 (2003) 5-21
13. Cesa-Bianchi, N., Gentile, C.: Improved risk tail bounds for on-line algorithms (2004) A presentation in the (Ab) use of Bounds workshop.
14. Blum, A., Kalai, A., Langford, J.: Beating the hold-out: bounds for k-fold and progressive cross-validation. In: Proceedings of the 12th Annual Conference on Computational Learning Theory, New York, NY, ACM Press (1999) 203-208
15. Devroye, L., Györfi, L., Lugosi, G.: A Probabilistic Theory of Pattern Recognition. Volume 31 of Applications of Mathematics. Springer, Berlin Heidelberg New York (1996)
16. Langford, J.: Practical prediction theory for classification (2003) A tutorial presented at ICML 2003. Available at http://hunch.net/~jl/projects/ prediction_bounds/tutorial/tutorial.pdf.
17. Kutin, S., Niyogi, P.: Almost-everywhere algorithmic stability and generalization error. In: Proceedings of Uncertainty in AI. (2002) 275-282
18. Joachims, T.: Making large-scale SVM learning practical. In Schölkopf, B., Burges, C., Smola, A., eds.: Advances in Kernel Methods - Support Vector Learning. MIT-Press (1999)
19. Seeger, M.: Bayesian Gaussian Process Models: PAC-Bayesian Generalisation Error Bounds and Sparse Approximations. PhD thesis, University of Edinburgh (2003)