Skip to main content

2013 | OriginalPaper | Buchkapitel

7. On Learnability, Complexity and Stability

verfasst von : Silvia Villa, Lorenzo Rosasco, Tomaso Poggio

Erschienen in: Empirical Inference

Verlag: Springer Berlin Heidelberg

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

We considerStability—( Learnability—( the fundamental question of learnability of a hypothesis class in the supervised learningSupervised learning setting and in the general learningGeneral learning setting introduced by Vladimir Vapnik. We survey classic results characterizing learnability in terms of suitable notions of complexity, as well as more recent results that establish the connection between learnability and stability of a learning algorithm.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

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!

Fußnoten
1
ConsistencyConsistency can be defined with respect to other convergence notions for random variables. If the loss function is bounded, convergence in probability is equivalent to convergence in expectation.
 
2
We say that a learning algorithm A is symmetric if it does not depend on the order of the points in z n .
 
3
Note that this construction is not possible in classification or in regression with the square loss.
 
Literatur
1.
Zurück zum Zitat Alon, N., Ben-David, S., Cesa-Bianchi, N., Haussler, D.: Scale-sensitive dimensions, uniform convergence, and learnability. J. ACM 44(4), 615–631 (1997)MathSciNetCrossRefMATH Alon, N., Ben-David, S., Cesa-Bianchi, N., Haussler, D.: Scale-sensitive dimensions, uniform convergence, and learnability. J. ACM 44(4), 615–631 (1997)MathSciNetCrossRefMATH
2.
Zurück zum Zitat Anthony, M., Bartlett, P.L.: Neural network learning: theoretical foundations. Cambridge University Press, Cambridge (1999)CrossRefMATH Anthony, M., Bartlett, P.L.: Neural network learning: theoretical foundations. Cambridge University Press, Cambridge (1999)CrossRefMATH
3.
Zurück zum Zitat Bartlett, P., Long, P., Williamson, R.: Fat-shattering and the learnability of real-valued functions. J. Comput. Syst. Sci. 52, 434–452 (1996)MathSciNetCrossRefMATH Bartlett, P., Long, P., Williamson, R.: Fat-shattering and the learnability of real-valued functions. J. Comput. Syst. Sci. 52, 434–452 (1996)MathSciNetCrossRefMATH
4.
Zurück zum Zitat Bousquet, O., Elisseeff, A.: Stability and generalization. J. Mach. Learn. Res. 2, 499–526 (2002)MathSciNetMATH Bousquet, O., Elisseeff, A.: Stability and generalization. J. Mach. Learn. Res. 2, 499–526 (2002)MathSciNetMATH
5.
Zurück zum Zitat Daniely, A., Sabato, S., Ben-David, S., Shalev-Shwartz, S.: Multiclass learnability and the ERM principle. J. Mach. Learn. Res. Proc. Track 19, 207–232 (2011) Daniely, A., Sabato, S., Ben-David, S., Shalev-Shwartz, S.: Multiclass learnability and the ERM principle. J. Mach. Learn. Res. Proc. Track 19, 207–232 (2011)
6.
Zurück zum Zitat Devroye, L., Györfi, L., Lugosi, G.: A Probabilistic Theory of Pattern Recognition. Applications of Mathematics 31. Springer, New York (1996) Devroye, L., Györfi, L., Lugosi, G.: A Probabilistic Theory of Pattern Recognition. Applications of Mathematics 31. Springer, New York (1996)
7.
Zurück zum Zitat Dudley, R., Giné, E., Zinn, J.: Uniform and universal Glivenko-Cantelli classes. J. Theor. Prob. 4, 485–510 (1991)CrossRefMATH Dudley, R., Giné, E., Zinn, J.: Uniform and universal Glivenko-Cantelli classes. J. Theor. Prob. 4, 485–510 (1991)CrossRefMATH
8.
Zurück zum Zitat Engl, H.W., Hanke, M., Neubauer, A.: Regularization of Inverse Problems. Mathematics and Its Applications, vol. 375. Kluwer, Dordrecht (1996) Engl, H.W., Hanke, M., Neubauer, A.: Regularization of Inverse Problems. Mathematics and Its Applications, vol. 375. Kluwer, Dordrecht (1996)
9.
Zurück zum Zitat Kearns, M.J., Schapire, R.E.: Efficient distribution-free learning of probabilistic concepts. In: Computational Learning Theory and Natural Learning Systems. Bradford Books, vol. I, pp. 289–329. MIT, Cambridge (1994) Kearns, M.J., Schapire, R.E.: Efficient distribution-free learning of probabilistic concepts. In: Computational Learning Theory and Natural Learning Systems. Bradford Books, vol. I, pp. 289–329. MIT, Cambridge (1994)
10.
Zurück zum Zitat Kutin, S., Niyogi, P.: Almost-everywhere algorithmic stability and generalization error. Technical report TR-2002-03, Department of Computer Science, The University of Chicago (2002) Kutin, S., Niyogi, P.: Almost-everywhere algorithmic stability and generalization error. Technical report TR-2002-03, Department of Computer Science, The University of Chicago (2002)
11.
Zurück zum Zitat Mukherjee, S., Niyogi, P., Poggio, T., Rifkin, R.: Learning theory: stability is sufficient for generalization and necessary and sufficient for consistency of empirical risk minimization. Adv. Comput. Math. 25(1–3), 161–193 (2006)MathSciNetCrossRefMATH Mukherjee, S., Niyogi, P., Poggio, T., Rifkin, R.: Learning theory: stability is sufficient for generalization and necessary and sufficient for consistency of empirical risk minimization. Adv. Comput. Math. 25(1–3), 161–193 (2006)MathSciNetCrossRefMATH
12.
Zurück zum Zitat Poggio, T., Rifkin, R., Mukherjee, S., Niyogi, P.: General conditions for predictivity in learning theory. Nature 428, 419–422 (2004)CrossRef Poggio, T., Rifkin, R., Mukherjee, S., Niyogi, P.: General conditions for predictivity in learning theory. Nature 428, 419–422 (2004)CrossRef
13.
Zurück zum Zitat Rakhlin, A., Sridharan, K., Tewari, A.: Online learning: beyond regret. J. Mach. Learn. Res. Proc. Track 19, 559–594 (2011) Rakhlin, A., Sridharan, K., Tewari, A.: Online learning: beyond regret. J. Mach. Learn. Res. Proc. Track 19, 559–594 (2011)
14.
Zurück zum Zitat Shalev-Shwartz, S., Shamir, O., Srebro, N., Sridharan, K.: Learnability, stability and uniform convergence. J. Mach. Learn. Res. 11, 2635–2670 (2010)MathSciNetMATH Shalev-Shwartz, S., Shamir, O., Srebro, N., Sridharan, K.: Learnability, stability and uniform convergence. J. Mach. Learn. Res. 11, 2635–2670 (2010)MathSciNetMATH
15.
Zurück zum Zitat Steinwart, I., Christmann, A.: Support Vector Machines. Information Science and Statistics. Springer, New York (2008)MATH Steinwart, I., Christmann, A.: Support Vector Machines. Information Science and Statistics. Springer, New York (2008)MATH
16.
17.
Zurück zum Zitat Vapnik, V.N., Chervonenkis, A.Y.: Theory of uniform convergence of frequencies of events to their probabilities and problems of search for an optimal solution from empirical data. Avtomatika i Telemekhanika 2, 42–53 (1971)MathSciNet Vapnik, V.N., Chervonenkis, A.Y.: Theory of uniform convergence of frequencies of events to their probabilities and problems of search for an optimal solution from empirical data. Avtomatika i Telemekhanika 2, 42–53 (1971)MathSciNet
Metadaten
Titel
On Learnability, Complexity and Stability
verfasst von
Silvia Villa
Lorenzo Rosasco
Tomaso Poggio
Copyright-Jahr
2013
Verlag
Springer Berlin Heidelberg
DOI
https://doi.org/10.1007/978-3-642-41136-6_7