Zimei Chen
Research Subjects
Zimei Chen has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Wen-Hao Zhang
Lyda Hill Department of Bioinformatics, UT Southwestern Medical Center, Dallas, USA
3 shared publications - Yi Ren
Lyda Hill Department of Bioinformatics, UT Southwestern Medical Center
2 shared publications - Eryn Sale
University of Texas Southwestern Medical Center
1 shared publication Hayden Deans
Lyda Hill Department of Bioinformatics, UT Southwestern Medical Center
1 shared publicationYi Ren
UT Southwestern Medical Center
1 shared publicationYing Nian Wu
UCLA
1 shared publication
Latest Publications
- Open Access
Scale-mixture Langevin sampling in the subspaces of recurrent cortical circuit dynamics
Recurrent cortical circuits are hypothesized to perform Bayesian posterior sampling through their stochastic dynamics. Yet identifying which sampling algorithm a circuit intrinsically implements, as opposed to mapping manually designing algorithms onto circuits, requires rigorous theoretical analysis of the biological circuit dynamics, and remains a fundamental open challenge because of the analytical intractability of nonlinear recurrent dynamics. Here, we tackle this challenge through comprehensive theoretical analysis of analytically tractable nonlinear recurrent circuit dynamics used in neuroscience research— the continuous attractor network (CAN). Surprisingly, we find that the circuit, without any non-Gaussian components in its connectivity or internal variability, intrinsically emerges heavy-tailed subspaces dynamics described as scale-mixture Langevin posterior sampling. The mechanism emerges from the circuit’s own nonlinear dynamics: divisive normalization renders the overall population activation Gamma-distributed which multiplicatively modulates the time constant of the Langevin sampling in the stimulus feature subspace. Eventually, this scale-mixture structure produces a heavy-tailed (Student- t ) sampling step size distribution, significantly accelerating the sampling speed. Moreover, the scale-mixture Langevin sampling approaches a Lévy-like regime in the weak input limit. Our results analytically identify an intrinsic circuit algorithm embedded in subspaces of nonlinear recurrent dynamics, and establish a minimal circuit mechanism for endogenous heavy-tail statistics without any explicit non-Gaussian components.
Open AccessScale-mixture Langevin sampling in the subspaces of recurrent cortical circuit dynamics
Recurrent cortical circuits are hypothesized to perform Bayesian posterior sampling through their stochastic dynamics. Yet identifying which sampling algorithm a circuit intrinsically implements, as opposed to mapping manually designing algorithms onto circuits, requires rigorous theoretical analysis of the biological circuit dynamics, and remains a fundamental open challenge because of the analytical intractability of nonlinear recurrent dynamics. Here, we tackle this challenge through comprehensive theoretical analysis of analytically tractable nonlinear recurrent circuit dynamics used in neuroscience research— the continuous attractor network (CAN). Surprisingly, we find that the circuit, without any non-Gaussian components in its connectivity or internal variability, intrinsically emerges heavy-tailed subspaces dynamics described as scale-mixture Langevin posterior sampling. The mechanism emerges from the circuit’s own nonlinear dynamics: divisive normalization renders the overall population activation Gamma-distributed which multiplicatively modulates the time constant of the Langevin sampling in the stimulus feature subspace. Eventually, this scale-mixture structure produces a heavy-tailed (Student- t ) sampling step size distribution, significantly accelerating the sampling speed. Moreover, the scale-mixture Langevin sampling approaches a Lévy-like regime in the weak input limit. Our results analytically identify an intrinsic circuit algorithm embedded in subspaces of nonlinear recurrent dynamics, and establish a minimal circuit mechanism for endogenous heavy-tail statistics without any explicit non-Gaussian components.
- Open Access
Concurrent model evidence computation and posterior sampling in continuous attractor network subspaces
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.
Open AccessConcurrent model evidence computation and posterior sampling in continuous attractor network subspaces
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.
- Open Access
Natural gradient Bayesian sampling automatically emerges in canonical cortical circuits
A bstract: Accumulating evidence suggests the canonical cortical circuit, consisting of excitatory (E) and diverse classes of inhibitory (I) interneurons, implements Bayesian posterior sampling. However, most of the identified circuits’ sampling algorithms are simpler than the nonlinear circuit dynamics, suggesting complex circuits may implement more advanced algorithms. Through comprehensive theoretical analyses, we discover the canonical circuit innately implements natural gradient Bayesian sampling, which is an advanced sampling algorithm that adaptively adjusts the sampling step size based on the local geometry of stimulus posteriors measured by Fisher information. Specifically, the nonlinear circuit dynamics can implement natural gradient Langevin and Hamiltonian sampling of uni- and multi-variate stimulus posteriors, and these algorithms can be switched by interneurons. We also find that the non-equilibrium circuit dynamics when transitioning from the resting to evoked state can further accelerate natural gradient sampling, and analytically identify the neural circuit’s annealing strategy. Remarkably, we identify the approximated computational strategies employed in the circuit dynamics, which even resemble the ones widely used in machine learning. Our work provides an overarching connection between canonical circuit dynamics and advanced sampling algorithms, deepening our understanding of the circuit algorithms of Bayesian sampling.
Open AccessNatural gradient Bayesian sampling automatically emerges in canonical cortical circuits
A bstract: Accumulating evidence suggests the canonical cortical circuit, consisting of excitatory (E) and diverse classes of inhibitory (I) interneurons, implements Bayesian posterior sampling. However, most of the identified circuits’ sampling algorithms are simpler than the nonlinear circuit dynamics, suggesting complex circuits may implement more advanced algorithms. Through comprehensive theoretical analyses, we discover the canonical circuit innately implements natural gradient Bayesian sampling, which is an advanced sampling algorithm that adaptively adjusts the sampling step size based on the local geometry of stimulus posteriors measured by Fisher information. Specifically, the nonlinear circuit dynamics can implement natural gradient Langevin and Hamiltonian sampling of uni- and multi-variate stimulus posteriors, and these algorithms can be switched by interneurons. We also find that the non-equilibrium circuit dynamics when transitioning from the resting to evoked state can further accelerate natural gradient sampling, and analytically identify the neural circuit’s annealing strategy. Remarkably, we identify the approximated computational strategies employed in the circuit dynamics, which even resemble the ones widely used in machine learning. Our work provides an overarching connection between canonical circuit dynamics and advanced sampling algorithms, deepening our understanding of the circuit algorithms of Bayesian sampling.