A hybrid iterative method based on MIONet for PDEs: Theory and numerical examples

• URL: http://arxiv.org/abs/2402.07156v1
• Date: Sun, 11 Feb 2024 11:02:25 GMT
• Title: A hybrid iterative method based on MIONet for PDEs: Theory and numerical examples
• Authors: Jun Hu and Pengzhan Jin
• Abstract summary: We show the theoretical results for the frequently-used smoothers, i.e. Richardson (damped Jacobi) and Gauss-Seidel. As a meshless acceleration method, it is provided with enormous potentials for practice applications.
• Score: 5.581859462239914
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We propose a hybrid iterative method based on MIONet for PDEs, which combines the traditional numerical iterative solver and the recent powerful machine learning method of neural operator, and further systematically analyze its theoretical properties, including the convergence condition, the spectral behavior, as well as the convergence rate, in terms of the errors of the discretization and the model inference. We show the theoretical results for the frequently-used smoothers, i.e. Richardson (damped Jacobi) and Gauss-Seidel. We give an upper bound of the convergence rate of the hybrid method w.r.t. the model correction period, which indicates a minimum point to make the hybrid iteration converge fastest. Several numerical examples including the hybrid Richardson (Gauss-Seidel) iteration for the 1-d (2-d) Poisson equation are presented to verify our theoretical results, and also reflect an excellent acceleration effect. As a meshless acceleration method, it is provided with enormous potentials for practice applications.

Related papers

• Mitigating distribution shift in machine learning-augmented hybrid simulation [15.37429773698171]
  We study the problem of distribution shift generally arising in machine-learning augmented hybrid simulation. We propose a simple methodology based on tangent-space regularized estimator to control the distribution shift. In all cases, we observe marked improvements in simulation accuracy under the proposed method.
  arXiv  Detail & Related papers  (2024-01-17T15:05:39Z)
• Gaussian Mixture Solvers for Diffusion Models [84.83349474361204]
  We introduce a novel class of SDE-based solvers called GMS for diffusion models. Our solver outperforms numerous SDE-based solvers in terms of sample quality in image generation and stroke-based synthesis.
  arXiv  Detail & Related papers  (2023-11-02T02:05: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)
• A Geometric Perspective on Diffusion Models [60.69328526215776]
  We inspect the ODE-based sampling of a popular variance-exploding SDE and reveal several intriguing structures of its sampling dynamics. We establish a theoretical relationship between the optimal ODE-based sampling and the classic mean-shift (mode-seeking) algorithm.
  arXiv  Detail & Related papers  (2023-05-31T15:33:16Z)
• Non-perturbative analytical diagonalization of Hamiltonians with application to coupling suppression and enhancement in cQED [0.0]
  Deriving effective Hamiltonian models plays an essential role in quantum theory. We present two symbolic methods for computing effective Hamiltonian models. We study the ZZ and cross-resonance interactions of superconducting qubits systems.
  arXiv  Detail & Related papers  (2021-11-30T19:01:44Z)
• Hybridized Methods for Quantum Simulation in the Interaction Picture [69.02115180674885]
  We provide a framework that allows different simulation methods to be hybridized and thereby improve performance for interaction picture simulations. Physical applications of these hybridized methods yield a gate complexity scaling as $log2 Lambda$ in the electric cutoff. For the general problem of Hamiltonian simulation subject to dynamical constraints, these methods yield a query complexity independent of the penalty parameter $lambda$ used to impose an energy cost.
  arXiv  Detail & Related papers  (2021-09-07T20:01:22Z)
• Loss function based second-order Jensen inequality and its application to particle variational inference [112.58907653042317]
  Particle variational inference (PVI) uses an ensemble of models as an empirical approximation for the posterior distribution. PVI iteratively updates each model with a repulsion force to ensure the diversity of the optimized models. We derive a novel generalization error bound and show that it can be reduced by enhancing the diversity of models.
  arXiv  Detail & Related papers  (2021-06-09T12:13:51Z)
• Quantum impurity models using superpositions of fermionic Gaussian states: Practical methods and applications [0.0]
  We present a practical approach for performing a variational calculation based on non-orthogonal fermionic Gaussian states. Our method is based on approximate imaginary-time equations of motion that decouple the dynamics of each state forming the ansatz. We also study the screening cloud of the two-channel Kondo model, a problem difficult to tackle using existing numerical tools.
  arXiv  Detail & Related papers  (2021-05-03T18:00:08Z)
• Convergence Analysis of Homotopy-SGD for non-convex optimization [43.71213126039448]
  We present a first-order algorithm based on a combination of homotopy methods and SGD, called Gradienty-Stoch Descent (H-SGD) Under some assumptions, we conduct a theoretical analysis of the proposed problem. Experimental results show that H-SGD can outperform SGD.
  arXiv  Detail & Related papers  (2020-11-20T09:50:40Z)
• Interpolation Technique to Speed Up Gradients Propagation in Neural ODEs [71.26657499537366]
  We propose a simple literature-based method for the efficient approximation of gradients in neural ODE models. We compare it with the reverse dynamic method to train neural ODEs on classification, density estimation, and inference approximation tasks.
  arXiv  Detail & Related papers  (2020-03-11T13:15:57Z)

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.