aiqbench analysis
This research introduces SDC-GON, a neural operator framework that leverages singular decomposition and consistency regularization to efficiently solve linear partial differential equations. By separating analytically known singular components from smooth corrections learned by the network, the method achieves higher accuracy with smaller architectures compared to standard baselines. The approach represents a significant advancement in scientific machine learning for physics-informed modeling.
SDC-GON: Singular Decomposition and Consistency-Regularized Green's Operator Networks for Solving Partial Differential Equations
arXiv:2609.23206v1 Announce Type: cross Abstract: Green's function based operator approximation offers an efficient route for solving linear partial differential equations under varying boundary conditions and source terms. Once the Green's function is learned, solutions for new configurations are obtained through integration rather than by solving the differential equation again. Existing Green's function learning methods face two structural challenges. The first is the singular behavior of the Green's function near the source point, which places a difficult approximation burden on neural networks. The second is the absence of explicit consistency between the learned Green's function and its gradient, although both quantities enter the integral solution representation directly. This work proposes SDC-GON, a Singular Decomposition and Consistency-Regularized Green's Operator Network that addresses both challenges within a unified framework. The Green's function is decomposed into an analytically known singular component and a smooth correction learned by the network, so that the neural approximation targets only the regular part of the response kernel. A self-consistency loss enforces agreement between the gradient and the autodifferentiation gradient of the smooth correction. The method is evaluated on two dimensional Poisson, three dimensional heat conduction, heterogeneous reaction diffusion, and Stokes benchmarks, consistently outperforming the compared baselines across all cases. On the heterogeneous pipe benchmark, SDC-GON achieves a testing error of $3.70\times10^{-4}$ with a smaller network architecture, compared with $9.60\times10^{-4}$ for the same-width baseline and $4.63\times10^{-4}$ for a larger configuration, demonstrating that structural improvements are more effective than increasing model size.
Abstract:Green's function based operator approximation offers an efficient route for solving linear partial differential equations under varying boundary conditions and source terms. Once the Green's function is learned, solutions for new configurations are obtained through integration rather than by solving the differential equation again. Existing Green's function learning methods face two structural challenges. The first is the singular behavior of the Green's function near the source point, which places a difficult approximation burden on neural networks. The second is the absence of explicit consistency between the learned Green's function and its gradient, although both quantities enter the integral solution representation directly. This work proposes SDC-GON, a Singular Decomposition and Consistency-Regularized Green's Operator Network that addresses both challenges within a unified framework. The Green's function is decomposed into an analytically known singular component and a smooth correction learned by the network, so that the neural approximation targets only the regular part of the response kernel. A self-consistency loss enforces agreement between the gradient and the autodifferentiation gradient of the smooth correction. The method is evaluated on two dimensional Poisson, three dimensional heat conduction, heterogeneous reaction diffusion, and Stokes benchmarks, consistently outperforming the compared baselines across all cases. On the heterogeneous pipe benchmark, SDC-GON achieves a testing error of $3.70\times10^{-4}$ with a smaller network architecture, compared with $9.60\times10^{-4}$ for the same-width baseline and $4.63\times10^{-4}$ for a larger configuration, demonstrating that structural improvements are more effective than increasing model size.
Systems and Control (eess.SY); Machine Learning (cs.LG)
arXiv:2609.23206 [eess.SY]
(or arXiv:2609.23206v1 [eess.SY] for this version)
https://doi.org/10.48550/arXiv.2609.23206 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 335 words
Related coverage

The SaaSpocalypse that wasn’t, with Atlassian CEO Mike Cannon-Brookes
The Verge · Sep 28, 2026

[AINews] OpenAI reports Navier-Stokes singularity find in 88 hours using Astra-next, roughly 10,000 agents and 130B tokens (>$40M), a contender for second ever Millennium Prize awarded
Latent Space · Sep 9, 2026

How Sonos rebooted itself
The Verge · Sep 3, 2026

How do neural networks regress cubic polynomials? Apparently, they use a trick invented in Milan 500 years ago
LessWrong · Jul 22, 2026