InputDSA: Demixing, then comparing recurrent and externally driven dynamics
Overview
Overall Novelty Assessment
The paper introduces InputDSA, a metric for comparing both intrinsic and input-driven dynamics across systems, extending the DSA framework by incorporating external forcing. It resides in the 'Dynamical Similarity Analysis and Comparison Metrics' leaf, which contains only two papers total. This is a notably sparse research direction within the broader taxonomy of 50 papers across 22 leaf nodes. The sibling paper focuses on modeling intrinsic and input dynamics rather than comparison metrics, suggesting that quantitative similarity measurement for input-driven systems remains an underexplored niche despite the field's broader interest in decomposition and identification methods.
The taxonomy reveals that neighboring leaves are densely populated with decomposition techniques: Koopman operator methods (4 papers), latent dynamics architectures (4 papers), and statistical approaches (2 papers). These adjacent directions emphasize separating or modeling intrinsic versus input-driven components, whereas InputDSA's leaf focuses on comparison after decomposition. The scope notes clarify that decomposition methods aim to identify components, while the comparison metrics category addresses quantifying similarity across systems. This structural positioning suggests InputDSA bridges a gap between decomposition-heavy approaches and the need for cross-system evaluation, occupying a distinct methodological space.
Among 30 candidates examined, the core InputDSA metric contribution shows no clear refutation (10 candidates examined, 0 refutable). However, the Subspace DMDc variant and the fast optimization algorithm each face one refutable candidate among 10 examined. The limited search scope means these statistics reflect top-30 semantic matches rather than exhaustive coverage. The metric itself appears more novel than its algorithmic components, which may overlap with existing DMDc or optimization literature. The contribution-level analysis suggests the conceptual framework for comparing input-driven dynamics is less anticipated by prior work than the technical implementation details.
Based on the limited 30-candidate search, InputDSA occupies a sparse research direction with minimal direct competition in its specific comparison-focused niche. The taxonomy structure and sibling paper context suggest the work addresses an underserved need, though the algorithmic contributions show some overlap with existing techniques. The analysis does not cover exhaustive DMDc or optimization literature, so the novelty assessment remains provisional and tied to the semantic search scope employed.
Taxonomy
Research Landscape Overview
Claimed Contributions
The authors propose InputDSA, which extends the Dynamical Similarity Analysis framework to account for external inputs by estimating and comparing both input and intrinsic dynamic operators. This enables quantitative comparison of how inputs affect dynamics in addition to recurrent dynamics.
The authors develop Subspace DMDc, a novel variant of Dynamic Mode Decomposition with control based on subspace identification. This method addresses the failure mode of standard DMDc in partially observed systems where inputs affect both observed and unobserved components.
The authors introduce an optimization algorithm that solves the InputDSA metric via Procrustes alignment rather than iterative optimization, providing exponential acceleration compared to prior methods while maintaining theoretical grounding.
Core Task Comparisons
Comparisons with papers in the same taxonomy category
[1] Modeling and dissociation of intrinsic and input-driven neural population dynamics underlying behavior PDF
Contribution Analysis
Detailed comparisons for each claimed contribution
InputDSA: a novel metric for comparing intrinsic and input-driven dynamics
The authors propose InputDSA, which extends the Dynamical Similarity Analysis framework to account for external inputs by estimating and comparing both input and intrinsic dynamic operators. This enables quantitative comparison of how inputs affect dynamics in addition to recurrent dynamics.
[15] BRAID: Input-driven nonlinear dynamical modeling of neural-behavioral data PDF
[71] Suppression of chaos in a partially driven recurrent neural network PDF
[72] Interpreting multi-stable behaviour in input-driven recurrent neural networks PDF
[73] A connectivity gradient in structured reservoir computing predicts a hierarchy for mixed selectivity in human cortex PDF
[74] Echo state property linked to an input: Exploring a fundamental characteristic of recurrent neural networks PDF
[75] Opening the black box: low-dimensional dynamics in high-dimensional recurrent neural networks PDF
[76] Inferring context-dependent computations through linear approximations of prefrontal cortex dynamics PDF
[77] Input-driven circuit reconfiguration in critical recurrent neural networks PDF
[78] Disentangling recurrent neural dynamics with stochastic representational geometry PDF
[79] On the dimension of pullback attractors in recurrent neural networks PDF
Subspace DMDc: a variant of DMD with control for partially observed systems
The authors develop Subspace DMDc, a novel variant of Dynamic Mode Decomposition with control based on subspace identification. This method addresses the failure mode of standard DMDc in partially observed systems where inputs affect both observed and unobserved components.
[68] Learning Bilinear Models of Actuated Koopman Generators from Partially-Observed Trajectories PDF
[61] Bridging Autoencoders and Dynamic Mode Decomposition for Reduced-order Modeling and Control of PDEs PDF
[62] Dynamic-mode decomposition and optimal prediction. PDF
[63] A scaled derivative-based DMDc method for modelling multiple-input multiple-output mechanical systems PDF
[64] Delay-structured noise robust dynamic mode decomposition for power system modal estimation with faulty PMU data PDF
[65] A Supervised and Transfer Learning Based Two-Stage Framework for UAV Swarm Multi-Target Tracking PDF
[66] Observerâbased eventâtriggered distributed model predictive control for a class of nonlinear interconnected systems PDF
[67] SelfâTriggered Distributed Model Predictive Control via Path Parameter Synchronization PDF
[69] Traffic forecasting with missing data via low rank dynamic mode decomposition of tensor PDF
[70] Online learning and control of complex dynamical systems from sensory input PDF
Fast optimization algorithm for InputDSA metric computation
The authors introduce an optimization algorithm that solves the InputDSA metric via Procrustes alignment rather than iterative optimization, providing exponential acceleration compared to prior methods while maintaining theoretical grounding.