Osman Yağan is a Research Professor in the Department of Electrical and Computer Engineering at Carnegie Mellon University (CMU), with affiliate faculty status in the School of Computer Science. He is also a core member of CyLab Security and Privacy Institute. Prior to joining CMU in 2013, he was a Postdoctoral Research Fellow at CyLab. He holds a Ph.D. in Electrical and Computer Engineering from the University of Maryland (2011) and a B.S. from Middle East Technical University (2007). His research focuses on modeling, analysis, and optimization of computing systems, leveraging applied probability, network science, data science, and machine learning. Key areas include multi-armed bandits, resilient machine learning, contagion processes in networks, and cybersecurity. Research Interests include Machine Learning, Data Science, Network Science, Cybersecurity, and Robustness in Cyber-Physical Systems. He has advised numerous students, including current PhD candidates Yurun Tian, Orkun İrsoy, and Ishank Juneja, as well as notable alumni such as Mansi Sood (now at MIT) and Jun Zhao (Assistant Professor at Nanyang Technological University). Key Awards include the CIT Dean's Early Career Fellowship, IBM Academic Award, and Best Paper Awards at ICC 2021, IPSN 2022, and ASONAM 2023. His work spans theoretical contributions (e.g., contagion models in multi-layer networks) and applied research (e.g., mitigating cascading failures in power systems). He leads or co-leads grants from ONR, NSF, and ARO, focusing on resilient machine learning, network robustness, and pandemic modeling.
Celestine Mendler-Dünner is a Principal Investigator at the ELLIS Institute in Tübingen, co-affiliated with the Max Planck Institute for Intelligent Systems and the Tübingen AI Center. She leads the Algorithms and Society research group, focusing on machine learning in social contexts and the role of prediction in digital economies. Her work bridges theoretical machine learning with practical societal impact, developing tools for safe, reliable, and equitable AI ecosystems. Her educational background includes a PhD from ETH Zurich in collaboration with IBM Research, followed by an SNSF postdoctoral fellowship at UC Berkeley hosted by Moritz Hardt. She was previously a group leader at the Max Planck Institute for Intelligent Systems before joining the ELLIS Institute. Mendler-Dünner's research spans several interconnected themes including performative prediction (where predictions change the behavior they aim to predict), algorithmic collective action (how participants can steer AI systems toward common goals), and the role of LLMs in social science research. Her work combines theoretical foundations with practical implementations, addressing challenges in interactive machine learning, optimization in dynamic environments, and context-specific evaluation of AI systems. She particularly examines how algorithmic predictions mediate services and platforms at societal scale, exploring concepts of economic power in digital markets. Her publication record shows a clear evolution from system-aware machine learning algorithms (including foundational work on IBM Snap ML) toward increasingly sociotechnical questions at the intersection of machine learning, economics, and policy. Recent work focuses on measuring performative power in digital economies, evaluating LLMs as risk scores, and developing frameworks for algorithmic collective action in recommender systems and labor markets. Among her notable recognitions are the ETH Medal for her dissertation, the IBM Research Division Award, the Fritz Kutter Award, and the IBM Eminence and Excellence Award. She is an ELLIS Scholar, a fellow of the Elisabeth-Schiemann-Kolleg, and affiliated with several prestigious research programs including the International Max Planck Research School for Intelligent Systems and the Max Planck ETH Center for Learning Systems. ETH Medal (dissertation award) IBM Research Division Award Fritz Kutter Award IBM Eminence and Excellence Award SNSF Early Postdoc Mobility Fellowship Mendler-Dünner actively mentors the next generation of researchers, advising PhD student Patrik Wolf and supervising research interns including Joachim Baumann, Haiqing Zhu, and Anna Badalyan, as well as Master's student Dorothee Sigg. She serves as core faculty for the International Max Planck Research School and associated faculty for the Max Planck ETH Center for Learning Systems. Her group has secured significant research funding through fellowships and institutional support, enabling work on projects like Powermeter (measuring search engine influence) and Snap ML (resource-efficient machine learning library with over 1 million PyPI downloads). She leads the Algorithms and Society research group, which examines machine learning as part of broader sociotechnical ecosystems. The group explores human-population interactions with algorithmic systems and incorporates these insights into learning system fundamentals. Current projects include investigating economic incentives in digital platforms, developing tools for systematic LLM evaluation in social science contexts, and creating frameworks for collective action in algorithmic systems. Mendler-Dünner also co-organizes the Algorithmic Collective Action workshop at NeurIPS 2025, demonstrating her leadership in emerging research directions at the AI-society interface.
Michael A Osborne is Professor of Machine Learning at the University of Oxford and leads the Bayesian Exploration Lab . He serves as Director of the EPSRC Centre for Doctoral Training in Autonomous Intelligent Machines and Systems and co-directs the Oxford Martin AI Governance Initiative. His research focuses on Bayesian optimization, Gaussian processes, and probabilistic numerics with applications in quantum devices, battery modeling, and AI governance. Key Positions: Professor of Machine Learning, University of Oxford Official Fellow, Exeter College Co-founder of Mind Foundry Lead Researcher, Oxford Martin Programme on Technology and Employment Research Themes: Probabilistic modeling for quantum systems Uncertainty quantification in energy storage AI safety and societal impact analysis Automated experimental design Quantum device calibration Probabilistic numerical methods Technical Contributions: Bridging reality gap in quantum devices Efficient Bayesian quadrature techniques Personalized neurostimulation algorithms Automated measurement protocols Quantum-classical hybrid ML
Clifford Stein is a Professor of Industrial Engineering and Operations Research (IEOR) and Computer Science at Columbia University, and Associate Director for Research at the Data Science Institute. He holds a Ph.D. (1992), M.S. (1989), and B.S.E. (1987) from MIT and Princeton University, respectively. His research focuses on algorithms, combinatorial optimization, operations research, scheduling, and computational biology. A co-author of the best-selling textbook Introduction to Algorithms , Stein has published widely in top venues and holds prestigious awards like ACM Fellow and NSF Career Award. His work includes foundational contributions to minimum cut algorithms, scheduling theory, and network optimization, supported by NSF and Sloan Foundation grants. Stein has advised over 40 graduate and undergraduate students, many now in academia and industry.
Andrea Coladangelo is an Assistant Professor at the Allen School of Computer Science & Engineering , University of Washington , co-leading the Quantum group and contributing to the Theory and Crypto groups. He coordinates the NSF-funded Quantum@UW REU program , fostering undergraduate research in quantum information. Previously, he was a postdoctoral researcher at UC Berkeley and the Simons Institute , advised by Umesh Vazirani , following a PhD in Computer Science at Caltech under Thomas Vidick . His academic journey began with a B.A. in Mathematics from Oxford and a Master in Mathematics from Cambridge . He co-founded qBraid , a platform for quantum computing education. Research Interests : Andrea explores the intersection of quantum computation and cryptography , focusing on foundational questions in entanglement , quantum correlations , and quantum learning theory . His work investigates quantum pseudorandomness , device-independent security , quantum algorithms , and quantum copy-protection , often leveraging computational assumptions to bridge quantum information theory with cryptographic applications. Scientific Awards : 2025 Google Research Scholar Program Award in Quantum Computing 2023 CSE Undergraduate Teaching Award for his course on quantum computation 2019 Best Student Paper Award at QIP Teaching & Outreach : Andrea designed and taught CSE 434: Intro to Quantum Computation (Spring 2023, 2024, 2025), CSE 534: Quantum Information and Computation (Autumn 2023), and CSE 599C: Quantum Learning Theory (Winter 2025). He also delivered lectures at the 22nd Bellairs Crypto Workshop (2024) and led a quantum programming tutorial using qBraid . Labs & Teams : As co-leader of the Quantum group at the Allen School, he collaborates with researchers in Theory and Crypto , advancing quantum computing through interdisciplinary projects and educational initiatives.
Yang P. Liu is an Assistant Professor at Carnegie Mellon University 's Department of Computer Science . He received his PhD from Stanford University under the supervision of Aaron Sidford and previously studied at MIT . Fields of Interest : Graph Algorithms, Optimization, High-Dimensional Geometry, Additive Combinatorics, Theoretical Computer Science. His research focuses on algorithmic design and analysis for graph problems, optimization, and combinatorics, with applications in machine learning and complexity theory. Recent work includes advancements in parallel repetition games , combinatorial lines , and dynamic graph algorithms . In 2024, his research spanned FOCS , STOC , and RANDOM conferences, addressing problems in k-CSPs , min-cost flow , and hypergraph sparsification . Earlier contributions (2023) included deterministic flow algorithms and spectral hypergraph techniques. Scientific Awards : NDSEG Fellowship (2018-2021), Google PhD Fellowship (2022-2023), FOCS Best Paper (2022), STOC Best Student Paper (2022), FOCS Best Student Paper (2021). He teaches CS 15-759 , a graduate course on convex optimization theory and applications, covering gradient descent, interior point methods, and algorithmic sparsification techniques.
Lijie Chen is an Assistant Professor in the Department of Electrical Engineering and Computer Sciences at UC Berkeley, where he is part of the Berkeley Theory Group. Previously, he was a Miller Research Fellow at UC Berkeley, hosted by Avishay Tal and Umesh Vazirani, and earned his Ph.D. from MIT under Ryan Williams. His research focuses on theoretical computer science, particularly computational complexity theory, with applications to quantum physics and AI safety. Education: Ph.D. in Computer Science from MIT (2022), B.Sc. from Yao Class at Tsinghua University. Research Interests: Complexity theory, quantum complexity, derandomization, circuit lower bounds, and foundational aspects of AI safety. Chen has made significant contributions to understanding fundamental questions in complexity theory, including circuit lower bounds and the connections between randomness and computation efficiency. His work often bridges theoretical insights with practical implications in quantum computing and algorithm design. Awards and Honors: Machtey Award for Best Student Paper (2019). Danny Lewin Best Student Paper Award (2019). Invited to SICOMP Special Issues for FOCS and STOC papers. He has organized workshops on complexity theory and derandomization, and his research has been recognized in venues like STOC, FOCS, and the Journal of the ACM.
Florentina Bunea is a Professor in the Department of Statistics and Data Science at Cornell University’s Bowers College of Computing and Information Science, and an active member of the Graduate Fields of Statistics, Applied Mathematics, and Computer Science. She also serves on the Diversity and Inclusion Council of her college, championing workforce diversity in data-science disciplines. Education & Institutional Roles Professor, Department of Statistics and Data Science, Cornell University Member, Graduate Fields of Statistics, Applied Mathematics, Computer Science Member, Diversity and Inclusion Council, Bowers College of Computing and Information Science Research Interests Professor Bunea’s research lies at the intersection of statistical machine-learning theory and high-dimensional inference. She develops rigorous methodology supported by sharp theoretical guarantees to tackle core problems in modern data science. Recent themes include: Soft-max mixtures for understanding large-language-model/AI algorithms Optimal transport for high-dimensional mixture distributions Wasserstein-distance inference for sparse mixing measures in topic models Latent-space clustering and cluster-based inference in high dimensions Network modeling and hidden-structure inference Applications spanning genetics, systems immunology, neuroscience, sociology, and economics Research Funding & Awards Her work is supported by grants from the National Science Foundation (NSF-DMS). She is a Fellow of the Institute of Mathematical Statistics and a recipient of the IMS Medallion Award. Editorial & Service Contributions Associate Editor: Annals of Statistics, Bernoulli, JASA, JRSS-B, EJS, Annals of Applied Statistics Co-Editor: Chapman & Hall/CRC Statistics and Applied Probability Monograph Series Advising & Collaboration Professor Bunea has mentored numerous doctoral and post-doctoral researchers, including Xin Bing, Shuyu Liu, Seth Strimas-Mackey, and Yang Ning, among others. Collaborative projects extend across Cornell and external institutions, producing widely-used software packages and high-impact publications. Contact Office: 1184 Comstock Hall, Cornell University Email: fb238@cornell.edu Phone: (607) 255-8449
Dean Eckles is an Associate Professor of Marketing at MIT Sloan School of Management and serves as an Associate Director of the MIT Institute for Data, Systems, and Society (IDSS). He is also affiliated with the MIT Schwarzman College of Computing through the Institute for Data, Systems & Society and its Statistics and Data Science Center. Additionally, he leads the analytics research area at the Initiative on the Digital Economy and organizes the annual Conference on Digital Experimentation (CODE@MIT). His educational background includes a BA in philosophy, BS and MS in cognitive science, MS in statistics, and PhD in communication, all from Stanford University. Prior to joining MIT, Eckles worked as a scientist at Facebook, where he contributed to areas including News Feed, messaging, advertising, tools for randomized experiments, and survey methods. He previously held research positions at Nokia and Yahoo. Eckles's research primarily focuses on social influence mediated by interactive technologies, examining how communication technologies mediate, amplify, and direct social influence. His work spans multiple specific areas including social interactions, contagion, and interventions in networks; experimental design and inference in networks; and methods for causal inference. His research often combines social science with advanced statistical methods. His notable publications include research on long ties in social networks and their relationship to economic prosperity, how network structure affects social contagions, and algorithmic transparency in social media platforms. His work has appeared in prestigious journals including PNAS and Nature Human Behaviour, and he has provided expert testimony before the US Senate on algorithmic ranking. Long ties, disruptive life events and economic prosperity (PNAS) Long ties accelerate noisy threshold-based contagions (Nature Human Behaviour) Algorithmic transparency and assessing effects of algorithmic ranking (Senate testimony) Eckles actively shares his research through social media platforms including Bluesky, Twitter, and Mastodon, as well as through his blog and contributions to the Gelman et al. blog. His work bridges academic research with practical applications in technology and policy.
Almut Sophia Koepke is a junior research group leader at the Technical University of Munich and University of Tübingen, focusing on multimodal learning problems integrating sound, vision, and text. Her work bridges foundational research in audio-visual understanding with practical applications in few-shot learning, zero-shot translation, and cross-modal attention mechanisms.
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.
Daniel M. Roy is a Full Professor at the University of Toronto, with cross-appointments in the Department of Computer Science, Department of Statistical Sciences, and Department of Electrical and Computer Engineering. He serves as Research Director at the Vector Institute and holds the CIFAR Canada AI Chair. Research Focus: Foundational principles of prediction, inference, and decision-making under uncertainty across machine learning, statistics, mathematical logic, applied probability, and computer science. Scientific Contributions: Key work in learning theory, statistical network analysis, probabilistic programming, and information-theoretic frameworks for generalization. Awards: ICML 2024 Best Paper Award for "Information Complexity of Stochastic Convex Optimization" and promotion to Full Professor in 2024. Student Advising: Actively mentors Ph.D. candidates and postdoctoral researchers with strong quantitative backgrounds, particularly at the intersection of machine learning, statistics, and computer science. Email: daniel.roy@utoronto.ca
Zaid Harchaoui is an Adjunct Professor in the Department of Statistics at the University of Washington. His research focuses on machine learning, generative AI, and algorithmic optimization, with applications spanning ecology, neuroscience, and artificial intelligence. He explores learning under distributional shifts and develops tools for scalable generative models in language and vision domains. University: University of Washington Department: Statistics Research Focus: Learning from data with computational, inferential, and mathematical rigor; distributional shift adaptation; generative model scaling Email: zaid@uw.edu His recent work emphasizes generative AI applications in ecology and neuroscience, stochastic optimization for robustness, and algorithmic efficiency in large-scale learning. Key contributions include techniques for distributionally robust optimization, interpretable authorship obfuscation, and uncertainty quantification in behavior classification. Scientific awards and honors are not explicitly mentioned in the provided text. Collaborative efforts often intersect with nonlinear control algorithms, spectral analysis, and privacy-preserving machine learning frameworks.
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 .
Ewain Gwynne is a Professor of Mathematics at the University of Chicago, affiliated with the Committee on Computational and Applied Mathematics (CCAM) and the Statistics Department. He previously held postdoctoral positions at the University of Cambridge and earned his Ph.D. from MIT in 2018 under Scott Sheffield. His research focuses on probability theory, particularly random geometric structures in statistical mechanics, including Schramm-Loewner evolution (SLE), Liouville quantum gravity (LQG), and random planar maps. Education: Ph.D. in Mathematics, MIT (2018); M.Sc., MIT (2015); B.Sc., Northwestern University (2013). Research Interests: Random geometric objects in statistical mechanics Liouville quantum gravity and its metric properties Random planar maps and their scaling limits SLE and its relationship with LQG Random walks on random planar maps Percolation and permutons His recent articles explore topics such as supercritical LQG, Gaussian curvature on random maps, and harmonic balls in LQG. He has advised multiple Ph.D. students and serves as an associate editor for Probability and Mathematical Physics . His work bridges probability theory, geometry, and mathematical physics, with applications to understanding critical phenomena in random systems.
