High-dimensional surrogate modeling with limited high-fidelity data poses a major challenge in uncertainty quantification. Classical supervised dimension reduction methods often fail in this setting due to insufficient accurate observations, while low-fidelity data are abundant but biased. In this work, we propose a Rotated Multi-Fidelity Gaussian Process (RMFGP) framework that enables reliable dimension reduction and surrogate construction under severe data scarcity. The proposed method integrates nonlinear multi-fidelity Gaussian process regression with sliced average variance estimation (SAVE) to iteratively identify informative input directions. Low-fidelity data are first used to extract coarse structural information, which is exploited to rotate the input space prior to multi-fidelity model training. Predictions generated by the trained RMFGP surrogate are then used to refine the dimension reduction, allowing accurate estimation of the central sufficient dimension reduction subspace even when high-fidelity data are scarce. A Bayesian active learning strategy based on predictive uncertainty is further incorporated to adaptively select new high-fidelity samples. Numerical examples, including stochastic partial differential equations, demonstrate that RMFGP significantly improves prediction accuracy, convergence, and uncertainty propagation compared to existing Gaussian process-based dimension reduction approaches, while requiring substantially fewer high-fidelity evaluations.
Deep learning has gained attention for solving partial differential equations (PDEs), but the limited interpretability of neural networks hinders precise enforcement of boundary conditions.To address this challenge, we propose BEKAN, a boundary condition-guaranteed evolutionary Kolmogorov-Arnold network with radial basis functions.BEKAN introduces three distinct and combinable approaches for rigorously incorporating Dirichlet, periodic, and Neumann boundary conditions.For Dirichlet problems, we construct boundary-embedded univariate basis functions using smooth Gaussian RBFs, encoding constraints directly at the activation level.For periodic problems, we design a sinusoidal periodic layer that exactly enforces periodicity.For Neumann problems, we formulate a least-squares evolutionary update that drives network parameters toward satisfying derivative constraints on boundaries.BEKAN also extends to general mixed boundary conditions, since the enforcement mechanisms for the three boundary types operate independently and can be assigned to distinct boundary segments.By integrating boundary-embedded RBFs, periodic layers, and evolutionary dynamics, BEKAN achieves accurate PDE simulations with rigorous boundary enforcement. Extensive numerical experiments on Dirichlet, Neumann, periodic, and mixed boundary value problems demonstrate that BEKAN consistently outperforms multilayer perceptron (MLP) and B-spline KAN baselines in both accuracy and boundary-condition satisfaction.This framework extends KAN capabilities for scientific machine learning, offering a robust and interpretable approach for solving complex PDEs under strict physical constraints.
Partial differential equations (PDEs) form a central component of scientific computing.Among recent advances in deep learning, evolutionary neural networks have been developed to successively capture the temporal dynamics of time-dependent PDEs via parameter evolution. The parameter updates are obtained by solving a linear system derived from the governing equation residuals at each time step.However, strong-form evolutionary approaches can yield ill-conditioned linear systems due to pointwise residual discretization, and their computational cost scales unfavorably with the number of training samples.To address these limitations, we propose a weak-form evolutionary Kolmogorov–Arnold Network (KAN) for the scalable and accurate prediction of PDE solutions.We decouple the linear system size from the number of training samples through the weak formulation, leading to improved scalability compared to strong-form approaches.We also rigorously enforce boundary conditions by constructing the trial space with boundary-constrained KANs to satisfy Dirichlet and periodic conditions, and by incorporating derivative boundary conditions directly into the weak formulation for Neumann conditions.In conclusion, the proposed weak-form evolutionary KAN framework provides a stable and scalable approach for PDEs and contributes to scientific machine learning with potential relevance to future engineering applications.
Physics-informed neural networks and neural operators often suffer from severe optimization difficulties caused by ill-conditioned gradients, multi-scale spectral behavior, and stiffness induced by physical constraints. Recently, the Muon optimizer has shown promise by performing orthogonalized updates in the singular-vector basis of the gradient, thereby improving geometric conditioning. However, its unit–singular-value updates may lead to overly aggressive steps and lack explicit stability guarantees when applied to physicsinformed learning. In this work, we propose SpecMuon, a spectral-aware optimizer that integrates Muon’s orthogonalized geometry with a mode-wise relaxed scalar auxiliary variable (RSAV) mechanism. By decomposing matrix-valued gradients into singular modes and applying RSAV updates individually along dominant spectral directions, SpecMuon adaptively regulates step sizes according to the global loss energy while preserving Muon’s scalebalancing properties. This formulation interprets optimization as a multi-mode gradient flow and enables principled control of stiff spectral components. We establish rigorous theoretical properties of SpecMuon, including a modified energy dissipation law, positivity and boundedness of auxiliary variables, and global convergence with a linear rate under the Polyak–Łojasiewicz condition. Numerical experiments on physics-informed neural networks, DeepONets, and fractional PINN–DeepONets demonstrate that SpecMuon achieves faster convergence and improved stability compared with Adam, AdamW, and the original Muon optimizer on benchmark problems such as the one-dimensional Burgers’ equation and fractional partial differential equations.
22 October 2026 in Computer Methods in Applied Mechanics and Engineering