Convergence rates for Poisson learning to a Poisson equation with measure data

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Bungert, Leon, Calder, Jeff, Mihailescu, Max, Houssou, Kodjo, Yuan, Amber
Format: Preprint
Publié: 2024
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866914863177007104
author Bungert, Leon
Calder, Jeff
Mihailescu, Max
Houssou, Kodjo
Yuan, Amber
author_facet Bungert, Leon
Calder, Jeff
Mihailescu, Max
Houssou, Kodjo
Yuan, Amber
contents In this paper we prove discrete to continuum convergence rates for Poisson Learning, a graph-based semi-supervised learning algorithm that is based on solving the graph Poisson equation with a source term consisting of a linear combination of Dirac deltas located at labeled points and carrying label information. The corresponding continuum equation is a Poisson equation with measure data in a Euclidean domain $Ω\subset \mathbb{R}^d$. The singular nature of these equations is challenging and requires an approach with several distinct parts: (1) We prove quantitative error estimates when convolving the measure data of a Poisson equation with (approximately) radial function supported on balls. (2) We use quantitative variational techniques to prove discrete to continuum convergence rates on random geometric graphs with bandwidth $\varepsilon>0$ for bounded source terms. (3) We show how to regularize the graph Poisson equation via mollification with the graph heat kernel, and we study fine asymptotics of the heat kernel on random geometric graphs. Combining these three pillars we obtain $L^1$ convergence rates that scale, up to logarithmic factors, like $O(\varepsilon^{\frac{1}{d+2}})$ for general data distributions, and $O(\varepsilon^{\frac{2-σ}{d+4}})$ for uniformly distributed data, where $σ>0$. These rates are valid with high probability if $\varepsilon\gg\left({\log n}/{n}\right)^q$ where $n$ denotes the number of vertices of the graph and $q \approx \frac{1}{3d}$.
format Preprint
id arxiv_https___arxiv_org_abs_2407_06783
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Convergence rates for Poisson learning to a Poisson equation with measure data
Bungert, Leon
Calder, Jeff
Mihailescu, Max
Houssou, Kodjo
Yuan, Amber
Analysis of PDEs
Machine Learning
Numerical Analysis
Probability
35J05, 35A35, 05C80, 35J05
In this paper we prove discrete to continuum convergence rates for Poisson Learning, a graph-based semi-supervised learning algorithm that is based on solving the graph Poisson equation with a source term consisting of a linear combination of Dirac deltas located at labeled points and carrying label information. The corresponding continuum equation is a Poisson equation with measure data in a Euclidean domain $Ω\subset \mathbb{R}^d$. The singular nature of these equations is challenging and requires an approach with several distinct parts: (1) We prove quantitative error estimates when convolving the measure data of a Poisson equation with (approximately) radial function supported on balls. (2) We use quantitative variational techniques to prove discrete to continuum convergence rates on random geometric graphs with bandwidth $\varepsilon>0$ for bounded source terms. (3) We show how to regularize the graph Poisson equation via mollification with the graph heat kernel, and we study fine asymptotics of the heat kernel on random geometric graphs. Combining these three pillars we obtain $L^1$ convergence rates that scale, up to logarithmic factors, like $O(\varepsilon^{\frac{1}{d+2}})$ for general data distributions, and $O(\varepsilon^{\frac{2-σ}{d+4}})$ for uniformly distributed data, where $σ>0$. These rates are valid with high probability if $\varepsilon\gg\left({\log n}/{n}\right)^q$ where $n$ denotes the number of vertices of the graph and $q \approx \frac{1}{3d}$.
title Convergence rates for Poisson learning to a Poisson equation with measure data
topic Analysis of PDEs
Machine Learning
Numerical Analysis
Probability
35J05, 35A35, 05C80, 35J05
url https://arxiv.org/abs/2407.06783