mlsanityData to 7 Oct 2026

CTSR: Cartesian tensor-based sparse regression for data-driven discovery of high-dimensional invariant governing equations

arXiv 2504.07618 ↗First posted 10 Apr 2025cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

Accurate and concise governing equations are crucial for understanding system dynamics. Recently, data-driven methods such as sparse regression have been employed to automatically uncover governing equations from data, representing a significant shift from traditional first-principles modeling. However, most existing methods focus on scalar equations, limiting their applicability to simple, low-dimensional scenarios, and failing to ensure rotation and reflection invariance without incurring significant computational cost or requiring additional prior knowledge. This paper proposes a Cartesian tensor-based sparse regression (CTSR) technique to accurately and efficiently uncover complex, high-dimensional governing equations while ensuring invariance. Evaluations on two two-dimensional (2D) and two three-dimensional (3D) test cases demonstrate that the proposed method achieves superior accuracy and efficiency compared to the conventional technique.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 17 of its 59 references that are in the map. First posted on arXiv 10 Apr 2025.

Builds on

17 of 59 references.

References · 17

  1. 2019AI Feynman: a Physics-Inspired Method for Symbolic Regressioncited by 536
  2. 2019Deep symbolic regression: Recovering mathematical expressions from data via risk-seeking policy gradientscited by 294
  3. 2018PDE-Net 2.0: Learning PDEs from Data with A Numeric-Symbolic Hybrid Deep Networkcited by 208
  4. 2020Physics-informed learning of governing equations from scarce datacited by 167
  5. 2018Learning Equations for Extrapolation and Controlcited by 151
  6. 2020SINDy-PI: A Robust Algorithm for Parallel Implicit Sparse Identification of Nonlinear Dynamicscited by 125
  7. 2016Extrapolation and learning equationscited by 106
  8. 2022Interpretable Scientific Discovery with Symbolic Regression: A Reviewcited by 105
  9. 2019Integration of Neural Network-Based Symbolic Regression in Deep Learning for Scientific Discoverycited by 93
  10. 2021Any equation is a forest: Symbolic genetic algorithm for discovering open-form partial differential equations (SGA-PDE)cited by 38
  11. 2021Discovering Sparse Interpretable Dynamics from Partial Observationscited by 25
  12. 2022Deep Learning and Symbolic Regression for Discovering Parametric Equationscited by 22
5 more
  1. 2022PDE-LEARN: Using Deep Learning to Discover Partial Differential Equations from Noisy, Limited Datacited by 20
  2. 2023Discover governing differential equations from evolving systemscited by 5
  3. 2024An invariance constrained deep learning network for PDE discoverycited by 3
  4. 2024Constrained or Unconstrained? Neural-Network-Based Equation Discovery from Datacited by 3
  5. 2024Constraining Genetic Symbolic Regression via Semantic Backpropagationcited by 2

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.