Latent computing by biological neural networks: A dynamical systems framework
Authors: Fatih Dinc, Marta Blanco-Pozo, David Klindt, Francisco Acosta, Yiqi Jiang, Sadegh Ebrahimi, Adam Shai, Hidenori Tanaka, Peng Yuan, Mark J. Schnitzer, Nina Miolane
Abstract: Although individual neurons and neural populations exhibit the phenomenon of representational drift, perceptual and behavioral outputs of many neural circuits can remain stable across time scales over which representational drift is substantial. These observations motivate a dynamical systems framework for neural network activity that focuses on the concept of \emph{latent processing units,} core elements for robust coding and computation embedded in collective neural dynamics. Our theoretical treatment of these latent processing units yields five key attributes of computing through neural network dynamics. First, neural computations that are low-dimensional can nevertheless generate high-dimensional neural dynamics. Second, the manifolds defined by neural dynamical trajectories exhibit an inherent coding redundancy as a direct consequence of the universal computing capabilities of the underlying dynamical system. Third, linear readouts or decoders of neural population activity can suffice to optimally subserve downstream circuits controlling behavioral outputs. Fourth, whereas recordings from thousands of neurons may suffice for near optimal decoding from instantaneous neural activity patterns, experimental access to millions of neurons may be necessary to predict neural ensemble dynamical trajectories across timescales of seconds. Fifth, despite the variable activity of single cells, neural networks can maintain stable representations of the variables computed by the latent processing units, thereby making computations robust to representational drift. Overall, our framework for latent computation provides an analytic description and empirically testable predictions regarding how large systems of neurons perform robust computations via their collective dynamics.
Explore the paper tree
Click on the tree nodes to be redirected to a given paper and access their summaries and virtual assistant
Look for similar papers (in beta version)
By clicking on the button above, our algorithm will scan all papers in our database to find the closest based on the contents of the full papers and not just on metadata. Please note that it only works for papers that we have generated summaries for and you can rerun it from time to time to get a more accurate result while our database grows.