Distributed mini-batch random projection algorithms for reduced communication overhead

Soomin Lee, Angelia Nedich

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

1 Citation (Scopus)

Abstract

We propose a gossip-based mini-batch random projection (GMRP) algorithm that can reduce communication overhead for a distributed optimization problem defined over a network with a very large number of constraints. We state a convergence result and provide an application of the GMRP, text classification with support vector machines.

Original languageEnglish (US)
Title of host publication2013 IEEE Global Conference on Signal and Information Processing, GlobalSIP 2013 - Proceedings
Pages559-562
Number of pages4
DOIs
StatePublished - 2013
Externally publishedYes
Event2013 1st IEEE Global Conference on Signal and Information Processing, GlobalSIP 2013 - Austin, TX, United States
Duration: Dec 3 2013Dec 5 2013

Other

Other2013 1st IEEE Global Conference on Signal and Information Processing, GlobalSIP 2013
CountryUnited States
CityAustin, TX
Period12/3/1312/5/13

Fingerprint

Support vector machines
Communication

ASJC Scopus subject areas

  • Information Systems
  • Signal Processing

Cite this

Lee, S., & Nedich, A. (2013). Distributed mini-batch random projection algorithms for reduced communication overhead. In 2013 IEEE Global Conference on Signal and Information Processing, GlobalSIP 2013 - Proceedings (pp. 559-562). [6736939] https://doi.org/10.1109/GlobalSIP.2013.6736939

Distributed mini-batch random projection algorithms for reduced communication overhead. / Lee, Soomin; Nedich, Angelia.

2013 IEEE Global Conference on Signal and Information Processing, GlobalSIP 2013 - Proceedings. 2013. p. 559-562 6736939.

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

Lee, S & Nedich, A 2013, Distributed mini-batch random projection algorithms for reduced communication overhead. in 2013 IEEE Global Conference on Signal and Information Processing, GlobalSIP 2013 - Proceedings., 6736939, pp. 559-562, 2013 1st IEEE Global Conference on Signal and Information Processing, GlobalSIP 2013, Austin, TX, United States, 12/3/13. https://doi.org/10.1109/GlobalSIP.2013.6736939
Lee S, Nedich A. Distributed mini-batch random projection algorithms for reduced communication overhead. In 2013 IEEE Global Conference on Signal and Information Processing, GlobalSIP 2013 - Proceedings. 2013. p. 559-562. 6736939 https://doi.org/10.1109/GlobalSIP.2013.6736939
Lee, Soomin ; Nedich, Angelia. / Distributed mini-batch random projection algorithms for reduced communication overhead. 2013 IEEE Global Conference on Signal and Information Processing, GlobalSIP 2013 - Proceedings. 2013. pp. 559-562
@inproceedings{2c533a25df494143a5ff93d7ad83e91f,
title = "Distributed mini-batch random projection algorithms for reduced communication overhead",
abstract = "We propose a gossip-based mini-batch random projection (GMRP) algorithm that can reduce communication overhead for a distributed optimization problem defined over a network with a very large number of constraints. We state a convergence result and provide an application of the GMRP, text classification with support vector machines.",
author = "Soomin Lee and Angelia Nedich",
year = "2013",
doi = "10.1109/GlobalSIP.2013.6736939",
language = "English (US)",
isbn = "9781479902484",
pages = "559--562",
booktitle = "2013 IEEE Global Conference on Signal and Information Processing, GlobalSIP 2013 - Proceedings",

}

TY - GEN

T1 - Distributed mini-batch random projection algorithms for reduced communication overhead

AU - Lee, Soomin

AU - Nedich, Angelia

PY - 2013

Y1 - 2013

N2 - We propose a gossip-based mini-batch random projection (GMRP) algorithm that can reduce communication overhead for a distributed optimization problem defined over a network with a very large number of constraints. We state a convergence result and provide an application of the GMRP, text classification with support vector machines.

AB - We propose a gossip-based mini-batch random projection (GMRP) algorithm that can reduce communication overhead for a distributed optimization problem defined over a network with a very large number of constraints. We state a convergence result and provide an application of the GMRP, text classification with support vector machines.

UR - http://www.scopus.com/inward/record.url?scp=84897691817&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84897691817&partnerID=8YFLogxK

U2 - 10.1109/GlobalSIP.2013.6736939

DO - 10.1109/GlobalSIP.2013.6736939

M3 - Conference contribution

SN - 9781479902484

SP - 559

EP - 562

BT - 2013 IEEE Global Conference on Signal and Information Processing, GlobalSIP 2013 - Proceedings

ER -