Size of multilayer networks for exact learning: Analytic approach

Advances in Neural Information Processing Systems

Volumn , Issue , 1997, Pages 162-168

  Elisseeff, André ^a   Paugam Moisy, Hélène ^a  

^a UNIVERSITÉ DE LYON   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ANALYTIC APPROACH; EXACT LEARNING; HIDDEN LAYERS; HIDDEN UNITS; INPUT AND OUTPUTS; MULTI-LAYER NETWORK; REAL SAMPLES; TRAINING SETS;

MULTILAYER NEURAL NETWORKS;

EID: 0343090605     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. E. B. Baum. On the capabilities of multilayer perceptrons. J, of Complexity, 4:193-215,1988.
2. E. B. Baum and D. Haussler. What size net gives valid generalization ? Neural Computation, 1:151-160, 1989.
3. E. K. Blum and L. K. Li. Approximation theory and feedforward networks. Neural Networks, 4(4):511-516, 1991.
4. F. M. Coetzee and V. L. Stonick. Topology and geometry of single hidden layer network, least squares weight solutions. Neural Computation, 7:672-705, 1995.
5. M. Cosnard, P. Koiran, and H. Paugam-Moisy. Bounds on the number of units for computing arbitrary dichotomies by multilayer perceptrons. J. of Complexity, 10:57-63, 1994.
6. G. Cybenko. Approximation by superpositions of a sigmoidal function. Math. Control, Signal Systems, 2:303-314, October 1988.
7. A. Elisseeff and H. Paugam-Moisy. Size of multilayer networks for exact learning: analytic approach. Rapport de recherche 96-16, LIP, July 1996.
8. K. Funahashi. On the approximate realization of continuous mappings by neural networks. Neuml Networks, 2(3):183 192, 1989.
9. K. Hornik, M. Stinchcombe, and H. White. Multilayer feedforward networks are universal approximators. Neural Networks, 2(5):359-366, 1989.
10. S.-C. Huang and Y.-F. Huang. Bounds on the number of hidden neurones in multilayer perceptrons. IEEE Trans. Neural Networks, 2:47-55, 1991.
11. M. Karpinski and A. Macintyre. Polynomial bounds for vc dimension of sigmoidal neural networks. In 27th ACM Symposium on Theory of Computing, pages 200-208, 1995.
12. P. Koiran and E. D. Sontag. Neural networks with quadratic vc dimension. In Neural Information Processing Systems (NIPS*95), 1995. to appear.
13. W. Maass. Bounds for the computational power and learning complexity of analog neural networks. In 25th ACM Symposium on Theory of Computing, pages 335-344, 1993.
14. E. D. Sontag. Feedforward nets for interpolation and classification. J. Comp. Syst. Sci., 45:20-48, 1992.
15. E. D. Sontag. Shattering all sets of κ points in "general position" requires (κ-l)/2 parameters. Technical Report Report 96-01, Rutgers Center for Systems and Control (SYCON), February 1996.