Royal Holloway, University of LondonUnited Kingdom
Grégoire Ithier is a Senior Lecturer in Physics at the Department of Physics, Royal Holloway, University of London. His research focuses on quantum engineering, decoherence, thermalization, mesoscopic physics, and random matrix theory. He leads the 'TypDyn' project exploring typical dynamics of embedded quantum systems, and co-leads the Leverhulme Trust-funded 'Generation and detection of quantum signals' initiative. His work bridges theoretical and experimental domains, including superconducting circuits and cryogenic microwave engineering. Ithier's research tools include advanced numerical methods (e.g., exact diagonalization) and statistical techniques (e.g., random matrix theory). Key Projects: TypDyn: Studies typical dynamics in embedded quantum systems (2015–present) QSimFP: Quantum simulators for fundamental physics (2020–2024) A new statistical theory of disordered quantum systems (2020–2024) His experimental work involves superconducting qubits, Josephson devices, and nano-superfluidic cavities. Grants include STFC and Leverhulme Trust funding. Recent publications address quantum thermalization, many-body systems, and random Hamiltonian analysis.
Murat Erdogdu is an Assistant Professor at the University of Toronto, jointly appointed in the Department of Computer Science and Department of Statistical Sciences . He is also a faculty member at the Vector Institute and holds the CIFAR Chair in Artificial Intelligence . PhD in Statistics, Stanford University (advised by Mohsen Bayati and Andrea Montanari) MSc in Computer Science, Stanford University BSc in Electrical Engineering and Mathematics, Bogazici University His research focuses on machine learning theory , high-dimensional statistics , and optimization . He has contributed to understanding gradient-based algorithms, sampling methods, and feature learning in structured data. Recent publications address problems in: Heavy-tailed sampling Mean-field Langevin dynamics Robust feature learning Minimax regression Stochastic optimization under infinite noise Scientific Awards: CIFAR Chair in Artificial Intelligence ICLR 2023 Spotlight NeurIPS 2019 & 2021 Spotlights He teaches graduate courses like STA 414/2104 (Statistical Methods for Machine Learning II) and STA 4273 (Modern Learning Theory) , emphasizing probabilistic modeling and theoretical analysis.
Afonso S. Bandeira is a Professor in the Department of Mathematics (D-MATH) at ETH Zurich, where he conducts research at the intersection of mathematics, statistics, and computer science. He maintains strong affiliations with several interdisciplinary research centers including the Institute For Operations Research (IFOR), the Max Planck ETH Center for Learning Systems, the ETH Foundations of Data Science, and the ETH AI Center, with a courtesy appointment at D-ITET. Bandeira actively teaches courses including Mathematics of Signals, Networks, and Learning, and Mathematics of Data Science. His research focuses on High Dimensional Probability, Random Matrices, Mathematical Statistics, Theoretical Computer Science, Combinatorics, and Mathematical Optimization. Bandeira's work often explores the theoretical foundations of data science, examining phase transitions in statistical problems, computational barriers, and the geometry of high-dimensional spaces. He maintains a research group blog called Randomstrasse101 that emphasizes open problems in his field. Analysis of his recent publications reveals a strong focus on matrix and tensor concentration inequalities, synchronization problems, nonconvex optimization landscapes, and computational-statistical tradeoffs in high-dimensional inference. His work bridges theoretical mathematics with practical applications in machine learning and data analysis, particularly examining where computational limitations arise in statistical problems. Bandeira actively mentors students and researchers, currently supervising several doctoral candidates including Daniil Dmitriev, Konstantin Donhauser, Anastasia Kireeva, Kevin Lucca, Chiara Meroni, Gil Kur, Petar Nizic-Nikolac, and Almut Roedder. He emphasizes that students working with him should participate in the DACO seminar and group meetings, and encourages prospective students to have completed his Mathematics of Signals, Networks, and Learning or Mathematics of Data Science courses. He leads a research group focused on the mathematics of data science, with regular group meetings and seminars. Bandeira has developed comprehensive lecture notes including 'A Tour Through the Mathematics of Signals, Learning, and Networks' (2025) and 'Mathematics of Machine Learning' (2021), and previously authored 'Ten Lectures and Forty-Two Open Problems in the Mathematics of Data Science' (2015).
Massachusetts Institute of TechnologyUnited States
Ali Vakilian is a Research Assistant Professor at the Toyota Technological Institute at Chicago (TTIC), with a strong academic background in theoretical computer science and algorithms. He will join the Department of Computer Science at Virginia Tech as an Assistant Professor in Fall 2025. His research bridges algorithmic theory and machine learning, focusing on scalable, fair, and efficient algorithms for massive data. Education: Ph.D. in EECS, Massachusetts Institute of Technology (MIT), advisors: Erik Demaine and Piotr Indyk M.S. in Computer Science, University of Illinois at Urbana-Champaign (UIUC), advisor: Chandra Chekuri B.S. in Computer Engineering, Sharif University of Technology Research Interests: Ali Vakilian's work centers on the algorithmic foundations of machine learning and data science. He develops streaming, sketching, and sublinear-time algorithms for massive datasets, and pioneers learning-augmented algorithms that use machine learning predictions to improve performance while maintaining worst-case guarantees. His research in trustworthy ML includes algorithmic fairness, fair clustering, and learning with strategic agents. He also contributes to combinatorial optimization and approximation algorithms for network design, set cover, and low-rank approximation. His recent publications (2023–2025) show a consistent focus on fair clustering (individual and group fairness), streaming graph algorithms , learning-augmented methods , and frequency estimation . These works appear in top venues such as NeurIPS, ICML, SODA, and ICALP, often with recognitions like oral or spotlight presentations. Scientific Awards: Outstanding Student Paper Highlight Award, AISTATS 2024 Notable-top-25% paper, ICLR 2023 Oral presentation, AISTATS 2024 Spotlight presentation, NeurIPS 2023 Advising and Grants: Ali Vakilian mentors several students and interns, including summer interns at TTIC and Fatima Fellows. His research is supported by the National Science Foundation (TRIPODS program), as noted in the press coverage of his work on LearnedSketch. He actively contributes to the academic community through advising, organizing workshops (e.g., Algorithms with Predictions, Learning-Augmented Algorithms), and serving on program committees (e.g., NeurIPS, ICML, AISTATS). Labs and Teams: He is affiliated with the theory and algorithms group at TTIC and collaborates with researchers at MIT, UIUC, and other institutions. His work on learning-augmented algorithms has led to influential workshops and collaborations with leading figures such as Piotr Indyk and Erik Demaine.
Massachusetts Institute of TechnologyUnited States
Aram Harrow is a Professor of Physics at the Massachusetts Institute of Technology (MIT) , affiliated with the MIT Center for Theoretical Physics and MIT Center for Quantum Engineering . He focuses on quantum information science and quantum algorithms , with additional interests in representation theory and optimization . His recent work explores quantum computing applications in chemical physics and statistical mechanics . Undergraduate and graduate degrees in Physics at MIT Faculty positions: MIT (2013-present), University of Washington (2010-12), University of Bristol (2005-10) Research Interests: His work bridges quantum information theory and many-body physics , including: Quantum algorithm design for chemistry and optimization Quantum circuit complexity and t-designs Entanglement dynamics in quantum systems Quantum-classical hybrid computing models Key Publications: Recent articles demonstrate quantum speedups for biomolecular free energy calculations , Hamiltonian simulation , and jet clustering algorithms . His research combines quantum complexity theory with practical implementations on near-term quantum devices. Scientific Awards: 2023 Simons Investigator 2018 APS Bennett Award 2017 IEEE Best Paper Award 2016 Kavli Frontiers Fellow Mentorship: He advises current PhD students Shankar Balasubramanian , Angus Lowe , and Norah Tan , with 12 former advisees including Anand Natarajan and Saeed Mehraban . His 2026 recruitment seeks one new graduate student.
Shirshendu Ganguly is an Associate Professor in the Department of Statistics at the University of California, Berkeley. His research focuses on probability theory, statistical physics, and their applications, including percolation models, phase transitions, Markov chains, and random graphs. He holds a PhD in Mathematics from the University of Washington and has held postdoctoral positions at UC Berkeley. Ganguly has been recognized with the 2019 Sloan Research Fellowship. Education: PhD in Mathematics, University of Washington, 2011–2016 Miller Postdoctoral Fellow, UC Berkeley, 2016–2018 Research Interests: Probability Theory, Statistical Mechanics, Markov Chains, Random Graphs, Percolation Theory, Sparse Combinatorial Structures His work explores geometric and probabilistic phenomena in disordered systems, including polymer models, self-organized criticality, and random matrix theory. He has advised multiple PhD students and contributes to teaching advanced probability courses at Berkeley. Awards: 2019 Sloan Research Fellowship
Prof. Dr. Frank Pollmann is a Full Professor (W3) at the Department of Physics PH-I, Technical University of Munich (TUM), leading the Chair of Theoretical Solid-State Physics since 2022. His research focuses on condensed matter theory and quantum information concepts , particularly in systems of correlated electrons and quantum many-body dynamics . PhD: Max Planck Institute for the Physics of Complex Systems / TU Ilmenau (2006) Postdoc: UC Berkeley (2008-2010) Group Leader: MPIPKS Dresden (2011-2016) Associate Professor: TUM (2017-2022) His work spans topological phases , frustrated spin systems , and non-equilibrium quantum dynamics , utilizing tensor network methods and quantum information theory to study phenomena like many-body localization and Hilbert space fragmentation . His publications demonstrate trends in quantum scar states , Kardar-Parisi-Zhang hydrodynamics , and quantum transport anomalies . Scientific Awards : ERC Consolidator Grant (2017) Walter Schottky Prize (2015) Otto-Hahn Medal (2007) He teaches courses including Advanced Methods in Quantum Many-Body Theory , Solid State Theory , and Topology in Condensed Matter , while leading the Pollmann Group under the TUM School of Natural Sciences.
Raphael Hauser is an Associate Professor in Numerical Mathematics at the University of Oxford's Mathematical Institute, Director of Graduate Studies - Teaching, and Tanaka Fellow in Applied Mathematics at Pembroke College. His affiliations include membership in the Data Science, Numerical Analysis, and Mathematical and Computational Finance research groups, as well as a fellowship at the Alan Turing Institute. Education: PhD in Operations Research, Cornell University, Ithaca, USA Dipl. Math. ETH, Swiss Federal Institute of Technology (ETH Zurich), Switzerland Research interests span data science, numerical optimisation, medical imaging, distributed computing, and applied probability/statistics. His work integrates mathematical rigor with practical applications, particularly in optimization algorithms, machine learning theory, and medical imaging technology. Publications focus on optimization theory, stochastic processes, medical imaging systems, and computational finance, with recurring themes in non-convex optimization guarantees, PCA variants, and X-ray tomography innovations. Awards: Oxford University Teaching Award (2007) SIAM Optimization Prize (2005) SIAM Student Paper Prize (2000) Advising includes 15+ DPhil students and 40+ MSc students, with projects in optimization, finance, imaging, and machine learning. Current postdocs and students are affiliated with the Alan Turing Institute and industrial partners like Siemens and Macquarie Group. He leads teams in the Mathematical Institute's research groups and collaborates with the Alan Turing Institute on large-scale data science initiatives.
Daniel A. Spielman is a Sterling Professor of Computer Science, Statistics & Data Science, and Mathematics at Yale University. He serves as the inaugural James A. Attwood Director of the Institute for Foundations of Data Science (FDS) and was previously co-Director of the Yale Institute for Network Science (YINS). He is also a member of TILOS, the NSF Institute for Learning-Enabled Optimization at Scale. His research interests span Spectral Graph Theory, Algebraic Graph Theory, Laplacian Matrices, Expander Graphs, and Random Walks on Graphs. Spielman has made fundamental contributions to understanding the mathematical foundations of data science, including work on smoothed analysis of algorithms, spectral sparsification, and solutions to the Kadison-Singer problem. Spielman's publications demonstrate a consistent focus on developing efficient algorithms with strong theoretical foundations. His work bridges pure mathematics, theoretical computer science, and practical applications in network analysis and machine learning. His research has evolved from foundational work on smoothed analysis to recent contributions in experimental design using discrepancy theory. His scientific honors include: Nevanlinna Prize for contributions to mathematical aspects of computer science Two Gödel Prizes (2008 and 2015) for outstanding papers in theoretical computer science MacArthur Fellowship ('Genius Grant') Simons Investigator award Membership in the National Academy of Sciences and American Academy of Arts and Sciences Spielman has advised numerous PhD students who have gone on to prominent positions in academia and industry. His teaching includes advanced courses in Spectral Graph Theory and Computation and Optimization. He has developed important software packages like Laplacians.jl for solving Laplacian linear equations and related problems.
Asaf Ferber is Associate Professor in Mathematics at University of California, Irvine, School of Physical Sciences. His research spans discrete mathematics including combinatorial games, random graphs, extremal hypergraph theory, and quantum computation. Research explores Hamiltonian cycles in random graphs, structural properties of pseudorandom graphs, and quantum algorithms for combinatorial problems. Recent work develops quantum approaches to graph learning and sparse recovery in random matrices. Awards: NSF CAREER Award Sloan Fellowship Distinguished Early Career Faculty Award for Research Air Force Research Grant NSF-BSF Grant Organizes conferences including SoCalDM Symposium and Desert Discrete Math Workshop, mentoring graduate students through UCI's Probability and Combinatorics Seminar.
Yiping Lu is an Assistant Professor in the Department of Industrial Engineering and Management Sciences at Northwestern University's McCormick School of Engineering. His research focuses on developing interdisciplinary approaches combining domain knowledge (differential equations, stochastic processes), machine learning, and experiments. Key interests include scientific machine learning (AI4Science), stochastic simulation, and robust machine learning. Education: Ph.D. in Applied and Computational Mathematics, Stanford University (2023) B.S. in Computational Mathematics, Peking University (2019) Research Highlights: Hybrid research integrating ML with scientific domains like PDEs and inverse problems Development of Physics-Informed Learning frameworks Contributions to deep learning theory (ResNets, neural collapse) Advances in kernel operator learning and adversarial robustness Awards: CPAL Rising Star Award (2024) University of Chicago Data Science Rising Star (2022) Stanford Interdisciplinary Graduate Fellowship (2021) Labs/Teams: SCALE Lab (Scientific Computation and Learning at Northwestern) Collaborations with NYU's Courant Institute and Stanford
Song Mei is an Assistant Professor in the Department of Statistics and Department of Electrical Engineering and Computer Sciences at the University of California, Berkeley. She received her Ph.D. from Stanford University in 2020 under Andrea Montanari and maintains active research collaborations with institutions including Amazon (as a 2023 Amazon Research Award recipient) and OpenAI (where she is currently on leave). Her research spans the intersection of statistics, machine learning, information theory, and computer science, with particular emphasis on foundational theories for modern AI systems. Key interests include language models, diffusion models, quantum algorithms, and high-dimensional statistics, often leveraging insights from statistical physics literature. Analysis of her recent publications reveals a strong focus on theoretical underpinnings of generative AI, with significant contributions to understanding contrastive pre-training (CLIP), attention mechanisms in LLMs, and mathematical foundations of diffusion models. Her work demonstrates consistent interdisciplinary connections between statistical theory and practical AI development. Sloan Research Fellowship (2025) Noether Early Career Scholar Award (2025) Google Research Scholar Award (2024) Amazon Research Award (2024) She actively advises graduate students through MA programs and has secured significant research grants including Amazon Research Awards. Her work with AGI Labs at Amazon demonstrates applied impact of theoretical research. Current projects focus on mechanistic interpretability of large language models and mathematical frameworks for generative AI. Professor Mei leads research on the statistical principles behind frontier AI models, with particular focus on developing rigorous theoretical frameworks for understanding emergent behaviors in large-scale systems.
Heping Zhang is the Susan Dwight Bliss Professor of Biostatistics at the Yale School of Public Health , with secondary appointments in the Child Study Center , Department of Statistics and Data Science , and Department of Obstetrics, Gynecology, and Reproductive Sciences . He directs the Collaborative Center for Statistics in Science (C²S²) and leads the Reproductive Medicine Network data coordinating center. Education: PhD in Statistics, Stanford University (1991) Postdoctoral Fellow, Mathematical Science Research Institute (1991) Research Focus : Zhang specializes in biostatistical methodology for genomic data analysis , clinical trials , and reproductive medicine . His work bridges genetics , mental health , and maternal-child health through innovative statistical approaches. Awards : 2023 Web of Science Highly Cited Researcher 2023 International Chinese Statistical Association Distinguished Achievement Award 2022 Institute of Mathematical Statistics Neyman Award and Lecture 2011 Royan Institute International Research Award 2011 Institute of Mathematical Statistics Medallion Award 2008 Harvard School of Public Health Myrto Lefokopoulou Distinguished Lecturer Professional Roles : He served as President of the International Chinese Statistical Association (2019) and Former Editor of the Journal of the American Statistical Association - Applications and Case Studies . His lab develops open-source software tools like ABESS , STREE , and modSaRa for genomic and clinical data analysis.
Jon Keating is a Professor at the University of Oxford affiliated with the Mathematical Institute . His research spans Mathematical Physics , Number Theory , and Stochastic Analysis , with a focus on Random Matrix Theory and its applications to quantum systems and number theory. Research Trends: His recent work explores connections between random matrices and number-theoretic functions, with contributions to understanding moments of L-functions, characteristic polynomials, and quantum chaos. Key themes include asymptotic analysis, recursive structures, and interdisciplinary applications in nonlinear systems. Publications: Highlights include studies on CUE characteristic polynomials, the Ratios Conjecture, and collaborations in Nonlinearity , International Mathematics Research Notices , and Transactions of the American Mathematical Society .
Weierstrass Institute for Applied Analysis and StochasticsGermany
Vladimir Spokoiny is a Professor at the Departments of Mathematics and Economics of the Humboldt University of Berlin and Head of the Research Group "Stochastic Algorithms and Nonparametric Statistics" at the Weierstrass Institute for Applied Analysis and Stochastics (WIAS) in Berlin, Germany. His research spans multiple areas of statistics, machine learning, and financial mathematics, with significant contributions to nonparametric statistics, high-dimensional data analysis, and statistical methods in finance. Spokoiny received his M.Sc. in applied mathematics from the Moscow Institute of Railway Engineering in 1981 and his Ph.D. in mathematics from Lomonosov Moscow State University in 1988. He completed his Habilitation at Humboldt University in 1996. His academic career includes positions at the All-Union Institute of Railway Transport in Moscow, the Institute for Information Transmission Problems in Moscow, and the Institute for Applied Analysis and Statistics in Berlin before joining the Weierstrass Institute and Humboldt University where he has been a professor since 2002. Spokoiny's research focuses on adaptive nonparametric smoothing and hypothesis testing, high dimensional data analysis, statistical methods in finance, image analysis with applications to medicine, classification, and nonlinear time series. His work often addresses the challenges of nonstationarity in time series data and develops innovative methods for volatility estimation and risk management. He has made significant contributions to the development of adaptive weights smoothing procedures, which have applications in image processing, community detection, and manifold learning. His recent work has expanded into high-dimensional statistics, Bayesian inference, and optimization methods for machine learning, with publications demonstrating novel approaches to Gaussian approximation, Laplace methods, and statistical inference in non-Euclidean spaces. Spokoiny has supervised numerous PhD students including Oliver Reiss, Danilo Mercurio, Ying Chen, Elmar Diederichs, and Mstislav Elagin, whose research has focused on mathematical finance, time series analysis, and statistical methods. He serves as an Associate Editor for The Annals of Statistics (since 2004) and Statistics and Decisions (since 2002), and has previously served on the editorial board of the Journal of Statistical Planning and Inference. His professional activities include reviewing for major statistical journals including Annals of Statistics, Bernoulli, Econometrica, and Journal of American Statistical Association, as well as reviewing grant proposals for the National Science Foundation (USA), German Research Foundation, and Netherlands Organisation for Scientific Research. Spokoiny is a member of several professional societies including the International Statistical Institute, American Statistical Association, Institute of Mathematical Statistics, and Bernoulli Society. He is fluent in Russian (mother tongue), English, and German, and has good knowledge of French. His research group at WIAS focuses on developing novel statistical methodologies with applications across various scientific domains, particularly emphasizing adaptivity and robustness in complex data environments. The group's work has significant implications for financial risk management, medical imaging, and machine learning applications, with recent publications addressing fundamental questions in high-dimensional statistics and nonparametric inference.
