scholarly journals Automatic model complexity control using marginalized discriminative growth functions

Author(s):  
X. Liu ◽  
M.J.F. Gales
1999 ◽  
Vol 10 (5) ◽  
pp. 1075-1089 ◽  
Author(s):  
V. Cherkassky ◽  
Xuhui Shao ◽  
F.M. Mulier ◽  
V.N. Vapnik

2008 ◽  
Vol 44 (12) ◽  
Author(s):  
G. Schoups ◽  
N. C. van de Giesen ◽  
H. H. G. Savenije

2000 ◽  
Vol 12 (8) ◽  
pp. 1969-1986 ◽  
Author(s):  
Xuhui Shao ◽  
Vladimir Cherkassky ◽  
William Li

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.


Sign in / Sign up

Export Citation Format

Share Document