Measuring the VC-dimension using optimized experimental design

被引:31
作者
Shao, XH [1 ]
Cherkassky, V
Li, W
机构
[1] Univ Minnesota, ECE Dept, Minneapolis, MN 55455 USA
[2] Univ Minnesota, Operat & Management Sci Dept, Minneapolis, MN 55455 USA
关键词
D O I
10.1162/089976600300015222
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
VC-dimension is the measure of model complexity (capacity) used in VC-theory. The knowledge of the VC-dimension of an estimator is necessary for rigorous complexity control using analytic VC generalization bounds. Unfortunately, it is not possible to obtain the analytic estimates of the VC-dimension in most cases. Hence, a recent proposal is to measure the VC-dimension of an estimator experimentally by fitting the theoretical formula to a set of experimental measurements of the frequency of errors on artificially generated data sets of varying sizes (Vapnik, Levin, & Le Cun, 1994). However, it may be difficult to obtain an accurate estimate of the VC-dimension due to the variability of random samples in the experimental procedure proposed by Vapnik et al. (1994). We address this problem by proposing an improved design procedure for specifying the measurement points (i.e., the sample size and the number of repeated experiments at a given sample size). Our approach leads to a nonuniform design structure as opposed to the uniform design structure used in the original article (Vapnik et al., 1994). Our simulation results show that the proposed optimized design structure leads to a more accurate estimation of the VC-dimension using the experimental procedure. The results also show that a more accurate estimation of VC-dimension leads to improved complexity control using analytic VC-generalization bounds and, hence, better prediction accuracy.
引用
收藏
页码:1969 / 1986
页数:18
相关论文
共 8 条
[1]  
Bishop C. M., 1995, NEURAL NETWORKS PATT
[2]   Model complexity control for regression using VC generalization bounds [J].
Cherkassky, V ;
Shao, XH ;
Mulier, FM ;
Vapnik, VN .
IEEE TRANSACTIONS ON NEURAL NETWORKS, 1999, 10 (05) :1075-1089
[3]  
Cherkassky V.S., 1998, LEARNING DATA CONCEP, V1st ed.
[4]  
Cortes C., 1995, THESIS U ROCHESTER
[5]  
Hastie T., 1990, Generalized additive model
[6]   Columnwise-pairwise algorithms with applications to the construction of supersaturated designs [J].
Li, WW ;
Wu, CFJ .
TECHNOMETRICS, 1997, 39 (02) :171-179
[7]   MEASURING THE VC-DIMENSION OF A LEARNING-MACHINE [J].
VAPNIK, V ;
LEVIN, E ;
LECUN, Y .
NEURAL COMPUTATION, 1994, 6 (05) :851-876
[8]  
Vapnik V, 1999, NATURE STAT LEARNING