Online prediction on large diameter graphs.
In: Koller, D and Schuurmans, D and Bengio, Y and Bottou, B, (eds.)
Advances in Neural Information Processing Systems 21 (NIPS 2008).
(pp. pp. 649-656).
Neural Information Processing Systems Foundation
Available under License : See the attached licence file.
We continue our study of online prediction of the labelling of a graph. We show a fundamental limitation of Laplacian-based algorithms: if the graph has a large diameter then the number of mistakes made by such algorithms may be proportional to the square root of the number of vertices, even when tackling simple problems. We overcome this drawback by means of an efficient algorithm which achieves a logarithmic mistake bound. It is based on the notion of a spine, a path graph which provides a linear embedding of the original graph. In practice, graphs may exhibit cluster structure; thus in the last part, we present a modified algorithm which achieves the "best of both worlds": it performs well locally in the presence of cluster structure, and globally on large diameter graphs.
|Title:||Online prediction on large diameter graphs|
|Event:||Neural Information Processing Systems 2008|
|Open access status:||An open access version is available from UCL Discovery|
|Additional information:||Copyright © The Authors 2008.|
|UCL classification:||UCL > School of BEAMS
UCL > School of BEAMS > Faculty of Engineering Science
Archive Staff Only