Limits of optimal decoding under synaptic coarse-tuning
Abstract
Sensory information propagates through successive processing stages in the brain, where synaptic weight patterns between stations determine how downstream neurons decode information from upstream populations. Although optimized synaptic connectivity can enhance information transmission, it requires precise weight tuning. Recent evidence depicting substantial synaptic volatility raises two fundamental questions: How does coarse-tuning of synaptic connectivity affect information transmission? What strategies could the nervous system employ to maintain reliable communication despite synaptic fluctuations? We addressed these questions by analyzing the signal-to-noise ratio (SNR) for binary stimulus discrimination under two decoding schemes: a naive population average and an optimized linear decoder. For the naive decoder, we found that SNR remains largely insensitive to synaptic imprecision, since performance is already limited by correlated noise in neuronal responses. For the optimal decoder, we identified three distinct regimes, that is, weak, moderate and strong coarse-tuning. Under weak coarse-tuning, SNR2 scales linearly with population size N. Under moderate coarse-tuning, scaling becomes sublinear. Strikingly, under strong coarse-tuning, the regime most consistent with observed neuronal heterogeneity, SNR saturates and can not be improved by recruiting larger populations. This limitation persists even when incorporating feedforward or recurrent network architectures. These findings suggest that in the biologically relevant regime of strong coarse-tuning, naive and optimal decoders can achieve qualitatively similar performance. The analysis shows that effective readout under synaptic volatility is constrained to an invariant low-dimensional manifold aligned with the naive decoder, potentially pointing to a fundamental principle for robust neural computation in the face of ongoing synaptic remodeling.
02 /Specification & Classification
Click any tag to browse matching papersReproducibility 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
- Signatures of criticality in efficient coding networks
Shervin Safavi, Matthew Chalk, … Anna Levina·Proceedings of the National Academy of SciencesPeer-reviewed·Oct 1, 2024
- A simple self-decoding model for neural coding
Thach V. Bui·IEEE International Symposium on Information Theory (ISIT)Peer-reviewed·Jul 7, 2024
- Efficient population coding depends on stimulus convergence and source of noise
Kai Röth, Shuai Shao, Julijana Gjorgjieva·PLoS Computational BiologyPeer-reviewed·Apr 26, 2021
- How short decoding times, stimulus dimensionality and spontaneous activity constrain the shape of tuning curves: A speed-accuracy trade-off
Movitz Lenninger, Mikael Skoglund, … Arvind Kumar·eLifePeer-reviewed·May 16, 2023
- Cooperative coding of continuous variables in networks with sparsity constraint
Paul Züge, Natalie Schieferstein, Raoul-Martin Memmesheimer·PLoS Computational BiologyPeer-reviewed·Jul 3, 2025
- The Role of Untuned Neurons In Sensory Information Coding
Joel Zylberberg·bioRxiv·May 30, 2018