Non-reversible Gaussian processes for identifying latent dynamical structure in neural data
Virginia Rutten, Alberto Bernacchia, Maneesh Sahani, Guillaume Hennequin
Abstract
A common goal in the analysis of neural data is to compress large population recordings into sets of interpretable, low-dimensional latent trajectories. This problem can be approached using Gaussian process (GP)-based methods which provide uncertainty quantification and principled model selection. However, standard GP priors do not distinguish between underlying dynamical processes and other forms of temporal autocorrelation. Here, we propose a new family of "dynamical" priors over trajectories, in the form of GP covariance functions that express a property shared by most dynamical systems: temporal non-reversibility. Non-reversibility is a universal signature of autonomous dynamical systems whose state trajectories follow consistent flow fields, such that any observed trajectory could not occur in reverse. Our new multi-output GP kernels can be used as drop-in replacements for standard kernels in multivariate regression, but also in latent variable models such as Gaussian process factor analysis (GPFA). We therefore introduce GPFADS (Gaussian Process Factor Analysis with Dynamical Structure), which models single-trial neural population activity using low-dimensional, non-reversible latent processes. Unlike previously proposed non-reversible multi-output kernels, ours admits a Kronecker factorization enabling fast and memory-efficient learning and inference. We apply GPFADS to synthetic data and show that it correctly recovers ground truth phase portraits. GPFADS also provides a probabilistic generalization of jPCA, a method originally developed for identifying latent rotational dynamics in neural data. When applied to monkey M1 neural recordings, GPFADS discovers latent trajectories with strong dynamical structure in the form of rotations.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext a738bafd-8c06-45e9-afdf-ecfe938cc7ecCited by top-tier papers8
- iLQR-VAE : control-based learning of input-driven dynamics with applications to neural dataMarine Schimel, Ta-Chu Kao, Kristopher T. Jensen, Guillaume HennequinICLR 2022 · 40 citations
- Scalable Bayesian GPFA with automatic relevance determination and discrete noise modelsKristopher T. Jensen, Ta-Chu Kao, Jasmine Stone, Guillaume HennequinNeurIPS 2021 · 22 citations
- Estimating Noise Correlations Across Continuous Conditions With Wishart ProcessesAmin Nejatbakhsh, Isabel Garon, Alex H. WilliamsNeurIPS 2023 · 13 citations
- A universal probabilistic spike count model reveals ongoing modulation of neural variabilityDavid Liu, Máté LengyelNeurIPS 2021 · 10 citations
- Mesoscopic modeling of hidden spiking neuronsShuqi Wang, Valentin Schmutz, Guillaume Bellec, Wulfram GerstnerNeurIPS 2022 · 6 citations
Related papers
- Multi-modal Gaussian Process Variational Autoencoders for Neural and Behavioral DataRabia Gondur, Usama Bin Sikandar, Evan Schaffer, Mikio Christian Aoi et al.ICLR 2024 · 15 citations
- Discovering Temporally Compositional Neural Manifolds with Switching Infinite GPFAChangmin Yu, Maneesh Sahani, Máté LengyelICLR 2025
- Conditionally-Conjugate Gaussian Process Factor Analysis for Spike Count Data via Data AugmentationYididiya Y. Nadew, Xuhui Fan, Christopher John QuinnICML 2024 · 2 citations
- Nonparametric Factor Trajectory Learning for Dynamic Tensor DecompositionZheng Wang, Shandian ZheICML 2022 · 8 citations
- Efficient Non-conjugate Gaussian Process Factor Models for Spike Count Data using Polynomial ApproximationsStephen L. Keeley, David M. Zoltowski, Yiyi Yu, Spencer L. Smith et al.ICML 2020 · 24 citations
