arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2502.08873cs.LGcs.DMmath.OC
收藏

基于$p$-传导性的鲁棒图半监督学习

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

Department of Mathematics, UC San Diego(加州大学圣迭戈分校数学系);Halicioğlu Data Science Institute, UC San Diego(加州大学圣迭戈分校哈利乔格鲁数据科学研究所);Department of Mathematics, University of Missouri(密苏里大学数学系)

Sawyer Jack Robertson, Chester Holtz, Zhengchao Wan, Gal Mishne, Alexander Cloninger

AI总结:

针对标签稀缺或污染的图半监督学习问题,提出$p$-传导性学习方法,泛化现有方法并构建概率测度最小割程序,理论连接图上经典问题,开发优化算法并扩展类大小估计,实证显示在多场景下达到最先进准确率。

摘要:

我们研究了数据标签稀缺或可能被污染情况下的图半监督学习问题。我们提出了一种名为$p$-传导性学习的方法,该方法通过引入类$p$-拉普拉斯正则化的目标函数和标签约束的仿射松弛,泛化了$p$-拉普拉斯和泊松学习方法。这产生了一系列概率测度最小割程序,平衡了稀疏边移除与准确的分布分离。我们的理论分析将这些程序与图上的著名变分和概率问题(包括随机割、有效电阻和瓦瑟斯坦距离)联系起来,并为通过热核扩散标签时的鲁棒性提供了动机。在计算上,我们开发了一种半光滑牛顿-共轭梯度算法,并在将连续解转换为标签分配时扩展该算法以纳入类大小估计。在计算机视觉和引用数据集上的实证结果表明,我们的方法在低标签率、标签污染和部分标签场景下实现了最先进的准确率。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