Dimitris Papailiopoulos

Assistant Professor @ University of Wisconsin-Madison
Electrical and Computer Engineering
Computer Sciences (by courtesy)

I am an assistant professor of Electrical and Computer Engineering and Computer Sciences (by courtesy) at the University of Wisconsin-Madison, a faculty fellow at the Grainger Institute, and a faculty affiliate with the Optimization group at the Wisconsin Institute for Discovery.

My research lies in the intersection of machine learning, coding theory, and distributed systems. I am particularly interested in the theory and practice of large-scale machine learning and the challenges that arise once we aim to build solutions that come with robustness and scalability guarantees.

Before coming to Madison, I spent two wonderful years as a postdoc at UC Berkeley, where I was a member of the AMPLab and BLISS, and had the pleasure to collaborate with Ben Recht and Kannan Ramchandran. I received my Ph.D. in 2014 from UT Austin, where I was fortunate to be advised by Alex Dimakis. Before UT, I spent 3.5 years as a grad student at USC. Before all that, I received my M.Sc. (2009) and ECE Diploma (2007) from the Technical University of Crete (TUC), located in the beautiful city of Chania.

In 2018, I co-founded the conference on Machine Learning & Systems (MLSys), a new conference that targets research at the intersection of systems and machine learning. In 2018 and 2020, I was the program co-chair for MLSys. In 2019, I also co-chaired the 3rd Midwest Machine Learning Symposium (MMLS).

My research has been supported by an NSF CAREER Award, a Sony Faculty Innovation Award, an AFRL Center of Excellence grant (MADLab), an ARPA-E Award, and AWS Cloud Credits for Research.


gScholar
bio, resume
twitter

Publications

2020

  • Federated Learning with Matched Averaging
    H. Wang, M. Yurochkin, Y. Sun, D. Papailiopoulos, Y. Khazaeni
    ICLR 2020 (oral).

2019

  • DETOX: A Redundancy-based Framework for Faster and More Robust Gradient Aggregation
    S. Rajput, H. Wang, Z. Charles, D. Papailiopoulos
    NeurIPS 2019. [arxiv]
  • Does Data Augmentation Lead to Positive Margin?
    S. Rajput, Z. Feng, Z. Charles, P.-L. Loh, D. Papailiopoulos
    ICML 2019. [arxiv]
  • Bad Global Minima Exist and SGD Can Reach Them
    S. Liu, D. Papailiopoulos, D. Achlioptas
    ICML 2019, Deep Phenomena Workshop (oral). [arxiv]
  • A Geometric Perspective on the Transferability of Adversarial Directions
    Z. Charles, H. Rosenberg, D. Papailiopoulos
    AISTATS 2019. [arxiv]

2018

  • ATOMO: Communication-efficient Learning via Atomic Sparsification
    H. Wang, S. Sievert, S. Liu, Z. Charles, S. Wright, D. Papailiopoulos
    NeurIPS 2018. [arxiv]
  • The Effect of Network Width on the Performance of Large-batch Training
    L. Chen, H. Wang, J. Zhao, P. Koutris, D. Papailiopoulos
    NeurIPS 2018. [arxiv]
  • DRACO: Byzantine-resilient Distributed Training via Redundant Gradients
    L. Chen, H. Wang, Z. Charles, D. Papailiopoulos
    ICML 2018. [arxiv]
  • Stability and Generalization of Learning Algorithms that Converge to Global Optima
    Z. Charles, D. Papailiopoulos
    ICML 2018. [arxiv]
  • Gradient Coding Using the Stochastic Block Model
    Z. Charles, D. Papailiopoulos
    ISIT 2018. [arxiv]
  • Gradient Diversity: a Key Ingredient for Scalable Distributed Learning
    D. Yin, A. Pananjady, M. Lam, D. Papailiopoulos, K. Ramchandran, P. Bartlett
    AISTATS 2018. [arxiv]

2017

  • Gradient Diversity: a Key Ingredient for Scalable Distributed Learning
    D. Yin, A. Pananjady, M. Lam, D. Papailiopoulos, K. Ramchandran, P. Bartlett
    NIPS 2017, OPT Workshop (oral). [arxiv]
  • UberShuffle: Communication-efficient Data Shuffling for SGD via Coding Theory
    J. Chung, K. Lee, R. Pedarsani, D. Papailiopoulos, K. Ramchandran
    NIPS 2017, ML Systems Workshop [pdf]
  • Perturbed Iterate Analysis for Asynchronous Stochastic Optimization
    H. Mania, X. Pan, D. Papailiopoulos, B. Recht, K. Ramchandran, M. I. Jordan
    SIAM Journal on Optimization. [arxiv]
  • Speeding-up Distributed Machine Learning Using Codes
    K. Lee, M. Lam, R. Pedarsani, D. Papailiopoulos, K. Ramchandran
    IEEE Transactions on Information Theory. [arxiv]
  • Coded Computation for Multicore Setups
    K. Lee, R. Pedarsani, D. Papailiopoulos, K. Ramchandran
    ISIT 2017. [pdf]

