On the Complexity of Learning for Spiking Neurons with Temporal Coding

Information and Computation

Volumn 153, Issue 1, 1999, Pages 26-46

  Maass, Wolfgang ^a   Schmitt, Michael ^b  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

^b RUHR UNIVERSITY BOCHUM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0004512775     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1999.2806     Document Type: Article

References (26)

1. Agmon-Snir, H., and Segev, I. (1993), Signal delay and input synchronization in passive dendritic structures, J. Neurophysiol. 70, 2066-2085.
2. Anthony, M., and Biggs, N. (1992), "Computational Learning Theory," Cambridge Tracts Theoret. Comput. Sci., Cambridge Univ. Press, Cambridge.
3. Blum, A. L., and Rivest, R. L. (1992), Training a 3-node neural network is NP-complete, Neural Networks 5, 117-127.
4. Blumer, A., Ehrenfeucht, A., Haussler, D., and Warmuth, M. K. (1989), Learnability and the Vapnik-Chervonenkis dimension, J. Assoc. Comput. Mach. 36, 929-965.
5. Cover, T. M. (1965), Geometrical and statistical properties of systems of linear inequalities with applications in pattern recognition, IEEE Trans. Electron. Comput. 14, 326-334.
6. Garey, M. R., and Johnson, D. S. (1979), "Computers and Intractability: A Guide to the Theory of NP-Completeness," Freeman, New York.
7. Gerstner, W. (1995), Time structure of the activity in neural network models, Phys. Rev. E 51, 738-758.
8. Gerstner, W., Kempter, R., van Hemmen, J. L., and Wagner, H. (1996), A neuronal learning rule for sub-millisecond temporal coding, Nature 383, 76-78.
9. Goldberg, P. W., and Jerrum, M. R. (1995), Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers, Mach. Learning 18, 131-148.
10. Haussler, D. (1992), Decision theoretic generalizations of the PAC model for neural net and other learning applications, Inform, and Comput. 100, 78-150.
11. Höffgen, K.-U., Simon, H.-U., and Van Horn, K. S. (1995), Robust trainability of single neurons, J. Comput. System Sci. 50, 114-125.
12. Kearns, M., Li, M., and Valiant, L. (1994a), Learning Boolean formulas, J. Assoc. Comput. Mach. 41, 1298-1328.
13. Kearns, M. J., Schapire, R. E., and Sellie, L. M. (1994b), Toward efficient agnostic learning, Mach. Learning 17, 115-141.
14. Koiran, P., and Sontag, E. D. (1997), Neural networks with quadratic VC dimension, J. Comput. System Sci. 54, 190-198.
15. Maass, W. (1997a), Fast sigmoidal networks via spiking neurons, Neural Computation 9, 279-304.
16. Maass, W. (1997b), Networks of spiking neurons: The third generation of neural network models, Neural Networks 10, 1659-1671.
17. Maass, W., and Bishop, C. M., (Eds.) (1999), "Pulsed Neural Networks," MIT Press, Cambridge, MA.
18. Macintyre, A., and Sontag, E. D. (1993), Finiteness results for sigmoidal "neural" networks, in "Proceedings of the Twenty-Fifth Annual ACM Symposium on the Theory of Computing," pp. 325-334, Assoc. Comput. Mach., New York.
19. Muroga, S. (1971), "Threshold Logic and Its Applications," Wiley, New York.
20. Muroga, S., and Toda, I. (1966), Lower bound of the number of threshold functions, IEEE Trans. Electron. Comput. 15, 805-806.
21. Murray, A., and Tarassenko, L. (1994), "Analogue Neural VLSI: A Pulse Stream Approach," Chapman & Hall, London.
22. Schläfli, L. (1901), "Theorie der vielfachen Kontinuität," Zürcher & Furrer, Zürich. [Reprinted in Schläfli, L. (1950), "Gesammelte Mathematische Abhandlungen," Band I, Birkhäuser, Basel.]
23. Schläfli, L. (1901), "Theorie der vielfachen Kontinuität," Zürcher & Furrer, Zürich. [Reprinted in Schläfli, L. (1950), "Gesammelte Mathematische Abhandlungen," Band I, Birkhäuser, Basel.]
24. Tuckwell, H. C. (1988), "Introduction to Theoretical Neurobiology," Vols. 1, 2, Cambridge Univ. Press, Cambridge.
25. Valiant, L. G. (1984), A theory of the learnable, Comm. ACM 27, 1134-1142.
26. Zador, A. M., and Pearlmutter, B. A. (1996), VC dimension of an integrate-and-fire neuron model, Neural Comput. 8, 611-624.