Distributed Information Regularization on Graphs

9 years 1 months ago
Distributed Information Regularization on Graphs
We provide a principle for semi-supervised learning based on optimizing the rate of communicating labels for unlabeled points with side information. The side information is expressed in terms of identities of sets of points or regions with the purpose of biasing the labels in each region to be the same. The resulting regularization objective is convex, has a unique solution, and the solution can be found with a pair of local propagation operations on graphs induced by the regions. We analyze the properties of the algorithm and demonstrate its performance on document classification tasks.
Adrian Corduneanu, Tommi Jaakkola
Added 31 Oct 2010
Updated 31 Oct 2010
Type Conference
Year 2004
Where NIPS
Authors Adrian Corduneanu, Tommi Jaakkola
Comments (0)