Semi-supervised Learning on Large Graphs: is Poisson Learning a Game-Changer?
arXiv:2202.13608v22 citations
Originality Synthesis-oriented
AI Analysis
This addresses a methodological limitation for researchers in graph-based machine learning, but it is incremental as it refutes a potential improvement without introducing new solutions.
The paper tackled the problem of global information loss in graph-based semi-supervised learning on large graphs by analyzing Poisson learning, and found that it is equivalent to Laplace regularization with thresholding and cannot overcome the issue.
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.