arXiv:2609.24021v1 Announce Type: cross
Abstract: Neural operators are data-driven models that learn mappings from inputs that parameterize partial differential equations, such as spatially varying c...
By Daniel Zhengyu Huang, Andrew M. Stuart
arXiv:2610.17221v1 Announce Type: cross
Abstract: Neural surrogates for Partial Differential Equations (PDEs) are usually trained on synthetic data from numerical simulators. As models grow and scali...
By Paul Setinek, Fabian Paischer, Nils Thuerey, Johannes Brandstetter, Felix Koehler
arXiv:2606. 27354v1 Announce Type: cross Abstract: Neural surrogate models offer fast approximate mappings from PDE parameters to solutions, but they typically treat solving as a purely statistical task: once trained, they struggle to correct their own constraint violations and extrapolate beyond the training distribution.
By Haina Jiang, Liam Wang, Peng-Chen Chen, Min Seop Kwak, Seungryong Kim, Brian Bell, Jeong Joon Park
Simulation is central to modern engineering and science, but the cost of numerical solvers for partial differential equations (PDEs) remains a bottleneck whenever fast or many-query evaluations are re...
The paper investigates why latent neural surrogate solvers, which compress physical system dynamics into a lower‑dimensional space, often fail during long‑horizon autoregressive rollouts. It demonstrates that training the latent representation only for reconstruction leads to instability, and proposes a set of training interventions—Koopman operator learning, Hamming noise injection, and multi‑step rollout fine‑tuning—that align the latent space with long‑horizon forecasting. These interventions reduce long‑rollout error by about 40 % and achieve accuracy comparable to full‑resolution models while using far fewer floating‑point operations and GPU memory, enabling stable extrapolation in mesoscale crystal‑plasticity simulations of high‑cycle fatigue.
By Andreas E. Robertson, Ashley T. Lenau, John D. Shimanek, Benjamin A. Jasperson, Vivek Oommen, David L. Damm, Krishna Garikipati, Remi Dingreville
arXiv:2608.24547v1 Announce Type: new
Abstract: Simulation is central to modern engineering and science, but the cost of numerical solvers for partial differential equations (PDEs) remains a bottlene...
By Felix Koehler
arXiv:2606. 17460v1 Announce Type: new Abstract: Neural operators are widely used as surrogate solution maps for partial differential equations (PDEs), but full-size models can be costly to store, deploy, and evaluate in many-query scientific workflows.
By Lennon J. Shikhman
arXiv:2602. 06842v2 Announce Type: replace-cross Abstract: Deep learning-based hybrid iterative methods (DL-HIMs) integrate classical numerical solvers with neural operators, utilizing their complementary spectral biases to accelerate convergence.
By Yuhan Wu, Jan Willem van Beek, Victorita Dolean, Alexander Heinlein
arXiv:2608. 00029v1 Announce Type: cross Abstract: The performance of deep learning models at scale relies heavily on how effectively high-level mathematical operations are mapped to underlying physical hardware.
By Adwaid Suresh, Aparna A, Harshini V M, Jona Delcy C A, Killi Uma Maheswara Rao, Ram Charan Golla, Surendra Vendra
The paper introduces a framework for evaluating how well learned states from neural PDE solvers can be reused in new contexts. By separating solution accuracy, learning contribution, and numerical utility through paired state comparisons and cost accounting, the authors audit 12 papers and conduct experiments on linear PDE families, Fourier neural operators, and convolutional networks. Their results show that matched state comparisons and downstream computational evidence can lead to significant savings in conjugate‑gradient iterations and demonstrate finite‑budget pretraining value.
By Shunye Wang, Haochen Wen, Shuo Li Liu, Xuanyi Wang, Lihao Liu, Zhongying Deng
arXiv:2606. 06164v1 Announce Type: new Abstract: Physics-informed neural operators (PINOs) aim to learn solution operators for partial differential equations by using the governing physics as supervision, rather than relying solely on paired input-output simulation data.
By Nanxi Chen, Chuanjie Cui, Airong Chen, Sifan Wang, Rujin Ma
The paper introduces Sparse Sum-of-Squares (SOS) Layers, a new type of differentiable layer that reuses the sparse structure of forward semidefinite programming (SDP) solves during backpropagation. By avoiding dense certificate construction, the method achieves up to 2.7× faster warm‑call times and reduces memory usage from 160 GiB to 1.7 GiB on large problems. Experiments demonstrate its effectiveness across sparse polynomial certification, control, combinatorial relaxations, robotics, oscillator chains, and pose‑graph synchronization, achieving zero certified violations on unseen instances with far fewer optimization solves than finite‑difference approaches.
By Ege Gursoy, Nicolas Mansard