Fast dynamical similarity analysis
Arman Behrad, Mitchell Ostrow, Mohammad Taha Fakharian, Ila Fiete, Christian Beste, Shervin Safavi

TL;DR
FastDSA is a new method that efficiently and accurately compares the dynamics of complex nonlinear systems, combining geometric efficiency with dynamical fidelity for large-scale neural data analysis.
Contribution
It introduces fastDSA, a novel similarity metric that is both computationally efficient and faithful to system dynamics, bridging a gap in existing methods.
Findings
FastDSA is robust to coordinate choices and sensitive to meaningful differences.
It outperforms existing methods in speed while maintaining accuracy.
Applicable to diverse nonlinear systems and neural models.
Abstract
Understanding how nonlinear dynamical systems (e.g., artificial neural networks and neural circuits) process information requires comparing their underlying dynamics at scale, across diverse architectures and large neural recordings. While many similarity metrics exist, current approaches fall short for large-scale comparisons. Geometric methods are computationally efficient but fail to capture governing dynamics, limiting their accuracy. In contrast, traditional dynamical similarity methods are faithful to system dynamics but are often computationally prohibitive. We bridge this gap by combining the efficiency of geometric approaches with the fidelity of dynamical methods. We introduce fast dynamical similarity analysis (fastDSA), a computationally efficient and accurate metric for measuring (dis)similarity between nonlinear dynamical systems. FastDSA leverages modern computational…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
