Skip to main content
Top

2015 | OriginalPaper | Chapter

9. Making Vapnik–Chervonenkis Bounds Accurate

Author : Léon Bottou

Published in: Measures of Complexity

Publisher: Springer International Publishing

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

This chapter shows how returning to the combinatorial nature of the Vapnik–Chervonenkis bounds provides simple ways to increase their accuracy, take into account properties of the data and of the learning algorithm, and provide empirically accurate estimates of the deviation between training error and test error.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
1.
go back to reference Bloom, D.: A birthday problem. Am. Math. Mon. 80, 1141–1142 (1973) Bloom, D.: A birthday problem. Am. Math. Mon. 80, 1141–1142 (1973)
2.
go back to reference Bottou, L., Cortes, C., Denker, J.S., Drucker, H., Guyon, I., Jackel, L.D., LeCun, Y., Muller, U.A., Säckinger, E., Simard, P., Vapnik, V.N.: Comparison of classifier methods: a case study in handwritten digit recognition. In: Proceedings of the 12th IAPR International Conference on Pattern Recognition, vol. 2, pp. 77–82. IEEE (1994) Bottou, L., Cortes, C., Denker, J.S., Drucker, H., Guyon, I., Jackel, L.D., LeCun, Y., Muller, U.A., Säckinger, E., Simard, P., Vapnik, V.N.: Comparison of classifier methods: a case study in handwritten digit recognition. In: Proceedings of the 12th IAPR International Conference on Pattern Recognition, vol. 2, pp. 77–82. IEEE (1994)
5.
go back to reference Bousquet, O.: Concentration inequalities and empirical processes theory applied to the analysis of learning algorithms. Ph.D. thesis, École Polytechnique (2002) Bousquet, O.: Concentration inequalities and empirical processes theory applied to the analysis of learning algorithms. Ph.D. thesis, École Polytechnique (2002)
6.
go back to reference Dudley, R.M.: The sizes of compact subsets of Hilbert space and continuity of Gaussian processes. J. Funct. Anal. 1(3), 290–330 (1967)MATHMathSciNetCrossRef Dudley, R.M.: The sizes of compact subsets of Hilbert space and continuity of Gaussian processes. J. Funct. Anal. 1(3), 290–330 (1967)MATHMathSciNetCrossRef
7.
8.
go back to reference Haussler, D.: Sphere packing numbers for subsets of the boolean \(n\)-cube with bounded Vapnik-Chervonenkis dimension. J. Comb. Theory Ser. A 69(2), 217–232 (1995)MATHMathSciNetCrossRef Haussler, D.: Sphere packing numbers for subsets of the boolean \(n\)-cube with bounded Vapnik-Chervonenkis dimension. J. Comb. Theory Ser. A 69(2), 217–232 (1995)MATHMathSciNetCrossRef
9.
go back to reference Kanerva, P.: Sparse Distributed Memory. MIT Press, Cambridge (1988)MATH Kanerva, P.: Sparse Distributed Memory. MIT Press, Cambridge (1988)MATH
10.
go back to reference LeCun, Y., Bottou, L., Bengio, Y., Haffner, P.: Gradient based learning applied to document recognition. Proc. IEEE 86(11), 2278–2324 (1998)CrossRef LeCun, Y., Bottou, L., Bengio, Y., Haffner, P.: Gradient based learning applied to document recognition. Proc. IEEE 86(11), 2278–2324 (1998)CrossRef
11.
go back to reference LeCun, Y., Bottou, L., Orr, G.B., Müller, K.R.: Efficient backprop. In: Orr, G.B., Müller, K.R. (eds.) Neural Networks, Tricks of the Trade. Lecture Notes in Computer Science, vol. 1524. Springer, Berlin (1998) LeCun, Y., Bottou, L., Orr, G.B., Müller, K.R.: Efficient backprop. In: Orr, G.B., Müller, K.R. (eds.) Neural Networks, Tricks of the Trade. Lecture Notes in Computer Science, vol. 1524. Springer, Berlin (1998)
12.
go back to reference Shawe-Taylor, J., Bartlett, P., Williamson, R., Anthony, M.: Structural risk minimization over data-dependent hierarchies. IEEE Trans. Inf. Theory 44(5), 1926–1940 (1998)MATHMathSciNetCrossRef Shawe-Taylor, J., Bartlett, P., Williamson, R., Anthony, M.: Structural risk minimization over data-dependent hierarchies. IEEE Trans. Inf. Theory 44(5), 1926–1940 (1998)MATHMathSciNetCrossRef
13.
go back to reference Talagrand, M.: The Generic Chaining: Upper and Lower Bounds of Stochastic Processes. Springer, Berlin (2005) Talagrand, M.: The Generic Chaining: Upper and Lower Bounds of Stochastic Processes. Springer, Berlin (2005)
14.
15.
go back to reference Vapnik, V.N.: Estimation of Dependences based on Empirical Data. Springer Series in Statistics. Springer, Berlin (1982) Vapnik, V.N.: Estimation of Dependences based on Empirical Data. Springer Series in Statistics. Springer, Berlin (1982)
16.
go back to reference Vapnik, V.N.: Statistical Learning Theory. Wiley, New York (1998)MATH Vapnik, V.N.: Statistical Learning Theory. Wiley, New York (1998)MATH
17.
go back to reference Vapnik, V.N., Chervonenkis, A.Y.: A note on one class of perceptrons. Autom. Remote Control 25(1), 774–780 (1964) Vapnik, V.N., Chervonenkis, A.Y.: A note on one class of perceptrons. Autom. Remote Control 25(1), 774–780 (1964)
18.
go back to reference Vapnik, V.N., Chervonenkis, A.Y.: On the uniform convergence of relative frequencies of events to their probabilities. Proc. USSR Acad. Sci. 181(4), 781–783 (1968) (English translation: Sov. Math. Dokl. 9(4), 915–918 (1968)) Vapnik, V.N., Chervonenkis, A.Y.: On the uniform convergence of relative frequencies of events to their probabilities. Proc. USSR Acad. Sci. 181(4), 781–783 (1968) (English translation: Sov. Math. Dokl. 9(4), 915–918 (1968))
19.
go back to reference Vapnik, V.N., Chervonenkis, A.Y.: On the uniform convergence of relative frequencies of events to their probabilities. Theory Probab. Appl. 16(2), 264–281 (1971) (This volume, Chap. 3) Vapnik, V.N., Chervonenkis, A.Y.: On the uniform convergence of relative frequencies of events to their probabilities. Theory Probab. Appl. 16(2), 264–281 (1971) (This volume, Chap. 3)
20.
go back to reference Vapnik, V.N., Chervonenkis, A.Y.: Теория распознавания образов: Статистические проблемы обучения (Theory of Pattern Recognition: Statistical Problems of Learning: in Russian). Nauka, Moscow (1974). German translation: Theorie der Zeichenerkennung, transl. K.G. Stöckel and B. Schneider, ed. S. Unger and B. Fritzsch, Akademie Verlag, Berlin (1979) Vapnik, V.N., Chervonenkis, A.Y.: Теория распознавания образов: Статистические проблемы обучения (Theory of Pattern Recognition: Statistical Problems of Learning: in Russian). Nauka, Moscow (1974). German translation: Theorie der Zeichenerkennung, transl. K.G. Stöckel and B. Schneider, ed. S. Unger and B. Fritzsch, Akademie Verlag, Berlin (1979)
21.
go back to reference Vapnik, V.N., Lerner, A.Y.: Pattern recognition using generalized portrait method. Autom. Remote Control 24(6), 774–780 (1963) Vapnik, V.N., Lerner, A.Y.: Pattern recognition using generalized portrait method. Autom. Remote Control 24(6), 774–780 (1963)
22.
go back to reference Vapnik, V.N., Levin, E., LeCun, Y.: Measuring the VC-dimension of a learning machine. Neural Comput. 6(5), 851–876 (1994)CrossRef Vapnik, V.N., Levin, E., LeCun, Y.: Measuring the VC-dimension of a learning machine. Neural Comput. 6(5), 851–876 (1994)CrossRef
23.
go back to reference Vorontsov, K.V.: Combinatorial substantiation of learning algorithms. Comput. Math. Math. Phys. 44(11), 1997–2009 (2004)MathSciNet Vorontsov, K.V.: Combinatorial substantiation of learning algorithms. Comput. Math. Math. Phys. 44(11), 1997–2009 (2004)MathSciNet
24.
go back to reference Vorontsov, K.V.: Exact combinatorial bounds on the probability of overfitting for empirical risk minimization. Pattern Recognit. Image Anal. Adv. Math. Theory Appl. 20(3), 269–285 (2010) Vorontsov, K.V.: Exact combinatorial bounds on the probability of overfitting for empirical risk minimization. Pattern Recognit. Image Anal. Adv. Math. Theory Appl. 20(3), 269–285 (2010)
Metadata
Title
Making Vapnik–Chervonenkis Bounds Accurate
Author
Léon Bottou
Copyright Year
2015
DOI
https://doi.org/10.1007/978-3-319-21852-6_9

Premium Partner