Professor Catherine Greenhill is a faculty member at the School of Mathematics and Statistics, UNSW Sydney , where she serves as Professor and head of the Combinatorics group. Her academic career spans institutions including the University of Queensland, University of Oxford, University of Leeds, University of Melbourne, and Australian National University. D.Phil., University of Oxford (1996) M.Sc. (Research) in Combinatorics (1992) B.Sc. (Hons) in Pure Mathematics (1991) Her research focuses on the intersection of discrete mathematics , theoretical computer science , and probability , particularly in asymptotic combinatorics , probabilistic methods , and analysis of algorithms . Her work includes asymptotic enumeration of combinatorial structures and design of randomized algorithms for graph sampling and counting. Her recent publications (2025–2021) center on random graphs and hypergraphs , with key contributions to switch Markov chains , degree sequence analysis , and chromatic number bounds . These works reflect her expertise in probabilistic combinatorics and algorithmic complexity . Scientific Awards: Fellow of the Australian Academy of Science (2022) Christopher Heyde Medal in Pure Mathematics (2015) June Griffith Fellowship (2013) Hall Medal (2010) Advising and Grants: She has supervised numerous PhD/Masters students and secured multiple ARC Discovery Grants (2019–2021, 2014–2016, 2012–2014). Her grants address topics like hypergraph modeling, random discrete structures, and network analysis in illicit drug trafficking.
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 .
Liza Rebrova is an Assistant Professor in the Department of Operations Research and Financial Engineering (ORFE) at Princeton University's School of Engineering and Applied Science. She is also an associated faculty member of the Program in Applied and Computational Mathematics (PACM) and the Center for Statistics and Machine Learning (CSML). Her research focuses on randomized numerical linear algebra and the mathematics of data science, with connections to high-dimensional probability and stochastic optimization. She develops mathematically justified randomized algorithms for large-scale data, particularly interested in settings where data exhibits mathematical structure such as spectral decay, multi-modality, or non-negativity. Her work addresses challenges in data compression, recovery, and optimization under structured noise conditions. Dr. Rebrova's recent publications show a strong trend toward developing robust algorithms for linear systems, tensor data compression, and nonnegative matrix factorization. Her work bridges theoretical foundations with practical applications in machine learning and data science, with emphasis on memory efficiency and handling corrupted or incomplete data. NSF DMS-2309685 (Single PI, 2024-2026): "Outliers are not what they seem: data-aware, flexible, and robust randomized iterative methods" NSF DMS-2108479 (Collaborative, 2022-2024): "Fast, Low-Memory Embeddings for Tensor Data with Applications" (co-PIs Mark Iwen and Deanna Needell) She currently advises three PhD students (Jackie Lok, Shambhavi Suryanarayanan, and Sofiia Shvaiko) and has previously advised Abraar Chaudhry (PhD 2024) and Nicolo Grometto (Masters thesis 2023). At Princeton, she teaches graduate courses including ORF526 (Graduate Probability), ORF387 (Networks), and ORF523 (Convex and Conic Optimization).
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
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.
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.
Jacob Fox is a Professor at Stanford University, specializing in Combinatorics and Probability. His research focuses on extremal combinatorics, Ramsey theory, graph theory, and additive combinatorics. He advises students like Maya Sankar. His work explores structural and enumerative aspects of graphs, hypergraphs, and combinatorial configurations. Recent studies include advancements in Ramsey numbers, sumset theory, and probabilistic methods in discrete mathematics. Key research areas include Ramsey numbers for sparse structures, hypergraph properties, and applications of combinatorial geometry. His publications often bridge theoretical insights with algorithmic applications. No scientific awards are listed in the provided text. His advising includes Maya Sankar, with research aligned to combinatorial problems. Collaborative projects involve extremal graph theory and probabilistic combinatorics. No labs or dedicated research groups are explicitly mentioned.
Martin T. Wells is the Charles A. Alexander Professor of Statistical Sciences at Cornell University, with joint appointments in the Department of Statistical Science, Department of Biological Statistics and Computational Biology, Department of Social Statistics, and as Professor of Clinical Epidemiology and Health Services Research at Weill Medical School. He serves as Editor-in-Chief of the ASA-SIAM Book Series and Co-Editor of the Journal of Empirical Legal Studies. Cornell University, Ithaca, NY Weill Cornell Medical College Research Interests span applied and theoretical statistics, Bayesian methods, biostatistics, clinical epidemiology, and computational biology. His work bridges disciplines like finance, legal studies, and health services research. Article Trends highlight advancements in Bayesian modeling, quantum cognition machine learning, tensor analysis, and misclassification correction, with applications in genomics, finance, and public health. Fellow of the American Statistical Association Fellow of the Royal Statistical Society Contributions include developing statistical software (e.g., rTensor), methodological innovations in clinical trials, and empirical legal studies on civil rights and the death penalty.
Ali H. Sayed is the Dean of the School of Engineering (Faculté des sciences et techniques de l'ingénieur - STI) at École Polytechnique Fédérale de Lausanne (EPFL), Switzerland, where he also directs the Adaptive Systems Laboratory (Laboratoire de systèmes adaptatifs). Previously, he served as an emeritus professor and chair of the Electrical Engineering Department at UCLA. He is a highly cited researcher and a member of the US National Academy of Engineering and the World Academy of Sciences. Sayed served as president of the IEEE Signal Processing Society in 2018 and 2019. Professor Sayed's research focuses on adaptation and learning theories, data and network sciences, statistical inference, multi-agent systems, adaptive networks, and optimization. His work bridges theoretical foundations with practical applications in signal processing, machine learning, and network science. He has made significant contributions to distributed learning algorithms, social learning over networks, and adaptive signal processing techniques that have influenced both academic research and practical implementations. His recent publications demonstrate a strong focus on multi-agent systems, distributed learning, privacy-preserving techniques, and social learning over networks. The research trends show increasing emphasis on federated learning with privacy guarantees, graph-based learning approaches, and the intersection of social dynamics with information processing. His work consistently addresses fundamental theoretical questions while maintaining relevance to practical applications in communication networks, social media analysis, and distributed artificial intelligence systems. Professor Sayed has received numerous prestigious awards throughout his career, including: IEEE Fourier Award (2022) Norbert Wiener Society Award (2020) IEEE Signal Processing Society Education Award (2015) Papoulis Award from the European Association for Signal Processing (2014) Technical Achievement Award from IEEE Signal Processing Society (2012) Terman Award from the American Society for Engineering Education (2005) IEEE Donald G. Fink Prize (1996) Multiple Best Paper Awards from IEEE and EURASIP Sayed has authored or co-authored over 570 publications and six monographs. He has mentored numerous PhD students and researchers in the fields of signal processing and adaptive systems. His editorial leadership includes serving as Editor-in-Chief of IEEE Transactions on Signal Processing (2003-2005) and EURASIP Journal on Advances in Signal Processing (2006-2007), as well as Founding Editor-in-Chief of the Open Access Book Series on Information and Learning Sciences. At EPFL, Professor Sayed leads the Adaptive Systems Laboratory, which focuses on developing theoretical frameworks and practical algorithms for adaptive systems, networked learning, and distributed signal processing. The lab's research encompasses both fundamental theoretical investigations and applications to real-world problems in communications, social networks, and computational biology.
Ming Hu is a Professor and University of Toronto Distinguished Professor of Business Operations and Analytics at Rotman School of Management, University of Toronto. He serves as Area Coordinator for the Operations Management & Statistics Area and holds editorial leadership roles including Editor-in-Chief of Naval Research Logistics and Associate Editor for multiple top journals. MS in Applied Mathematics, Brown University (2003) PhD in Operations Research, Columbia University (2009) His research focuses on sharing economy , social operations , and platform economics , examining how operational decisions can maximize societal benefit. Key areas include crowdfunding , two-sided markets , crowdsourcing , and group buying , with applications to DEI , sustainability , and AI-empowered operations . Recent work analyzes spatial operations in delivery systems, algorithmic fairness , and climate change adaptation in agricultural supply chains. His publications span top journals like Management Science and Operations Research , covering topics from blockchain traceability to quantum-inspired optimization . Scientific recognitions include: Wickham Skinner Early-Career Research Award (2016) Best Operations Management Paper in Management Science (2017) 2018 Poets & Quants Best 40 Under 40 MBA Professors As an Amazon Scholar (2022–) and Chair of Chain Analytics Institute (2023–), he bridges academic research with industry applications in AI-driven logistics and sustainable operations.
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.
Gauri Joshi is an Associate Professor in the Electrical and Computer Engineering (ECE) department at Carnegie Mellon University, with affiliate appointments in the Machine Learning Department and Robotics Institute. Her work focuses on system-aware algorithms for distributed machine learning, combining optimization, probability, and coding theory to address communication and computational constraints in edge networks. MIT Ph.D. in EECS (2016) IIT Bombay B.Tech/M.Tech in Electrical Engineering (2010) Research themes include federated learning with communication efficiency, erasure coding for non-linear computations, and reinforcement learning for heterogeneous queueing systems. She leads the Optimization, Probability and Learning (OPAL) lab , affiliated with the Parallel Data Lab (PDL), CyLab, and FLAME Center. Recent publications highlight advances in: federated fine-tuning with low-rank adaptation, robust PCA for model aggregation, privacy-preserving prediction mechanisms, and adaptive reinforcement learning for job dispatching systems. Her group has received 15+ paper awards across SIGMETRICS, MobiHoc, and NeurIPS workshops. Scientific recognition includes: IEEE Goldsmith Lecturer (2025), MIT Technology Review '35 Innovators Under 35' (2022), ONR Young Investigator Award (2023), NSF CAREER (2021), and ACM SIGMETRICS Best Paper (2020). She has advised 20+ graduate students, many now at tech giants like Google, Apple, and Meta. Service contributions span program co-chair roles (MLSys 2025), associate editorships (IEEE/ACM Transactions on Networking), and workshop organization (ICML, NeurIPS). Her NSF AI-EDGE Institute leadership (2021-present) drives next-generation intelligent edge networks for robotics and aerospace applications.
Erik B. Sudderth is a Professor of Computer Science and Statistics and Chancellor's Fellow at the University of California, Irvine (UCI). He leads the Learning, Inference, & Vision Group and directs multiple research centers, including the UCI Center for Machine Learning and Intelligent Systems and the HPI Research Center in Machine Learning and Data Science. He previously served as an Associate Professor at Brown University. Education: B.S. (summa cum laude) in Electrical Engineering from UC San Diego (1999), M.S. and Ph.D. in EECS from MIT (2002, 2006). His research focuses on statistical methods for scalable machine learning, Bayesian nonparametrics, probabilistic graphical models, and applications in computer vision, AI, and environmental science. Key areas include nonparametric clustering, deep generative models, and particle-based inference algorithms. Research interests span diverse topics: advancing Bayesian nonparametric models for medical time series, scalable variational inference, and AI ethics. Notable contributions include the NET-VISA seismic monitoring system (ISBA Mitchell Prize, 2014), the BNPy toolbox (NSF CAREER Award), and work on diverse particle max-product algorithms for continuous inference. Scientific awards include the NSF CAREER Award, ISBA Mitchell Prize, and recognition as one of "AI's 10 to Watch" (IEEE). He has served as editor for top journals (JMLR, IEEE PAMI) and conference chairs (NeurIPS, CVPR). His work bridges theory and practice, with applications in robotics, climate science, and healthcare. Labs/Teams: UCI Learning, Inference, & Vision Group; UCI Center for Machine Learning; CREATE Technology Center. Grants include NSF funding for visually impaired collaboration tools and soil biogeochemical modeling.
Amit Kumar is the Jaswinder and Tarwinder Chadha Chair Professor in the Department of Computer Science and Engineering at IIT Delhi. His research focuses on combinatorial optimization, online algorithms, and algorithmic fairness. He has taught courses such as Approximation Algorithms (COL 754), Design and Analysis of Algorithms (COL 351), and Numerical Analysis (COL 726). His work spans theoretical computer science with applications to clustering, scheduling, and fairness in evaluation processes. Research Interests Kumar's research emphasizes developing efficient algorithms for online and dynamic settings, particularly in constrained optimization and biased evaluation systems. He explores theoretical foundations of clustering, load balancing, and resource allocation, with recent contributions to fair food delivery systems and coreset constructions. Publications His recent work includes advancements in online convex paging (STOC 2025), consensus clustering (SODA 2025), and fairness-aware algorithms (AAAI 2024). Over 70 papers across top venues like STOC, SODA, and ICML reflect his expertise in algorithm design and analysis. Awards Best Paper Award at ISAAC 2023 for 'Clustering What Matters in Constrained Settings' Teaching & Mentorship Kumar instructs graduate and undergraduate courses in algorithms, data structures, and numerical methods. He advises students through these courses and collaborates with researchers on NSF-funded projects related to approximation algorithms and streaming systems.
