Advertisement

A note on a scale-sensitive dimension of linear bounded functionals in Banach Spaces

  • Leonid Gurvits
Session 9
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1316)

Abstract

We show that “B is of type p > 1” is a necessary and sufficient condition for a learnability of a class of linear bounded functionals with norm ≤ 1 restrited to the unit ball in Banach Space B. On the way we give very short probabilistic proof for Vapnik's result (Hilbert Space and improved) and improve our result with Pascal Koiran for convex halls of indicator functions. The approach we use in this paper allows to connect various results about learnability and approximation.

Keywords

VC-dimension scale-sensitive dimension Banach Spaces 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [ABCH]
    N. Alon, S. Ben-David, N. Cesa-Bianchi, and D. Haussler, “Scale-sensitive dimensions, uniform convergence, and learnability,” in Proc. 34th IEEE Symp. on FOCS, pages 292–301, 1993.Google Scholar
  2. [KS94]
    M. Kearns and R. Schapire, “Efficient distribution-free learning of probabilistic concepts,” Journal of Comp. and System Sciences, 48(3): 464–497, 1994.Google Scholar
  3. [GK95]
    L. Gurvits and P. Koiran, “Approximation and learning of convex superpositions,” in Proc. of Computational Learning Theory: EuroCOLT-95, Springer, pages 222–236, 1995.Google Scholar
  4. [Va95]
    Vladimir N. Vapnik, “The nature of statistical learning theory,” Springer, 1995.Google Scholar
  5. [DDGS93]
    C. Darken, M. Donahue, L. Gurvits and E. Sontag, “Rate of approximation results motivated by robust neural network learning,” in Proc. of the Sixth Annual ACM COLT. pages 303–309, 1993.Google Scholar
  6. [DGDS97]
    M. Donahue, L. Gurvits, C. Darken and E. Sontag, “Ratex of convex approximations in Non-Hibert spaces,” Constractive Approximation, (1997) 13: 187–220.Google Scholar
  7. [Ba91]
    A.R. Barron, “Approximation and estimation bounds for artificial neural networks,” in “Proc. Fourth Annual Workshop on Computational Learning Theory,” Morgan Kaufmann, pages 243–249, 1991.Google Scholar
  8. [Jo92]
    L.K. Jones, “A simple lemma on greedy approximations in Hilbert space and convergence rates for projection pursuit regression and neural network training,” Annals of Statistics, 20:608–613, 1992.Google Scholar
  9. [BH]
    E.B. Baum and D. Haussler, “What size net gives valid generalization?” Neural Computation, 1:151–160, 1989.Google Scholar
  10. [LT91]
    M. Ledoux and M. Talagrand, “Probability in Banach Space,” Springer-Verlag, 1991.Google Scholar
  11. [LT92]
    J. Lindenstrauss and L. Tzafriri, “Classical Banach Spaces (second and third books)”, Springer-Verlag, 1979.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Leonid Gurvits
    • 1
    • 2
  1. 1.NEC Research InstitutePrinceton
  2. 2.DIMACSRutgers UniversityNew Brunswick

Personalised recommendations