bioRxivNeurosciencePreprint
A Radically New Theory of how the Brain Represents and Computes with Probabilities
Abstract
Many believe that the brain implements probabilistic reasoning and that it represents information via some form of population (distributed) code. Most prior probabilistic population coding (PPC) theories share basic properties: 1) continuous-valued units; 2) fully/densely distributed codes; 3) graded synap-ses; 4) rate coding; 5) units have innate low-complexity, usually unimodal, tuning functions (TFs); and 6) units are intrinsically noisy and noise is generally considered harmful. I describe a radically different theory that assumes: 1) binary units; 2) sparse distributed codes (SDC); 3) functionally binary synapses; 4) a novel, atemporal, combinatorial spike code; 5) units initially have flat TFs (all weights zero); and 6) noise is a resource generated/used, normatively, to cause similar inputs to map to similar codes. The theory, Sparsey, was introduced 25+ years ago as: a) an explanation of the physical/computational relationship of episodic and semantic memory for the spatiotemporal (sequential) pattern domain; and b) a canonical, mesoscale cortical probabilistic circuit/algorithm possessing fixed-time, unsupervised, single-trial, non-optimization-based, unsupervised learning and fixed-time best-match (approximate) retrieval; but was not described as an alternative to PPC-type theories. Here, we show that: a) the active SDC in a Sparsey coding field (CF) simultaneously represents not only the likelihood of the single most likely input but the likelihoods of all hypotheses stored in the CF; and b) the whole explicit distribution can be sent, e.g., to a downstream CF, via a set of simultaneous single spikes from the neurons comprising the active SDC.
- Citations
- 0
Reproducibility ledger
Nobody has reported trying to reproduce this paper yet. Did you replicate an experiment or run the code? Your report saves the next lab a week.
Sign in to file a reproducibility report.
Related papers
- Learning probabilistic representations with randomly connected neural circuits
Ori Maoz, Gašper Tkačik, … Elad Schneidman·Proceedings of the National Academy of SciencesPeer-reviewed·Sep 18, 2020
- Efficient Similarity-Preserving Unsupervised Learning using Modular Sparse Distributed Codes and Novelty-Contingent Noise
Gerard J. Rinkus·bioRxiv·Oct 9, 2020
- A simple self-decoding model for neural coding
Thach V. Bui·IEEE International Symposium on Information Theory (ISIT)Peer-reviewed·Jul 7, 2024
- Relating sparse/predictive coding to divisive normalization
Yanbo Lian, Anthony Neville Burkitt·PLoS Computational BiologyPeer-reviewed·May 27, 2025
- Towards a unified theory of efficient, predictive and sparse coding
Matthew Chalk, Olivier Marre, Gašper Tkačik·Proceedings of the National Academy of SciencesPeer-reviewed·Dec 19, 2017
- Learning probability distributions of sensory inputswith Monte Carlo Predictive Coding
Gaspard Oliviers, Rafał Bogacz, Alexander Meulemans·PLoS Computational BiologyPeer-reviewed·Oct 30, 2024