Searcharxiv⌕ Search

arXiv · 2611.20678

UNIDE: Cross-PDE Learning for Noise-Robust Discovery of Governing Equations

Abstract

Governing partial differential equations (PDEs) provide compact and interpretable descriptions of physical systems. Classical methods, such as sparse and symbolic regression, fit a new equation to each observed field: what is learned on one system is not carried to the next, and observation noise corrupts the derivative features they rely on. This paper introduces UNIDE (Unified Identification of Differential Equations), a data-driven approach that learns across PDE families to identify governing equations from new noisy trajectories. It integrates three components: a self-supervised denoiser trained without clean targets, an encoder shared across PDE families that predicts which candidate terms are active, and weak-form least squares with residual-based pruning that estimates their coefficients. We demonstrate UNIDE on synthetic one-dimensional trajectories from six PDE families with known term structures, including the Burgers and Kuramoto--Sivashinsky equations. We train one model per noise level and systematically compare UNIDE with SINDy, WSINDy, and PySR. The results show that UNIDE recovers the exact set of governing terms more often than all three at every noise level from $1\%$ to $80\%$. At $80\%$ noise, where the noise standard deviation is $0.8$ times that of the field, it recovers the exact terms for $92\%$ of held-out trajectories, whereas the best baseline recovers about $1\%$. UNIDE is also efficient: because its neural components are reused rather than refit, it identifies each new trajectory in $0.45$ seconds, $2.7$ times faster than WSINDy and $51$ times faster than PySR. These results demonstrate the potential of learning across PDE families for efficient equation identification under substantial observation noise.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xiaoyu Xie. 2026-11-16. UNIDE: Cross-PDE Learning for Noise-Robust Discovery of Governing Equations. https://searcharxiv.com/abs/2611.20678

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related papers

Adaptive mesh refinement for the Landau-Lifshitz-Gilbert equation

We propose a new adaptive algorithm for the approximation of the Landau--Lifshitz--Gilbert equation via a higher-order tangent plane scheme. We show that the adaptive approximation satisfies an energy inequality and demonstrate numerically that the adaptive algorithm outperforms uniform approaches.

math.NA↗

A one-dimensional model of catheter aspiration in blood vessels

Aspiration thrombectomy is a primary endovascular treatment option for acute ischemic stroke caused by large vessel occlusions, in which a catheter is navigated to the occlusion site and suction is applied to remove the thrombus. This work introduces a reduced one-dimensional model for aspiration in blood vessels that accounts for the elasticity of both the vessel wall and the catheter. The inclusion of vessel wall visco-elasticity transforms the governing equation for the flow rate into a parabolic form, enabling an accurate resolution of the diffuse pressure gradients near the catheter tip observed in CFD simulations. The numerical treatment is based on a relaxation of the hyperbolic subsystem that facilitates nodal solvers, enabling efficient coupling between catheterized and uncatheterized vessel segments, including bifurcations and the catheter tip. A splitting strategy ensures that the visco-elastic terms incur only negligible additional computational cost relative to the purely hyperbolic model. The model is benchmarked against three-dimensional CFD simulations and reference data from the literature. Numerical experiments investigating the role of catheter elasticity and suction force on the hemodynamics are presented, and an uncertainty quantification study demonstrates the suitability of the framework for efficient parameter studies. The results indicate that the proposed model resolves blood flow comparably accurate to three-dimensional simulations at a fraction of the computational cost. While further in vitro and in vivo validation is required, the framework represents a promising step toward computationally efficient preoperative planning and uncertainty-aware decision support in aspiration thrombectomy.

math.NA↗

Exploiting the nonzero diagonal pattern in matrix function computations

We consider the task of approximating a matrix function $f(A)$, where $A$ is a matrix in which only a relatively small number of (not necessarily consecutive) sub- and superdiagonals contain nonzero entries. Approximating $f$ by a low-degree polynomial $p$ allows us to obtain sparse approximations to $f(A)$, which one can efficiently work with (while, in general, $f(A)$ is a dense matrix, even when $A$ is sparse). Our approach is based on carefully inspecting the locations where nonzeros can occur in $p(A)$, and identifying the entries in $A$ that influence them. In particular, we illustrate how this approach can be used for efficiently approximating the trace of $f(A)$ and identify how this approach is related to established (stochastic) probing methods for trace estimation. Another application area in which our approach works particularly well is the computation of functions of Toeplitz matrices. Here, studying the sparsity pattern of $p(A)$ allows us to reduce the computation of the whole matrix polynomial to that of a single small-scale submatrix, yielding an algorithm that scales exceptionally well to large problem sizes.

math.NA↗