Related papers: Approximating solutions of linear elliptic PDE's o…

We construct deterministic particle solutions for linear and fast diffusion equations using a nonlocal approximation. We exploit the $2$-Wasserstein gradient flow structure of the equations in order to obtain the nonlocal approximating PDEs…

Since its introduction in 2000, the locally linear embedding (LLE) has been widely applied in data science. We provide an asymptotical analysis of the LLE under the manifold setup. We show that for the general manifold, asymptotically we…

We describe a numerical framework that uses random sampling to efficiently capture low-rank local solution spaces of multiscale PDE problems arising in domain decomposition. In contrast to existing techniques, our method does not rely on…

This paper introduces a new and effective algorithm for learning kernels in a Multi-Task Learning (MTL) setting. Although, we consider a MTL scenario here, our approach can be easily applied to standard single task learning, as well. As…

Deep learning algorithms have been successfully applied to numerically solve linear Kolmogorov partial differential equations~(PDEs). A recent research shows that if the initial functions are bounded, the empirical risk minimization (ERM)…

We present an error bound for a least squares version of the kernel based meshless finite difference method for elliptic differential equations on smooth compact manifolds of arbitrary dimension without boundary. In particular, we obtain…

We propose a new technique for constructing low-rank approximations of matrices that arise in kernel methods for machine learning. Our approach pairs a novel automatically constructed analytic expansion of the underlying kernel function…

The usual approach to model reduction for parametric partial differential equations (PDEs) is to construct a linear space $V_n$ which approximates well the solution manifold $\mathcal{M}$ consisting of all solutions $u(y)$ with $y$ the…

Well known to the machine learning community, the random feature model is a parametric approximation to kernel interpolation or regression methods. It is typically used to approximate functions mapping a finite-dimensional input space to…

We are interested in mesh-free formulas based on the Monte-Carlo methodology for the approximation of multi-dimensional integrals, and we investigate their accuracy when the functions belong to a reproducing-kernel space. A kernel typically…

The objective of the paper is to describe Besov spaces on general compact Riemannian manifolds in terms of the best approximation by eigenfunctions of elliptic differential operators.

Physics-informed machine learning (PIML) has emerged as a promising alternative to conventional numerical methods for solving partial differential equations (PDEs). PIML models are increasingly built via deep neural networks (NNs) whose…

In this paper, we propose a new randomized method for numerical integration on a compact complex manifold with respect to a continuous volume form. Taking for quadrature nodes a suitable determinantal point process, we build an unbiased…

We present a spectrally accurate embedded boundary method for solving linear, inhomogeneous, elliptic partial differential equations (PDE) in general smooth geometries, focusing in this manuscript on the Poisson, modified Helmholtz, and…

We consider finite element methods of multiscale type to approximate solutions for two-dimensional symmetric elliptic partial differential equations with heterogeneous $L^\infty$ coefficients. The methods are of Galerkin type and follow the…

We introduce a deep neural network based method for solving a class of elliptic partial differential equations. We approximate the solution of the PDE with a deep neural network which is trained under the guidance of a probabilistic…

This paper establishes error bounds for the convergence of a piecewise linear approximation of the constrained optimal smoothing problem posed in a reproducing kernel Hilbert space (RKHS). This problem can be reformulated as a Bayesian…

While much attention of neural network methods is devoted to high-dimensional PDE problems, in this work we consider methods designed to work for elliptic problems on domains $\Omega \subset \mathbb{R} ^d, $ $d=1,2,3$ in association with…

We develop a kernel-based solver for path-dependent PDEs (PPDEs) along with a convergence theory. Our numerical scheme leverages signature kernels, a recently introduced class of kernels on path-space. Specifically, we solve an optimal…

In this paper, we propose and analyze a multiscale method for a class of quasilinear elliptic problems of nonmonotone type with spatially multiscale coefficient. The numerical approach is inspired by the Localized Orthogonal Decomposition…