A hybrid MGA-MSGD ANN training approach for approximate solution of linear elliptic PDEs
Hamidreza Dehghani, Andreas Zilian

TL;DR
This paper presents a hybrid MGA-MSGD training algorithm for neural networks that efficiently solves 3D PDE-based mechanical problems by focusing on specific locations, outperforming traditional methods in accuracy and speed.
Contribution
The novel hybrid MGA-MSGD approach improves neural network training for PDEs, reducing sensitivity to parameters and enhancing accuracy and efficiency over standard algorithms.
Findings
Significant accuracy improvements over classical SGD and Adam.
Less sensitivity to learning rate, data distribution, and initial parameters.
Successful application to complex 3D mechanical problems.
Abstract
We introduce a hybrid "Modified Genetic Algorithm-Multilevel Stochastic Gradient Descent" (MGA-MSGD) training algorithm that considerably improves accuracy and efficiency of solving 3D mechanical problems described, in strong-form, by PDEs via ANNs (Artificial Neural Networks). This presented approach allows the selection of a number of locations of interest at which the state variables are expected to fulfil the governing equations associated with a physical problem. Unlike classical PDE approximation methods such as finite differences or the finite element method, there is no need to establish and reconstruct the physical field quantity throughout the computational domain in order to predict the mechanical response at specific locations of interest. The basic idea of MGA-MSGD is the manipulation of the learnable parameters' components responsible for the error explosion so that we can…
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
MethodsStochastic Gradient Descent · Adam
