Measuring the VC-dimension of a learning machine
Neural Computation
Prediction of generalization ability in learning machines
Prediction of generalization ability in learning machines
The nature of statistical learning theory
The nature of statistical learning theory
Neural Networks for Pattern Recognition
Neural Networks for Pattern Recognition
Learning from Data: Concepts, Theory, and Methods
Learning from Data: Concepts, Theory, and Methods
Model complexity control for regression using VC generalization bounds
IEEE Transactions on Neural Networks
Model complexity control and statisticallearning theory
Natural Computing: an international journal
Automatic Hyperparameter Tuning for Support Vector Machines
ICANN '02 Proceedings of the International Conference on Artificial Neural Networks
Comparison of model selection for regression
Neural Computation
Penalty functions for genetic programming algorithms
ICCSA'11 Proceedings of the 2011 international conference on Computational science and its applications - Volume Part I
SLIT: designing complexity penalty for classification and regression trees using the SRM principle
ISNN'06 Proceedings of the Third international conference on Advances in Neural Networks - Volume Part I
| Hi-index | 0.01 |
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.