Search arXivSearch

arXiv · 2511.23409

A Multi-Phase Dual-PINN Framework: Soft Boundary-Interior Specialization via Distance-Weighted Priors

Abstract

Physics-informed neural networks (PINNs) often struggle with multi-scale PDEs featuring sharp gradients and nontrivial boundary conditions, as the physics residual and boundary enforcement compete during optimization. We present a dual-network framework that decomposes the solution as $u = u_{\text{D}} + u_{\text{B}}$, where $u_{\text{D}}$ (domain network) captures interior dynamics and $u_{\text{B}}$ (boundary network) handles near-boundary corrections. Both networks share a unified physics residual while being softly specialized via distance-weighted priors ($w_{\text{bd}} = \exp(-d/τ)$) that are cosine-annealed during training. Boundary conditions are enforced through an augmented Lagrangian method, eliminating manual penalty tuning. Training proceeds in two phases: Phase~1 uses uniform collocation to establish network roles and stabilize boundary satisfaction; Phase~2 employs focused sampling (e.g. ring sampling near $\partialΩ$) with annealed role weights to efficiently resolve localized features. We evaluate our model on four benchmarks, including the 1D Fokker-Planck equation, the Laplace equation, the Poisson equation, and the 1D wave equation. Across Laplace and Poisson benchmarks, our method reduces error by $36-90\%$, improves boundary satisfaction by $21-88\%$, and decreases MAE by $2.2-9.3\times$ relative to a single-network PINN. Ablations isolate contributions of (i)~soft boundary-interior specialization, (ii)~annealed role regularization, and (iii)~the two-phase curriculum. The method is simple to implement, adds minimal computational overhead, and broadly applies to PDEs with sharp solutions and complex boundary data.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Naseem Abbas, Vittorio Colao, Davide Macri, William Spataro. 2025-11-28. A Multi-Phase Dual-PINN Framework: Soft Boundary-Interior Specialization via Distance-Weighted Priors. https://arxiv.org/abs/2511.23409

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

The Stability of Block Eliminations and Additive Modifications

The block elimination with additive modifications (BEAM) method was recently proposed as a alternative to LU with partial pivoting requiring less communication. Because of the novelty of BEAM, the existing theoretical analysis is lacking. To that end, we analyze both the numerical stability of the underlying block LU factorization and the effects of additive modifications. For the block LU factorization, we are able to improve the previous results of Demmel et al. from being cubic in the element growth to merely quadratic. Furthermore, we propose an alternative measure of element growth that is better aligned with block LU; this new measure of growth allows our analysis to apply to matrices that cannot be factored with pointwise LU. In the second part, we analyzed the modifications produced by BEAM and the effect they have on the condition number and growth factor. Finally, we show that BEAM will not apply any modifications in some cases that regular block LU can safely factor.

math.NA

Efficient Rigorous Continuation via Chebyshev Series Expansion I

We study the global continuation of solution manifolds arising in dynamical systems. We present a rigorous continuation method based on a Chebyshev series expansion of the solution manifold. The branch is first approximated by a high-order Chebyshev interpolation polynomial, and an explicit error bound is then obtained by verifying the contraction of a quasi-Newton operator near this approximation. The contraction is formulated on a weighted $\ell^1$ space, giving a finer control than the typical $C^0$-error bound obtained from the uniform contraction theorem. In fact, the latter follows directly from our contraction operator. Furthermore, we discuss how our strategy applies naturally to pseudo-arclength continuation, where the continuation parameter fails to provide a valid local coordinate, and extends to multi-parameter continuation. Lastly, we detail two applications in which we compute a two-parameter family of steady-states for the Cahn--Hilliard equation, and a one-parameter family of steady-states undergoing saddle-node bifurcations for the Shigesada--Kawasaki--Teramoto system.

math.NA

Efficient iterative techniques for solving tensor problems with the T-product

This paper develops two efficient iterative methods for solving tensor equations under the T-product framework. For T-symmetric positive definite tensor equations of the form $\mathcal{C} \star \mathcal{X} = \mathcal{D}$, we propose a conjugate-gradient-type algorithm that generates orthogonal residual and $\mathcal{C}$-orthogonal direction sequences, ensuring convergence within a finite number of steps. For general consistent tensor equations, we extend the method using a normal-equation transformation, and further adapt it to handle inconsistent systems by solving a least-squares minimization problem. Key advantages include direct tensor-based computations without explicit matrix expansion, rigorous finite-step convergence proofs, and the ability to obtain minimal Frobenius norm solutions. Numerical experiments on synthetic data, benchmark images, and video sequences demonstrate that the proposed algorithms achieve high precision with low computational time, confirming their practicality for large-scale multidimensional problems.

math.NA