Fotis Iliopoulos

Fotis Iliopoulos
Senior Research scientist
Google Research
Email: fotisi at google dot com
Google Scholar , DBLP

General Information

I am senior research scientist at Google Research. Previously, I was a post-doctoral scholar at the Institute for Advanced Study from September 2019 to August 2020, and at the Princeton TCS group from September 2020 to August 2021. I received my Ph.D. from University of California Berkeley where I was advised by Alistair Sinclair. I am broadly interested in Theoretical Computer Science and Machine Learning. I am currently mainly focusing on algorithmic techniques for Efficient Deep Learning. I have also been working on the design and analysis of stochastic local search algorithms for finding and sampling solutions of constraint satisfaction problems, and for statistical inference.

Selected Papers

SLaM: Student-Label Mixing for Distillation with Unlabeled Examples
Proceedings of the 37th Conference on Neural Information Processing Systems (NeurIPS), 2023 [Arxiv]
Weighted Distillation with Unlabeled Examples
Proceedings of the 36th Conference on Neural Information Processing Systems (NeurIPS), 2022 [Arxiv]
Beyond the Lovasz Local Lemma: Point to Set Correlations and Their Algorithmic Applications
Proceedings of the 60th IEEE Symposium on Foundations of Computer Science (FOCS), November 2019, pp. 725-744 [Arxiv]
A Local Lemma for Focused Stochastic Algorithms
SIAM Journal on Computing, Volume 48(5):1583-602; 2019. [Local copy]
Random walks that Find Perfect Objects and the Lovasz Local Lemma
Journal of the ACM, Volume 63(3): 22:1-22:29; 2016. [Arxiv]

For the complete list and links click on the publications tab.

Dissertation

Stochastic Local Search and the Lovasz Local Lemma. August 2019, UC Berkeley

Service

I have served as reviewer for the Journal of the ACM, the SIAM Journal on Computing, Random Structures & Algorithms, ACM Transactions on Algorithms, Theoretical Computer Science, the Journal of Machine Learning Research, the IEEE Symposium on Foundations of Computer Science (FOCS), the ACM Symposium on Theory of Computing (STOC), the ACM-SIAM Symposium on Discrete Algorithms (SODA), the Conference on Neural Information Processing Systems (NeurIPS), the International Conference on Randomization and Computation (RANDOM), the International Colloquium on Automata, Language and Programming (ICALP), the IEEE International Symposium on Information Theory (ISIT).
I served in the Program Committee of RANDOM 2022.

Teaching

Teaching Assistant

CS 170 Efficient Algorithms and Intractable Problems, taught by Luca Trevisan and Prasad Raghavendra,
University of California Berkeley, Spring 2019.
CS 70 Discrete Mathematics and Probability Theory, taught by Babak Ayazifar and Satish Rao,
University of California Berkeley, Spring 2018.
CS174 Combinatorics and Discrete Probability, taught by Eric Friedman,
University of California Berkeley, Spring 2017.
Discrete Mathematics for Computer Science, taught by Dimitris Fotakis,
National Technical University of Athens, Spring 2011.

Internships

Data Science Researcher in Adobe Systems Ltc, supervised Nikos Vlassis. (Internship, Summer 2016.)
Research Assistant at CTI Diofantos, supervised by Dimitris Achlioptas. (September 2013 - August 2014.)

Awards and Honors

Onassis Foundation Fellowship (2016-2019)
for doctoral studies
Christos Papakyriakopoulos award (2014)
for excellence in mathematics in the school of ECE, NTUA.
Nikos Kritikos award (2011)
for excellence in mathematics in the school of ECE, NTUA.
Bronze Medal, SEEMOUS (2010)
Southerneastern European Mathematical Olympiad for University Students.
Silver Medal, Archimedes (2008)
Greek National Mathematical Olympiad
3rd Prize, Eucledes (2008)
68th Panhellenic Contest in Mathematics
Latsis Foundation Fellowship (2008-2013)
for undergraduate studies
Eurobank EFG Group Fellowship (2008)
for excellence in university entrance exams