Skip to main content

On the Limitations of Embedding Methods

  • Conference paper
Learning Theory (COLT 2005)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3559))

Included in the following conference series:

Abstract

We show that for any class of functions H which has a reasonable combinatorial dimension, the vast majority of small subsets of the combinatorial cube can not be represented as a Lipschitz image of a subset of H, unless the Lipschitz constant is very large. We apply this result to the case when H consists of linear functionals of norm at most one on a Hilbert space, and thus show that “most” classification problems can not be represented as a reasonable Lipschitz loss of a kernel class.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Barthe, F., Guédon, O., Mendelson, S., Naor, A.: A probabilistic approach to the geometry of the ball, all. Annals of Probability 33(2), 480–513 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  2. Ben-David, S., Eiron, N., Simon, H.U.: Limitations of learning via embeddings in Euclidean half spaces. Journal of Machine Learning Research 3, 441–461 (2002)

    Article  MathSciNet  Google Scholar 

  3. Bollobás, B.: Extremal graph theory. Academic Press, London (1978)

    MATH  Google Scholar 

  4. Forster, J., Schmitt, N., Simon, H.U.: Estimating the optimal margins of embeddings in Euclidean halfspaces. In: Helmbold, D.P., Williamson, B. (eds.) COLT 2001 and EuroCOLT 2001. LNCS (LNAI), vol. 2111, pp. 402–415. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  5. Ledoux, M., Talagrand, M.: Probability in Banach spaces. Springer, Heidelberg (1991)

    MATH  Google Scholar 

  6. Linial, N., Mendelson, S., Schechtman, G., Shraibman, A.: Complexity measures of sign matrices (preprint)

    Google Scholar 

  7. Mendelson, S., Vershynin, R.: Entropy and the combinatorial dimension. Inventiones Mathmaticae 152(1), 37–55 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  8. Mendelson, S., Schechtman, G.: The shattering dimension of sets of linear functionals. Annals of Probability 32(3A), 1746–1770 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  9. Mendelson, S.: Embedding with a Lipschitz function, Random Structures and Algorithms. (available on the journal’s web-page) (to appear)

    Google Scholar 

  10. Milman, V.D., Schechtman, G.: Asymptotic theory of finite dimensional normed spaces. Lecture Notes in Mathematics, vol. 1200. Springer, Heidelberg (1986)

    MATH  Google Scholar 

  11. Pajor, A.: Sous espaces _n1 des espaces de Banach. Hermann, Paris (1985)

    Google Scholar 

  12. Pisier, G.: The volume of convex bodies and Banach space geometry. Cambridge University Press, Cambridge (1989)

    Book  MATH  Google Scholar 

  13. Van der Vaart, A.W., Wellner, J.A.: Weak convergence and Empirical Processes. Springer, Heidelberg (1996)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mendelson, S. (2005). On the Limitations of Embedding Methods. In: Auer, P., Meir, R. (eds) Learning Theory. COLT 2005. Lecture Notes in Computer Science(), vol 3559. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11503415_24

Download citation

  • DOI: https://doi.org/10.1007/11503415_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-26556-6

  • Online ISBN: 978-3-540-31892-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics