Research map / Probabilistic and scientific modeling / Dynamical systems
Extracting Governing Equations from Latent Dynamics via Multi-View Contrastive Learning
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Proposes DYSCO, a multi-view temporal contrastive learning method that jointly recovers latent trajectories and symbolic governing dynamics (polynomial basis) from noisy nonlinear observations, with identifiability up to an affine gauge.
Problem
Recovering latent dynamical states and their governing equations from high-dimensional, noisy, nonlinear observations (Gaussian or Poisson noise) with identifiability guarantees, where prior contrastive identifiability results assume noiseless observations.
Approach
Uses multiple independent noisy views of the same latent trajectory in a temporal InfoNCE contrastive objective with a symbolic polynomial-basis dynamics model rolled out by ODE integration, so that cross-view consistency denoises the encoder; proves affine identifiability in the infinite-view limit and gives a symbolic sparsity-over-affine-orbit recovery procedure.
Key results
- Across seven simulated systems under Gaussian and Poisson noise, DYSCO averages 97.6% R^2 and 87.4% dynR^2 (Gaussian) and 98.0% R^2 and 85.4% dynR^2 (Poisson).
- On Lorenz and Stuart-Landau vs DYNCL under Poisson noise, DYSCO reaches 94.4% and 98.0% R^2 with dynR^2 82.3% and 83.1%, while DYNCL gets 0.0% dynR^2 on both.
- Ablation on Lorenz shows performance improves monotonically with number of views (1,2,4,8), and remains good up to noise sigma about 1 (SNR about 4 dB).
Surprising findings
- A single view already yields good results on the Lorenz system, attributed to dense resampling of neighboring latent states on the chaotic attractor.
- Winner-Take-All shows only average dynR^2 despite visually excellent phase portraits, suggesting the metric is affected by slow-velocity attractors.
Limitations
- Evaluated only on simulated data; real neural data not demonstrated.
- Latent dimensionality and symbolic basis are assumed known.
- Scalar potential term omitted in implementation, which may matter for non-uniform marginals; symbolic recovery is only a proof of concept with imperfect spurious terms.
Experimental setup
Datasets: simulated latent dynamical systems (Duffing, Lorenz, FitzHugh-Nagumo, Winner-Take-All, Double-Well, Stuart-Landau, Heter
Benchmarks: Duffing Lorenz FitzHugh-Nagumo Winner-Take-All Double-Well Stuart-Landau Heteroclinic
Metrics: R^2 after affine alignment dynR^2 flow-field R^2
Baselines: DYNCL
Builds on: DYNCL SINDy InfoNCE nonlinear ICA
Closest papers by meaning
- Self-supervised contrastive learning performs non-linear system identification (ICLR 2025 · similarity 0.90)
- Identifying latent state transitions in non-linear dynamical systems (ICLR 2025 · similarity 0.90)
- Contrast encodes inductive bias: separating slow noise from dynamics in predictive representation learning (NeurIPS 2026 · similarity 0.89)
- Maximum-Likelihood Learning of Latent Dynamics Without Reconstruction (ICML 2026 · similarity 0.88)
- Probabilistic Decomposed Linear Dynamical Systems for Robust Discovery of Latent Neural Dynamics (NeurIPS 2024 · similarity 0.87)
- Disentangling Continuous-Time Latent Dynamics: Identifiability of Latent SDEs via Diffusion Shifts (NeurIPS 2026 · similarity 0.86)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
