Consistent Semi-Supervised Graph Regularization for High Dimensional Data
Machine Learning
2020-06-16 v1 Machine Learning
Abstract
Semi-supervised Laplacian regularization, a standard graph-based approach for learning from both labelled and unlabelled data, was recently demonstrated to have an insignificant high dimensional learning efficiency with respect to unlabelled data (Mai and Couillet 2018), causing it to be outperformed by its unsupervised counterpart, spectral clustering, given sufficient unlabelled data. Following a detailed discussion on the origin of this inconsistency problem, a novel regularization approach involving centering operation is proposed as solution, supported by both theoretical analysis and empirical results.
Cite
@article{arxiv.2006.07575,
title = {Consistent Semi-Supervised Graph Regularization for High Dimensional Data},
author = {Xiaoyi Mai and Romain Couillet},
journal= {arXiv preprint arXiv:2006.07575},
year = {2020}
}