@article{AIHPB_2003__39_6_943_0, author = {Koltchinskii, Vladimir}, title = {Bounds on margin distributions in learning problems}, journal = {Annales de l'I.H.P. Probabilit\'es et statistiques}, volume = {39}, year = {2003}, pages = {943-978}, doi = {10.1016/S0246-0203(03)00023-2}, mrnumber = {2010392}, zbl = {1031.60017}, language = {en}, url = {http://dml.mathdoc.fr/item/AIHPB_2003__39_6_943_0} }
Koltchinskii, Vladimir. Bounds on margin distributions in learning problems. Annales de l'I.H.P. Probabilités et statistiques, Tome 39 (2003) pp. 943-978. doi : 10.1016/S0246-0203(03)00023-2. http://gdmltest.u-ga.fr/item/AIHPB_2003__39_6_943_0/
[1] Neural Network Learning: Theoretical Foundations, Cambridge University Press, 1999. | MR 1741038 | Zbl 0968.68126
, ,[2] The sample complexity of pattern classification with neural networks: the size of the weights is more important than the size of the network, IEEE Trans. Inform. Theory 44 (1998) 525-536. | MR 1607706 | Zbl 0901.68177
,[3] Support vector networks, Machine Learning 20 (1995) 273-297. | Zbl 0831.68098
, ,[4] A Probabilistic Theory of Pattern Recognition, Springer-Verlag, New York, 1996. | MR 1383093 | Zbl 0853.68150
, , ,[5] Uniform Central Limit Theorems, Cambridge University Press, 1999. | MR 1720712 | Zbl 0951.60033
,[6] E. Giné, V. Koltchinskii, J. Wellner, Ratio limit theorems for empirical processes, Preprint, 2003. | MR 2073436
[7] Data-dependent margin-based generalization bounds for classification, in: , (Eds.), Proc. of 14th Annual Conference on Computational Learning Theory, COLT2001, Lecture Notes in Artificial Intelligence, Springer, New York, 2001, pp. 368-384. | MR 2042047 | Zbl 0992.68091
, , ,[8] Rademacher processes and bounding the risk of function learning, in: , , (Eds.), High Dimensional Probability II, Birkhäuser, Boston, 2000, pp. 444-459. | MR 1857339 | Zbl 1106.68385
, ,[9] Empirical margin distributions and bounding the generalization error of combined classifiers, Ann. Statist. 30 (2002) 1-50. | MR 1892654 | Zbl 1012.62004
, ,[10] Some new bounds on the generalization error of combined classifiers, in: , , (Eds.), Proc. of NIPS'2000, Advances in Neural Information Processing Systems, 13, MIT Press, 2001, pp. 245-251, URL: , http://www.boosting.org/.
, , ,[11] Further explanation of the effectiveness of voting methods: the game between margins and weights, in: , (Eds.), Proc. of 14th Annual Conference on Computational Learning Theory, COLT2001, Lecture Notes in Artif. Intell., Springer, New York, 2001, pp. 241-255. | MR 2042039 | Zbl 0992.68511
, , ,[12] Bounding the generalization error of convex combinations of classifiers: balancing the dimensionality and the margins, Ann. Appl. Probab. 13 (1) (2003) 213-252. | MR 1951998 | Zbl 1073.62535
, , ,[13] Probability in Banach Spaces, Springer-Verlag, New York, 1991. | MR 1102015 | Zbl 0748.60004
, ,[14] About the constants in Talagrand's concentration inequalities for empirical processes, Ann. Probab. 28 (2000) 863-885. | MR 1782276 | Zbl 01905939
,[15] Some applications of concentration inequalities to statistics, Ann. Fac. Sci. Tolouse (IX) (2000) 245-303. | Numdam | MR 1813803 | Zbl 0986.62002
,[16] Boosting the margin: a new explanation of effectiveness of voting methods, Ann. Statist. 26 (1998) 1651-1687. | MR 1673273 | Zbl 0929.62069
, , , ,[17] A new look at independence, Ann. Probab. 24 (1996) 1-34. | MR 1387624 | Zbl 0858.60019
,[18] New concentration inequalities in product spaces, Invent. Math. 126 (1996) 505-563. | MR 1419006 | Zbl 0893.60001
,[19] A. Tsybakov, Optimal aggregation of classifiers in statistical learning, Preprint, 2002. | MR 2051002
[20] Weak Convergence and Empirical Processes. With Applications to Statistics, Springer-Verlag, New York, 1996. | MR 1385671 | Zbl 0862.60002
, ,[21] Statistical Learning Theory, Wiley, New York, 1998. | MR 1641250 | Zbl 0935.62007
,