Adaptive Symmetry Discovery for Dynamical System Identification

• URL: http://arxiv.org/abs/2608.08091v1
• Date: Sat, 08 Aug 2026 12:18:07 GMT
• Title: Adaptive Symmetry Discovery for Dynamical System Identification
• Abstract summary: We study adaptive symmetry discovery for dynamical system identification.<n>We first show that for known symmetries, the system can be identified from a significantly shorter single trajectory than in the generic setting.<n>We then consider the automatic symmetry discovery setting, proposing a method to learn the symmetry group directly from a single trajectory.
• Score: 15.56971726974056
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Dynamical systems model trajectory data generated by fixed underlying dynamics, with applications ranging from biology to physics. Especially in scientific settings, dynamical systems are not generic but often exhibit symmetries imposed by physical laws, formalized through equivariance with respect to group actions. The identification problem concerns recovering the parameters of a system from observed trajectories. In this work, we study adaptive symmetry discovery for dynamical system identification and address how a system can be identified from a single trajectory when it is equivariant with respect to an unknown symmetry group. To this end, we first show that for known symmetries, the system can be identified from a significantly shorter single trajectory than in the generic setting, and we precisely characterize this improvement. We then consider the automatic symmetry discovery setting, proposing a method to learn the symmetry group directly from a single trajectory and incorporate it into the identification procedure, achieving the same optimal trajectory length as in the known-symmetry case. Our analysis relies on tools from group representation theory and the expander properties of Cayley graphs, and may be of independent interest for the study of symmetries in dynamical systems.

Related papers

• SIM-GRAPH: A universal guide to symmetric interactions [0.0]
  In finite quantum systems, symmetries are often discrete, such as reflection and rotational symmetries.<n>We present the SIM-GRAPH method, which uses such symmetries to efficiently calculate ground-state observables of interacting quantum systems.
  arXiv  Detail & Related papers  (2026-09-09T10:20:58Z)
• Loss Landscape Geometry and the Learning of Symmetries: Or, What Influence Functions Reveal About Robust Generalization [0.14201057456467273]
  We study how neural emulators internalize physical symmetries by introducing an influence-based diagnostic.<n>This quantity probes the local geometry of the learned loss landscape.<n>We show that orbit-wise gradient coherence provides the mechanism for learning to generalize over symmetry transformations.
  arXiv  Detail & Related papers  (2026-01-28T02:14:01Z)
• Disordered Dynamics in High Dimensions: Connections to Random Matrices and Machine Learning [52.26396748560348]
  We provide an overview of high dimensional dynamical systems driven by random matrices.<n>We focus on applications to simple models of learning and generalization in machine learning theory.
  arXiv  Detail & Related papers  (2026-01-03T00:12:32Z)
• Axis-level Symmetry Detection with Group-Equivariant Representation [48.813587457507786]
  Recent heatmap-based approaches can localize potential regions of symmetry axes but often lack precision in identifying individual axes.<n>We propose a novel framework for axis-level detection of the two most common symmetry types-reflection and rotation.<n>Our method achieves state-of-the-art performance, outperforming existing approaches.
  arXiv  Detail & Related papers  (2025-08-14T15:26:53Z)
• Generalized Linear Mode Connectivity for Transformers [87.32299363530996]
  A striking phenomenon is linear mode connectivity (LMC), where independently trained models can be connected by low- or zero-loss paths.<n>Prior work has predominantly focused on neuron re-ordering through permutations, but such approaches are limited in scope.<n>We introduce a unified framework that captures four symmetry classes: permutations, semi-permutations, transformations, and general invertible maps.<n>This generalization enables, for the first time, the discovery of low- and zero-barrier linear paths between independently trained Vision Transformers and GPT-2 models.
  arXiv  Detail & Related papers  (2025-06-28T01:46:36Z)
• Exceptional Points and Stability in Nonlinear Models of Population Dynamics having $\mathcal{PT}$ symmetry [49.1574468325115]
  We analyze models governed by the replicator equation of evolutionary game theory and related Lotka-Volterra systems of population dynamics.<n>We study the emergence of exceptional points in two cases: (a) when the governing symmetry properties are tied to global properties of the models, and (b) when these symmetries emerge locally around stationary states.
  arXiv  Detail & Related papers  (2024-11-19T02:15:59Z)
• A Generative Model of Symmetry Transformations [44.87295754993983]
  We build a generative model that explicitly aims to capture the data's approximate symmetries.<n>We empirically demonstrate its ability to capture symmetries under affine and color transformations.
  arXiv  Detail & Related papers  (2024-03-04T11:32:18Z)
• Latent Space Symmetry Discovery [31.28537696897416]
  We propose a novel generative model, Latent LieGAN, which can discover symmetries of nonlinear group actions. We show that our model can express nonlinear symmetries under some conditions about the group action. LaLiGAN also results in a well-structured latent space that is useful for downstream tasks including equation discovery and long-term forecasting.
  arXiv  Detail & Related papers  (2023-09-29T19:33:01Z)
• Finding discrete symmetry groups via Machine Learning [0.0]
  We introduce a machine-learning approach capable of automatically discovering discrete symmetry groups in physical systems. This method identifies the finite set of parameter transformations that preserve the system's physical properties.
  arXiv  Detail & Related papers  (2023-07-25T12:37:46Z)
• On discrete symmetries of robotics systems: A group-theoretic and data-driven analysis [38.92081817503126]
  We study discrete morphological symmetries of dynamical systems. These symmetries arise from the presence of one or more planes/axis of symmetry in the system's morphology. We exploit these symmetries using data augmentation and $G$-equivariant neural networks.
  arXiv  Detail & Related papers  (2023-02-21T04:10:16Z)
• Identifiability and Asymptotics in Learning Homogeneous Linear ODE Systems from Discrete Observations [114.17826109037048]
  Ordinary Differential Equations (ODEs) have recently gained a lot of attention in machine learning. theoretical aspects, e.g., identifiability and properties of statistical estimation are still obscure. This paper derives a sufficient condition for the identifiability of homogeneous linear ODE systems from a sequence of equally-spaced error-free observations sampled from a single trajectory.
  arXiv  Detail & Related papers  (2022-10-12T06:46:38Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.