ResearchTrend.AI
Communication Efficient Distributed Agnostic Boosting
v1v2 (latest)

Communication Efficient Distributed Agnostic Boosting

Shang-Tse Chen
Maria-Florina Balcan
Duen Horng Chau
ArXiv (abs)PDFHTML

Papers citing "Communication Efficient Distributed Agnostic Boosting"

6 / 6 papers shown
Title
Communication-Efficient Distributed Dual Coordinate Ascent
Communication-Efficient Distributed Dual Coordinate Ascent
Martin Jaggi
Virginia Smith
Martin Takáč
Jonathan Terhorst
S. Krishnan
Thomas Hofmann
Michael I. Jordan
102
353
0
04 Sep 2014
Improved Distributed Principal Component Analysis
Improved Distributed Principal Component Analysis
Maria-Florina Balcan
Vandana Kanchanapally
Yingyu Liang
David P. Woodruff
102
149
0
25 Aug 2014
Distributed k-Means and k-Median Clustering on General Topologies
Distributed k-Means and k-Median Clustering on General Topologies
Maria-Florina Balcan
Steven Ehrlich
Yingyu Liang
180
124
0
03 Jun 2013
Efficient Protocols for Distributed Classification and Optimization
Efficient Protocols for Distributed Classification and Optimization
Hal Daumé
J. M. Phillips
A. Saha
Suresh Venkatasubramanian
102
41
0
16 Apr 2012
Agnostic Learning of Monomials by Halfspaces is Hard
Agnostic Learning of Monomials by Halfspaces is Hard
Vitaly Feldman
V. Guruswami
P. Raghavendra
Yi Wu
109
157
0
03 Dec 2010
Distribution-Specific Agnostic Boosting
Distribution-Specific Agnostic Boosting
Vitaly Feldman
FedML
122
50
0
16 Sep 2009