2016

  • CYCLADES: Conflict-free Asynchronous Machine Learning
    X. Pan, M. Lam, S. Tu, D. Papailiopoulos, C. Zhang, M. I. Jordan, K. Ramchandran, C. Re, B. Recht
    NIPS 2016. [arxiv]
  • Speeding-up Distributed Machine Learning Using Codes
    K. Lee, M. Lam, R. Pedarsani, D. Papailiopoulos, K. Ramchandran
    ISIT 2016. [arxiv]
  • On the Worst-Case Approximability of Sparse PCA
    S. O. Chan, D. Papailiopoulos, A. Rubinstein
    COLT 2016. [arxiv]
  • Bipartite Correlation Clustering - Maximizing Agreements
    M. Asteris, A. Kyrillidis, D. Papailiopoulos, A. G. Dimakis
    AISTATS 2016. [arxiv]
  • Locality and Availability in Distributed Storage
    A.S. Rawat, D. Papailiopoulos, A.G. Dimakis, and S. Vishwanath,
    IEEE Transactions on Information Theory. [preprint]
  • Optimal Locally Repairable Codes and Connections to Matroid Theory
    I. Tamo, D. Papailiopoulos, and A. G. Dimakis
    IEEE Trans. on Information Theory. [preprint]

2015

  • Perturbed Iterate Analysis for Asynchronous Stochastic Optimization
    H. Mania, X. Pan, D. Papailiopoulos, B. Recht, K. Ramchandran, M. I. Jordan
    NIPS 2015, OPT Workshop (oral). [long version]
  • Speeding-up Distributed Machine Learning Using Codes
    K. Lee, M. Lam, R. Pedarsani, Dimitris Papailiopoulos, Kannan Ramchandran
    NIPS 2015, ML-Systems Workshop. [arxiv]
  • Parallel Correlation Clustering on Big Graphs
    X. Pan, D. Papailiopoulos, S. Oymak, B. Recht, K. Ramchandran, M. I. Jordan
    NIPS 2015. [long version]
  • Sparse PCA via Bipartite Matchings
    M. Asteris, D. Papailiopoulos, A. Kyrillidis, A. G. Dimakis
    NIPS 2015. [long version]
  • Orthogonal NMF through Subspace Exploration
    M. Asteris, D. Papailiopoulos, A. G. Dimakis
    NIPS 2015. [long version]

2014

  • Provable Deterministic Leverage Score Sampling
    D. Papailiopoulos, A. Kyrillidis, C. Boutsidis
    KDD 2014. [long version]
  • Finding Dense Subgraphs via Low-Rank Bilinear Optimization
    D. Papailiopoulos, I. Mitlagkas, A. G. Dimakis, and C. Caramanis
    ICML 2014. [short version], [slides], recorded ICML'14 talk given by Yannis.
  • Nonnegative Sparse PCA with Provable Guarantees
    M. Asteris, D. Papailiopoulos, and A. G. Dimakis,
    ICML 2014. [long version], [slides], recorded ICML'14 talk given by Megas.
  • Locality and Availability in Distributed Storage
    A. S. Rawat, D. Papailiopoulos, A. G. Dimakis, and S. Vishwanath
    ISIT 2014. [long version]
  • Locally Repairable Codes
    D. Papailiopoulos and A. G. Dimakis
    IEEE Transactions on Information Theory, September 2014. [IEEEXplore], [arXiv]
  • A Repair Framework for Scalar MDS Codes
    K. Shanmugam, D. Papailiopoulos, A. G. Dimakis, and G. Caire
    IEEE Journal on Selected Areas in Communications, May 2014. [IEEEXplore], [arXiv]
  • The Sparse Principal Component of a Constant-rank Matrix
    M. Asteris, D. Papailiopoulos, and G. N. Karystinos
    IEEE Transactions on Information Theory, March 2014. [IEEEXplore], [arXiv]. MATLAB implementation by Megas.

