Dimitris Papailiopoulos

Dimitris Papailiopoulos
Assistant Professor
330 North Orchard Street
Madison WI 53715
Room 4235A
dimitris@ece.wisc.edu
http://papail.io/

Years at WID

2016 - present

About

Before coming to Madison, Dimitris spent two wonderful years as a postdoc at UC Berkeley. At Berkeley, he was a member of the AMPLab and BLISS, and he worked on several fun projects with Kannan Ramchandran and Ben Recht. He received his Ph.D. in 2014 from UT Austin, where he was advised by Alex Dimakis. Before UT, he spent 3.5 years as a grad student at USC. Before all that, he received his M.Sc. and ECE Diploma from the Technical University of Crete, located in the beautiful city of Chania.

Education

Ph.D., Electrical and Computer Engineering, University of Texas at Austin 

Research Description

Dimitris research interests lie in the intersection of machine learning, coding theory, distributed and parallel systems. His current focus is on coordination-avoiding algorithms for large-scale machine learning, and on using erasure codes to speed up distributed computation. 

Affiliations

Grainger Institute of Engineering

Selected Publications

  • 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.
  • Speeding-up Distributed Machine Learning Using Codes
    K. Lee, M. Lam, R. Pedarsani, D. Papailiopoulos, K. Ramchandran
    ISIT 2016.
  • On the Worst-Case Approximability of Sparse PCA
    S. O. Chan, D. Papailiopoulos, A. Rubinstein
    COLT 2016.
  • Perturbed Iterate Analysis for Asynchronous Stochastic Optimization
    H. Mania, X. Pan, D. Papailiopoulos, B. Recht, K. Ramchandran, M. I. Jordan
    NIPS 2015, OPT Workshop.
  • Parallel Correlation Clustering on Big Graphs
    X. Pan, D. Papailiopoulos, S. Oymak, B. Recht, K. Ramchandran, M. I. Jordan
    NIPS 2015.
  • Sparse PCA via Bipartite Matchings
    M. Asteris, D. Papailiopoulos, A. Kyrillidis, A. G. Dimakis
    NIPS 2015.
  • Finding Dense Subgraphs via Low-Rank Bilinear Optimization
    D. Papailiopoulos, I. Mitlagkas, A. G. Dimakis, and C. Caramanis
    ICML 2014.
  • Locally Repairable Codes
    D. Papailiopoulos and A. G. Dimakis
    IEEE Transactions on Information Theory, September 2014.