Beyond the Euclidean brain: inferring non-Euclidean latent trajectories from spike trains
Kristopher Torp JenseniD, David LiuiD, Ta-Chu Kao, Máté LengyeliD, Guillaume HennequiniD
Abstract
Neuroscience faces a growing need for scalable data analysis methods that reduce the dimensionality of population recordings yet retain key aspects of the computation or behaviour. To extract interpretable latent trajectories from neural data, it is critical to embrace the inherent topology of the features of interest: head direction evolves on a ring or torus, 3D body rotations on the special orthogonal group, and navigation is best described in the intrinsic coordinates of the environment. Accordingly, we recently proposed the manifold Gaussian process latent variable model (mGPLVM) to simultaneously infer latent representations on non-Euclidean manifolds and how neurons are tuned to these representations. This probabilistic method generalizes previous Euclidean models and allows principled selection between candidate latent topologies. While powerful, mGPLVM makes two unjustified approximations that limit its practical applicability to neural datasets. First, consecutive latent states are assumed independent a priori, whereas behaviour is continuous in time. Second, its Gaussian noise model is inappropriate for positive integer spike counts. Previous work in Euclidean LVMs such as GPFA has shown significant improvements in performance when modeling such features appropriately (Jensen et al., 2021). Here, we extend mGPLVM by incorporating temporally continuous priors over latent states and flexible count-based noise models. This improves inference on synthetic data, avoiding negative spike count predictions and discontinuous jumps in latent trajectories. On real data, we also mitigate these pathologies while improving model fit compared to the original mGPLVM formulation. In summary, our extended mGPLVM provides a widely applicable tool for inferring (non-)Euclidean neural representations from large-scale, heterogeneous population recordings. We provide an efficient implementation in python, relying on recent advances in approximate inference to e.g. fit 10,000 time bins of recording for 100 neurons in five minutes on a single GPU.
02 /Specification & Classification
Click any tag to browse matching papers- Citations
- 0
- Assay
- Research Focus
- Approach
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
- Extended Poisson Gaussian-Process Latent Variable Model for Unsupervised Neural Decoding
Daiyi Luo, Bapun K. Giri, … Caleb T. Kemere·Neural ComputationPeer-reviewed·Jul 19, 2024
- Temporal alignment and latent Gaussian process factor inference in population spike trains
Lea Duncker, Maneesh Sahani·bioRxiv·May 27, 2018
- Scalable Bayesian GPFA with automatic relevance determination and discrete noise models
Kristopher Torp Jensen, Ta-Chu Kao, … Guillaume Hennequin·bioRxiv·Jun 3, 2021
- Discovering Temporally Compositional Neural Manifolds with Switching Infinite GPFA
Changmin Yu, Maneesh Sahani, Máté Lengyel·bioRxiv·Oct 4, 2024
- SIMPL: Scalable and hassle-free optimisation of neural representations from behaviour
Tom M George, Pierre Glaser, … Claudia Clopath A·bioRxiv·Nov 11, 2024
- Spatio-temporal "global" neurodynamics of the human brain in continuous and discrete picture:Simple statistics meet on-manifold microstates as multi-level cortical attractors
Tomohisa Asai, Shiho Kashihara, … Hiroshi Imamizu·bioRxiv·Jul 13, 2023