An Iterative Deep Ritz Method for Monotone Elliptic Problems

• URL: http://arxiv.org/abs/2501.15186v1
• Date: Sat, 25 Jan 2025 11:50:24 GMT
• Title: An Iterative Deep Ritz Method for Monotone Elliptic Problems
• Authors: Tianhao Hu, Bangti Jin, Fengru Wang,
• Abstract summary: We present a novel iterative deep Ritz method (IDRM) for solving a general class of elliptic problems. The algorithm is applicable to elliptic problems involving a monotone operator. We establish a convergence rate for the method using tools from geometry of Banach spaces and theory of monotone operators.
• Score: 0.29792392019703945
• License:
• Abstract: In this work, we present a novel iterative deep Ritz method (IDRM) for solving a general class of elliptic problems. It is inspired by the iterative procedure for minimizing the loss during the training of the neural network, but at each step encodes the geometry of the underlying function space and incorporates a convex penalty to enhance the performance of the algorithm. The algorithm is applicable to elliptic problems involving a monotone operator (not necessarily of variational form) and does not impose any stringent regularity assumption on the solution. It improves several existing neural PDE solvers, e.g., physics informed neural network and deep Ritz method, in terms of the accuracy for the concerned class of elliptic problems. Further, we establish a convergence rate for the method using tools from geometry of Banach spaces and theory of monotone operators, and also analyze the learning error. To illustrate the effectiveness of the method, we present several challenging examples, including a comparative study with existing techniques.

Related papers

• Local Linear Convergence of Infeasible Optimization with Orthogonal Constraints [12.414718831844041]
  An infeasible retraction-based approach was proposed as an efficient alternative. This paper establishes a novel landing algorithm for smooth non-free component analysis using only a neuralian PL condition. Numerical experiments demonstrate that the landing algorithm performs on par with the state-the-art retraction-based methods with substantially reduced computational overhead.
  arXiv  Detail & Related papers  (2024-12-07T16:02:27Z)
• Optimizing Solution-Samplers for Combinatorial Problems: The Landscape of Policy-Gradient Methods [52.0617030129699]
  We introduce a novel theoretical framework for analyzing the effectiveness of DeepMatching Networks and Reinforcement Learning methods. Our main contribution holds for a broad class of problems including Max-and Min-Cut, Max-$k$-Bipartite-Bi, Maximum-Weight-Bipartite-Bi, and Traveling Salesman Problem. As a byproduct of our analysis we introduce a novel regularization process over vanilla descent and provide theoretical and experimental evidence that it helps address vanishing-gradient issues and escape bad stationary points.
  arXiv  Detail & Related papers  (2023-10-08T23:39:38Z)
• An Optimization-based Deep Equilibrium Model for Hyperspectral Image Deconvolution with Convergence Guarantees [71.57324258813675]
  We propose a novel methodology for addressing the hyperspectral image deconvolution problem. A new optimization problem is formulated, leveraging a learnable regularizer in the form of a neural network. The derived iterative solver is then expressed as a fixed-point calculation problem within the Deep Equilibrium framework.
  arXiv  Detail & Related papers  (2023-06-10T08:25:16Z)
• Dirichlet-Neumann learning algorithm for solving elliptic interface problems [7.935690079593201]
  Dirichlet-Neumann learning algorithm is proposed in this work to solve the benchmark elliptic interface problem with high-contrast coefficients as well as irregular interfaces. We carry out a rigorous error analysis to evaluate the discrepancy caused by the boundary penalty treatment for each subproblem. The effectiveness and robustness of our proposed methods are demonstrated experimentally through a series of elliptic interface problems.
  arXiv  Detail & Related papers  (2023-01-18T08:10:49Z)
• NeuralEF: Deconstructing Kernels by Deep Neural Networks [47.54733625351363]
  Traditional nonparametric solutions based on the Nystr"om formula suffer from scalability issues. Recent work has resorted to a parametric approach, i.e., training neural networks to approximate the eigenfunctions. We show that these problems can be fixed by using a new series of objective functions that generalizes to space of supervised and unsupervised learning problems.
  arXiv  Detail & Related papers  (2022-04-30T05:31:07Z)
• A deep branching solver for fully nonlinear partial differential equations [0.1474723404975345]
  We present a multidimensional deep learning implementation of a branching algorithm for the numerical solution of fully nonlinear PDEs. This approach is designed to tackle functional nonlinearities involving gradient terms of any orders.
  arXiv  Detail & Related papers  (2022-03-07T09:46:46Z)
• Physics informed neural networks for continuum micromechanics [68.8204255655161]
  Recently, physics informed neural networks have successfully been applied to a broad variety of problems in applied mathematics and engineering. Due to the global approximation, physics informed neural networks have difficulties in displaying localized effects and strong non-linear solutions by optimization. It is shown, that the domain decomposition approach is able to accurately resolve nonlinear stress, displacement and energy fields in heterogeneous microstructures obtained from real-world $mu$CT-scans.
  arXiv  Detail & Related papers  (2021-10-14T14:05:19Z)
• Inverse Problem of Nonlinear Schr\"odinger Equation as Learning of Convolutional Neural Network [5.676923179244324]
  It is shown that one can obtain a relatively accurate estimate of the considered parameters using the proposed method. It provides a natural framework in inverse problems of partial differential equations with deep learning.
  arXiv  Detail & Related papers  (2021-07-19T02:54:37Z)
• Fractal Structure and Generalization Properties of Stochastic Optimization Algorithms [71.62575565990502]
  We prove that the generalization error of an optimization algorithm can be bounded on the complexity' of the fractal structure that underlies its generalization measure. We further specialize our results to specific problems (e.g., linear/logistic regression, one hidden/layered neural networks) and algorithms.
  arXiv  Detail & Related papers  (2021-06-09T08:05:36Z)
• Multipole Graph Neural Operator for Parametric Partial Differential Equations [57.90284928158383]
  One of the main challenges in using deep learning-based methods for simulating physical systems is formulating physics-based data. We propose a novel multi-level graph neural network framework that captures interaction at all ranges with only linear complexity. Experiments confirm our multi-graph network learns discretization-invariant solution operators to PDEs and can be evaluated in linear time.
  arXiv  Detail & Related papers  (2020-06-16T21:56:22Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.