Fetching the paper…
Reading the bibliography…
This work studies distributed learning in the spirit of Yao's model of communication complexity: consider a two-party setting, where each of the players gets a list of labelled examples and they communicate in order to jointly perform some learning task.
Über die topologische erweiterung von räumen
A. Tychonoff · 1930
Earlier work this paper cites.
On the uniform convergence of relative frequencies of events to their probabilities
V.N. Vapnik and A.Ya. Chervonenkis · 1971
Earlier work this paper cites.
Some complexity questions related to distributive computing (preliminary report)
Andrew Chi-Chih Yao · 1979
Earlier work this paper cites.
Lower bounds on information transfer in distributed computations
Harold Abelson · 1980
Earlier work this paper cites.
On notions of information transfer in VLSI circuits
Alfred V. Aho, Jeffrey D. Ullman, and Mihalis Yannakakis · 1983
Earlier work this paper cites.
Communication complexity
Christos H. Papadimitriou and Michael Sipser · 1984
Earlier work this paper cites.
Relating data compression and learnability
N. Littlestone and M. Warmuth · 1986
Earlier work this paper cites.
ϵ \epsilon -nets and simplex range queries
David Haussler and Emo Welzl · 1987
Earlier work this paper cites.
The probabilistic communication complexity of set intersection
Bala Kalyanasundaram and Georg Schnitger · 1992
Earlier work this paper cites.
On the distributional complexity of disjointness
Alexander A. Razborov · 1992
Earlier work this paper cites.
Communication complexity and combinatorial lattice theory
László Lovăsz and Michael Saks · 1993
Earlier work this paper cites.
Discrepancy and approximations for bounded vc-dimension
Jiří Matoušek, Emo Welzl, and Lorenz Wernisch · 1993
Earlier work this paper cites.
Rounds in communication complexity revisited
Noam Nisan and Avi Wigderson · 1993
Earlier work this paper cites.
Boosting a weak learning algorithm by majority
Yoav Freund · 1995
Earlier work this paper cites.
Sample compression, learnability, and the vapnik-chervonenkis dimension
Sally Floyd and Manfred K. Warmuth · 1995
Earlier work this paper cites.
A decision-theoretic generalization of on-line learning and an application to boosting
Yoav Freund and Robert E. Schapire · 1997
Cited alongside, same era.
Communication complexity
Eyal Kushilevitz and Noam Nisan · 1997
Cited alongside, same era.
Boosting the margin: A new explanation for the effectiveness of voting methods
Robert E. Schapire, Yoav Freund, Peter Barlett, and Wee Sun Lee · 1997
Cited alongside, same era.
Combinatorial variability of vapnik-chervonenkis classes with applications to sample compression schemes
Shai Ben-David and Ami Litman · 1998
Cited alongside, same era.
Distributed delayed stochastic optimization
Alekh Agarwal and John C. Duchi · 2012
Cited alongside, same era.
Distributed learning, communication complexity and privacy
Maria-Florina Balcan, Avrim Blum, Shai Fine, and Yishay Mansour · 2012
Understanding Machine Learning: From Theory to Algorithms
Shai Shalev-Shwartz and Shai Ben-David · 2014
Later among the works it cites.
Communication-efficient distributed optimization using an approximate newton-type method
Ohad Shamir, Nathan Srebro, and Tong Zhang · 2014
Later among the works it cites.
Communication complexity of distributed convex learning and optimization
Yossi Arjevani and Ohad Shamir · 2015
Later among the works it cites.
Compressing and teaching for low vc-dimension
Shay Moran, Amir Shpilka, Avi Wigderson, and Amir Yehudayoff · 2015
Later among the works it cites.
Agnostic pointwise-competitive selective classification
Yair Wiener and Ran El-Yaniv · 2015
Later among the works it cites.
On version space compression
Shai Ben-David and Ruth Urner · 2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Optimal distributed online prediction using mini-batches
Ofer Dekel, Ran Gilad-Bachrach, Ohad Shamir, and Lin Xiao · 2012
Cited alongside, same era.
Efficient protocols for distributed classification and optimization
Hal Daumé III, Jeff M. Phillips, Avishek Saha, and Suresh Venkatasubramanian · 2012
Cited alongside, same era.
Protocols for learning classifiers on distributed data
Hal Daumé III, Jeff M. Phillips, Avishek Saha, and Suresh Venkatasubramanian · 2012
Cited alongside, same era.
Boosting: Foundations and algorithms
Robert E Schapire and Yoav Freund · 2012
Cited alongside, same era.
Honest compressions and their application to compression schemes
Roi Livni and Pierre Simon · 2013
Cited alongside, same era.
Learning economic parameters from revealed preferences
Maria-Florina Balcan, Amit Daniely, Ruta Mehta, Ruth Urner, and Vijay V. Vazirani · 2014
Cited alongside, same era.
Communication efficient distributed agnostic boosting
Shang-Tse Chen, Maria-Florina Balcan, and Duen Horng Chau · 2016
Later among the works it cites.
On statistical learning through the lens of compression
Ofir David, Shay Moran, and Amir Yehudayoff · 2016
Later among the works it cites.
Sample compression schemes for VC classes
Shay Moran and Amir Yehudayoff · 2016
Later among the works it cites.
Agnostic distribution learning via compression
Hassan Ashtiani, Shai Ben-David, and Abbas Mehrabian · 2017
Closest in time.
A learning problem that is independent of the set theory ZFC axioms
Shai Ben-David, Pavel Hrubes, Shay Moran, Amir Shpilka, and Amir Yehudayoff · 2017
Closest in time.
Nearest-neighbor sample compression: Efficiency, consistency, infinite dimensions
Aryeh Kontorovich, Sivan Sabato, and Roi Weiss · 2017
Closest in time.
On learning vs. refutation
Salil P. Vadhan · 2017
Closest in time.
Pravesh K. Kothari and Roi Livni · 2018
Closest in time.