Papers › A probabilistic framework for task-aligned intra- and inter-area neural manifold estimation

A probabilistic framework for task-aligned intra- and inter-area neural manifold estimation

6 Sep 2022arXiv:2209.02816archive 2025-07-28

Edoardo Balzani, Jean Paul Noel, Pedro Herrero-Vidal, Dora E. Angelaki, Cristina Savin

Latent manifolds provide a compact characterization of neural population activity and of shared co-variability across brain areas. Nonetheless, existing statistical tools for extracting neural manifolds face limitations in terms of interpretability of latents with respect to task variables, and can be hard to apply to datasets with no trial repeats. Here we propose a novel probabilistic framework that allows for interpretable partitioning of population variability within and across areas in the context of naturalistic behavior. Our approach for task aligned manifold estimation (TAME-GP) extends a probabilistic variant of demixed PCA by (1) explicitly partitioning variability into private and shared sources, (2) using a Poisson noise model, and (3) introducing temporal smoothing of latent trajectories in the form of a Gaussian Process prior. This TAME-GP graphical model allows for robust estimation of task-relevant variability in local population responses, and of shared co-variability between brain areas. We demonstrate the efficiency of our estimator on within model and biologically motivated simulated data. We also apply it to neural recordings in a closed-loop virtual navigation task in monkeys, demonstrating the capacity of TAME-GP to capture meaningful intra- and inter-area neural variability with single trial resolution.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2209.02816")

Code

Syntology Ran 0 of 12 code samples harvested from 1 repository linked to this paper; 12 have no recorded run.

By repository: official repository: 12 samples from 1 repository, 0 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

balzaniedoardo/tame-gp officialmentioned in papermentioned on GitHubMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

12 samples harvested; 0 ran; 0 honoured the contract we drafted; 12 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

12unverified

Licence: 0 of the 12 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from balzaniedoardo/tame-gp. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

GPLogLike balzaniedoardo/tame-gp/core/inference.py official repository unverified MIT (permissive) · 37c9910bd5d7a1ee · report
MStepGauss balzaniedoardo/tame-gp/core/learnGaussianParam.py official repository unverified MIT (permissive) · 3018164749c26e46 · report
block_inv balzaniedoardo/tame-gp/core/data_processing_tools.py official repository unverified MIT (permissive) · e30898c47a64f3a0 · report
compileTrialStackedObsAndLatent balzaniedoardo/tame-gp/core/data_processing_tools.py official repository unverified MIT (permissive) · 9ca8df1a25d01713 · report
expectedLLPoisson balzaniedoardo/tame-gp/core/learnPoissonParam.py official repository unverified MIT (permissive) · e1f68ee82159b776 · report
fast_stackCSRHes_memoryPreAllocation balzaniedoardo/tame-gp/core/data_processing_tools.py official repository unverified MIT (permissive) · 77dc3857c3b4d606 · report
grad_GPLogLike balzaniedoardo/tame-gp/core/inference.py official repository unverified MIT (permissive) · afc943a0bf54fdc6 · report
grad_Poisson_ithunit balzaniedoardo/tame-gp/core/learnPoissonParam.py official repository unverified MIT (permissive) · 300256c468a22a4b · report
grad_expectedLLPoisson balzaniedoardo/tame-gp/core/learnPoissonParam.py official repository unverified MIT (permissive) · 86af6b6c728cd3c8 · report
grag_GaussLL_wrt_Wd balzaniedoardo/tame-gp/core/learnGaussianParam.py official repository unverified MIT (permissive) · 080e1e0050cc6ef8 · report
hess_GPLogLike balzaniedoardo/tame-gp/core/inference.py official repository unverified MIT (permissive) · 752cd888d54fd526 · report
logLike_Gauss balzaniedoardo/tame-gp/core/learnGaussianParam.py official repository unverified MIT (permissive) · 1587807b549bfccc · report

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Gaussian ProcessPCA

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections