Concurrent model evidence computation and posterior sampling in continuous attractor network subspaces

Abstract

Extensive studies suggest the brain performs Bayesian inference to infer the latent world states. It is a fundamental neuroscience question that how canonical recurrent neural circuits in the brain implement Bayesian inference. Many existing theoretical studies focused on how the recurrent circuits compute the posterior, while largely overlooking how the circuits compute the model evidence (normalization constant in Bayes' theorem), a key quantity that measures how well a model explains the observed data.Thus, it remains largely unknown about how the recurrent circuits compute the model evidence. The present study performs rigorous theoretical analyses of the continuous attractor networks, a canonical recurrent circuit model, and reveals that the nonlinear circuit dynamics can simultaneously compute the posterior and model evidence in first two dominant subspaces within the circuit dynamics. Specifically, the circuit dynamics in the stimulus feature subspace implements the Langevin posterior sampling, and the circuit dynamics in the subspace of total neuronal activity computes the model evidence in a way analogous to the evidence lower bound in stochastic variational inference. We further extend the circuit model to compute the model evidence of multiple inputs, and simulations validate the computation in the network. Our work for the first time reveals the concurrent model evidence and posterior sampling in subspaces in continuous attractor networks, significantly deepen our understanding of the computational algorithms adopted by the neural circuits.