This paper proposes a mesh-free computational framework and machine learning theory for solving elliptic PDEs on unknown manifolds, identified with point clouds, based on diffusion maps (DM) and deep learning. The PDE solver is formulated as a supervised learning task to solve a least-squares regression problem that imposes an algebraic equation approximating a PDE (and boundary conditions if applicable). This algebraic equation involves a graph-Laplacian type matrix obtained via DM asymptotic expansion, which is a consistent estimator of second-order elliptic differential operators. The resulting numerical method is to solve a highly non-convex empirical risk minimization problem subjected to a solution from a hypothesis space of neural-network type functions. In a well-posed elliptic PDE setting, when the hypothesis space consists of feedforward neural networks with either infinite width or depth, we show that the global minimizer of the empirical loss function is a consistent solution in the limit of large training data. When the hypothesis space is a two-layer neural network, we show that for a sufficiently large width, the gradient descent method can identify a global minimizer of the empirical loss function. Supporting numerical examples demonstrate the convergence of the solutions and the effectiveness of the proposed solver in avoiding numerical issues that hampers the traditional approach when a large data set becomes available, e.g., large matrix inversion.
翻译:本文提出一个无网格计算框架和机器学习理论, 以解决在未知的方块上的椭圆式 PDE, 以分布图( DM) 和深层次学习为基础, 用点云确定。 PDE 求解器是设计成一个受监督的学习任务, 以解决一个最小方形回归问题, 使代数方程式( 如果适用, 以及边界条件) 相近。 此代数方程式包含一个图形- Laplacian 类型矩阵, 用于解决在未知的方程式上的椭圆式 PDE 。 通过 DM 无线扩展获得的图形- Laplacecian 类型矩阵, 这是二阶椭圆形差异操作器的一致估计符 。 由此得出的数字方法是解决高度非colvex 实证风险最小化问题, 由神经网络的假设空间, 由神经网络假设空间的假设空间, 一个高度非colovex 实验性最小化的实验性最小性最小化风险最小化问题, 我们展示一个足够大的缩度, 数字缩缩度 的缩略度 的模型, 将 演示一个实验性 的缩缩缩 的缩 的模型 。