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

• URL: http://arxiv.org/abs/2603.20474v1
• Date: Fri, 20 Mar 2026 20:06:34 GMT
• Title: From Data to Laws: Neural Discovery of Conservation Laws Without False Positives
• Abstract summary: We introduce NGCG, a neuralsymbolic pipeline that decouples dynamics learning from invariant discovery.<n>On a benchmark of nine diverse systems, NGCG achieves consistent discovery on all four systems with true conservation laws.<n>It is the only method that succeeds on the Lotka-Volterra system, and it correctly outputs no law on all five systems without invariants.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• 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 ($σ= 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.

Related papers

• S$^3$GNN: Efficient Global Mixing and Local Message Passing for Long-Range Graph Learning [56.04227780048336]
  Message-passing neural networks (MPNNs) often suffer from an information bottleneck when capturing long-range dependencies.<n>We propose S$3$GNN, which mitigates oversquashing (OSQ) by lightweightly reintroducing omitted components.<n>Our experiments show that S$3$GNN achieves up to an order-of-magnitude error reduction with up to 50% fewer parameters.
  arXiv  Detail & Related papers  (2026-05-22T10:26:41Z)
• Symbolic Graph Networks for Robust PDE Discovery from Noisy Sparse Data [38.07396595643637]
  We propose a Symbolic Graph Network (SGN) framework for PDE discovery under noisy and sparse conditions.<n>We evaluate the proposed method on several benchmark systems, including the wave equation, convection-diffusion equation, and incompressible Navier-Stokes equations.
  arXiv  Detail & Related papers  (2026-03-23T13:53:44Z)
• Semantic Tube Prediction: Beating LLM Data Efficiency with JEPA [50.494504099850325]
  We introduce the Geodesic Hypothesis, positing that token sequences trace geodesics on a smooth semantic manifold and are therefore locally linear.<n>We show this constraint improves signal-to-noise ratio, and preserves diversity by preventing collisions during trajectory.<n>We demonstrate that geometric priors can surpass brute-force scaling.
  arXiv  Detail & Related papers  (2026-02-26T04:45:07Z)
• LEVDA: Latent Ensemble Variational Data Assimilation via Differentiable Dynamics [6.953554594702111]
  We propose Latent Ensemble Data Assimilation (LEVDA), an ensemble-space variational smoother.<n>It assimilates states and unknown parameters without the need for adjoint code or auxiliary observation-to-latent encoders.<n>It substantially improved assimilation accuracy and computational efficiency compared to full-state 4DEnVar.
  arXiv  Detail & Related papers  (2026-02-23T00:54:59Z)
• Discovering Governing Equations in the Presence of Uncertainty [11.752763800308276]
  In this work, we theorize that accounting for system variability together with measurement noise is the key to consistently discover the governing equations underlying dynamical systems.<n>We show that SIP consistently identifies the correct equations by an average of 82% relative to the Sparse Identification Dynamics (SINDy) approach and its variant.
  arXiv  Detail & Related papers  (2025-07-13T18:31:25Z)
• Tensor-Var: Efficient Four-Dimensional Variational Data Assimilation [30.63086465547801]
  Four-dimensional variational assimilation (4D-Var) faces high computational costs in complex nonlinear systems and depends on imperfect state-observation mappings.<n>Deep learning (DL) offers more expressive approximators, while integrating DL models into 4D-Var is challenging due to their nonlinearities and lack of theoretical guarantees in assimilation results.<n>We propose a novel framework that integrates kernel conditional mean embedding (CME) with 4D-Var to linearize nonlinear dynamics, achieving convex optimization in a learned feature space.
  arXiv  Detail & Related papers  (2025-01-23T01:43:31Z)
• Learning Controlled Stochastic Differential Equations [61.82896036131116]
  This work proposes a novel method for estimating both drift and diffusion coefficients of continuous, multidimensional, nonlinear controlled differential equations with non-uniform diffusion. We provide strong theoretical guarantees, including finite-sample bounds for (L2), (Linfty), and risk metrics, with learning rates adaptive to coefficients' regularity. Our method is available as an open-source Python library.
  arXiv  Detail & Related papers  (2024-11-04T11:09:58Z)
• Stable Neighbor Denoising for Source-free Domain Adaptive Segmentation [91.83820250747935]
  Pseudo-label noise is mainly contained in unstable samples in which predictions of most pixels undergo significant variations during self-training. We introduce the Stable Neighbor Denoising (SND) approach, which effectively discovers highly correlated stable and unstable samples. SND consistently outperforms state-of-the-art methods in various SFUDA semantic segmentation settings.
  arXiv  Detail & Related papers  (2024-06-10T21:44:52Z)
• Message Passing Neural PDE Solvers [60.77761603258397]
  We build a neural message passing solver, replacing allally designed components in the graph with backprop-optimized neural function approximators. We show that neural message passing solvers representationally contain some classical methods, such as finite differences, finite volumes, and WENO schemes. We validate our method on various fluid-like flow problems, demonstrating fast, stable, and accurate performance across different domain topologies, equation parameters, discretizations, etc., in 1D and 2D.
  arXiv  Detail & Related papers  (2022-02-07T17:47:46Z)
• Reachability Analysis of Neural Feedback Loops [34.94930611635459]
  This work focuses on estimating the forward reachable set of textitneural feedback loops (closed-loop systems with NN controllers) Recent work provides bounds on these reachable sets, but the computationally tractable approaches yield overly conservative bounds. This work bridges the gap by formulating a convex optimization problem for the reachability analysis of closed-loop systems with NN controllers.
  arXiv  Detail & Related papers  (2021-08-09T16:11:57Z)
• Sparse Identification of Nonlinear Dynamical Systems via Reweighted $\ell_1$-regularized Least Squares [62.997667081978825]
  This work proposes an iterative sparse-regularized regression method to recover governing equations of nonlinear systems from noisy state measurements. The aim of this work is to improve the accuracy and robustness of the method in the presence of state measurement noise.
  arXiv  Detail & Related papers  (2020-05-27T08:30:15Z)
• A Data-Driven Approach for Discovering Stochastic Dynamical Systems with Non-Gaussian Levy Noise [5.17900889163564]
  We develop a new data-driven approach to extract governing laws from noisy data sets. First, we establish a feasible theoretical framework, by expressing the drift coefficient, diffusion coefficient and jump measure. We then design a numerical algorithm to compute the drift, diffusion coefficient and jump measure, and thus extract a governing equation with Gaussian and non-Gaussian noise.
  arXiv  Detail & Related papers  (2020-05-07T21:29:17Z)
• Adaptive Control and Regret Minimization in Linear Quadratic Gaussian (LQG) Setting [91.43582419264763]
  We propose LqgOpt, a novel reinforcement learning algorithm based on the principle of optimism in the face of uncertainty. LqgOpt efficiently explores the system dynamics, estimates the model parameters up to their confidence interval, and deploys the controller of the most optimistic model.
  arXiv  Detail & Related papers  (2020-03-12T19:56: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.