From Data to Laws: Neural Discovery of Conservation Laws Without False Positives

arXiv cs.LG / 3/24/2026

💬 OpinionIdeas & Deep AnalysisModels & Research

Key Points

  • The paper introduces NGCG, a neural-symbolic pipeline that separates learning system dynamics from discovering conservation-law invariants to reduce common failure modes in data-driven discovery.
  • NGCG uses a multi-restart variance minimiser to learn near-constant latent representations, then applies system-specific symbolic extraction techniques (e.g., polynomial/log-basis Lasso and PySR) to produce closed-form candidates.
  • It incorporates a strict constancy gate and a diversity filter to eliminate spurious or “false positive” laws, including on chaotic systems.
  • On a benchmark of nine diverse dynamical systems (ODEs, Hamiltonian/dissipative systems, chaos, and PDEs), NGCG reports perfect conservation-law detection metrics (DR=1.0, FDR=0.0, F1=1.0 for systems with true invariants) and uniquely succeeds on Lotka–Volterra.
  • The method is claimed to be robust to noise (σ=0.1), sample-efficient (50–100 trajectories), relatively insensitive to hyperparameters, and fast (under one minute per system), while offering an interpretable Pareto tradeoff between expression complexity and constancy.

Abstract

Conservation laws are fundamental to understanding dynamical systems, but discovering them from data remains challenging due to parameter variation, non-polynomial invariants, local minima, and false positives on chaotic systems. We introduce NGCG, a neural-symbolic pipeline that decouples dynamics learning from invariant discovery and systematically addresses these challenges. A multi-restart variance minimiser learns a near-constant latent representation; system-specific symbolic extraction (polynomial Lasso, log-basis Lasso, explicit PDE candidates, and PySR) yields closed-form expressions; a strict constancy gate and diversity filter eliminate spurious laws. On a benchmark of nine diverse systems including Hamiltonian and dissipative ODEs, chaos, and PDEs, NGCG achieves consistent discovery (DR=1.0, FDR=0.0, F1=1.0) on all four systems with true conservation laws, with constancy two to three orders of magnitude lower than the best baseline. It is the only method that succeeds on the Lotka--Volterra system, and it correctly outputs no law on all five systems without invariants. Extensive experiments demonstrate robustness to noise (\sigma = 0.1), sample efficiency (50--100 trajectories), insensitivity to hyperparameters, and runtime under one minute per system. A Pareto analysis shows that the method provides a range of candidate expressions, allowing users to trade complexity for constancy. NGCG achieves strong performance relative to prior methods for data-driven conservation-law discovery, combining high accuracy with interpretability.

From Data to Laws: Neural Discovery of Conservation Laws Without False Positives | AI Navigate