activity
20182020
most citedFetchSGD: Communication-Efficient Federated Learning with Sketching

65 citations · 109 across the 6 of their papers we have counts for

collaborators

6 papers

cs.LG2020★ 65 cited

FetchSGD: Communication-Efficient Federated Learning with Sketching

Daniel Rothchild, Ashwinee Panda, Enayat Ullah +5

Existing approaches to federated learning suffer from a communication bottleneck as well as convergence issues due to sparse client participation. In this paper we introduce a nove…

cs.DC2019★ 4 cited

Harmonia: Near-Linear Scalability for Replicated Storage with In-Network Conflict Detection

Hang Zhu, Zhihao Bai, Jialin Li +4

Distributed storage employs replication to mask failures and improve availability. However, these systems typically exhibit a hard tradeoff between consistency and performance. Ens…

cs.LG2019★ 16 cited

Communication-efficient distributed SGD with Sketching

Nikita Ivkin, Daniel Rothchild, Enayat Ullah +3

Large-scale distributed training of neural networks is often limited by network bandwidth, wherein the communication time overwhelms the local computation time. Motivated by the su…

cs.NI2019★ 5 cited

Neural Packet Classification

Eric Liang, Hang Zhu, Xin Jin +1

Packet classification is a fundamental problem in computer networking. This problem exposes a hard tradeoff between the computation and state complexity, which makes it particularl…

cs.DC2019★ 19 cited

DistCache: Provable Load Balancing for Large-Scale Storage Systems with Distributed Caching

Zaoxing Liu, Zhihao Bai, Zhenming Liu +5

Load balancing is critical for distributed storage to meet strict service-level objectives (SLOs). It has been shown that a fast cache can guarantee load balancing for a clustered…

cs.DC2018

NetChain: Scale-Free Sub-RTT Coordination (Extended Version)

Xin Jin, Xiaozhou Li, Haoyu Zhang +5

Coordination services are a fundamental building block of modern cloud systems, providing critical functionalities like configuration management and distributed locking. The major…