The unreasonable effectiveness of small neural ensembles in high-dimensional brain
Not on the map. Why?
Abstract (arXiv)
Despite the widely-spread consensus on the brain complexity, sprouts of the single neuron revolution emerged in neuroscience in the 1970s. They brought many unexpected discoveries, including grandmother or concept cells and sparse coding of information in the brain. In machine learning for a long time, the famous curse of dimensionality seemed to be an unsolvable problem. Nevertheless, the idea of the blessing of dimensionality becomes gradually more and more popular. Ensembles of non-interacting or weakly interacting simple units prove to be an effective tool for solving essentially multidimensional problems. This approach is especially useful for one-shot (non-iterative) correction of errors in large legacy artificial intelligence systems. These simplicity revolutions in the era of complexity have deep fundamental reasons grounded in geometry of multidimensional data spaces. To explore and understand these reasons we revisit the background ideas of statistical physics. In the course of the 20th century they were developed into the concentration of measure theory. New stochastic separation theorems reveal the fine structure of the data clouds. We review and analyse biological, physical, and mathematical problems at the core of the fundamental question: how can high-dimensional brain organise reliable and fast learning in high-dimensional world of data by simple tools? Two critical applications are reviewed to exemplify the approach: one-shot correction of errors in intellectual systems and emergence of static and associative memories in ensembles of single neurons.
Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). First posted on arXiv 20 Sep 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 4; 2022: 2; 2023: 0; 2024: 2; 2025: 1; 2026: 1.
10 papers.
- 2021Scikit-dimension: a Python package for intrinsic dimension estimationcited by 68
- 2021The Feasibility and Inevitability of Stealth Attackscited by 12
- 2021High-dimensional separability for one- and few-shot learningcited by 11
- 2021Demystification of Few-shot and One-shot Learningcited by 10
- 2024Stealth edits to large language modelscited by 3
- 2022Including STDP to eligibility propagation in multi-layer recurrent spiking neural networkscited by 1
- 2022Quasi-orthogonality and intrinsic dimensions as measures of learning and generalisationcited by 1
- 2024A Mathematical Framework for the Problem of Security for Cognition in Neurotechnologycited by 1
- 2025Networks with Finite VC Dimension: Pro and Contracited by 0
- 2026Theoretical Lower Bounds on the Robustness of Deep ReLU Networkscited by 0
- 2026Theoretical Lower Bounds on the Robustness of Deep ReLU Networks21 Feb 2026
- 2025Networks with Finite VC Dimension: Pro and Contra4 Feb 2025
- 2024Stealth edits to large language models18 Jun 2024
- 2024A Mathematical Framework for the Problem of Security for Cognition in Neurotechnology11 Mar 2024
- 2022Quasi-orthogonality and intrinsic dimensions as measures of learning and generalisation30 Mar 2022
- 2022Including STDP to eligibility propagation in multi-layer recurrent spiking neural networks5 Jan 2022
- 2021Scikit-dimension: a Python package for intrinsic dimension estimation6 Sep 2021
- 2021High-dimensional separability for one- and few-shot learning28 Jun 2021
- 2021The Feasibility and Inevitability of Stealth Attacks26 Jun 2021
- 2021Demystification of Few-shot and One-shot Learning25 Apr 2021