2013

  • Sparse PCA through Low-rank Approximations
    D. Papailiopoulos, A. G. Dimakis, and S. Korokythakis
  • Optimal Locally Repairable Codes and Connections to Matroid Theory
    I. Tamo, D. Papailiopoulos, and A. G. Dimakis
    ISIT 2013. [IEEEXplore], [arXiv]
  • XORing Elephants: Novel Erasure Codes for Big Data
    M. Sathiamoorthy, M. Asteris, D. Papailiopoulos, A.G. Dimakis, R. Vadali, S. Chen, and D. Borthakur
  • Repair Optimal Erasure Codes through Hadamard Designs
    D. Papailiopoulos, A. G. Dimakis, and V. R. Cadambe,
    IEEE Transactions on Information Theory, May 2013. [IEEEXplore], [arXiv]
  • Maximum-Likelihood Noncoherent PAM Detection
    D. Papailiopoulos, G. A.-Elkheir, G. N. Karystinos,
    IEEE Transactions on Communications, March 2013. [IEEEXplore], [draft]

2012

  • A Repair Framework for Scalar MDS Codes
    K. Shanmugam, D. Papailiopoulos, A. G. Dimakis, and G. Caire
    Allerton 2012. [IEEEXplore], [arXiv]
  • Locally Repairable Codes
    D. Papailiopoulos and A. G. Dimakis
  • Feedback in the K-user Interference channel
    D. Papailiopoulos, Changho Suh, Alexandros G. Dimakis
  • Simple Regenerating Codes: Network Coding for Cloud Storage
    D. Papailiopoulos, Jianqiang Luo, Alexandros G. Dimakis, Cheng Huang, and Jin Li
    INFOCOM 2012 (Miniconference). [IEEEXplore], [arXiv], [slides]
  • Maximum-likelihood Blind PAM Detection
    D. Papailiopoulos, G. A.-Elkheir, G. N. Karystinos
    ICC 2012. [IEEEXplore], [long]
  • Interference Alignment as a Rank Constrained Rank Minimization
    D. Papailiopoulos and A. G. Dimakis,
    IEEE Transactions on Signal Processing, August 2012. [IEEEXplore], [arXiv] MATLAB Implementation

2011

  • Repair Optimal Erasure Codes through Hadamard Designs
    D. Papailiopoulos, A. G. Dimakis, and V. R. Cadambe
    Allerton 2011. [IEEEXplore], [long], [slides]
  • Distributed Storage Codes through Hadamard Designs
    D. Papailiopoulos and A. G. Dimakis
  • Sparse Principal Component of a Rank-deficient Matrix
    M. Asteris, D. Papailiopoulos, G. N. Karystinos
  • Repairing Erasure Codes
    D. Papailiopoulos and A. G. Dimakis
    USENIX FAST 2011, Work-In-Progress (WiP). [short abstract]

2010

  • Distributed Storage Codes Meet Multiple-Access Wiretap Channels
    D. Papailiopoulos and A. G. Dimakis
    Allerton 2010. [IEEEXplore], [long], [slides]
  • MCMC Methods for Integer Least-Squares Problems
    B. Hassibi, A. G. Dimakis, and D. Papailiopoulos
    Allerton 2010. [IEEEXplore], [draft]
  • Interference Alignment as a Rank Constrained Rank Minimization
    D. Papailiopoulos and A. G. Dimakis
    GLOBECOM 2010. [IEEEXplore], [long], [slides], [MATLAB]
  • Maximum-likelihood Noncoherent OSTBC Detection with Polynomial Complexity
    D. Papailiopoulos and G. N. Karystinos,
    IEEE Transactions on Wireless Communications, June 2010. [IEEEXplore], [draft]

2007-2009

  • Optimal OSTBC Sequence Detection over Unknown Correlated Fading Channels
    D. Papailiopoulos and G. N. Karystinos
    Asilomar 2009. [IEEEXplore], [draft]
  • Efficient maximum-likelihood noncoherent orthogonal STBC detection
    D. Papailiopoulos and G. N. Karystinos
    Allerton 2008. [IEEEXplore], [draft], [slides]
  • Polynomial-complexity maximum-likelihood block noncoherent MPSK detection
    D. Papailiopoulos and G. N. Karystinos
    ICASSP 2008. [IEEEXplore], [draft]
  • Near ML detection of nonlinearly distorted OFDM signals
    D. Papailiopoulos and G. N. Karystinos
    Asilomar 2007. [IEEEXplore], [draft], [slides]

Research Group

I am very grateful to work with and learn from the following amazing colleagues

Ph.D.

M.Sc.

Alumni

Contact

Address
1415 Engineering Drive, Engineering Hall,
University of Wisconsin-Madison
Madison, WI 53706