Semi-supervised Learning on Large Graphs: is Poisson Learning a Game-Changer?
We explain Poisson learning on graph-based semi-supervised learning to see if it could avoid the problem of global information loss problem as Laplace-based learning methods on large graphs. From our analysis, Poisson learning is simply Laplace regularization with thresholding, cannot overcome the problem.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Poisson Learning: Graph Based Semi-Supervised Learning At Very Low Label Rates
We propose a new framework, called Poisson learning, for graph based semi-supervised learning at very low label rates. Poisson learning is motivated by the need to address the degeneracy of Laplacian semi-supervised lear…
The game theoretic p-Laplacian and semi-supervised learning with few labels
We study the game theoretic p-Laplacian for semi-supervised learning on graphs, and show that it is well-posed in the limit of finite labeled data and infinite unlabeled data. In particular, we show that the continuum li…
Convergence rates for Poisson learning to a Poisson equation with measure data
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…
Semi-supervised Learning on Graphs with Generative Adversarial Nets
We investigate how generative adversarial nets (GANs) can help semi-supervised learning on graphs. We first provide insights on working principles of adversarial learning over graphs and then present GraphSGAN, a novel a…
Robust Graph-Based Semi-Supervised Learning via $p$-Conductances
We study the problem of semi-supervised learning on graphs in the regime where data labels are scarce or possibly corrupted. We propose an approach called $p$-conductance learning that generalizes the $p$-Laplace and Poi…