Distributed and robust support vector machine

Yangwei Liu, Hu Ding, Ziyun Huang, Jinhui Xu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations


In this paper, we consider the distributed version of Support Vector Machine (SVM) under the coordinator model, where all input data (i.e., points in ℝd space) of SVM are arbitrarily distributed among k nodes in some network with a coordinator which can communicate with all nodes. We investigate two variants of this problem, with and without outliers. For distributed SVM without outliers, we prove a lower bound on the communication complexity and give a distributed (1 - ε)-approximation algorithm to reach this lower bound, where ε is a user specified small constant. For distributed SVM with outliers, we present a (1 - ε)-approximation algorithm to explicitly remove the influence of outliers. Our algorithm is based on a deterministic distributed top t selection algorithm with communication complexity of O(k log (t)) in the coordinator model. Experimental results on benchmark datasets confirm the theoretical guarantees of our algorithms.

Original languageEnglish (US)
Title of host publication27th International Symposium on Algorithms and Computation, ISAAC 2016
EditorsSeok-Hee Hong
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959770262
StatePublished - Dec 1 2016
Event27th International Symposium on Algorithms and Computation, ISAAC 2016 - Sydney, Australia
Duration: Dec 12 2016Dec 14 2016

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
ISSN (Print)1868-8969


Conference27th International Symposium on Algorithms and Computation, ISAAC 2016

All Science Journal Classification (ASJC) codes

  • Software


Dive into the research topics of 'Distributed and robust support vector machine'. Together they form a unique fingerprint.

Cite this