Related papers: A General Error Estimate For Parabolic Variational…
We study gradient-based regularization methods for neural networks. We mainly focus on two regularization methods: the total variation and the Tikhonov regularization. Applying these methods is equivalent to using neural networks to solve…
Gradient schemes is a framework that enables the unified convergence analysis of many numerical methods for elliptic and parabolic partial differential equations: conforming and non-conforming Finite Element, Mixed Finite Element and Finite…
The aim of this paper is to extend the global error estimation and control addressed in Lang and Verwer [SIAM J. Sci. Comput. 29, 2007] for initial value problems to finite difference solutions of semilinear parabolic partial differential…
We derive a simple and model-independent formula for the change in the generalization gap due to a gradient descent update. We then compare the change in the test error for stochastic gradient descent to the change in test error from an…
In this paper, we present a numerical scheme to solve the initial-boundary value problem for backward stochastic partial differential equations of parabolic type. Based on the Galerkin method, we approximate the original equation by a…
The aim of this article is to provide a firm mathematical foundation for the application of deep gradient flow methods (DGFMs) for the solution of (high-dimensional) partial differential equations (PDEs). We decompose the generalization…
In this paper, we employ a space-time finite element method to discretize the parabolic initial-boundary value problem and extend its error analysis with refined estimates on unstructured space-time meshes. We establish higher-order…
In this work, we consider space-time goal-oriented a posteriori error estimation for parabolic problems. Temporal and spatial discretizations are based on Galerkin finite elements of continuous and discontinuous type. The main objectives…
In this paper we establish a best approximation property of fully discrete Galerkin finite element solutions of second order parabolic problems on convex polygonal and polyhedral domains in the $L^\infty$ norm. The discretization method…
Gradient schemes is a framework which enables the unified convergence analysis of many different methods -- such as finite elements (conforming, non-conforming and mixed) and finite volumes methods -- for $2^{\rm nd}$ order diffusion…
While many methods exist to discretize nonlinear time-dependent partial differential equations (PDEs), the rigorous estimation and adaptive control of their discretization errors remains challenging. In this paper, we present a methodology…
Geometric median (\textsc{Gm}) is a classical method in statistics for achieving a robust estimation of the uncorrupted data; under gross corruption, it achieves the optimal breakdown point of 0.5. However, its computational complexity…
This paper develops a probabilistic numerical method for solution of partial differential equations (PDEs) and studies application of that method to PDE-constrained inverse problems. This approach enables the solution of challenging inverse…
The stochastic reaction-diffusion model driven by a multiplicative noise is examined. We construct the gradient discretisation method (GDM), an abstract framework combining several numerical method families. The paper provides the…
Since Pearson [Philosophical Transactions of the Royal Society of London. A, 185 (1894), pp. 71-110] first applied the method of moments (MM) for modeling data as a mixture of one-dimensional Gaussians, moment-based estimation methods have…
*The gradient discretisation method (GDM) is a generic framework, covering many classical methods (Finite Elements, Finite Volumes, Discontinuous Galerkin, etc.), for designing and analysing numerical schemes for diffusion models. In this…
To solve the separable convex optimization problem with linear constraints, Eckstein and Bertsekas introduced the generalized alternating direction method of multipliers (in short, GADMM), which is an efficient and simple acceleration…
Stochastic gradient descent with momentum (SGDM) is one of the most widely used optimization algorithms in machine learning. While optimization properties of SGDM have been extensively studied in the literature, it remains insufficiently…
In this paper, we consider an approximation method, and a novel general analysis, for second-order elliptic differential equations with heterogeneous multiscale coefficients. We obtain convergence of the Generalized Multi-scale Finite…
In this paper, both semidiscrete and completely discrete finite volume element methods (FVEMs) are analyzed for approximating solutions of a class of linear hyperbolic integro- differential equations in a two-dimensional convex polygonal…