Publication Type
Conference Proceeding Article
Version
publishedVersion
Publication Date
8-2017
Abstract
The conditional gradient algorithm has regained a surge of research interest in recent years due to its high efficiency in handling large-scale machine learning problems. However, none of existing studies has explored it in the distributed online learning setting, where locally light computation is assumed. In this paper, we fill this gap by proposing the distributed online conditional gradient algorithm, which eschews the expensive projection operation needed in its counterpart algorithms by exploiting much simpler linear optimization steps. We give a regret bound for the proposed algorithm as a function of the network size and topology, which will be smaller on smaller graphs or ”well-connected” graphs. Experiments on two large-scale real-world datasets for a multiclass classification task confirm the computational benefit of the proposed algorithm and also verify the theoretical regret bound.
Discipline
Theory and Algorithms
Research Areas
Data Science and Engineering
Publication
Proceedings of the 34th International Conference on Machine Learning
Publisher
The International Machine Learning Society
City or Country
Sydney, Australia
Citation
ZHANG, Wenpeng; ZHAO, Peilin; ZHU, Wenwu; HOI, Steven C. H.; and ZHANG, Tong.
Projection-free distributed online learning in networks. (2017). Proceedings of the 34th International Conference on Machine Learning.
Available at: https://ink.library.smu.edu.sg/sis_research/3970
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.