“Exploring the limits of efficient computation.”

一、个人简介

Dimitrios Myrisiotis is an Assistant Professor at the School of ComputingInformation Technology, Great Bay University. His research is in theoretical computer science, focusing on computational complexity theorythe foundations of machine learning. He holds a PhD from Imperial College London (2021), an MSc from the University of Athens,a BEng-MEng from NTUA. He was previously a postdoctoral fellow at NUSCNRS@CREATE in Singapore.

二、学术/研究成果综述

His work spans circuitformula lower bounds (notably for MCSPDe Morgan formulas), the complexity of estimating statistical distances between probability distributions, the learnability of structured graphical models such as Bayes netsIsing models,provably efficient reinforcement learning for linear MDPs. Results have appeared at ICLR, ICML, AAAI, IJCAI, CCC, FSTTCS, STACS,ICALP.

三、（代表）论文/著作

[1] Bhattacharyya A, Gayen S, Meel K S, Myrisiotis D, Pavan A, Vinodchandran N V. Computational explorations of total variation distance. In: The Thirteenth International Conference on Learning Representations (ICLR 2025), Singapore, 2025. (Spotlight; top 5.1% of submitted papers.)

[2] Bhattacharyya A, Gayen S, Meel K S, Myrisiotis D, Pavan A, Vinodchandran N V. Total variation distance for product distributions is #P-complete. Information Processing Letters, 2025, 189: 106560.

[3] Bhattacharyya A, Choo D, Gayen S, Myrisiotis D. Learnability of parameter-bounded Bayes nets. In: Proceedings of the 39th AAAI Conference on Artificial Intelligence (AAAI 2025), Philadelphia, PA, USA, 2025: 15559–15566.

[4] Bhattacharyya A, Gayen S, Meel K S, Myrisiotis D, Pavan A, Vinodchandran N V. Total variation distance meets probabilistic inference. In: Proceedings of the 41st International Conference on Machine Learning (ICML 2024), Vienna, Austria, 2024.

[5] Cheraghchi M, Hirahara S, Myrisiotis D, Yoshida Y. One-tape Turing machinebranching program lower bounds for MCSP. Theory of Computing Systems, 2024, 68(4): 868–899.

[6] Bhattacharyya A, Gayen S, Meel K S, Myrisiotis D, Pavan A, Vinodchandran N V. On approximating total variation distance. In: Proceedings of the 32nd International Joint Conference on Artificial Intelligence (IJCAI 2023), Macao, China, 2023: 3479–3487.

[7] Allender E, Cheraghchi M, Myrisiotis D, Tirumala H, Volkovich I. One-way functionsa conditional variant of MKTP. In: Proceedings of the 41st IARCS Annual Conference on Foundations of Software TechnologyTheoretical Computer Science (FSTTCS 2021), LIPIcs, vol. 213, 2021: 7:1–7:19.

[8] Kabanets V, Koroth S, Lu Z, Myrisiotis D, Oliveira I C. Algorithmslower bounds for De Morgan formulas of low-communication leaf gates. ACM Transactions on Computation Theory, 2021, 13(4): 23:1–23:37.

[9] Cheraghchi M, Kabanets V, Lu Z, Myrisiotis D. Circuit lower bounds for MCSP from local pseudorandom generators. ACM Transactions on Computation Theory, 2020, 12(3): 21:1–21:27.

[10] John P G, Bhattacharyya A, Maniu S, Myrisiotis D, Wu Z. Efficient, low-regret, online reinforcement learning for linear MDPs. CoRR, abs/2411.10906, 2024.

四、联系方式

Email: dimyrisiotis@gbu.edu.cn; dimyrisiotis@gmail.com.

Personal website: https://dimyrisiotis.github.io.

DBLP: https://dblp.org/pid/176/6922.html.

Google Scholar: BvR0TM8AAAAJ.

ORCiD: 0000-0001-9585-1227.

五、其他信息

Research Visits: Laboratoire d’Informatique de Grenoble, Université Grenoble Alpes, France (2024); Department of EECS, University of Michigan, Ann Arbor, USA (2020, 2021, 2022); Causality Program, Simons Institute for the Theory of Computing, UC Berkeley, USA (2022); Department of Computer Science, Rutgers University, USA (2020); National Institute of Informatics (NII), Tokyo, Japan (2019); School of Computing Science, Simon Fraser University, Canada (2018).

AwardsDistinctions: ICLR 2025 Spotlight Paper (top 5.1% of submitted papers, 2025); Student Academic Choice Awards (SACA) Nominee, Department of Computing, Imperial College London (2018); Highest GPA among the graduates of the MPLA MSc program, University of Athens (2016).

Teaching Experience: Graduate Teaching Assistant at the Department of Computing, Imperial College London, for the courses: Discrete Mathematics (CO142, Autumn 2019Autumn 2020); Complexity (CO438, Autumn 2019Autumn 2020); Algorithms II (CO202, Autumn 2018); GraphsAlgorithms (CO150, Spring 2018); Quantum Computing (CO484, Autumn 2017).

Community Service: Program Committee Member of UAI 2021; Co-organizer of the NUS School of Computing Algo-Theory Seminar (2022–2024); Reviewer for FOCS, STOC, SODA, ICALP, CCC, STACS, ISAAC, ICLR, NeurIPS, ISIT, BioRob, CSR, the SIAM Journal on Computing, Theory of Computing,ACM Transactions on Probabilistic Machine Learning.