Hugging Face Trending Papers

Higher-Order Geometric Updates for Levenberg-Marquardt Method via Riemann Normal Coordinates

Nonlinear least-squares optimization is central to regression, physics-informed neural networks, and other machine-learning tasks. Such problems have a natural geometric interpretation, model predictions form a manifold in data space, while the chosen parameterization can introduce parameter-effects curvature that becomes a dominant source of nonlinearity.

arXiv AI
Aug 28

Physics-Informed Stochastic Configuration Machine: A Backpropagation-Free Neural Network with Fast Training for Nonlinear Differential Equations

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)
arXiv Machine Learning
Jun 17

A Convex Quasilinearization Method for Solving Nonlinear PDEs with Physics-Informed Neural Networks

arXiv:2606. 18175v1 Announce Type: cross Abstract: We present a numerical method for the forward solution of nonlinear partial differential equations (PDEs) in which Bellman-Kalaba quasilinearization reduces the nonlinear problem to a sequence of linear subproblems, each discretized by collocation onto a trial space that is linear in its parameters and solved by a single direct linear least-squares QR factorization.

By Gbenga T. Awojinrin, Abdul-Akeem Olawoyin, Rami M. Younis
arXiv Machine Learning
Aug 27

Adaptive Hybrid Subspace Levenberg Marquardt Algorithm with Adequacy Monitor for Large Scale Least Squares Problems

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 Machine Learning
Aug 6

From Non-Convex Self-Concordant Regularization to Scalable Quasi-Newton Training of PINNs

arXiv:2608. 04206v1 Announce Type: new Abstract: Physics-informed neural networks (PINNs) often require high-accuracy quasi-Newton refinement to obtain reliable partial differential equation solutions, but their residual objectives can exhibit indefinite, nearly singular, and poorly scaled local curvature.

By Chenhao Si, Kang An, Shiqian Ma, Ming Yan
arXiv Machine Learning
Sep 15

Linearized PINN with pretrained nonlinear layers

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
arXiv Computer Vision
Sep 21

Geometry-Aware Diffusion Guidance via Curvature-Adaptive Tubular Correction

The paper introduces Curvature-Adaptive Tubular Correction (CAT), a training‑free plugin that refines diffusion guidance by decomposing the guidance gradient into normal and tangent components and regulating them within a noise‑dependent geometric budget. CAT charges normal displacement at first order and tangent displacement according to directional curvature, solving a one‑dimensional dual equation for optimal magnitudes and using Armijo backtracking to calibrate the step size. Experiments on seven inverse problems with FFHQ and ImageNet demonstrate that CAT consistently improves pixel‑ and latent‑space samplers, enhances perceptual metrics, and achieves the lowest FID across classifier‑free guidance scales while maintaining stable saturation and contrast.

By Enze Jiang, Jinwei He, Zheng Ma