Dimitris Papailiopoulos

Publications
Influence

XORing Elephants: Novel Erasure Codes for Big Data

M. Sathiamoorthy, Megasthenis Asteris, +4 authors Dhruba Borthakur
Computer Science, Mathematics
Proc. VLDB Endow.
16 January 2013

We present a novel family of erasure codes that are efficiently repairable and offer higher reliability compared to Reed-Solomon codes. Expand

Speeding Up Distributed Machine Learning Using Codes

Kangwook Lee, Maximilian Lam, Ramtin Pedarsani, Dimitris Papailiopoulos, K. Ramchandran
Computer Science, Mathematics
IEEE Transactions on Information Theory
8 December 2015

Codes are widely used in many engineering applications to offer <italic>robustness</italic>. Expand

Perturbed Iterate Analysis for Asynchronous Stochastic Optimization

Horia Mania, Xinghao Pan, Dimitris Papailiopoulos, B. Recht, K. Ramchandran, Michael I. Jordan
Mathematics, Computer Science
SIAM J. Optim.
24 July 2015

We introduce and analyze stochastic optimization methods where the input to each gradient update is perturbed by bounded noise, that are simpler than earlier analyses, remove many assumptions of previous models. Expand

Locality and Availability in Distributed Storage

A. Rawat, Dimitris Papailiopoulos, A. Dimakis, S. Vishwanath
Computer Science, Mathematics
IEEE Transactions on Information Theory
9 February 2014

This paper studies the problem of information symbol availability in codes: we refer to a systematic code as code with (r, t)-availability if every information (systematic) symbol can be reconstructed from t disjoint groups of other code symbols. Expand

Interference Alignment as a Rank Constrained Rank Minimization

Dimitris Papailiopoulos, A. Dimakis
Mathematics, Computer Science
IEEE Transactions on Signal Processing
4 October 2010

We show that the maximization of the sum degrees-of-freedom for the static flat-fading multiple-input multiple-output (MIMO) interference channel (IC) is equivalent to a rank constrained rank minimization problem when the signal subspaces span all available dimensions. Expand

Locally Repairable Codes

Dimitris Papailiopoulos, A. Dimakis
Mathematics, Computer Science
IEEE Transactions on Information Theory
17 June 2012

In this paper, we explore the repair metric of locality, which corresponds to the number of disk accesses required during a single node repair. Expand

Speeding up distributed machine learning using codes

Kangwook Lee, Maximilian Lam, Ramtin Pedarsani, Dimitris Papailiopoulos, K. Ramchandran
Computer Science
ISIT
10 July 2016

We view distributed machine learning algorithms through a coding-theoretic lens, and show how codes can equip them with robustness against this system noise. Expand

Locally Repairable Codes

Dimitris Papailiopoulos, A. Dimakis
Computer Science
IEEE Trans. Inf. Theory
19 May 2014

We explore the repair metric of locality, which corresponds to the number of disk accesses required during a single node repair. Expand

Repair optimal erasure codes through hadamard designs

Dimitris Papailiopoulos, A. Dimakis, V. Cadambe
Mathematics, Computer Science
49th Annual Allerton Conference on Communication…
8 June 2011

We use Hadamard matrices to construct the first explicit 2-parity MDS storage code with optimal repair properties for all single node failures, including the parity nodes. Expand

DRACO: Byzantine-resilient Distributed Training via Redundant Gradients

Lingjiao Chen, H. Wang, Zachary B. Charles, Dimitris Papailiopoulos
Computer Science, Mathematics
ICML
27 March 2018

We present DRACO, a general distributed training framework that is robust against adversarial nodes and worst-case compute errors. Expand

Recommended Authors