REVIEW 2 cited by
Lie Point Symmetry Data Augmentation for Neural PDE Solvers
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Neural networks are increasingly being used to solve partial differential equations (PDEs), replacing slower numerical solvers. However, a critical issue is that neural PDE solvers require high-quality ground truth data, which usually must come from the very solvers they are designed to replace. Thus, we are presented with a proverbial chicken-and-egg problem. In this paper, we present a method, which can partially alleviate this problem, by improving neural PDE solver sample complexity -- Lie point symmetry data augmentation (LPSDA). In the context of PDEs, it turns out that we are able to quantitatively derive an exhaustive list of data transformations, based on the Lie point symmetry group of the PDEs in question, something not possible in other application areas. We present this framework and demonstrate how it can easily be deployed to improve neural PDE solver sample complexity by an order of magnitude.
Forward citations
Cited by 2 Pith papers
-
MultiPDENet: PDE-embedded Learning with Multi-time-stepping for Accelerated Flow Simulation
MultiPDENet predicts long-term flow dynamics on coarse grids from a few trajectories by embedding finite-difference stencils and Runge-Kutta stepping into a network with macro-scale error correction.
-
Predicting Change, Not States: An Alternate Framework for Neural PDE Surrogates
Predicting the temporal derivative and integrating it with an ODE solver improves accuracy and stability of neural PDE surrogates compared with direct next-state prediction.
Discussion (0). Continue with ORCID to comment.