The paper introduces the Physics-Informed Stochastic Configuration Machine (PI‑SCM), a backpropagation‑free neural network designed for solving nonlinear differential equations. By analytically evaluating local Jacobians, PI‑SCM linearizes the physical loss, enabling optimal weight determination through generalized linear least squares and avoiding iterative nonlinear optimization. The authors present a progressive algorithmic suite—PI‑SC‑I, PI‑SC‑II, and PI‑SC‑III—prove their universal approximation properties, and show through experiments that PI‑SCM achieves high‑fidelity predictions and parameter identification while accelerating training by orders of magnitude compared to standard PINNs.
By Yuehao Song (School of Automation, Central South University, Changsha, China), Zhong Chen (School of Automation, Central South University, Changsha, China), Lihui Cen (School of Automation, Central South University, Changsha, China), Liang Wu (Johns Hopkins University, Baltimore, USA), Kai Zhang (State Key Laboratory of Simulation and Regulation of Water Cycle in River Basin, China Institute of Water Resources and Hydropower Research, Beijing, China)
The paper introduces a linearized Physics-Informed Neural Network (lPINN), a reduced‑order neural basis approach for solving forward and inverse differential equations. In an offline phase, lPINN learns continuous, differentiable neural basis functions from numerical solutions, which are then frozen for new problem instances; the online solution is obtained by minimizing the governing‑equation residual with additional constraints. Experiments on advection‑diffusion, Burgers', and nonlinear pendulum equations show that lPINN achieves lower solution and parameter errors than vanilla PINNs while reducing online inference times by up to three orders of magnitude, and its continuous representation generalizes to finer meshes without retraining.
By Wenhao Chen, Alexandre M. Tartakovsky
The paper introduces an Adaptive Hybrid Subspace Levenberg–Marquardt (HSLM) algorithm that tackles large‑scale nonlinear least‑squares problems by building a low‑dimensional subspace from gradient, memory, Krylov‑subspace, and randomized curvature data. It employs a deterministic adequacy monitor to adaptively enrich the subspace and decouples step acceptance from damping adjustment, using Armijo backtracking for step length and a ratio of actual to predicted reduction for damping updates. The authors prove global convergence to stationarity and local linear and superlinear convergence, and demonstrate that HSLM matches the convergence of classical and Krylov‑subspace LM while significantly reducing per‑iteration cost, especially as the parameter dimension increases.
By M. Duc Hoang, Timothy J. Lewis
arXiv:2609.00789v1 Announce Type: new
Abstract: The Levenberg-Marquardt (LM) algorithm is a well-known second-order method for rapid convergence and strong robustness when training small- to medium-s...
By M. Duc Hoang
arXiv:2607. 23940v1 Announce Type: new Abstract: Physics-Informed Neural Networks (PINNs) solve differential equations by minimizing the residual of a nonlinear operator over a neural parameterization of the solution.
By Pavlos Protopapas, Kaylee Vo
The Levenberg-Marquardt (LM) algorithm is a well-known second-order method for rapid convergence and strong robustness when training small- to medium-sized neural networks (NNs). However, its computat...