On the complexity of learning for spiking neurons with temporal coding.

DOI10.1006/INCO.1999.2806MaRDI QIDQ1854302zbMATH OpenOpenAlexWikidataFDO

Authors Michael Schmitt, Wolfgang Maass

Publication date 14 January 2003

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/inco.1999.2806

zbMATH Keywords

computational complexitybiological neural systems

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Analysis of algorithms and problem complexity (68Q25) Neural biology (92C20) Biophysics (92C05)

Recommendations

• On the Nonlearnability of a Single Spiking Neuron
• Fast Sigmoidal Networks via Spiking Neurons
• What is different with spiking neurons?
• On the relevance of time in neural computation and learning
• Modeling the learning of a spiking neural network with synaptic delays

Cites work

• scientific article; zbMATH DE number 53984 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 555215 (Why is no real title available?)
• scientific article; zbMATH DE number 3385535 (Why is no real title available?)
• A theory of the learnable
• Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers
• Decision theoretic generalizations of the PAC model for neural net and other learning applications
• Enumeration of Seven-Argument Threshold Functions
• Fast Sigmoidal Networks via Spiking Neurons
• Finiteness results for sigmoidal “neural” networks
• Introduction to Theoretical Neurobiology
• Learnability and the Vapnik-Chervonenkis dimension
• Learning Boolean formulas
• Neural networks with quadratic VC dimension
• Reduction of the Number of Columns in Flow Table Minimization
• Robust trainability of single neurons
• Toward efficient agnostic learning

Cited in

(14)

• scientific article; zbMATH DE number 1843044 (Why is no real title available?)
• scientific article; zbMATH DE number 2033239 (Why is no real title available?)
• Learning neural connectivity from firing activity: efficient algorithms with provable guarantees on topology
• On computation with pulses
• Algorithmic Learning Theory
• On the relevance of time in neural computation and learning
• Hardware-amenable structural learning for spike-based pattern classification using a simple model of active dendrites
• Neural Networks with Local Receptive Fields and Superlinear VC Dimension
• Modeling the learning of a spiking neural network with synaptic delays
• On the Nonlearnability of a Single Spiking Neuron
• Investigating the computational power of spiking neurons with non-standard behaviors
• General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results
• A basic compositional model for spiking neural networks
• Event-based simulation of networks with pulse delayed coupling

This page was built for publication: On the complexity of learning for spiking neurons with temporal coding.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1854302)