On the Nonlearnability of a Single Spiking Neuron

DOI10.1162/089976605774320601MaRDI QIDQ3370746zbMATH OpenOpenAlexWikidataFDO

Authors Jiří Šíma, Jiří Sgall

Publication date 8 February 2006

Published in Neural Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1162/089976605774320601

zbMATH Keywords

Boolean functionneural networks

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Algorithmic Learning Theory
• On the complexity of learning for spiking neurons with temporal coding.
• scientific article; zbMATH DE number 1843044
• What Can a Neuron Learn with Spike-Timing-Dependent Plasticity?
• On computing Boolean functions by a spiking neuron

Cites work

• A theory of the learnable
• Complexity theoretic hardness results for query learning
• Computational limitations on learning from examples
• Learnability and the Vapnik-Chervonenkis dimension
• On computing Boolean functions by a spiking neuron
• On the complexity of learning for spiking neurons with temporal coding.
• On the geometric separability of Boolean functions
• Robust trainability of single neurons
• The densest hemisphere problem
• Training a Single Sigmoidal Neuron Is Hard

Cited in

(7)

• Second order spiking perceptrons
• On computing Boolean functions by a spiking neuron
• On the complexity of learning for spiking neurons with temporal coding.
• On the complexity of recognizing a set of vectors by a neuron
• A Spiking Neuron as Information Bottleneck
• scientific article; zbMATH DE number 1843044 (Why is no real title available?)
• Memoryless Optimality: Neurons Do Not Need Adaptation to Optimally Encode Stimuli With Arbitrarily Complex Statistics

This page was built for publication: On the Nonlearnability of a Single Spiking Neuron

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