On the nonlearnability of a single spiking neuron

Neural Computation

Volumn 17, Issue 12, 2005, Pages 2635-2647

  Šíma, Jiří ^a   Sgall, Jiří ^b  

^a INSTITUTE OF COMPUTER SCIENCE   (Czech Republic)

^b MATHEMATICAL INSTITUTE   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

ACTION POTENTIAL; ALGORITHM; ARTICLE; ARTIFICIAL NEURAL NETWORK; BIOLOGICAL MODEL; CORTICAL SYNCHRONIZATION; METHODOLOGY; NERVE CELL; PHYSIOLOGY;

ACTION POTENTIALS; ALGORITHMS; CORTICAL SYNCHRONIZATION; MODELS, NEUROLOGICAL; NEURAL NETWORKS (COMPUTER); NEURONS;

COMPUTER CIRCUITS; NEURONS;

ADAPTIVE WEIGHTS; CONSISTENCY PROBLEMS; INPUT AND OUTPUTS; NP COMPLETE; ROBUST LEARNING; SPIKING NEURONES; SYNAPTIC DELAYS; SYNCHRONIZATION TECHNIQUE; THRESHOLD GATES;

BOOLEAN FUNCTIONS;

EID: 27144501832     PISSN: 08997667     EISSN: 1530888X     Source Type: Journal    
DOI: 10.1162/089976605774320601     Document Type: Article

References (28)

1. Aizenstein, H., Hegedüs, T., Hellerstein, L., & Pitt, L. (1998). Theoretic hardness results for query learning. Computational Complexity, 7(1), 19-53.
2. Amaldi, E. (1991). On the complexity of training perceptrons. In T. Kohonen, K. Mäkisara, O. Simula, & J. Kangas (Eds.), Proceedings of the 1st International Conference on Artificial Neural Networks (ICANN'91) (pp. 55-60). Amsterdam: Elsevier.
3. Anthony, M., & Bartlett, P. L. (1999). Neural network learning: Theoretical foundations Cambridge: Cambridge University Press.
4. Balcázar, J. L., Díaz, J., & Gabarró, J. (1995). Structural complexity I (2nd ed.). Berlin: Springer-Verlag.
5. Blumer, A., Ehrenfeucht, A., Haussler, D., & Warmuth, M. K. (1989). Learnability and the Vapnik-Chervonenkis dimension. Journal of the ACM, 36(4), 929-965.
6. Bohte, M., Kok, J. N., & La Poutré, H. (2000). Spike-prop: Error-backpropagation in multi-layer networks of spiking neurons. In Proceedings of the European Symposium on Artificial Neural Networks (ESANN'2000) (pp. 419-425). Brussels: D-Facto Publications.
7. Cook, S. A. (1971). The complexity of theorem-proving procedures. In Proceedings of the 3rd Annual ACM Symposium on Theory of Computing (STOC'71) (pp. 151-158). New York: ACM Press.
8. Fahlman, S. E., & Lebiere, C. (1990). The cascade-correlation learning architecture. In D. S. Touretzky (Ed.), Advances in neural information processing systems (NIPS' 89), 2 (pp. 524-532). San Mateo, CA: Morgan Kaufmann.
9. Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. San Francisco: Freeman.
10. Gerstner, W., & Kistler, W. M. (2002). Spiking neuron models: Single neurons, populations, plasticity. Cambridge: Cambridge University Press.
11. Hammer, P. L., Ibaraki, T., & Peled, U. N. (1981). Threshold numbers and threshold completions. In P. Hansen (Ed.), Studies on graphs and discrete programming, Annals of Discrete Mathematics, 11, Mathematics Studies, 59 (pp. 125-145). Amsterdam: North-Holland.
12. Haykin, S. (1999). Neural networks: A comprehensive foundation (2nd ed.). Upper Saddle River, NJ: Prentice Hall.
13. Hegedüs, T., & Megiddo, N. (1996). On the geometric separability of Boolean functions. Discrete Applied Mathematics, 66(3), 205-218.
14. Höffgen, K.-U., Simon, H.-U., & Van Horn, K. S. (1995). Robust trainability of single neurons. Journal of Computer and System Sciences, 50(1), 114-125.
15. Johnson, D. S., & Preparata, F. P. (1978). The densest hemisphere problem. Theoretical Computer Science, 6(1), 93-107.
16. Judd, J. S. (1990). Neural network design and the complexity of learning. Cambridge, MA: MIT Press.
17. Maass, W. (1997). Networks of spiking neurons: The third generation of neural network models. Neural Networks, 20(9), 1659-1671.
18. Maass, W., & Bishop, C. M. (Eds.). (1999). Pulsed neural networks. Cambridge, MA: MIT Press.
19. Maass, W., & Schmitt, M. (1999). On the complexity of learning for spiking neurons with temporal coding. Information and Computation, 153(1), 26-46.
20. Pitt, L., & Valiant, L. G. (1988). Computational limitations on learning from examples. Journal of the ACM, 35(4), 965-984.
21. Rosenblatt, F. (1958). The perceptron: A probabilistic model for information storage and organization in the brain. Psychological Review, 65(6), 386-408.
22. Roychowdhury, V. P., Siu, K.-Y., & Kailath, T. (1995). Classification of linearly nonseparable patterns by linear threshold elements. IEEE Transactions on Neural Networks, 6(2), 318-331.
23. Roychowdhury, V. P., Siu, K.-Y., & Orlitsky, A. (Eds.). (1994). Theoretical advances in neural computation and learning. Boston: Kluwer.
24. Schmitt, M. (1998). On computing Boolean functions by a spiking neuron. Annals of Mathematics and Artificial Intelligence, 24(1-4), 181-191.
25. Šíma, J. (2002). Training a single sigmoidal neuron is hard. Neural Computation, 14(11), 2709-2728.
26. Šíma, J. (2003). On the complexity of training a single perceptron with programmable synaptic delays. In Proceedings of the 14th International Conference on Algorithmic Learning Theory (ALT'2003), LNAI2842 (pp. 221-233). Berlin: Springer-Verlag.
27. Valiant, L. G. (1984). A theory of the learnable. Communications of the ACM, 27(11), 1134-1142.
28. Vidyasagar, M. (1997). A theory of learning and generalization. London: Springer-Verlag.