REVIEW 3 cited by
Approximating High-Dimensional Minimal Surfaces with Physics-Informed Neural Networks
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
Approximating High-Dimensional Minimal Surfaces with Physics-Informed Neural Networks
read the original abstract
In this paper, we compute numerical approximations of the minimal surfaces, an essential type of Partial Differential Equation (PDE), in higher dimensions. Classical methods cannot handle it in this case because of the Curse of Dimensionality, where the computational cost of these methods increases exponentially fast in response to higher problem dimensions, far beyond the computing capacity of any modern supercomputers. Only in the past few years have machine learning researchers been able to mitigate this problem. The solution method chosen here is a model known as a Physics-Informed Neural Network (PINN) which trains a deep neural network (DNN) to solve the minimal surface PDE. It can be scaled up into higher dimensions and trained relatively quickly even on a laptop with no GPU. Due to the inability to view the high-dimension output, our data is presented as snippets of a higher-dimension shape with enough fixed axes so that it is viewable with 3-D graphs. Not only will the functionality of this method be tested, but we will also explore potential limitations in the method's performance.
Forward citations
Cited by 3 Pith papers
-
Minimal surfaces, Knots, and Neural Networks
PINNs approximate near-minimal surfaces bounding knots in S^3; their self-intersection numbers align with Fine's conjecture predictions derived from the HOMFLY polynomial.
-
Neural Representation of Minimal Surfaces
Complex-valued neural nets for two holomorphic spinor functions yield minimal surfaces by construction and can be trained to match prescribed Plateau boundaries.
-
A user's guide to PINNs in geometric analysis: lessons from the asymptotic Plateau problem
Hard-encoding boundary geometry and propagating second-order jets with a compiled graph makes a PINN for the asymptotic Plateau problem 40–50 times faster per training step.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.