arXiv Machine Learning

Low-Rank Evolutionary Deep Neural Networks via Adaptive Tangent-Space Reduction

arXiv:2509. 16395v2 Announce Type: replace-cross Abstract: Evolutionary deep neural networks (EDNNs) solve time-dependent partial differential equations by evolving the neural-network parameters sequentially in time through a local least-squares problem.

arXiv AI
Aug 6

The Hamilton-Jacobi Theory of Deep Learning

arXiv:2605. 28983v2 Announce Type: replace-cross Abstract: In this paper, training a neural network is identified, exactly, as a search through Hamilton--Jacobi initial-value problems: each gradient step selects the initial data of a viscous Hamilton--Jacobi equation whose Hopf--Cole propagator best fits the observations; at inference, the input is the spatial point at which that solution is evaluated and the initial condition is already encoded in the weights.

By Jose Marie Antonio Mi\~noza, Erika Fille T. Legara, Christopher P. Monterola
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 Machine Learning
Jun 19

A fast direct solver based neural network for solving PDEs

arXiv:2606. 19895v1 Announce Type: cross Abstract: The matrices arising from large scale $N$-body problems can be efficiently represented using hierarchical matrices, whose key idea is that the admissible off-diagonal sub-matrices can be well approximated by low-rank matrices across a hierarchy of matrix partitions.

By Jashwanth Reddy Kadaru, Vaishnavi Gujjula
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