Multi-Grade Deep Learning for Partial Differential Equations with Applications to the Burgers Equation
Yuesheng Xu, Taishan Zeng

TL;DR
This paper introduces a two-stage multi-grade deep learning approach for solving nonlinear PDEs, effectively reducing training complexity and improving accuracy over traditional single-grade methods, demonstrated on Burgers equations.
Contribution
The paper proposes a novel multi-grade deep learning framework that stacks neural networks to better solve PDEs, addressing training difficulties of deep networks and improving predictive accuracy.
Findings
The method reduces loss function values at each stage.
It outperforms single-grade deep learning in accuracy.
Experimental results show significant error reductions in Burgers equations.
Abstract
We develop in this paper a multi-grade deep learning method for solving nonlinear partial differential equations (PDEs). Deep neural networks (DNNs) have received super performance in solving PDEs in addition to their outstanding success in areas such as natural language processing, computer vision, and robotics. However, training a very deep network is often a challenging task. As the number of layers of a DNN increases, solving a large-scale non-convex optimization problem that results in the DNN solution of PDEs becomes more and more difficult, which may lead to a decrease rather than an increase in predictive accuracy. To overcome this challenge, we propose a two-stage multi-grade deep learning (TS-MGDL) method that breaks down the task of learning a DNN into several neural networks stacked on top of each other in a staircase-like manner. This approach allows us to mitigate the…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsModel Reduction and Neural Networks
