• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Sample Complexity for Learning Recurrent Perceptron Mappings (1996)

Cached

  • Download as a PDF
  •  
  • Download as a PS

Download Links

  • [www.math.rutgers.edu]
  • [math.rutgers.edu]
  • [crab.rutgers.edu]
  • [crab.rutgers.edu]
  • [dimacs.rutgers.edu]
  • [www.math.rutgers.edu]
  • [math.rutgers.edu]
  • [www.math.rutgers.edu]
  • [math.rutgers.edu]
  • [www.cs.uic.edu]
  • [crab.rutgers.edu]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Bhaskar Dasgupta , Eduardo D. Sontag
Venue:IEEE Trans. Inform. Theory
Citations:22 - 10 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@ARTICLE{Dasgupta96samplecomplexity,
    author = {Bhaskar Dasgupta and Eduardo D. Sontag},
    title = {Sample Complexity for Learning Recurrent Perceptron Mappings},
    journal = {IEEE Trans. Inform. Theory},
    year = {1996},
    volume = {42},
    pages = {204--210}
}

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

Recurrent perceptron classifiers generalize the classical perceptron model. They take into account those correlations and dependences among input coordinates which arise from linear digital filtering. This paper provides tight bounds on sample complexity associated to the fitting of such models to experimental data. Keywords: perceptrons, recurrent models, neural networks, learning, Vapnik-Chervonenkis dimension 1 Introduction One of the most popular approaches to binary pattern classification, underlying many statistical techniques, is based on perceptrons or linear discriminants ; see for instance the classical reference [9]. In this context, one is interested in classifying k-dimensional input patterns v = (v 1 ; : : : ; v k ) into two disjoint classes A + and A \Gamma . A perceptron P which classifies vectors into A + and A \Gamma is characterized by a vector (of "weights") ~c 2 R k , and operates as follows. One forms the inner product ~c:v = c 1 v 1 + : : : c k v k . I...

Citations

3341 Pattern Classification and Scene Analysis - Duda, Hart - 1973
1515 A Theory of the Learnable - Valiant - 1984
688 Estimation of dependencies based on empirical data - Vapnik - 1982
565 Learnability and the Vapnik Chervonenkis dimension - Blumer, Ehrenfeucht, et al. - 1989
328 Decision theoretic generalization of the PAC model for neural net and other learning applications - Haussler - 1992
247 Pattern Classi cation and Scene Analysis - Duda, Hart - 1973
177 On the combinatorial and algebraic complexity of quantifier elimination - Basu, Pollack, et al. - 1996
89 Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers - Goldberg, Jerrum - 1995
83 Empirical processes: theory and applications - Pollard - 1990
69 Feedforward nets for interpolation and classification - Sontag - 1992
67 Learning and Generalization: With Applications to Neural Networks - Vidyasagar - 2003
65 FIR and IIR synapses, a new neural network architecture for time-series modeling - Back, Tsoi - 1991
51 Neural Networks for Speech and Sequence Recognition - Bengio - 1996
46 Neural networks with quadratic VC dimension - Koiran, P, et al.
39 Higher order recurrent networks and grammatical inference - Giles, Sun, et al. - 1990
35 A new algorithm to find a point in every cell defined by a family of polynomials - Basu, Pollack, et al. - 1998
29 Thom’s lemma, the coding of real algebraic numbers and the computation of the topology of semi-algebraic sets - Coste, Roy - 1988
29 Theory of Pattern Recognition [in Russian - Vapnik, Chervonenkis - 1974
25 Neural networks for control - Sontag - 1993
21 A Course on Empirical Processes, Ecole d'ete de probabilites de SaintFlour - Dudley - 1984
19 Extracting State Information from a Quantized Output Record - Delchamps - 1989
18 Perspectives of current research about the complexity of learning in neural nets - Maass - 1994
13 the coding of real algebraic numbers and the computation of the topology of semialgebraic sets - Coste, Lemma - 1988
10 Complexity of Computation on Real Algebraic Numbers - Roy, Szpirglas - 1990
9 A comparison of discrete-time operator models for nonlinear system identi cation - Back, Tsoi - 1995
9 Shattering all sets of k points in general position requires (k-1)/2 parameters - Sontag - 1996
6 Linear systems with sign-observations - Koplon, Sontag - 1993
5 Feedforward nets for interpolation and classi cation - Sontag
4 On the similarity of conditions for an open-eye channel and for signed filtered error adaptive filter stability - Baksho, Dasgupta, et al. - 1991
4 Neural network structure for emulating decision feedback equalizers - Pulford, Kennedy, et al. - 1991
3 A course on empirical processes. In ' Ecole d"et'e de probabilit'es de St.-Flour, number 1097 - Dudley - 1984
2 Computational Learning Theory and Neural Networks: A Survey of Selected Topics - Turan - 1994
1 Complexity of Computation on - Roy, Szpirglas - 1990
1 A New Algorithm to Find a PointinEvery Cell De ned by aFamily of Polynomials - Basu, Pollack, et al.
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University