Ilias Diakonikolas

I am a faculty member in the CS department at UW Madison.

Prior to joining UW, I was Andrew and Erna Viterbi Early Career Chair in Computer Science at USC, and a faculty member at the University of Edinburgh. Prior to that, I spent two years at UC Berkeley as the Simons Postdoctoral Fellow in Theoretical Computer Science. I obtained my Ph.D. in Computer Science at Columbia University, advised by Mihalis Yannakakis. I did my undergraduate studies in Greece, at the National Technical University of Athens.

Research: My main research interests are in algorithms and machine learning. A major goal of my work is to understand the tradeoff between statistical efficiency, computational efficiency, and robustness for fundamental problems in statistics and machine learning. Areas of current interest include high-dimensional robust statistics/learning, nonparametric estimation, and distribution testing. I also have strong interests in applied probability, algorithmic game theory, and their connections to machine learning.

Funding: My research has been supported by an NSF CAREER Award, an NSF AITF Award, a DARPA grant, a Sloan Research Fellowship, a Google Faculty Research Award, a Marie Curie Career Integration Grant, and an EPSRC grant.

A short professional biography can be found here.

Interested in working with me? Apply to our Ph.D. program.

University of Wisconsin-Madison
Department of Computer Sciences
1210 W. Dayton St.
Madison, WI 53706
fullname_at_gmail.com

Recent and Upcoming Activities


Expository Articles

