Fanny Yang is an Assistant Professor in the Computer Science Department at ETH Zurich . She previously held postdoctoral positions at Stanford University and a Junior Fellowship at the Institute for Theoretical Studies at ETH Zurich, advised by Nicolai Meinshausen . Her PhD was completed at the EECS Department of UC Berkeley , supervised by Martin Wainwright . Research Interests : Theoretical foundations of machine learning and statistics , particularly focusing on overparameterized models and high-dimensional data . Developing trustworthy ML models with emphasis on distributional robustness , domain generalization , and interpretability . Applications in medical diagnostics and treatment effect analysis , aiming to address reliability issues in real-world domains. Recent Work Trends : 2025 Articles : Theoretical analysis of semi-supervised multi-objective learning , test-time scaling with verifiers, and foundation models for efficient randomized experiments . 2024 Articles : Studies on robust mixture learning , privacy-preserving data synthesis via optimal transport , confounding quantification in causal inference , and semi-private learning frameworks. 2023 Articles : Investigations into active vs. passive learning in high dimensions, inductive bias in noisy interpolation , and semi-supervised novelty detection using model ensembles .
Dr. Daniel J. Hsu is a Professor of Computer Science at Columbia University, affiliated with the Foundations of Data Science Center and TRIPODS Institute. His research focuses on algorithmic statistics, machine learning theory, and their applications in public health informatics. He has advised numerous students and postdocs, and his work bridges foundational theory with practical systems like foodborne illness detection via social media analysis. Key roles: Associate Editor (ACM Transactions on Algorithms), Program Chair (ICML 2025, COLT 2019) Research areas: Foundations of Data Science, Machine Learning Theory, Fairness, and High-dimensional Statistics His work on detecting foodborne illnesses using Yelp reviews has been deployed by NYC Health departments. Recent contributions include advancements in transformer architectures, group fairness algorithms, and multi-group learning frameworks. Scientific awards include the Sloan Fellowship and multiple NSF grants. He has pioneered interactive machine teaching methods and developed algorithms for robust parameter estimation in high-dimensional settings.
Sham Kakade is the Rampell Family Professor of Computer Science and Professor of Statistics at Harvard University, co-director of the Kempner Institute. His research focuses on advancing artificial general intelligence through foundational work in reinforcement learning, large-scale learning systems, and autonomous agent architectures. He earned his PhD in 2003 from the Gatsby Computational Neuroscience Unit at University College London. His work emphasizes scalable optimization algorithms, distributed systems for foundation models, and understanding emergent capabilities in neural architectures. Research interests include full-stack training pipelines for foundation models, mathematical principles of large-scale learning systems, and bridging language models with embodied intelligence. He advises prospective students with backgrounds in applied deep learning or theoretical computer science, offering access to the Kempner Institute's computational resources. He serves on committees for the ACM Prize in Computing and Sloan Research Fellowships, co-organizes the Simons Symposium on Theoretical Machine Learning, and chaired COLT 2011. His lab works at the intersection of theory and practice, addressing challenges in AI's societal impact and technical scalability. Labs/Teams: Co-directs the Kempner Institute, fostering collaborations between AI researchers and social scientists. Active in Harvard's SEAS community.
Daniel Dominic Kaplan Sleator is a Professor of Computer Science at Carnegie Mellon University's School of Computer Science. He maintains an office in the Gates-Hillman Center (7205 Gates-Hillman) and teaches various courses in algorithms and theoretical computer science. Professor Sleator's research spans several areas of theoretical computer science and algorithms. His primary interests include: Algorithms and Data Structures Amortized Analysis and Competitive Analysis Persistent and Self-Adjusting Data Structures Computational Geometry and Combinatorial Optimization Combinatorial Game Theory and Mathematical Games Music Analysis using Computational Methods His extensive publication record shows a consistent focus on efficient data structures and algorithms. Over the years, his work has evolved from foundational data structures like splay trees and skew heaps to applications in diverse areas such as music analysis and combinatorial games. A notable trend in his work is the development of self-adjusting data structures that achieve excellent amortized performance without maintaining explicit structural constraints. His papers on splay trees, skew heaps, and persistent data structures have become classics in the field. Professor Sleator has made significant contributions across multiple domains of computer science. His work on competitive algorithms for paging and list update problems has been particularly influential, establishing fundamental results in online algorithms. His research extends beyond traditional computer science into interdisciplinary areas like computational music theory, demonstrating the broad applicability of algorithmic thinking. He teaches a variety of courses including Algorithms 15-451/651, Competition Programming 15-295, and specialized topics like mathematical games.
Professor Richard Samworth is a leading academic at the University of Cambridge , affiliated with the Department of Pure Mathematics and Mathematical Statistics and serving as Director of the Statistical Laboratory . His research focuses on Nonparametric and High-dimensional Statistics , addressing challenges in data analysis, statistical learning, and computational methods. Research Interests : Richard Samworth's work emphasizes Nonparametric Statistics , High-dimensional Data , and Statistical Learning . His research spans topics such as Missing Data , Changepoint Detection , Log-concave Density Estimation , and Subgroup Analysis , with applications in Machine Learning and Data Science . Key methodologies include Score Matching , Random Projections , and Minimax Estimation . Recent publications highlight advancements in Semi-Supervised Learning , Robust Statistical Testing , and High-dimensional PCA with heterogeneous missingness. His work bridges theoretical rigor with practical applications, particularly in Statistical Algorithms and Optimization .
Jelani Nelson is a Professor and Department Chair in the UC Berkeley EECS Department (College of Engineering). His work focuses on theoretical computer science , particularly algorithms , data streams , dimensionality reduction , and privacy-preserving computation . Advising : Current students include Ishaq Aden-Ali, Xin Lyu, Mihir Singhal, and Hongxun Wu (co-advised with leading researchers). Education : PhD from MIT (George M. Sprowls Award), M.Eng from MIT. Research Highlights : Developed foundational results in Johnson-Lindenstrauss dimensionality reduction (optimality, sparse embeddings). Advancements in differential privacy (lower bounds, private mean estimation, threshold learning). Pioneering work on streaming algorithms for heavy hitters, norm estimation, and graph problems. Innovations in compressed sensing and oblivious subspace embeddings . Scientific Awards : PODS Best Paper Award (2011, 2022) IBM Pat Goldberg Memorial Best Paper Award (2011) George M. Sprowls Award for MIT doctoral thesis (2009) NeurIPS 2020 Spotlight Presentation
Andrew Childs is a Professor at the University of Maryland, affiliated with the Department of Computer Science and the Institute for Advanced Computer Studies (UMIACS). He serves as Director of the NSF Quantum Leap Challenge Institute for Robust Quantum Simulation (RQS) and is a Fellow at the Joint Center for Quantum Information and Computer Science (QuICS). His research focuses on quantum algorithms for simulating physical systems, algebraic problems, and quantum walk protocols, with applications in quantum computing and computational complexity. University of Maryland Institute for Advanced Computer Studies (UMIACS) Joint Center for Quantum Information and Computer Science (QuICS) NSF Quantum Leap Challenge Institute for Robust Quantum Simulation Childs' research spans quantum simulation, quantum Fourier transform, phase estimation, and Hamiltonian dynamics. He has developed techniques to reduce quantum computational resources for simulating quantum systems and explored limitations of quantum computers through hidden subgroup problems and non-unitary dynamics. His publications cover diverse areas including quantum walk optimization, Hamiltonian simulation methods, and applications to cryptography and condensed matter physics. Recent works address spatial search algorithms, product formulas for commutators, and quantum routing protocols. As an educator, Childs has taught courses on quantum algorithms and information processing at both the University of Maryland and University of Waterloo, with lecture notes and materials spanning multiple years. Contact: amchilds@umd.edu | Office: ATL 3359 | Affiliated with University of Maryland's quantum research institutes.
John Duchi is an Associate Professor at Stanford University, holding positions in the Department of Statistics and the Department of Electrical Engineering (with a courtesy appointment in Computer Science). He is affiliated with the School of Engineering. His research focuses on statistical learning, optimization, information theory, and computation, with an emphasis on balancing computational efficiency, privacy, and robustness. Key interests include developing algorithms for large-scale optimization, privacy-preserving techniques, and tools for evaluating machine learning systems' validity. Education: BS and MS in Computer Science (Stanford University, 2007–2008), MA in Statistics (UC Berkeley, 2012), and PhD in EECS (UC Berkeley, 2014). Research Interests: His work addresses three core areas: (1) optimizing trade-offs between computational resources and statistical performance, (2) creating scalable optimization methods, and (3) quantifying confidence in machine learning systems. Recent publications highlight contributions to privacy in federated learning, robust statistical validation, and uncertainty quantification. Articles: His recent work explores topics like distribution-free M-estimation, private federated learning, and instance-optimal mechanisms for statistical estimation. These studies emphasize privacy, robustness, and scalable solutions for modern data challenges. Advising & Grants: While no advisees are listed, his research has been supported by grants focused on optimization, privacy, and statistical theory.
Jordi Galí is a Professor at the Department of Economics and Business at Universitat Pompeu Fabra (UPF), a Senior Researcher at the Center for Research in International Economics (CREI), and a Research Professor at the Barcelona School of Economics (BSE). He holds a PhD from MIT and has played a central role in shaping modern macroeconomic theory, particularly the New Keynesian framework used by central banks worldwide. Education: PhD in Economics, Massachusetts Institute of Technology (MIT), 1989 Master in International Management, ESADE, 1985 Bachelor in Economics, Universitat Pompeu Fabra, 1994 His research focuses on macroeconomic theory, monetary economics, and macroeconometrics. He is best known for his work on the New Keynesian Phillips Curve, optimal monetary policy rules, and the role of technology and expectations in business cycles. His influential book, Monetary Policy, Inflation and the Business Cycle , is a standard reference in graduate programs globally. The most recent articles highlight a continued focus on critical issues in modern macroeconomics: the implications of a low natural rate of interest (r*), the effectiveness of monetary policy at the zero lower bound, the role of wage and price flexibility, and the interaction between fiscal and monetary policy. His work increasingly integrates heterogeneity, financial frictions, and experimental methods, reflecting the evolving frontiers of the field. Scientific Awards: BBVA Foundation Frontiers of Knowledge Award (2025) Yrjo Jahnsson Award (2005) Premi Rei Jaume I d'Economia (2004) Premio Nacional de Investigación “Pascual Madoz” (2022) Three ERC Advanced Grants Foreign Honorary Member, American Economic Association (2020) Galí has advised numerous central banks, including the ECB, Federal Reserve, and Banque de France. He has held leadership roles as President of the European Economic Association (2012), co-editor of the Journal of the European Economic Association , and co-director of the CEPR International Macroeconomics Programme. He is a Research Fellow at CEPR, a Research Associate at NBER, and a Fellow of the Econometric Society. He has also been actively involved in public policy debates in Spain and Europe, particularly on issues of productivity, labor market reform, and fiscal policy. His research program continues to explore the design of stabilization policies in open and currency union economies.
Daniel M. Kane is a Professor at the University of California, San Diego (UCSD), holding a joint appointment in the Department of Mathematics and the Department of Computer Science and Engineering (CSE). His research spans mathematics and theoretical computer science, with a focus on number theory, combinatorics, complexity theory, and computational statistics. He earned a Ph.D. in Mathematics from Harvard University (2011) and dual BS degrees in Mathematics with Computer Science and Physics from MIT (2007). Prior to UCSD, he was a postdoctoral researcher at Stanford University (2011–2014) on an NSF fellowship. His research interests include robust statistics, machine learning, polynomial threshold functions, and algorithmic methods for high-dimensional data. Notable achievements include co-authoring the book Algorithmic High-Dimensional Robust Statistics (Cambridge University Press, 2023) and receiving the Best Paper Award at the Conference on Computational Complexity (2013), as well as gold medals at the International Mathematical Olympiad (2002 and 2003). Current teaching includes courses such as Math 96 (Putnam Seminar), Math 154 (Graph Theory), CSE 101 (Algorithms), and CSE 203A (Randomized Algorithms). He has consulted for companies like CASPER Labs and AIble, and his work extends to cryptographic protocols, including quantum money schemes based on quaternion algebras. Key contributions include breakthroughs in robust mean estimation, list-decodable learning, and the development of efficient algorithms for statistical problems. His research often bridges foundational theory with practical applications in machine learning and data analysis.
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.
Daniel Grier is an Assistant Professor jointly appointed in the Computer Science and Engineering and Mathematics departments at the University of California, San Diego (UCSD). His research focuses on quantum complexity theory , particularly exploring near-term quantum computing paradigms and proving quantum advantage over classical systems. He holds a Ph.D. from MIT and was previously a postdoctoral fellow at the University of Waterloo’s Institute for Quantum Computing. Education: Ph.D. in Computer Science, MIT B.S. in Computer Science and Mathematics, University of South Carolina Research Interests: Grier’s work bridges theoretical computer science and quantum computing, emphasizing algorithm design, complexity class separations, and foundational questions about quantum supremacy. He studies how low-depth quantum circuits, boson sampling, and other near-term technologies can achieve computational tasks classically deemed intractable. Recent Article Trends: His publications explore efficient quantum state learning (e.g., classical shadows), hardness results for quantum sampling problems (e.g., bipartite Gaussian boson sampling), and circuit lower bounds (e.g., depth-2 QAC circuits). These contributions highlight his focus on rigorously defining quantum computational advantages. Awards: None explicitly listed in the text. Advising & Grants: Advises at least one student, Jackson Morris. His research is supported by grants exploring quantum complexity and algorithm design. Teaches advanced courses on quantum complexity theory, computability, discrete mathematics, and quantum computing fundamentals. Labs/Teams: Maintains an active lab focused on quantum complexity theory, collaborating with colleagues on topics like interactive protocols and shallow quantum circuits.
Jonathan A. Kelner is a Professor of Applied Mathematics in the Department of Mathematics at the Massachusetts Institute of Technology (MIT) and a member of the MIT Computer Science and Artificial Intelligence Laboratory (CSAIL). His research focuses on applying techniques from pure mathematics to solve fundamental problems in algorithms and complexity theory, with the goal of developing practical algorithms for real-world questions. Dr. Kelner received his undergraduate degree from Harvard University and his Ph.D. in Computer Science from MIT in 2006. Before joining the MIT faculty, he spent a year as a member of the Institute for Advanced Study. His educational background has provided a strong foundation for his interdisciplinary research spanning mathematics and computer science. His research interests include combinatorial optimization, mathematical programming, spectral graph theory, distributed computing, machine learning, computational geometry and topology, computational biology, signal processing, and random matrix theory. Kelner's work demonstrates how deep theoretical insights can lead to practical algorithmic improvements, particularly in graph algorithms and optimization problems. His approach often involves connecting seemingly disparate areas of mathematics to create novel algorithmic techniques. Analysis of his recent publications reveals a strong focus on spectral graph theory, optimization algorithms, and the Sum-of-Squares method. His work frequently addresses fundamental questions in theoretical computer science with practical implications for algorithm design. A notable trend in his research is the development of nearly-linear-time algorithms for various graph problems, which represents significant improvements over previous approaches. NSF CAREER Award Alfred P. Sloan Research Fellowship NEC Award for Research in Computers and Communication Sprowls Doctoral Dissertation Award Best Student Paper Award at STOC 2004 Best Paper Award at STOC 2011 Kokusai Denshin Denwa Junior Faculty Chair 2008 Harold E. Edgerton Faculty Achievement Award 2011 School of Science Award for Excellence in Undergraduate Education 2012 Professor Kelner has been actively involved in mentoring students and has received recognition for his teaching excellence, including the School of Science Award for Excellence in Undergraduate Education in 2012. His research has been supported by prestigious grants including the NSF CAREER Award. He has collaborated extensively with researchers across multiple institutions, often working with other leading figures in theoretical computer science to produce groundbreaking results in algorithm design. At MIT, Kelner is part of both the Mathematics Department and CSAIL, positioning him at the intersection of theoretical mathematics and practical computer science. This dual affiliation reflects the interdisciplinary nature of his work, which bridges pure mathematical theory with concrete algorithmic applications.
Dimitrios P. Tsomocos is a Professor of Financial Economics at Saïd Business School and a Fellow in Management at St Edmund Hall, University of Oxford. He holds a BA, MA, MPhil, and PhD from Yale University and previously worked at the Bank of England. He serves on editorial boards including Annals of Finance and Economic Theory, and is a Senior Research Associate at the Financial Markets Group at the London School of Economics. His educational background includes: University of Oxford: M.A. by resolution, 2002 Yale University: Ph.D. in economics, 1996 Yale University: M.Phil. in economics, 1992 Yale University: M.A. in economics, 1990 Yale University: B.A. in economics, 1989 Professor Tsomocos is a mathematical economist specializing in Central Banking, Banking and regulation, Incomplete asset markets, Systemic risk, Financial instability, and Issues of new financial architecture. His research focuses on contagion, financial fragility, interbank linkages, and the impact of the Basel Accord using General Equilibrium models with incomplete asset markets, money, and endogenous default. He is working toward designing a new paradigm of monetary policy, financial stability analysis, and macroprudential regulation. His recent publications show a consistent focus on financial stability, banking regulation, and the interaction between monetary policy and financial stability. The research spans theoretical modeling of bankruptcy and default in general equilibrium frameworks, practical applications to bank regulation, analysis of commodity cycles in emerging economies, and policy responses to crises like the COVID-19 pandemic. His work frequently employs quantitative methods and general equilibrium modeling to address pressing issues in financial economics. His scientific achievements include: 2004 Bank Sabatell prize for the best work on the economics of banking (for "Book vs. Fair Value Accounting in Banking and Intertemporal Smoothing") Co-development of the Goodhart-Tsomocos model of financial fragility (2003) Testimony to House of Lords for the Economic and Financial Affairs and International Trade Sub Committee's report (2011) Appointment to Research Advisory Board, Central Bank of Russian Federation (2018) Professor Tsomocos has advised numerous PhD students and collaborated extensively with central banks worldwide. He has served as an economic advisor to a major political party in Greece and regularly provides commentary on the Greek economy. His research has had substantial policy impact, with the Goodhart-Tsomocos model implemented by more than ten central banks including the Bank of Bulgaria, Bank of Colombia, Bank of England, and Bank of Korea. He continues to collaborate with researchers from the ECB, Central Bank of the Russian Federation, and Bank of Chile on updated versions of his financial fragility model. He co-developed the Goodhart-Tsomocos model of financial fragility while working at the Bank of England, which has been implemented at various central banks globally. His research group at Oxford continues to refine this model and apply it to contemporary financial stability challenges.
Anand V Natarajan is the ITT Career Development Professor in Computer Technology and Assistant Professor in the Department of Electrical Engineering and Computer Science (EECS) at MIT, with affiliation to the Computer Science and Artificial Intelligence Laboratory (CSAIL). He holds a PhD in Physics from MIT (2018), advised by Aram Harrow, and previously served as a postdoc at Caltech's Institute for Quantum Information and Matter. His research focuses on theoretical quantum information, emphasizing quantum complexity theory (e.g., MIP* and QMA(2) classes), nonlocality (Bell inequalities, nonlocal games), and semidefinite programming hierarchies. He teaches courses such as Quantum Cryptography, Quantum Systems Engineering, and Introduction to Algorithms at MIT. Notable contributions include resolving the MIP* = RE problem and the FOCS 2019 Best Paper Award for NEEXP ⊆ MIP*. He advises PhD students in quantum computing topics and collaborates extensively on quantum verification protocols and entanglement testing.
