TL;DR
This paper introduces a physics-informed Wasserstein GAN framework with groupSort activations for uncertainty quantification in PDE solutions, providing theoretical error bounds and validating results with synthetic examples.
Contribution
It develops a novel physics-informed WGAN approach with theoretical convergence guarantees and insights into discriminator and generator capacity requirements.
Findings
Convergence of the generator's generalization error to the approximation error.
Higher capacity requirements for discriminators compared to generators.
Validation of the method through synthetic PDE examples.
Abstract
In this paper, we study a physics-informed algorithm for Wasserstein Generative Adversarial Networks (WGANs) for uncertainty quantification in solutions of partial differential equations. By using groupsort activation functions in adversarial network discriminators, network generators are utilized to learn the uncertainty in solutions of partial differential equations observed from the initial/boundary data. Under mild assumptions, we show that the generalization error of the computed generator converges to the approximation error of the network with high probability, when the number of samples are sufficiently taken. According to our established error bound, we also find that our physics-informed WGANs have higher requirement for the capacity of discriminators than that of generators. Numerical results on synthetic examples of partial differential equations are reported to validate our…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
