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.
Professor Po-Ling Loh is a faculty member at the University of Cambridge, affiliated with the Statistical Laboratory within the Faculty of Mathematics. Her research focuses on statistical theory and methodology, with applications in machine learning, robust statistics, and medical imaging. She holds a professorship position and contributes to advancing computational and theoretical frameworks for high-dimensional data analysis. Loh’s work addresses challenges such as robust regression, differential privacy, and efficient algorithms for complex models. Her educational background includes studies at Cambridge and further academic pursuits, though specific degree details are not provided here. Research interests span statistical learning, adversarial machine learning, and the mathematical foundations of robust algorithms. She actively publishes in top-tier journals and conferences, addressing topics like neural network regularization, privacy-preserving synthetic data, and network analysis. Notably, Loh collaborates on projects involving medical image analysis (e.g., bone age estimation via BAE-ViT) and has contributed to methodological advancements in hypothesis testing and privacy-constrained inference. Her research often bridges theory and practice, emphasizing computational efficiency and statistical rigor. While no specific grants or awards are listed, her prolific publication record reflects sustained academic impact in statistical and machine learning domains. Loh is associated with the Statistical Laboratory, contributing to its research initiatives and possibly advising students in high-dimensional statistics and related fields. Her work frequently intersects with interdisciplinary applications, such as medical imaging and network science, underscoring the practical relevance of her theoretical contributions.
Professor Chris Holmes is a Professor of Biostatistics at the University of Oxford, where he moved from Imperial College London in February 2004. He is a Fellow at St Anne's College and works in the Department of Statistics. His research focuses on applications and statistical methods development in genomic sciences and genetic epidemiology, holding a prestigious Programme Leaders Grant in Statistical Genomics from the Medical Research Council. Prior to his position at Oxford, Professor Holmes completed his doctorate in Bayesian statistics at Imperial College London, investigating novel nonlinear pattern recognition methods. This was followed by a post-doctoral position and then a lectureship at Imperial. Before his academic career, he worked in industry for several years in scientific computing, developing techniques for real-time pattern recognition models in defense and SCADA systems. Professor Holmes has a broad interest in the theory, methods and applications of statistics and statistical modeling, with a particular foundation in Bayesian statistics which he views as providing a unified framework for stochastic modeling and information processing. His specific research interests include: Bayesian statistics and stochastic simulation Markov chain Monte Carlo methods Pattern recognition and nonlinear, nonparametric methods Spatial statistics Statistical genetics and genomics Genetic epidemiology His recent publications (2023-2025) demonstrate a strong focus on the intersection of biostatistics, artificial intelligence, and healthcare applications. His work spans multiple domains including AI-driven disease classification in neurology, genomic data analysis for health equity, machine learning tools for healthcare prediction, and addressing bias in medical AI systems. A notable trend across his research is the application of advanced statistical methods to solve pressing problems in genomics, epidemiology, and medical diagnostics, with an increasing emphasis on health equity and the ethical implications of AI in healthcare. Professor Holmes currently supervises PhD students Oscar Clivio, Sahra Ghalebikesabi, and Natalia Garcia Martin. His research is supported by multiple grants, including the MRC Programme Leaders Grant in Statistical Genomics which funds his work in statistical genomics. He is actively involved in three research groups at Oxford that reflect the breadth of his scholarly interests: Computational Statistics and Machine Learning Statistical Genetics and Epidemiology Statistical Theory and Methodology
Professor Anders C. Hansen is a mathematician at the University of Cambridge and University of Oslo, leading the Applied Functional and Harmonic Analysis group. His work bridges functional analysis, artificial intelligence, and computational mathematics, focusing on the Solvability Complexity Index (SCI) hierarchy and stability issues in deep learning. He has held prestigious fellowships, including a Royal Society University Research Fellowship and Peterhouse Bye-Fellowship. Educated at the University of Cambridge, UC Berkeley, and the Norwegian University of Science and Technology Developed groundbreaking theories in compressed sensing and deep learning, revealing algorithmic instability paradoxes Organized workshops on computational mathematics and AI interpretability His research explores the SCI hierarchy , exposing computational barriers in AI, quantum mechanics, and inverse problems. Key projects include Smale’s 18th problem and analyzing neural network stability. His work has transformed understanding of compressed sensing, particularly in medical imaging. Recent scientific awards include the Whitehead Prize (2019), IMA Prize (2018), and Leverhulme Prize (2017). Collaborations span institutions like Caltech, MIT, and the University of Vienna. As an educator, he teaches NST Part IA Mathematical Methods , Part II Numerical Analysis , and a Part III course on Compressed Sensing . His group has mentored 17 PhD and postdoctoral researchers since 2012.
Bei Wang Phillips is an Associate Professor in the School of Computing and a faculty member at the Scientific Computing and Imaging (SCI) Institute at the University of Utah. She holds a Ph.D. in Computer Science from Duke University and an undergraduate degree from the University of Bridgeport. Her research focuses on Topological Data Analysis (TDA), data visualization, computational topology, and machine learning, with applications in scientific data exploration and analysis. She has received prestigious awards including the NSF CAREER Award (2022) and the PECASE Award (2025). Her work spans projects funded by NSF, NIH, and DOE, including multiparameter TDA and topology-aware data compression. She advises numerous students and collaborates on interdisciplinary initiatives in astrophysics, climate science, and AI fairness. Education: Ph.D. in Computer Science, Duke University (2010) B.S. in Computer Science and Mathematics, University of Bridgeport (2003) Research Interests: Topological techniques for large-scale data analysis Integration of topological, geometric, and machine learning methods Applications in visualization, bioinformatics, and network analysis Key Projects: NSF-funded TDA research (DMS-2301361, OAC-2313124) DOE project on topology-preserving data compression Collaborations with NASA, Argonne National Lab, and Carnegie Institution of Washington Awards: Presidential Early Career Award for Scientists and Engineers (2025) NSF CAREER Award (2022) DOE Early Career Research Program (2020) Advising and Grants: Mentored over 30 students and postdocs Recipient of multiple NSF and DOE grants totaling millions
Suhas Diggavi is a Professor in the Department of Electrical and Computer Engineering at the University of California, Los Angeles, within the Henry Samueli School of Engineering and Applied Science. His primary research area is Signals and Systems, with a strong focus on information theory and its interdisciplinary applications. His research interests span Information Theory , Machine Learning , Differential Privacy , Federated Learning , Cyber-Physical Systems , and Bio-informatics . He investigates fundamental limits and practical algorithms for secure, efficient, and robust data processing in distributed and networked environments. The recent publications highlight a strong trend in privacy-preserving machine learning, particularly in the shuffled model of differential privacy , communication-efficient distributed SGD , and robust optimization . His work bridges theoretical information-theoretic foundations with real-world applications in federated learning, wireless networks, and genomic data analysis. Notable scientific awards include: Guggenheim Foundation Fellow (2021) ACM CCS Best Paper Award (2021) IEEE Fellow (2013) IEEE Donald G. Fink Prize Paper Award (2006) Multiple Google, Amazon, and Facebook Research Awards Suhas Diggavi actively advises graduate students and leads a research group focused on learning, information, and optimization. His work is supported by major industry grants and collaborations, particularly in privacy and distributed learning. He has made significant contributions to information-theoretic models in bio-sequencing and wireless security. He leads the LIOS (Learning, Information, Optimization, and Stochastic Systems) research group at UCLA, where his team develops theoretical frameworks and practical algorithms for next-generation data-driven systems.
Moe Z. Win is the Robert R. Taylor Professor at the Massachusetts Institute of Technology (MIT), specializing in wireless communications, optical communications, and space communications systems. His research bridges theoretical and applied domains, including quantum sensing, network localization, and signal processing. B.S.E.E., Texas A&M (1987) M.S.E.E. & Ph.D., University of Southern California (1989, 1998) Recent work focuses on quantum-enhanced positioning, machine learning for localization, and next-generation (xG) non-terrestrial networks. He leads research at the Quantum neXus Laboratory (QX Lab), Wireless Information & Network Sciences Lab, and Laboratory for Information and Decision Systems. His career spans the Jet Propulsion Laboratory (1987-1995) and AT&T Research Laboratories (1998-2002). Key methodologies include soft information fusion, variational quantum sensing, and robust beam tracking for terahertz communications.
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.
David Stillwell serves as Professor of Computational Social Science at Cambridge Judge Business School and Academic Director of The Psychometrics Centre, University of Cambridge. His research leverages big data to understand human psychology and behavior, with significant contributions in personality prediction from digital footprints and personalized advertising applications. His educational background includes: BSc in Psychology from the University of Nottingham (2007) MSc in Research Methods from the University of Nottingham (2008) PhD in Decision Making from the University of Nottingham (2012) Dr. Stillwell's research centers on computational social science and psychometrics, pioneering the myPersonality Facebook application that collected data from over 6 million users. His work demonstrates computers can predict personality as accurately as spouses, reveals psychological targeting's advertising effectiveness, and establishes links between personality-matched spending and life satisfaction. He also explores linguistic honesty markers through profanity analysis and personality-based dating patterns. His recent publications (2019-2025) reveal a strong trajectory toward AI evaluation using psychometric frameworks, particularly in medical and general-purpose AI assessment. Key themes include fairness metrics in language models, crisis emotional responses through social media, and computational personality recognition - demonstrating consistent innovation at the psychology-technology intersection. He has received significant recognition: Top 10 most influential papers of 2013 by Altmetric Nieman Journalism Lab highlight of 2013 Named in 'top 30 thinkers under 30' by Pacific Standard Magazine Dr. Stillwell maintains active industry engagement through consultancy with Barclays, Hilton, and Ubisoft on projects spanning computer-adaptive testing systems to interactive experiences like Predictive World for Watch Dogs 2. His policy impact is substantial, with citations by the European Data Protection Supervisor, World Bank, and multiple national governments, leading to speaking engagements at the European Parliament and Bank of England. As Academic Director of The Psychometrics Centre, he leads a global hub for advancing psychological assessment through innovative methods including Concerto open-source software, collaborating with organizations ranging from the European Commission to major corporations on psychometric applications in people analytics and digital behavior.
J. Andrew Bagnell is a Professor at the Robotics Institute of Carnegie Mellon University (CMU). His research bridges planning, control theory, and computational learning, focusing on systems that can self-optimize under partial models. Key projects include the LAIRLab (Learning Applied to Intelligent Robotics) and initiatives in the ARM-S and BIRD MURI programs. Research domains: Machine Learning, Robotics, Control Theory, Optimization, Probabilistic Modeling Key applications: Mobile Robotics, Intelligent Transportation Systems, Multi-Robot Decision Making Recent work emphasizes imitation learning, trajectory optimization, and game-theoretic algorithms for decision-making. His publications highlight collaborations with students and researchers on topics like online learning, planning under uncertainty, and autonomous systems. Notable affiliations include advising Gokul Swamy and past students such as Wen Sun and Anirudh Vemula. Labs: LAIRLab, ARM-S, BIRD MURI team.
Bo Li is an Associate Professor at the University of Illinois at Urbana-Champaign, affiliated with the Siebel School of Computing and Data Science. Her research focuses on trustworthy machine learning, emphasizing robustness, privacy, and security in AI systems. She leads the Secure Learning Lab (SL²), exploring adversarial attacks and defenses across digital and physical domains. Key contributions include foundational work on adversarial examples, robust learning frameworks, and privacy-preserving techniques. Her academic roles include advisory board positions at the Center for Artificial Intelligence Innovation (CAII) and membership in the Information Trust Institute (ITI). She collaborates with institutions like the Advanced Digital Science Center (ADSC) and the Quantum Information Science and Technology Center (IQUIST). Notable recognitions include the IJCAI Computers and Thought Award (2022), MIT Technology Review's 35 Innovators Under 35 (2020), and multiple best paper awards. Recent work addresses AI safety through frameworks like ShieldAgent and AutoRedTeamer, aiming to enhance system resilience against adversarial threats. Her research spans theoretical guarantees, practical defenses, and ethical AI deployment. Students advised include Chulin Xie, Linyi Li, and Boxin Wang, who have received prestigious fellowships such as the IBM PhD Fellowship and Rising Stars in ML Awards. Advising: Guides PhD students in adversarial ML, privacy, and security. Labs/Teams: Secure Learning Lab (SL²), collaboration with ALERT program. Grants/Funding: NSF CAREER Award, Amazon/Google Faculty Awards, and industry partnerships.
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
Kamalika Chaudhuri is a Professor in the Department of Computer Science and Engineering at the University of California, San Diego (UCSD), and also serves as a Director and Research Scientist with the FAIR team at Meta AI. Her research focuses on the foundations of trustworthy machine learning, including robust machine learning, learning with privacy, and out-of-distribution generalization. Dr. Chaudhuri has earned her PhD from UC Berkeley in 2007 with a dissertation on "Learning Mixtures of Distributions." Her academic journey has led her to become a leading researcher in machine learning theory with a particular emphasis on privacy and robustness. Her research interests span machine learning foundations with a strong focus on trustworthy AI . She investigates problems at the intersection of differential privacy , adversarial robustness , and out-of-distribution generalization . Her work addresses critical challenges in developing machine learning systems that maintain privacy while preserving utility, resist adversarial attacks, and generalize effectively beyond training data distributions. She has pioneered approaches in privacy-preserving machine learning, robust learning theory, and methods for detecting and mitigating data memorization in models. An analysis of her recent publications (2024-2025) reveals a strong focus on the intersection of privacy, security, and machine learning. Her work spans differential privacy mechanisms, membership inference attacks, memorization detection, and fairness certification. She has been particularly active in developing methods for privacy-preserving foundation models, with several papers on differentially private computer vision and language models. Her research demonstrates a consistent thread of addressing fundamental challenges in trustworthy AI while developing practical solutions that balance privacy, accuracy, and utility. Best Award at the ICLR 2024 Workshop on Privacy Regulation and Protection in Machine Learning Distinguished Paper Award at IEEE Conference on Secure and Trustworthy Machine Learning (SaTML), 2024 Dr. Chaudhuri has advised numerous PhD students who have gone on to prominent positions at Google, DeepMind, Microsoft Research, and other leading AI institutions. Her group maintains an active research blog with guest posts from UCSD researchers. She has served in significant leadership roles including General Chair for ICML 2022 and Program Co-Chair for both ICML 2019 and AISTATS 2019, where she pioneered initiatives to improve reproducibility in machine learning research. Her research group at UCSD focuses on trustworthy machine learning, with current projects spanning privacy-preserving AI, robustness against adversarial attacks, and methods for ensuring reliable out-of-distribution generalization. The group collaborates closely with the FAIR team at Meta AI, where Dr. Chaudhuri serves as a Research Scientist.
Prof. Ramakrishna Gokaraju is a Professor and Graduate Chair in the Department of Electrical and Computer Engineering at the University of Saskatchewan. His academic journey includes roles as Assistant Professor (2003), Associate Professor (2009), and full Professor (2015). He holds a B.E. from NIT Trichy (1992), M.Sc. and Ph.D. from the University of Calgary (1996, 2000). His research focuses on power system protection, smart grids, and sustainable energy systems, including small modular reactors (SMRs) and renewable integration. He has advised 8 PhD and 25+ Master’s students, with over 80 publications in top journals/conferences. Dr. Gokaraju’s honors include the Izaak Walton Killam Memorial Scholarship (1998–2000) and the Professor of the Year Award (2008). He has held visiting roles at the University of Manitoba (2009–2010), IIT Kanpur (2018), and institutions in Australia and India. His work emphasizes high-speed digital relaying, PMU-based solutions, and transient stability protection. Current research includes wind generator modeling, SMR integration, and energy storage systems for remote communities. His technical contributions span fault location algorithms, grid resilience enhancement, and GPU-based optimization for transport systems. Ongoing projects explore hybrid energy systems combining SMRs with renewables. Lab affiliations include the Power Systems Research Group at the University of Saskatchewan, focusing on smart grid innovation and sustainable energy solutions.
Paul Goldberg is a Professor of Computer Science and Director of the MSc in Mathematics and Foundations of Computer Science (MFoCS) at the University of Oxford. He holds a BA in Mathematics from Oxford University and a PhD in Computer Science from the University of Edinburgh. His research focuses on algorithmic game theory, computational complexity, and machine learning, with notable contributions to equilibrium computation, complexity classes of total search problems, and decentralized systems. Affiliations: Department of Computer Science, Oxford; Editorial Board of ACM Transactions on Economics and Computation. Education: PhD in Computer Science (1993), University of Edinburgh MSc in Computer Systems Engineering (1989), University of Edinburgh and Université Paris-Sud BA in Mathematics (1988), Oxford University Research Interests: Algorithmic game theory, computational complexity (especially total search problems like CLS and PPAD), decentralized computation of equilibria, and applications in machine learning and AI. His work bridges theoretical computer science and economics, with a focus on algorithm design and complexity analysis. Publications and Awards: Over 120 papers, including influential work on Nash equilibrium complexity (2009), gradient descent (2023), and fair division algorithms. Notable awards include the ACM SIGecom Test of Time Award (2022) and a SIAM Outstanding Paper Prize (2011). Grants and Students: Leads EPSRC-funded projects on game theory and machine learning. Supervised 11 PhD graduates and currently advises Giannis Tyrovolas and others. Active in mentoring MSc and undergraduate projects. Labs/Teams: Part of the Algorithms and Complexity Theory group at Oxford, contributing to research on optimization, equilibrium dynamics, and fair division.
