By formalizing the classical conditions for well-posedness within neural operators, this framework demonstrates the theoretical benefits of explicitly conditioning on PDE parameters and boundary conditions and achieves superior generalization across heterogeneous physical regimes while maintaining strict inference efficiency comparable to conventional numerical baselines.
Abstract
Developing foundational neural simulators for Partial Differential Equations (PDEs) requires robust generalization across diverse physical parameters and boundary conditions. However, current deep learning approaches largely face a structural trade-off between condition-agnostic deployment and physical fidelity. Purely data-driven operators infer the underlying physics implicitly and thus lack the explicit constraints needed to ensure physically valid solutions across varying domains, rendering the learning problem ill-posed. On the other hand, Physics-Informed Neural Networks (PINNs) enforce rigorous physical constraints but necessitate costly, instance-specific optimization. Furthermore, the massive scale of emerging foundational operators has severely degraded their inference speeds, making them computationally uncompetitive with traditional numerical solvers. To address this bottleneck between condition-agnostic deployment, physical rigor, and inference efficiency, we propose a \textit{Generalized Neural Operator}. By formalizing the classical conditions for well-posedness within neural operators, our framework demonstrates the theoretical benefits of explicitly conditioning on PDE parameters and boundary conditions. To implement this synthesis without compromising computational speed, we introduce three novel architectural components: a parameter-gated mixture of kernels for efficient parameter generalization, a generalized boundary transfer operator that projects arbitrary boundary constraints into a unified latent Dirichlet representation, and a specialized training objective to ensure stability. Extensive experiments demonstrate that our theoretically grounded approach achieves superior generalization across heterogeneous physical regimes while maintaining strict inference efficiency comparable to conventional numerical baselines.
A Physics Constraint‐Guided Network (PCGN) for deep PDE solving is proposed, to introduce physical information at three levels: feature representation, optimization, and output correction.
Results establish that the empirical residual minimization is a mathematically principled approach to solving parametric PDE-constrained optimal control problems.
Experiments show that FC-VPINN achieves approximately one-order-of-magnitude lower prediction errors than the traditional PINN and reduces memory usage to 40% of that required by the baseline, demonstrating improved accuracy and computational efficiency in multidimensional problems.
Wenjie Zhang, Yu-Bo Li, Wei-Dong Cui et al.· Chinese Physics B· 0 citations
Equation recast is introduced, which reformulates parametric operator learning as the learning of a single canonical operator, and provides a route toward reusable neural PDE solvers combining equation-guided transfer, data efficiency, and monitorable inference.
Qi-Yun Cheng, Valentin Duruisseaux, C. Clauser et al.· 0 citations
Meta-SPINN works both as a direct predictor for unseen tasks and as a task-aware initializer for subsequent single-instance residual-guided refinement, providing reusable predictions together with an interpretable visualization of how solution geometry changes across a parameter family.
This work shows that the output Jacobian of a neural solution model trained at one condition defines a reusable response space for cross-condition solution variations, and introduces Linearized Subspace Transfer (LST) to exploit this space and recover target solutions by minimizing the target PDE-system residual over r...
Wen-Bo Cao, Wei-Wei Zhang· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.