PLoS Computational BiologyNeurosciencePeer-reviewed journal article
Sparse connectivity for MAP inference in linear models using sister mitral cells
Abstract
Sensory processing is hard because the variables of interest are encoded in spike trains in a relatively complex way. A major goal in studies of sensory processing is to understand how the brain extracts those variables. Here we revisit a common encoding model in which variables are encoded linearly. Although there are typically more variables than neurons, this problem is still solvable because only a small number of variables appear at any one time (sparse prior). However, previous solutions require all-to-all connectivity, inconsistent with the sparse connectivity seen in the brain. Here we propose an algorithm that provably reaches the MAP (maximum a posteriori) inference solution, but does so using sparse connectivity. Our algorithm is inspired by the circuit of the mouse olfactory bulb, but our approach is general enough to apply to other modalities. In addition, it should be possible to extend it to nonlinear encoding models. SummarySensory systems must infer latent variables from noisy and ambiguous input. MAP inference - choosing the most likely latent variable given the sensory input - is one of the simplest methods for doing that, but its neural implementation often requires all-to-all connectivity between the neurons involved. In common sensory contexts this can require a single neuron to connect to hundreds of thousands of others, which is biologically implausible. In this work we take inspiration from the sister mitral cells of the olfactory system - groups of neurons associated with the same input channel - to derive a method for performing MAP inference using sparse connectivity. We do so by assigning sister cells to random subsets of the latent variables and using additional cells to ensure that sisters correctly share information. We then derive the circuitry and dynamics required for the sister cells to compute the original MAP inference solution. Our work yields a biologically plausible circuit that provably solves the MAP inference problem and provides experimentally testable predictions. While inspired by the olfactory system, our method is quite general, and is likely to apply to other sensory modalities.
- organism: mouse
- assay: spatial transcriptomics
- research focus: dimensionality reduction
- approach: statistical model
- Citations
- 6
- FWCI
- 0.77
- Field percentile
- top 35%
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
- Simultaneous detection and estimation in olfactory sensing
Chen Jiang, Matthew Y. He, … Paul Masset·bioRxiv·Nov 1, 2025
- Computational algorithms and neural circuitry for compressed sensing in the mammalian main olfactory bulb
Daniel R. Kepple, Brittany N. Cazakoff, … Alexei A. Koulakov·bioRxiv·Jun 5, 2018
- Neural Correlates of Optimal Multisensory Decision Making
Han Hou, Qihao Zheng, … Yong Gu·bioRxiv·Nov 29, 2018
- Sampling-based Bayesian inference in recurrent circuits of stochastic spiking neurons
Wenhao Zhang, Si Wu, … Brent Doiron·Nature CommunicationsPeer-reviewed·Nov 4, 2023
- 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
- Late Bayesian inference in sensorimotor behavior
Evan Remington, Mehrdad Jazayeri·bioRxiv·Apr 24, 2017