Herbster, M; Robinson, J; (2019) Online Prediction of Switching Graph Labelings with Cluster Specialists. In: Wallach, H and Larochelle, H and Beygelzimer, A and d'Alche-Buc, F and Fox, E and Garnett, R, (eds.) Advances in Neural Information Processing Systems 32 (NIPS 2019). Neural Information Processing Systems (NIPS): Vancouver, Canada.

Preview

Text 8923-online-prediction-of-switching-graph-labelings-with-cluster-specialists.pdf - Published Version Download (2MB) | Preview

Abstract

We address the problem of predicting the labeling of a graph in an online setting when the labeling is changing over time. We present an algorithm based on a specialist [11] approach; we develop the machinery of cluster specialists which probabilistically exploits the cluster structure in the graph. Our algorithm has two variants, one of which surprisingly only requires O(log n) time on any trial t on an n-vertex graph, an exponential speed up over existing methods. We prove switching mistake-bound guarantees for both variants of our algorithm. Furthermore these mistake bounds smoothly vary with the magnitude of the change between successive labelings. We perform experiments on Chicago Divvy Bicycle Sharing data and show that our algorithms significantly outperform an existing algorithm (a kernelized Perceptron) as well as several natural benchmarks.

Download activity - last month

Export as CSVXMLJSON

Download activity - last 12 months

Export as XMLJSONCSV

Downloads by country - last 12 months

Export as CSVXMLJSON

Archive Staff Only

View Item