Sample Complexity of Classifiers Taking Values in Q, Application to Multi-Class SVMs

被引:8
作者
Guermeur, Yann [1 ]
机构
[1] LORIA, CNRS, F-54506 Vandoeuvre Les Nancy, France
关键词
Generalized VC dimensions; Multi-class support vector machines; Rademacher complexity; Sample complexity; CLASSIFICATION;
D O I
10.1080/03610920903140288
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
Bounds on the risk play a crucial role in statistical learning theory. They usually involve as capacity measure of the model studied the VC dimension or one of its extensions. In classification, such oVC dimensionso exist for models taking values in {0, 1}, [[1, Q]], and . We introduce the generalizations appropriate for the missing case, the one of models with values in Q. This provides us with a new guaranteed risk for M-SVMs. For those models, a sharper bound is obtained by using the Rademacher complexity.
引用
收藏
页码:543 / 557
页数:15
相关论文
共 18 条
[1]   Scale-sensitive dimensions, uniform convergence, and learnability [J].
Alon, N ;
BenDavid, S ;
CesaBianchi, N ;
Haussler, D .
JOURNAL OF THE ACM, 1997, 44 (04) :615-631
[2]  
[Anonymous], 2004, KERNEL METHODS PATTE
[3]  
[Anonymous], 1998, CSDTR9804 U LOND DEP
[4]  
[Anonymous], 2001, Journal of Machine Learning Research
[5]  
[Anonymous], 2004, REPRODUCING K HILBER
[6]  
Bartlett P, 1999, ADVANCES IN KERNEL METHODS, P43
[7]   The sample complexity of pattern classification with neural networks: The size of the weights is more important than the size of the network [J].
Bartlett, PL .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1998, 44 (02) :525-536
[8]   CHARACTERIZATIONS OF LEARNABILITY FOR CLASSES OF (O,...,N)-VALUED FUNCTIONS [J].
BENDAVID, S ;
CESABIANCHI, N ;
HAUSSLER, D ;
LONG, PM .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1995, 50 (01) :74-86
[9]   Theory of classification: A survey of some recent advances [J].
Boucheron, Stéphane ;
Bousquet, Olivier ;
Lugosi, Gábor .
ESAIM - Probability and Statistics, 2005, 9 :323-375
[10]  
GUERMEUR Y, 2005, INT S APPL STOCH MOD, P507