Predicting a Switching Sequence of Graph Labelings
Mark Herbster, Stephen Pasteris, Massimiliano Pontil; 16(60):2003−2022, 2015.
Abstract
We study the problem of predicting online the labeling of a graph. We consider a novel setting for this problem in which, in addition to observing vertices and labels on the graph, we also observe a sequence of just vertices on a second graph. A latent labeling of the second graph selects one of $K$ labelings to be active on the first graph. We propose a polynomial time algorithm for online prediction in this setting and derive a mistake bound for the algorithm. The bound is controlled by the geometric cut of the observed and latent labelings, as well as the resistance diameters of the graphs. When specialized to multitask prediction and online switching problems the bound gives new and sharper results under certain conditions.
[abs]
[pdf][bib]| © JMLR 2015. (edit, beta) |