Papers › Beyond Geometry: Comparing the Temporal Structure of Computation in Neural Circuits...

Beyond Geometry: Comparing the Temporal Structure of Computation in Neural Circuits with Dynamical Similarity Analysis

16 Jun 2023NeurIPS 2023 11arXiv:2306.10168archive 2025-07-28

Mitchell Ostrow, Adam Eisen, Leo Kozachkov, Ila Fiete

How can we tell whether two neural networks utilize the same internal processes for a particular computation? This question is pertinent for multiple subfields of neuroscience and machine learning, including neuroAI, mechanistic interpretability, and brain-machine interfaces. Standard approaches for comparing neural networks focus on the spatial geometry of latent states. Yet in recurrent networks, computations are implemented at the level of dynamics, and two networks performing the same computation with equivalent dynamics need not exhibit the same geometry. To bridge this gap, we introduce a novel similarity metric that compares two systems at the level of their dynamics, called Dynamical Similarity Analysis (DSA). Our method incorporates two components: Using recent advances in data-driven dynamical systems theory, we learn a high-dimensional linear system that accurately captures core features of the original nonlinear dynamics. Next, we compare different systems passed through this embedding using a novel extension of Procrustes Analysis that accounts for how vector fields change under orthogonal transformation. In four case studies, we demonstrate that our method disentangles conjugate and non-conjugate recurrent neural networks (RNNs), while geometric methods fall short. We additionally show that our method can distinguish learning rules in an unsupervised manner. Our method opens the door to comparative analyses of the essential temporal structure of computation in neural circuits.

PaperPDFConference PDFCodeCode 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="2306.10168")

Code

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

By repository: official repository: 17 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.

mitchellostrow/dsa officialmentioned in papermentioned on GitHubpytorchMIT report
qglht/repal mentioned on GitHubpytorchMIT 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

17 samples harvested; 0 ran; 0 honoured the contract we drafted; 17 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.

17unverified

Licence: 0 of the 17 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 mitchellostrow/dsa. “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.

coarse_grain mitchellostrow/dsa/DSA/preprocessing.py official repository unverified MIT (permissive) · ce82b9159690e201 · report
compute_angle mitchellostrow/dsa/DSA/simdist.py official repository unverified MIT (permissive) · f619414f24f51acd · report
compute_residuals mitchellostrow/dsa/DSA/resdmd.py official repository unverified MIT (permissive) · 2c07e6403bc87552 · report
compute_residuals_pykoopman mitchellostrow/dsa/DSA/resdmd.py official repository unverified MIT (permissive) · 70f1203a7cd08d77 · report
compute_residuals_subspace_dmdc mitchellostrow/dsa/DSA/resdmd.py official repository unverified MIT (permissive) · 4b89656fc2246ff0 · report
compute_subspace_angles mitchellostrow/dsa/DSA/simdist.py official repository unverified MIT (permissive) · e56244a3bcbf33c4 · report
embed_data_DMDc mitchellostrow/dsa/DSA/dmdc.py official repository unverified MIT (permissive) · 43f545258d864847 · report
embed_signal_torch mitchellostrow/dsa/DSA/dmd.py official repository unverified MIT (permissive) · 727929ee435d8106 · report
mae mitchellostrow/dsa/DSA/stats.py official repository unverified MIT (permissive) · 43a5b3592b84536d · report
mase mitchellostrow/dsa/DSA/stats.py official repository unverified MIT (permissive) · aa9cf3edabb13e0d · report
normalize_data mitchellostrow/dsa/DSA/preprocessing.py official repository unverified MIT (permissive) · f56b12d183adacab · report
normalize_dataset mitchellostrow/dsa/DSA/preprocessing.py official repository unverified MIT (permissive) · be99d312201d0c3d · report
pad_zeros mitchellostrow/dsa/DSA/simdist.py official repository unverified MIT (permissive) · fb3e7fc8f5aae568 · report
split_train_test mitchellostrow/dsa/DSA/sweeps.py official repository unverified MIT (permissive) · 16779f71fd8051f6 · report
sweep_local_dmd mitchellostrow/dsa/DSA/sweeps.py official repository unverified MIT (permissive) · dea4ecf3be0f5736 · report
sweep_pykoopman mitchellostrow/dsa/DSA/sweeps.py official repository unverified MIT (permissive) · aa3a546937bafe14 · report
torch_convert mitchellostrow/dsa/DSA/stats.py official repository unverified MIT (permissive) · e1d6e88bffac80b7 · report

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

FocusProcrustes

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