Generalization Bounds for Linear Learning Algorithms
暂无分享,去创建一个
[1] Dan Roth,et al. Learning Coherent Concepts , 2001, ALT.
[2] Nello Cristianini,et al. An introduction to Support Vector Machines , 2000 .
[3] Santosh S. Vempala,et al. An algorithmic theory of learning: Robust concepts and random projection , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[4] Nello Cristianini,et al. Further results on the margin distribution , 1999, COLT '99.
[5] John Shawe-Taylor,et al. Classification Accuracy Based on Observed Margin , 1998, Algorithmica.
[6] Dan Roth,et al. Learning to Resolve Natural Language Ambiguities: A Unified Approach , 1998, AAAI/IAAI.
[7] Manfred K. Warmuth,et al. The Perceptron Algorithm Versus Winnow: Linear Versus Logarithmic Mistake Bounds when Few Input Variables are Relevant (Technical Note) , 1997, Artif. Intell..
[8] Manfred K. Warmuth,et al. The perceptron algorithm vs. Winnow: linear vs. logarithmic mistake bounds when few input variables are relevant , 1995, COLT '95.
[9] Dana Ron,et al. An Experimental and Theoretical Comparison of Model Selection Methods , 1995, COLT '95.
[10] Robert E. Schapire,et al. Efficient distribution-free learning of probabilistic concepts , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[11] David Haussler,et al. Learnability and the Vapnik-Chervonenkis dimension , 1989, JACM.
[12] W. B. Johnson,et al. Extensions of Lipschitz mappings into Hilbert space , 1984 .