Publications (18)
Relaxed Schedulers Can Efficiently Parallelize Iterative Algorithms
Dan Alistarh, Trevor Brown, Justin Kopinsky +1
Byzantine Stochastic Gradient Descent
Dan Alistarh, Zeyuan Allen-Zhu, Jerry Li
The LevelArray: A Fast, Practical Long-Lived Renaming Algorithm
Dan Alistarh, Justin Kopinsky, Alexander Matveev +1
Distributed Learning over Unreliable Networks
Chen Yu, Hanlin Tang, Cedric Renggli +5
The ZipML Framework for Training Models with End-to-End Low Precision: The Cans, the Cannots, and a Little Bit of Deep Learning
Hantian Zhang, Jerry Li, Kaan Kara +3
The Power of Choice in Priority Scheduling
Dan Alistarh, Justin Kopinsky, Jerry Li +1
Inherent Limitations of Hybrid Transactional Memory
Dan Alistarh, Justin Kopinsky, Petr Kuznetsov +2
Model compression via distillation and quantization
Antonio Polino, Razvan Pascanu, Dan Alistarh
The Convergence of Sparsified Gradient Methods
Dan Alistarh, Torsten Hoefler, Mikael Johansson +3
Space-Optimal Majority in Population Protocols
Dan Alistarh, James Aspnes, Rati Gelashvili
Are Lock-Free Concurrent Algorithms Practically Wait-Free?
Dan Alistarh, Keren Censor-Hillel, Nir Shavit
Polylogarithmic-Time Leader Election in Population Protocols Using Polylogarithmic States
Dan Alistarh, Rati Gelashvili
The Transactional Conflict Problem
Dan Alistarh, Syed Kamran Haider, Raphael Kübler +1
DataBright: Towards a Global Exchange for Decentralized Data Ownership and Trusted Computation
David Dao, Dan Alistarh, Claudiu Musat +1
The Convergence of Stochastic Gradient Descent in Asynchronous Shared Memory
Dan Alistarh, Christopher De Sa, Nikola Konstantinov
QSGD: Communication-Efficient SGD via Gradient Quantization and Encoding
Dan Alistarh, Demjan Grubic, Jerry Li +2
Time-Space Trade-offs in Population Protocols
Dan Alistarh, James Aspnes, David Eisenstat +2
How to Elect a Leader Faster than a Tournament
Dan Alistarh, Rati Gelashvili, Adrian Vladu