Fast Sampling-Based Inference in Balanced Neuronal Networks

Guillaume Hennequin, Laurence Aitchison, Máté Lengyel

Introduction

A leading theory in neuroscience suggests the brain represents uncertainty by "sampling" from probability distributions, akin to Markov Chain Monte Carlo (MCMC) methods. However, there is a major temporal bottleneck: for sampling to be useful for quick decisions, the neural circuit must generate independent, uncorrelated samples very rapidly.

Standard models often rely on Langevin Sampling (LS), where neural activity follows the gradient of the probability distribution's "landscape." A fatal flaw in LS is its requirement for symmetric synaptic connections. In high-dimensional spaces, these symmetric dynamics suffer from "critical slowing down," where the time it takes to generate a new independent sample grows linearly with the number of neurons. This makes LS too slow to account for the sub-second speed of human perception. This paper demonstrates that the brain can perform lightning-fast probabilistic inference by using non-symmetric, "non-normal" neural dynamics, breaking the constraints of statistical reversibility.

Methods and Model Architecture

The authors investigate this bottleneck using a Linear Gaussian latent variable model. They model neural activity as a stochastic process (a system of linear differential equations) where the stationary distribution of the neurons' firing rates matches the "posterior" distribution—the brain's best guess given the input.

Linear Gaussian latent variable model and posterior sampling network

The key technical innovation is the introduction of a skew-symmetric matrix ($S$) into the weight matrix formula. Mathematically, adding $S$ changes the path the network takes through state space without changing the final distribution it samples from.

To find the optimal $S$, the authors employ:

  1. Control Theory: Formulating a "slowing cost" function based on the autocorrelation of the samples.
  2. Optimization: Using the L-BFGS algorithm to find specific connectivity patterns that minimize this cost, effectively tuning the network for maximum sampling speed.
  3. Biological Constraints: Extending the model to obey Dale’s Law (neurons are either purely excitatory or purely inhibitory), creating a "balanced" E/I network.

The models are tested using synthetic datasets with random covariance matrices drawn from an Inverse Wishart distribution. This allows systematic variation of the network size ($N$) and correlation strength to observe how different algorithms scale.

Key Insights

  • Symmetry is the Enemy of Speed: Langevin sampling is proven to be the slowest possible way to sample in this framework. Its symmetric weights prevent the system from taking large, efficient steps through state space.
  • Non-Normal Dynamics: The fastest networks are mathematically "non-normal," meaning the eigenvectors of the connectivity matrix are not orthogonal. This allows for transient amplification: a small amount of noise can be momentarily blown up into a large excursion along a specific dimension, allowing the network to "jump" to a new, independent sample much faster.
  • Breaking Detailed Balance: Fast sampling requires statistical irreversibility. While standard MCMC algorithms usually move back and forth along the same paths (detailed balance), these optimized networks move in loops or vortices, preventing the system from getting stuck.
  • E/I Balance as a Feature: Forcing the network to have separate excitatory and inhibitory populations (Dale's Law) does not slow it down. The "balanced" state—where excitation and inhibition cancel each other out—is exactly the regime needed to support these fast, non-normal dynamics.

Key Results

The optimized networks produce independent samples 10 to 100 times faster than Langevin or Gibbs sampling.

Slowing factor and scaling with network size

Crucially, while Langevin Sampling gets progressively slower as the number of neurons ($N$) increases, the optimized networks maintain high speeds regardless of dimensionality. Furthermore, these optimized E/I networks exhibit "balanced" inputs (where excitatory and inhibitory currents are highly correlated in time), a phenomenon widely observed in the real cortex but absent in traditional sampling models.

Limitations and Future Work

  • Linearity: The core results are derived for linear-Gaussian models. While the authors provide a proof of principle for non-linear networks (using a tanh activation function), a comprehensive theory for non-Gaussian distributions is still needed.
  • Learning Rules: The paper uses offline optimization (L-BFGS) to find the weights. It remains unclear what kind of biologically plausible, local synaptic plasticity rules (like STDP) could allow a real brain to learn these optimal, non-symmetric weights.
  • Noise Sources: The model assumes a constant source of external "private" noise for each neuron. The biological origin of this noise—and whether it is truly external or generated by other parts of the network—remains an open question.

Summary updated

Abstract

Multiple lines of evidence support the notion that the brain performs probabilistic inference in multiple cognitive domains, including perception and decision making. There is also evidence that probabilistic inference may be implemented in the brain through the (quasi-)stochastic activity of neural circuits, producing samples from the appropriate posterior distributions, effectively implementing a Markov chain Monte Carlo algorithm. However, time becomes a fundamental bottleneck in such sampling-based probabilistic representations: the quality of inferences depends on how fast the neural circuit generates new, uncorrelated samples from its stationary distribution (the posterior). We explore this bottleneck in a simple, linear-Gaussian latent variable model, in which posterior sampling can be achieved by stochastic neural networks with linear dynamics. The well-known Langevin sampling (LS) recipe, so far the only sampling algorithm for continuous variables of which a neural implementation has been suggested, naturally fits into this dynamical framework. However, we first show analytically and through simulations that the symmetry of the synaptic weight matrix implied by LS yields critically slow mixing when the posterior is high-dimensional. Next, using methods from control theory, we construct and inspect networks that are optimally fast, and hence orders of magnitude faster than LS, while being far more biologically plausible. In these networks, strong -- but transient -- selective amplification of external noise generates the spatially correlated activity fluctuations prescribed by the posterior. Intriguingly, although a detailed balance of excitation and inhibition is dynamically maintained, detailed balance of Markov chain steps in the resulting sampler is violated, consistent with recent findings on how statistical irreversibility can overcome the speed limitation of random walks in other domains.
BibTeX
@inproceedings{hennequin2014fast,
  author = {Guillaume Hennequin and Laurence Aitchison and Máté Lengyel},
  title = {{Fast Sampling-Based Inference in Balanced Neuronal Networks}},
  booktitle = {Advances in Neural Information Processing Systems},
  year = {2014},
}
Figure