# Robust Graph-Based Semi-Supervised Learning via p-Conductances

arXiv: https://arxiv.org/abs/2502.08873 · HTML: https://mlsanity.com/paper/2502.08873/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 13 Feb 2025.

## Built on by (most cited first, 1 of 1)

- [Neural Algorithmic Reasoning for Graph Saddle Point Problems](https://mlsanity.com/paper/2610.07255/) (2026)

## Abstract (arXiv)

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 Poisson learning methods by introducing an objective reminiscent of p-Laplacian regularization and an affine relaxation of the label constraints. This leads to a family of probability measure mincut programs that balance sparse edge removal with accurate distribution separation. Our theoretical analysis connects these programs to well-known variational and probabilistic problems on graphs (including randomized cuts, effective resistance, and Wasserstein distance) and provides motivation for robustness when labels are diffused via the heat kernel. Computationally, we develop a semismooth Newton-conjugate gradient algorithm and extend it to incorporate class-size estimates when converting the continuous solutions into label assignments. Empirical results on computer vision and citation datasets demonstrate that our approach achieves state-of-the-art accuracy in low label-rate, corrupted-label, and partial-label regimes.