2017
Re-revisiting Learning on Hypergraphs: Confidence Interval and Subgradient Method
ICML 2017poster
We revisit semi-supervised learning on hypergraphs. Same as previous approaches, our method uses a convex program whose objective function is not everywhere differentiable. We exploit the non-uniqueness of the optimal solutions, and consider confidence intervals which give the exact ranges that unla…