Skip to content

DeSyR: A Decoupled Symbolic Recovery Framework with PINN-Guided Structure Search and Physics-Informed Coefficient Refinement

Sep 2026 · 0 citations
Computer Science

TL;DR

Results show that an approximate neural teacher can guide topology discovery without imposing its error scale on final recovered coefficients, provided a target-capable topology is retained and physics-only refinement converges.

Abstract

Recovering compact explicit solutions from neural approximations is challenging when imperfect teacher data guide symbolic topology search and coefficient estimation. We present DeSyR, a decoupled symbolic recovery framework for differential equations. A physics-informed neural network guides repeated searches to construct candidate topologies with provisional constants. Once a topology is fixed, its coefficients are refined solely from the governing equation and prescribed constraints, followed by gated selection and verification. For linear fixed-topology parameterizations, we characterize teacher-error inheritance and show that finite-weight mixed data--physics fitting retains an $O(\beta^{-1})$ teacher-dependent contribution when the teacher error projects onto the model space. Under well-posedness, representability, zero-residual attainment, and discrete determinacy, physics-only refinement conditionally recovers exact coefficients; for nonlinear parameterizations, the corresponding guarantees are local. DeSyR is evaluated on 15 differential-equation problems across 18 configurations covering high-order, space--time, multidimensional, nonlinear, and coupled systems. A candidate-level audit yields a 99.23% convergence rate among free-parameter refits, while every selected refinement involving free coefficients converges. Configuration-level median refined relative $L_2$ errors are $2.31\times10^{-14}$ or lower. In same-topology comparisons, refinement reduces error by eight to fourteen orders of magnitude. These results show that an approximate neural teacher can guide topology discovery without imposing its error scale on final recovered coefficients, provided a target-capable topology is retained and physics-only refinement converges.

View source

Similar papers

#machine learning Preprint Sep 2026

SMILE: Bridging Continuous Optimization and Discrete Symbolic Recovery

Symbolic regression (SR) discovers closed-form mathematical expressions from data, offering interpretability beyond black-box models. Existing methods suffer from slow convergence in combinatorial search spaces and lack mechanisms to exploit compositional structure in the data. We introduce SMILE (Sine, Multiplication,...

Mansooreh Montazerin, Antonio Ortega, Ajitesh Srivastava · 0 citations
Review Aug 2026

NestyNet. III. Symbolic Regression from Analytic Neural Surrogates

A neural surrogate with analytic derivatives is used to detect separability, recursively reducing multivariate problems to simpler neural atoms, and provides a practical route from neural surrogates to interpretable closed-form empirical laws.

Rodrigo Ibata, Wassim Tenachi, F. Diakogiannis et al. · 0 citations
Preprint Aug 2026

Reduced-Order Physics-Informed Neural Network with Adaptive Basis Refinement for Structural Identification

This work proposes a Reduced-Order Physics-Informed Neural Network (RO-PINN) framework with adaptive basis refinement for structural identification under known and incomplete physics, and shows parameter identification comparable to or more accurate than Bayesian model updating with lower computational cost.

Rui Zhang, Konstantinos Vlachas, Eleni N. Chatzi · 0 citations
Open access Sep 2026

Two-stage projection physics-informed neural networks for preserving conservation laws

Physics-informed neural networks (PINNs) can attain small residuals for partial differential equations while drifting from global invariants. We separate residual-based training from invariant enforcement: a standard PINN is trained first, and its output is then projected onto a selected invariant manifold at inference...

Xue-Wen Shen, Han-Ran Song, Li-Pu Zhang · 0 citations
Preprint Aug 2026

NestyNet. IV. Laws Chosen by Nothing in Advance

NestyNet-DE addresses differential-equation discovery via two complementary DE search strategies, both employing analytic derivatives from segmented neural surrogates: a sparse-library route linear in the outer coefficients, and a new operator-factorized route that searches directly over equation structure rather than...

Rodrigo Ibata, Wassim Tenachi, F. Diakogiannis et al. · 0 citations

Related blog posts

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.