Computation in Networks of Neurons in the Brain I
summary
Argues that networks of spiking neurons can simulate any Turing machine and implement Boltzmann-like models to perform sampling-based inference, but only under idealized neuron/EPSP assumptions; points out pervasive trial-to-trial variability and unreliable synapses (~50% release) as core constraints. Presents simulations where STDP produces unsupervised pattern detectors, shows hippocampal and orbitofrontal recordings consistent with temporal sampling (~100 ms episodes), and highlights that spiking samplers can find good constraint-satisfaction solutions faster than Boltzmann machines, leaving open how assemblies, heterogeneity, and state retention are realized biologically.
AI-written summary · about
chapters (17)
- 0:00Introduction
- 2:15Spiking neuron computation
- 4:24Computational power
- 7:29The impact of noise
- 10:20Synaptic unreliability
- 13:40Revisiting unreliability
- 18:05Stochastic computation
- 21:07Boltzmann machines
- 25:19Spiking and Boltzmann
- 29:45Probabilistic learning
- 32:17Learning algorithms
- 35:36Unsupervised learning
- 37:53Constraint satisfaction
- 43:35Experimental evidence
- 50:20Efficiency of sampling
- 53:25Future directions
- 58:39Q&A and conclusion
