Probabilities of discrepancy between minima of cross-validation, Vapnik bounds and true risks

Anthony, M. and Shawe-Taylor, J. (1993). A result of Vapnik with applications, Discrete Applied Mathematics 48(3): 207-217.10.1016/0166-218X(93)90126-9Search in Google Scholar

Bartlett, P. (1998). The sample complexity of pattern classification with neural networks: The size of the weights is more important than the size of the network, IEEE Transactions on Information Theory 44(2): 525-536.10.1109/18.661502Search in Google Scholar

Bartlett, P., Kulkarni, S. and Posner, S. (1997). Covering numbers for real-valued function classes, IEEE Transactions on Information Theory 43(5): 1721-1724.10.1109/18.623181Search in Google Scholar

Bartlett, P. and Tewari, A. (2007). Sample complexity of policy search with known dynamics, Advances in Neural Information Processing Systems 19: 97-104.Search in Google Scholar

Berry, A. (1941). The accuracy of the Gaussian approximation to the sum of independent variates, Transactions of the American Mathematical Society 49(1): 122-136.10.1090/S0002-9947-1941-0003498-3Search in Google Scholar

Bousquet, L., Boucheron S. and Lugosi G. (2004). Introduction to Statistical Learning Theory, Advanced Lectures in Machine Learning, Springer, Heidelberg, pp. 169-207.Search in Google Scholar

Cherkassky, V. and Mulier, F. (1998). Learning from Data, John Wiley & Sons, Hoboken, NJ.Search in Google Scholar

DasGupta, A. (2008). Asymptotic Theory of Statistics and Probability, Springer, New York, NY.Search in Google Scholar

Devroye, L., Gyorfi, L. and Lugosi, G. (1996). A Probabilistic Theory of Pattern Recognition, Springer-Verlag, New York, NY.10.1007/978-1-4612-0711-5Search in Google Scholar

Efron, B. and Tibshirani, R. (1993). An Introduction to Bootstrap, Chapman & Hall, London.10.1007/978-1-4899-4541-9Search in Google Scholar

Esséen, C. (1942). On the Liapounoff limit of error in the theory of probability, Arkiv fdr Matematik, Astronomi och Fysik 28A(9): 1-19.Search in Google Scholar

Esséen, C. (1956). A moment inequality with an application to the central limit theorem, Skand. Aktuarietidskr. 39: 160-170.Search in Google Scholar

Fu, W., Caroll, R. and Wang, S. (2005). Estimating misclassification error with small samples via bootstrap cross-validation, Bioinformatics 21(9): 1979-1986.10.1093/bioinformatics/bti29415691862Search in Google Scholar

Graham, R., Knuth, D. and Patashnik, O. (2002). Matematyka konkretna (Concrete Mathematics. A Foundation for Computer Science), PWN, Warsaw.Search in Google Scholar

Hasterberg, T., Choi, N. H., Meier, L. and Fraley C. (2008). Least angle and l1 penalized regression: A review, Statistics Surveys 2: 61-93.10.1214/08-SS035Search in Google Scholar

Hellman, M. and Raviv, J. (1970). Probability of error, equivocation and the Chernoff bound, IEEE Transactions on Information Theory 16(4): 368-372.10.1109/TIT.1970.1054466Search in Google Scholar

Hjorth, J. (1994). Computer Intensive Statistical Methods Validation, Model Selection, and Bootstrap, Chapman & Hall, London.Search in Google Scholar

Knuth, D. (1997). The Art of Computer Programming, Addison-Wesley, Reading, MA.Search in Google Scholar

Kohavi, R. (1995). A study of cross-validation and boostrap for accuracy estimation and model selection, International Joint Conference on Artificial Intelligence (IJCAI), Montreal, Quebec, Canada, pp. 1137-1143.Search in Google Scholar

Korzeń, M. and Klęsk, P. (2008). Maximal margin estimation with perceptron-like algorithm, in L. Rutkowski, R. Scherer, R. Tadeusiewicz, L. A. Zadeh and J. Żurada (Eds.), Artificial Intelligence and Soft Computing—ICAISC 2008, Lecture Notes in Artificial Intelligence, Vol. 5097, Springer, Berlin, Heidelberg, pp. 597-608.10.1007/978-3-540-69731-2_58Search in Google Scholar

Krzyżak, A., Kohler M., and Schäfer D. (2000). Application of structural risk minimization to multivariate smoothing spline regression estimates, Bernoulli 8(4): 475-489.Search in Google Scholar

Ng, A. (2004). Feature selection, l₁ vs. l₂ regularization, and rotational invariance, ACM International Conference on Machine Learning, Banff, Alberta, Canada, Vol. 69, pp. 78-85.Search in Google Scholar

Schmidt, J., Siegel, A. and Srinivasan, A. (1995). Chernoff-Hoeffding bounds for applications with limited independence, SIAM Journal on Discrete Mathematics 8(2): 223-250.10.1137/S089548019223872XSearch in Google Scholar

Shawe-Taylor, J., Bartlett, P., Williamson, R. and Anthony, M. (1996). A framework for structural risk minimization, COLT, ACM Press, New York, NY, pp. 68-76.Search in Google Scholar

Shevtsova, I. (2007). Sharpening of the upper bound of the absolute constant in the Berry-Esséen inequality, Theory of Probability and its Applications 51(3): 549-553.10.1137/S0040585X97982591Search in Google Scholar

van Beek, P. (1972). An application of Fourier methods to the problem of sharpening the Berry-Esséen inequality, Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete 23: 187-196.10.1007/BF00536558Search in Google Scholar

Vapnik, V. (1995). The Nature of Statistical Learning Theory, Springer, New York, NY.10.1007/978-1-4757-2440-0Search in Google Scholar

Vapnik, V. (1998). Statistical Learning Theory: Inference from Small Samples, Wiley, New York, NY.Search in Google Scholar

Vapnik, V. (2006). Estimation of Dependencies Based on Empirical Data, Information Science & Statistics, Springer, New York, NY.10.1007/0-387-34239-7Search in Google Scholar

Vapnik, V. and Chervonenkis, A. (1968). On the uniform convergence of relative frequencies of events to their probabilities, Doklady Akademii Nauk 9(4): 915-918.Search in Google Scholar

Vapnik, V. and Chervonenkis, A. (1989). The necessary and sufficient conditions for the consistency of the method of empirical risk minimization, Yearbook of the Academy of Sciences of the USSR on Recognition, Classification and Forecasting, Vol. 2, pp. 217-249.Search in Google Scholar

Weiss, S. and Kulikowski, C. (1991). Computer Systems That Learn, Morgan Kauffman Publishers, San Francisco, CA.Search in Google Scholar

Zhang, T. (2002). Covering number bounds of certain regularized linear function classes, Journal of Machine Learning Research 2: 527-550.Search in Google Scholar