Research Publications [chronologically][by topic]

  1. Private Testing of Distributions via Sample Permutations
    M. Aliakbarpour, I. Diakonikolas, D. Kane, R. Rubinfeld
    Advances in Neural Information Processing Systems (NeurIPS 2019)

  2. Efficient Algorithms for Multidimensional Segmented Regression
    I. Diakonikolas, J. Li, A. Voloshinov
    Manuscript, 2019

  3. Nearly Tight Bounds for Robust Proper Learning of Halfspaces with a Margin [abstract] [arxiv]
    I. Diakonikolas, D. Kane, P. Manurangsi
    Advances in Neural Information Processing Systems (NeurIPS 2019)
    Spotlight Presentation

  4. Outlier-Robust High-Dimensional Sparse Estimation via Iterative Filtering
    I. Diakonikolas, S. Karmalkar, D. Kane, E. Price, A. Stewart
    Advances in Neural Information Processing Systems (NeurIPS 2019)

  5. Distribution-Independent PAC Learning of Halfspaces with Massart Noise [abstract] [arxiv]
    I. Diakonikolas, T. Gouleakis, C. Tzamos
    Advances in Neural Information Processing Systems (NeurIPS 2019)
    Outstanding Paper Award at NeurIPS 2019

  6. Equipping Experts/Bandits with Long-term Memory [abstract] [arxiv]
    K. Zheng, H. Luo, I. Diakonikolas, L. Wang
    Advances in Neural Information Processing Systems (NeurIPS 2019)

  7. A Polynomial Time Algorithm for Log-Concave Maximum Likelihood via Locally Exponential Families [abstract] [arxiv]
    B. Axelrod, I. Diakonikolas, A. Sidiropoulos, A. Stewart, G. Valiant
    Advances in Neural Information Processing Systems (NeurIPS 2019)

  8. Faster Algorithms for High-Dimensional Robust Covariance Estimation [abstract] [arxiv]
    Y. Cheng, I. Diakonikolas, R. Ge, D. Woodruff
    Proceedings of the 32nd Annual Conference on Learning Theory (COLT 2019)

  9. Communication and Memory Efficient Testing of Discrete Distributions [abstract] [arxiv]
    I. Diakonikolas, T. Gouleakis, D. Kane, S. Rao
    Proceedings of the 32nd Annual Conference on Learning Theory (COLT 2019)

  10. Testing Identity of Multidimensional Histograms [abstract] [arxiv]
    I. Diakonikolas, D. Kane, J. Peebles
    Proceedings of the 32nd Annual Conference on Learning Theory (COLT 2019)

  11. Sever: A Robust Meta-Algorithm for Stochastic Optimization [abstract] [arxiv] [code]
    I. Diakonikolas, G. Kamath, D. Kane, J. Li, J. Steinhardt, A. Stewart
    Proceedings of the 36th International Conference on Machine Learning (ICML 2019)
    Oral Presentation at the NeurIPS 2018 Workshop on Security in Machine Learning (SECML 2018)

  12. Degree-d Chow Parameters Robustly Determine Degree-d PTFs (and Algorithmic Applications) [abstract] [eccc]
    I. Diakonikolas, D. Kane
    Proceedings of the 51st Annual ACM Symposium on Theory of Computing (STOC 2019)

  13. Learning Wasserstein distance in spaces of low intrinsic dimension
    T. Carpenter, I. Diakonikolas, A. Sidiropoulos
    Manuscript

  14. Efficient Robust Proper Learning of Log-concave Distributions [abstract] [arxiv]
    I. Diakonikolas, D. Kane, A. Stewart
    Manuscript

  15. On the Complexity of the Inverse Semivalue Problem for Weighted Voting Games [abstract] [arxiv]
    I. Diakonikolas, C. Pavlou
    Proceedings of the 33rd AAAI Conference on Artificial Intelligence (AAAI 2019)

  16. Collision-based Testers are Optimal for Uniformity and Closeness [abstract] [eccc]
    I. Diakonikolas, T. Gouleakis, J. Peebles, E. Price
    Chicago Journal of Theoretical Computer Science, 2019
    Also see Oded Goldreich's exposition of our proof here

  17. High-Dimensional Robust Mean Estimation in Nearly-Linear Time [abstract] [arxiv]
    Y. Cheng, I. Diakonikolas, R. Ge
    Proceedings of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2019)

  18. Efficient Algorithms and Lower Bounds for Robust Linear Regression [abstract] [arxiv]
    I. Diakonikolas, W. Kong, A. Stewart
    Proceedings of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2019)

  19. Fourier-based Testing for Families of Distributions [abstract] [eccc]
    C. Canonne, I. Diakonikolas, A. Stewart
    Advances in Neural Information Processing Systems (NeurIPS 2018)

  20. Sharp Bounds for Generalized Uniformity Testing [abstract] [arxiv]
    I. Diakonikolas, D. Kane, A. Stewart
    Advances in Neural Information Processing Systems (NeurIPS 2018)
    Spotlight Presentation
    See the comments in Oded Goldreich's Choices #229

  21. Robust Learning of Fixed-Structure Bayesian Networks [abstract] [arxiv]
    Y. Cheng, I. Diakonikolas, D. Kane, A. Stewart
    Advances in Neural Information Processing Systems (NeurIPS 2018)

  22. Differentially Private Identity and Closeness Testing of Discrete Distributions [abstract] [arxiv]
    M. Aliakbarpour, I. Diakonikolas, R. Rubinfeld
    Proceedings of the 35th International Conference on Machine Learning (ICML 2018)

  23. Near-Optimal Sample Complexity Bounds for Maximum Likelihood Estimation of Multivariate Log-concave Densities [abstract] [arxiv]
    T. Carpenter, I. Diakonikolas, A. Sidiropoulos, A. Stewart
    Proceedings of the 31st Annual Conference on Learning Theory (COLT 2018)

  24. Fast and Sample Near-Optimal Algorithms for Learning Multidimensional Histograms [abstract] [arxiv]
    I. Diakonikolas, J. Li, L. Schmidt
    Proceedings of the 31st Annual Conference on Learning Theory (COLT 2018)

  25. Sample-Optimal Identity Testing with High Probability [abstract] [arxiv]
    I. Diakonikolas, T. Gouleakis, J. Peebles, E. Price
    Proceedings of the 45th Intl. Colloquium on Automata, Languages and Programming (ICALP 2018)
    See the comments in Oded Goldreich's Choices #229

  26. Testing Conditional Independence of Discrete Distributions [abstract] [arxiv]
    C. Canonne, I. Diakonikolas, D. Kane, A. Stewart
    Proceedings of the 50th Annual ACM Symposium on Theory of Computing (STOC 2018)

  27. List-Decodable Robust Mean Estimation and Learning Mixtures of Spherical Gaussians [abstract] [arxiv]
    I. Diakonikolas, D. Kane, A. Stewart
    Proceedings of the 50th Annual ACM Symposium on Theory of Computing (STOC 2018)

  28. Learning Geometric Concepts with Nasty Noise [abstract] [arxiv]
    I. Diakonikolas, D. Kane, A. Stewart
    Proceedings of the 50th Annual ACM Symposium on Theory of Computing (STOC 2018)

  29. Robustly Learning a Gaussian: Getting Optimal Error, Efficiently [abstract] [arxiv]
    I. Diakonikolas, G. Kamath, D. Kane, J. Li, A. Moitra, A. Stewart
    Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2018)

  30. Communication-Efficient Distributed Learning of Discrete Distributions [abstract] [proceedings]
    I. Diakonikolas, E. Grigorescu, J. Li, A. Natarajan, K. Onak, L. Schmidt
    Advances in Neural Information Processing Systems (NIPS 2017)
    Oral Presentation

  31. Statistical Query Lower Bounds for Robust Estimation of High-dimensional Gaussians and Gaussian Mixtures [abstract] [eccc] [arxiv]
    I. Diakonikolas, D. Kane, A. Stewart
    Proceedings of the 58th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2017)
    See here and here for videos of related talks.

  32. Being Robust (in High Dimensions) Can be Practical [abstract] [arxiv] [code]
    I. Diakonikolas, G. Kamath, D. Kane, J. Li, A. Moitra, A. Stewart
    Proceedings of the 34th International Conference on Machine Learning (ICML 2017)

  33. Testing Bayesian Networks [abstract] [arxiv]
    C. Canonne, I. Diakonikolas, D. Kane, A. Stewart
    Proceedings of the 30th Annual Conference on Learning Theory (COLT 2017)

  34. Learning Multivariate Log-concave Distributions [abstract] [arxiv]
    I. Diakonikolas, D. Kane, A. Stewart
    Proceedings of the 30th Annual Conference on Learning Theory (COLT 2017)

  35. Near-optimal Closeness Testing of Discrete Histogram Distributions [abstract] [arxiv]
    I. Diakonikolas, D. Kane, V. Nikishkin
    Proceedings of the 44th Intl. Colloquium on Automata, Languages and Programming (ICALP 2017)

  36. Playing Anonymous Games using Simple Strategies [abstract] [arxiv]
    Y. Cheng, I. Diakonikolas, A. Stewart
    Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2017)

  37. Sample Optimal Density Estimation in Nearly-Linear Time [abstract] [pdf] [code]
    J. Acharya, I. Diakonikolas, J. Li, L. Schmidt
    Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2017)

  38. Robust Estimators in High Dimensions without the Computational Intractability [abstract] [arxiv]
    I. Diakonikolas, G. Kamath, D. Kane, J. Li, A. Moitra, A. Stewart
    Proceedings of the 57th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2016)
    SIAM Journal on Computing Special Issue for FOCS 2016
    Invited to Communications of the ACM, Research Highlights
    See here for my Simons Institute tutorial on the topic and here for a previous related talk.

  39. A New Approach for Testing Properties of Discrete Distributions [abstract] [pdf] [arxiv]
    I. Diakonikolas, D. Kane
    Proceedings of the 57th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2016)
    Also see the comments in Oded Goldreich's Choices #188 and #195, and Oded's very nice exposition of our framework here

  40. Fast Algorithms for Segmented Regression [abstract] [pdf] [code]
    J. Acharya, I. Diakonikolas, J. Li, L. Schmidt
    Proceedings of the 33rd International Conference on Machine Learning (ICML 2016)

  41. Properly Learning Poisson Binomial Distributions in Almost Polynomial Time [abstract] [pdf] [arxiv]
    I. Diakonikolas, D. Kane, A. Stewart
    Proceedings of the 29th Annual Conference on Learning Theory (COLT 2016)

  42. Optimal Learning via the Fourier Transform for Sums of Independent Integer Random Variables [abstract] [pdf] [arxiv] [notes]
    I. Diakonikolas, D. Kane, A. Stewart
    Proceedings of the 29th Annual Conference on Learning Theory (COLT 2016)

  43. The Fourier Transform of Poisson Multinomial Distributions and its Algorithmic Applications [abstract] [pdf] [arxiv]
    I. Diakonikolas, D. Kane, A. Stewart
    Proceedings of the 48th Annual ACM Symposium on Theory of Computing (STOC 2016)

  44. Testing Shape Restrictions of Discrete Distributions [abstract] [pdf]
    C. Canonne, I. Diakonikolas, T. Gouleakis, R. Rubinfeld
    Proceedings of the 33rd International Symposium on Theoretical Aspects of Computer Science (STACS 2016)
    Invited to Special Issue for STACS 2016

  45. Differentially Private Learning of Structured Discrete Distributions [abstract] [pdf] [code]
    I. Diakonikolas, M. Hardt, L. Schmidt
    Advances in Neural Information Processing Systems (NIPS 2015)

  46. Optimal Algorithms and Lower Bounds for Testing Closeness of Structured Distributions [abstract] [pdf]
    I. Diakonikolas, D. Kane, V. Nikishkin
    Proceedings of the 56th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2015)

  47. On the Complexity of Optimal Lottery Pricing and Randomized Mechanisms [abstract] [pdf]
    X. Chen, I. Diakonikolas, A. Orfanou, D. Paparas, X. Sun, M. Yannakakis
    Proceedings of the 56th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2015)

  48. Fast and Near-Optimal Algorithms for Approximating Distributions by Histograms [abstract] [pdf]
    J. Acharya, I. Diakonikolas, C. Hegde, J. Li, L. Schmidt
    Proceedings of the 34th Annual ACM Symposium on Principles of Database Systems (PODS 2015)

  49. Testing Identity of Structured Distributions [abstract] [pdf]
    I. Diakonikolas, D. Kane, V. Nikishkin
    Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2015)

  50. Learning from Satisfying Assignments [abstract] [pdf]
    A. De, I. Diakonikolas, R. Servedio
    Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2015)

  51. Near-Optimal Density Estimation in Near-Linear Time Using Variable-Width Histograms [abstract] [pdf]
    S. Chan, I. Diakonikolas, R. Servedio, X. Sun
    Advances in Neural Information Processing Systems (NIPS 2014)

  52. Efficient Density Estimation via Piecewise Polynomial Approximation [abstract] [pdf]
    S. Chan, I. Diakonikolas, R. Servedio, X. Sun
    Proceedings of the 46th Annual ACM Symposium on Theory of Computing (STOC 2014)

  53. Deterministic Approximate Counting for Juntas of Degree-$2$ Polynomial Threshold Functions [abstract] [pdf]
    A. De, I. Diakonikolas, R. Servedio
    Proceedings of the 29th Annual IEEE Conference on Computational Complexity (CCC 2014)

  54. The Complexity of Optimal Multidimensional Pricing [abstract] [pdf]
    X. Chen, I. Diakonikolas, D. Paparas, X. Sun, M. Yannakakis
    Games and Economic Behavior, accepted with minor revisions
    Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2014)

  55. Optimal Algorithms for Testing Closeness of Discrete Distributions [abstract] [pdf]
    S. Chan, I. Diakonikolas, G. Valiant, P. Valiant
    Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2014)
    Blog post about this work: Property Testing Review

  56. A Polynomial-time Approximation Scheme for Fault-tolerant Distributed Storage [abstract] [pdf]
    C. Daskalakis, A. De, I. Diakonikolas, A. Moitra, R. Servedio
    Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2014)
    Featured in Abstract Talk. Podcast is here

  57. Learning Sums of Independent Integer Random Variables [abstract] [pdf]
    C. Daskalakis, I. Diakonikolas, R. O'Donnell, R. Servedio, L-Y. Tan
    Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2013)
    Blog post about this work: MIT theory student blog

  58. Deterministic Approximate Counting for Degree-$2$ Polynomial Threshold Functions [abstract] [pdf]
    A. De, I. Diakonikolas, R. Servedio
    Manuscript, 2013. Available as ECCC technical report [link]

  59. A robust Khintchine Inequality and computing optimal constants in Fourier analysis and high-dimensional geometry [abstract] [pdf]
    A. De, I. Diakonikolas, R. Servedio
    SIAM Journal on Discrete Mathematics, 30-2 (2016), pp. 1058-1094
    Proceedings of the 40th Intl. Colloquium on Automata, Languages and Programming (ICALP 2013)

  60. Learning Mixtures of Structured Distributions over Discrete Domains [abstract] [pdf]
    S. Chan, I. Diakonikolas, R. Servedio, X. Sun
    Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013)

  61. Testing $k$-modal Distributions: Optimal Algorithms via Reductions [abstract] [pdf]
    C. Daskalakis, I. Diakonikolas, R. Servedio, G. Valiant, P. Valiant
    Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013)

  62. An Optimal Algorithm for the Efficient Approximation of Convex Pareto Curves
    I. Diakonikolas, M. Yannakakis
    Manuscript, 2012

  63. Efficiency-Revenue Tradeoffs in Auctions [abstract] [pdf]
    I. Diakonikolas, C.H. Papadimitriou, G. Pierrakos, Y. Singer
    Proceedings of the 39th Intl. Colloquium on Automata, Languages and Programming (ICALP 2012)

  64. The Inverse Shapley Value Problem [abstract] [pdf]
    A. De, I. Diakonikolas, R. Servedio
    Games and Economic Behavior, accepted with minor revisions
    Proceedings of the 39th Intl. Colloquium on Automata, Languages and Programming (ICALP 2012)

  65. Nearly optimal solutions for the Chow Parameters Problem and low-weight approximation of halfspaces [abstract] [pdf]
    A. De, I. Diakonikolas, V. Feldman, R. Servedio
    Journal of the ACM, 61(2), 2014. Invited to Theory of Computing special issue on Analysis of Boolean functions (declined)
    Proceedings of the 44th Annual ACM Symposium on Theory of Computing (STOC 2012)
    IBM Research 2014 Pat Goldberg Math/CS/EE Best Paper Award

  66. Learning Poisson Binomial distributions [abstract] [pdf]
    C. Daskalakis, I. Diakonikolas, R. Servedio
    Invited to Algorithmica special issue on New Theoretical Challenges in Machine Learning
    Proceedings of the 44th Annual ACM Symposium on Theory of Computing (STOC 2012)

  67. Learning $k$-modal distributions via testing [abstract] [pdf]
    C. Daskalakis, I. Diakonikolas, R. Servedio
    Theory of Computing, 10 (20), 535-570 (2014)
    Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2012)
    Oded Goldreich's Choices #72

  68. Noise Stable Halfspaces are Close to Very Small Juntas [abstract] [pdf]
    I. Diakonikolas, R. Jaiswal, R. Servedio, L.-Y.Tan, A. Wan
    Chicago Journal of Theoretical Computer Science, 2015

  69. Supervised Design Space Exploration by Compositional Approximation of Pareto sets [abstract] [pdf]
    H.-Y. Liu, I. Diakonikolas, M. Petracca, L.P. Carloni
    Proceedings of the 48th Design Automation Conference (DAC 2011)

  70. Disjoint-Path Facility Location: Theory and Practice [abstract] [pdf]
    L. Breslau, I. Diakonikolas, N. Duffield, Y.Gu, M.T. Hajiaghayi, D.S. Johnson, H. Karloff, M. Resende, S.Sen
    Proceedings of the 13th Workshop on Algorithm Engineering and Experiments (ALENEX 2011)
    Journal version in Operations Research, 2019 [arxiv]

  71. Hardness Results for Agnostically Learning Low-Degree Polynomial Threshold Functions [abstract] [pdf]
    I. Diakonikolas, R. O'Donnell, R. Servedio, Y.Wu
    Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011)

  72. Bounded Independence Fools Degree-$2$ Threshold Functions [abstract] [pdf]
    I. Diakonikolas, D. Kane, J. Nelson
    Proceedings of the 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS 2010)

  73. Average Sensitivity and Noise Sensitivity of Polynomial Threshold Functions [abstract] [pdf]
    I. Diakonikolas, P. Raghavendra, R. Servedio, L.-Y. Tan
    SIAM Journal on Computing, 43(1), 231-253 (2014)
    Proceedings of the 42nd Annual ACM Symposium on Theory of Computing (STOC 2010) (Conference version merged with this paper by Harsha, Klivans and Meka)

  74. A Regularity Lemma, and Low-weight Approximators, for low-degree Polynomial Threshold Functions [abstract] [pdf]
    I. Diakonikolas, R. Servedio, L.-Y. Tan, A. Wan
    Theory of Computing, 10(2), 27-53 (2014)
    Proceedings of the 25th Annual IEEE Conference on Computational Complexity (CCC 2010)

  75. How Good is the Chord Algorithm? [abstract] [pdf]
    C. Daskalakis, I. Diakonikolas, M. Yannakakis
    SIAM Journal on Computing, 45(3), pp. 811-858, 2016
    Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010)

  76. Bounded Independence Fools Halfspaces [abstract] [pdf]
    I. Diakonikolas, P. Gopalan, R. Jaiswal, R. Servedio, E. Viola
    SIAM Journal on Computing, 39(8), 3441-3462 (2010)
    Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2009)

  77. Improved Approximation of Linear Threshold Functions [abstract] [pdf]
    I. Diakonikolas, R. Servedio
    Computational Complexity, 22(3), 623-677 (2013)
    Proceedings of the 24th Annual IEEE Conference on Computational Complexity (CCC 2009)

  78. Efficiently Testing Sparse $GF(2)$ Polynomials [abstract] [pdf]
    I. Diakonikolas, H. Lee, K. Matulef, R. Servedio, A. Wan
    Algorithmica, 61(3), 580-605 (2011)
    Proceedings of the 35th Intl. Colloquium on Automata, Languages and Programming (ICALP 2008)

  79. Succinct Approximate Convex Pareto Curves [abstract] [pdf]
    I. Diakonikolas, M. Yannakakis
    Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2008)

  80. Testing for Concise Representations [abstract] [pdf]
    I. Diakonikolas, H. Lee, K. Matulef, K. Onak, R. Rubinfeld, R. Servedio, A. Wan
    Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007)
    Oded Goldreich's Choices #39

  81. Small Approximate Pareto Sets for Biobjective Shortest Paths and Other Problems [abstract] [pdf]
    I. Diakonikolas, M. Yannakakis
    SIAM Journal on Computing, 39(4), 1340-1371 (2009)
    Proceedings of the 10th Intl. Workshop on Approximation, Randomization, and Combinatorial Optimization (APPROX 2007)
    Honorable Mention, George Nicholson student paper competition INFORMS society, 2009

Thesis


Professional Activities

Recent Teaching

Advising

  • PhD students: Nikos Zarifis (August 2019 - present), Anastasia Voloshinov (September 2017 - present), Chrystalla Pavlou (October 2015 - present), Vladimir Nikishkin (graduated 2016)
  • Postdocs: Alistair Stewart (September 2014 - January 2018), Themis Gouleakis (August 2018 - May 2019), Ali Vakilian (starting August 2019)
  • MSc students: Paul Carter (2014), Evgeniya Sotirova (2014), Michael Zhang (2015)