Physics-enriched neural solvers for transient ice-flow simulation
- URL: http://arxiv.org/abs/2609.12900v1
- Date: Fri, 11 Sep 2026 14:26:12 GMT
- Title: Physics-enriched neural solvers for transient ice-flow simulation
- Abstract summary: We show that supplying the network with inexpensive input fields derived from low-order ice-flow balances improves this online solver.<n>Across three real-world glacier configurations, the enriched solver is markedly more robust to solver settings.
- Score: 0.21892916695245224
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Transient glacier simulations with higher-order ice flow require the repeated solution of a nonlinear problem as the geometry evolves. In the online mode of the Instructed Glacier Model, the velocity field is represented by a neural network whose weights are warm-started from the previous time step and updated with a few optimizer iterations. We show that supplying the network with inexpensive input fields derived from low-order ice-flow balances improves this online solver. Unlike residual-based physics-informed neural networks, which incorporate physics through governing-equation penalties in the loss, our approach leaves the governing energy objective unchanged, adding physical structure through the network inputs. Across three real-world glacier configurations, the enriched solver is markedly more robust to solver settings. On the two alpine cases, it also improves the tuned accuracy--runtime trade-off, reducing surface-velocity errors by factors of two to four at fixed runtime and reaching few-percent relative errors with only $10^4$--$10^5$ trainable parameters, far fewer than comparable raw-input baselines. A 300-year Aletsch simulation then completes in under one minute, and the larger Valais domain in about two minutes, on a single GPU---a budget once reserved for much simpler shallow-ice models. Gains are smaller for the fast marine-terminating glacier, where nonlocal stress coupling favors larger or spectral networks. More broadly, the results suggest that enriching a neural solver's inputs with reduced-order physics can make repeated higher-order solves much cheaper, with no training data and no offline training.
Related papers
- DeepOHeat-v2: Self-Improving Operator Learning for Fast and Trustworthy Thermal Optimization in 3D-IC Design [9.372025997391441]
Operator-learning surrogates replace a costly heat-equation solve with a fast forward pass, ideally trained from physics alone, without labeled data.<n>DeepOHeat-v2 trains on a discretized physics loss that handles the discontinuities and cuts the mean peak temperature error from over 30 K to 0.55 K.<n>Because optimization leaves the training distribution, we propose a self-improving framework: a hotspot trust gate sends flagged placements to a reference solver, and the surrogate incrementally retrains on the refined solutions, keeping an update only when it improves held-out validation error.
arXiv Detail & Related papers (2026-08-17T04:23:55Z) - An Optimisation Framework for the Well-Conditioned Training of Physics-Informed Neural Networks [0.12744523252873352]
Physics-informed neural networks (PINNs) have emerged as a promising route to solve partial differential equations.<n>PINNs have struggled to reach the precision of classical solvers.<n>We present $textbfDSGNAR$: Doubly-Sketched Gauss-Newton with Adaptive Ratio, a scalable second-order optimisation framework.
arXiv Detail & Related papers (2026-07-02T14:03:34Z) - INC: An Indirect Neural Corrector for Auto-Regressive Hybrid PDE Solvers [61.84396402100827]
We propose the Indirect Neural Corrector ($mathrmINC$), which integrates learned corrections into the governing equations.<n>$mathrmINC$ reduces the error amplification on the order of $t-1 + L$, where $t$ is the timestep and $L$ the Lipschitz constant.<n>We test $mathrmINC$ in extensive benchmarks, covering numerous differentiable solvers, neural backbones, and test cases ranging from a 1D chaotic system to 3D turbulence.
arXiv Detail & Related papers (2025-11-16T20:14:28Z) - Enabling Automatic Differentiation with Mollified Graph Neural Operators [73.52999622724101]
We propose the mollified graph neural operator ($m$GNO), the first method to leverage automatic differentiation and compute exact gradients on arbitrary geometries.<n>For a PDE example on regular grids, $m$GNO paired with autograd reduced the L2 relative data error by 20x compared to finite differences.<n>It can also solve PDEs on unstructured point clouds seamlessly, using physics losses only, at resolutions vastly lower than those needed for finite differences to be accurate enough.
arXiv Detail & Related papers (2025-04-11T06:16:30Z) - Coarse Graining with Neural Operators for Simulating Chaotic Systems [78.64101336150419]
Predicting the long-term behavior of chaotic systems is crucial for various applications such as climate modeling.<n>An alternative approach to such a full-resolved simulation is using a coarse grid and then correcting its errors through a temporalittext model.<n>We propose an alternative end-to-end learning approach using a physics-informed neural operator (PINO) that overcomes this limitation.
arXiv Detail & Related papers (2024-08-09T17:05:45Z) - Transferable Neural Wavefunctions for Solids [5.219568203653524]
We show how to optimize a single ansatz across all of these variations.
We successfully transfer a network, pre-trained on 2x2x2 supercells of LiH, to 3x3x3 supercells.
arXiv Detail & Related papers (2024-05-13T09:59:59Z) - NeuralStagger: Accelerating Physics-constrained Neural PDE Solver with
Spatial-temporal Decomposition [67.46012350241969]
This paper proposes a general acceleration methodology called NeuralStagger.
It decomposing the original learning tasks into several coarser-resolution subtasks.
We demonstrate the successful application of NeuralStagger on 2D and 3D fluid dynamics simulations.
arXiv Detail & Related papers (2023-02-20T19:36:52Z) - Joint inference and input optimization in equilibrium networks [68.63726855991052]
deep equilibrium model is a class of models that foregoes traditional network depth and instead computes the output of a network by finding the fixed point of a single nonlinear layer.
We show that there is a natural synergy between these two settings.
We demonstrate this strategy on various tasks such as training generative models while optimizing over latent codes, training models for inverse problems like denoising and inpainting, adversarial training and gradient based meta-learning.
arXiv Detail & Related papers (2021-11-25T19:59:33Z) - Training Feedback Spiking Neural Networks by Implicit Differentiation on
the Equilibrium State [66.2457134675891]
Spiking neural networks (SNNs) are brain-inspired models that enable energy-efficient implementation on neuromorphic hardware.
Most existing methods imitate the backpropagation framework and feedforward architectures for artificial neural networks.
We propose a novel training method that does not rely on the exact reverse of the forward computation.
arXiv Detail & Related papers (2021-09-29T07:46:54Z) - Towards Compact Neural Networks via End-to-End Training: A Bayesian
Tensor Approach with Automatic Rank Determination [11.173092834726528]
It is desirable to directly train a compact neural network from scratch with low memory and low computational cost.
Low-rank tensor decomposition is one of the most effective approaches to reduce the memory and computing requirements of large-size neural networks.
This paper presents a novel end-to-end framework for low-rank tensorized training of neural networks.
arXiv Detail & Related papers (2020-10-17T01:23:26Z) - EikoNet: Solving the Eikonal equation with Deep Neural Networks [6.735657356113614]
We propose EikoNet, a deep learning approach to solving the Eikonal equation.
Our grid-free approach allows for rapid determination of the travel time between any two points within a continuous 3D domain.
The developed approach has important applications to earthquake hypocenter inversion, ray multi-pathing, and tomographic modeling.
arXiv Detail & Related papers (2020-03-25T02:31:53Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.