Shivaram Kalyanakrishnan is an Associate Professor at the Department of Computer Science and Engineering , Indian Institute of Technology Bombay , specialising in Artificial Intelligence and Machine Learning . His research spans sequential decision making , multiagent learning , multi-armed bandits , and humanoid robotics , with applications in robot soccer , computer games , and online advertising . He teaches advanced courses like CS 747: Foundations of Intelligent and Learning Agents and CS 748: Advances in Intelligent and Learning Agents , focusing on end-to-end system design and theoretical analysis. His scientific awards include the Best Student Paper Award at RoboCup International Symposium 2006 and nomination for Best Student Paper Award at AAMAS 2007 . His work on reinforcement learning and policy iteration has been published in leading venues such as IJCAI , ICML , and COLT , with recent contributions to railway scheduling and bandit algorithms. While no explicit list of advisees is provided, his research projects and publications suggest mentorship of students in collaborative efforts. Contact : shivaram@cse.iitb.ac.in .
Kevin Jamieson is an Associate Professor at the Paul G. Allen School of Computer Science & Engineering and an Adjunct Professor in the Department of Statistics at the University of Washington . His academic journey includes a B.S. (2009) , M.S. (2010) , and Ph.D. (2015) in electrical engineering from the University of Washington, Columbia University, and University of Wisconsin–Madison respectively. He completed a postdoc at UC Berkeley's AMP Lab before joining UW in 2017. Ph.D., Electrical Engineering, University of Wisconsin–Madison (2015) M.S., Electrical Engineering, Columbia University (2010) B.S., Electrical Engineering, University of Washington (2009) Jamieson's research lies at the intersection of interactive machine learning , active learning , and sequential decision making . His work focuses on: Adaptive sampling strategies in multi-armed bandits and reinforcement learning (RL) Developing instance-dependent optimal algorithms that adapt to problem difficulty Applications in robotics , human perception studies , and hyperparameter optimization Representation learning for large models and experimental design frameworks His 15 most recent publications (2025-2022) demonstrate expertise in bandit theory , contextual RL , and game-theoretic learning . Notable trends include sample-efficient optimization , adaptive A/B testing , and sim-to-real transfer in robotics. Jamieson has received: NSF CAREER award for foundational contributions Amazon Faculty Research award for innovation in learning systems He actively recruits graduate students and postdocs , emphasizing collaboration in areas like: Multi-agent RL and strategic actor learning Empirical process suprema and adaptive sampling theory Applications in robotics , large language model finetuning , and biomedical data analysis Jamieson leads the Washington AI Lab (WAIL) and develops open-source learning systems like the NEXT framework for real-world adaptive data collection. He serves as co-PI for the Institute for the Foundations of Data Science (IFDS) and co-organizes the Distinguished Seminar in Optimization & Data .
Aarti Singh is a Professor in the Machine Learning Department at Carnegie Mellon University and Director of the NSF AI Institute for Societal Decision Making. She leads research at the intersection of machine learning, statistics, and decision making, with applications to scientific and societal domains. Her work focuses on designing principled interactive algorithms for learning and decision making under uncertainty. Education: Ph.D. in Electrical Engineering, University of Wisconsin-Madison (2008) M.S. in Electrical Engineering, University of Wisconsin-Madison (2003) B.E. in Electronics and Communication Engineering, University of Delhi (2001) Research Interests: Professor Singh's research centers on developing interactive machine learning algorithms that go beyond finding input-output associations to make higher-level decisions about the most informative data and actions. Her work spans autonomous decision making, including active sampling, stochastic optimization, bandits, and reinforcement learning that are statistically optimal, computationally tractable, and robust. She also investigates human factors in decision making, designing algorithms that model and leverage human feedback while accounting for bias, memory effects, and calibration. Her research has applications in material science, cosmology, and peer review systems. Research Trends: Professor Singh's recent publications demonstrate a strong focus on reinforcement learning, particularly in developing more efficient and robust algorithms for decision making under uncertainty. Her work bridges theoretical foundations with practical applications, spanning from fundamental algorithm development to real-world implementation in scientific domains. There's a clear trajectory toward integrating human factors into decision-making algorithms, with significant contributions to peer review systems and preference learning. Scientific Awards: NSF Career Award United States Air Force Young Investigator Award A. Nico Habermann Faculty Chair Award Harold A. Peterson Best Dissertation Award Multiple paper awards Advising and Grants: Professor Singh has advised numerous PhD and master's students, many of whom have gone on to faculty positions or research roles at leading institutions. Her research is supported by prestigious grants from ONR, Simons Foundation, AFRL, ARL, and NSF. She serves as General Chair (2025) and Program Chair (2020) for the International Conference on Machine Learning (ICML) and has held leadership roles in multiple professional organizations. Research Team: Professor Singh leads a vibrant research group within the Machine Learning Department at CMU, with current PhD students working on topics including reinforcement learning, human-AI collaboration, and decision making under uncertainty. She also directs the NSF AI Institute for Societal Decision Making, which brings together researchers from multiple disciplines to develop AI systems that support human decision making in societal contexts.
Dai Zhongxiang is an Assistant Professor and Presidential Young Fellow at the School of Data Science, The Chinese University of Hong Kong, Shenzhen (CUHKSZ), where he joined in August 2024. Previously, he was a Postdoctoral Associate at MIT's Laboratory for Information and Decision Systems (January-June 2024) and a Postdoctoral Fellow at the National University of Singapore's Department of Computer Science (April 2021-December 2023). He completed his Ph.D. in Artificial Intelligence at NUS under the supervision of Bryan Kian Hsiang Low and Patrick Jaillet. Dr. Dai's research focuses on the intersection of theoretical and practical AI, with particular emphasis on large language models (LLMs) and optimization techniques. His work spans both theoretical foundations of multi-armed bandits and Bayesian optimization, as well as practical applications in LLM inference, including prompt optimization, in-context learning, personalization of LLMs, LLM-based agents, and scaling up test-time computation of LLMs. His research approach often bridges theoretical principles with real-world applications, particularly in AI4Science problems. His recent publications demonstrate a clear trend toward advancing LLM capabilities through optimization techniques, with increasing focus on practical deployment challenges. The research spans both theoretical contributions to optimization theory and applied work on enhancing LLM performance in real-world scenarios. His work on dueling bandits, neural bandits, and zeroth-order optimization has been consistently published in top-tier venues including NeurIPS, ICML, ICLR, and ACL. Presidential Young Fellow, CUHKSZ (2024) Dean's Graduate Research Excellence Award, NUS (2021) Research Achievement Award × 2, NUS (2019 & 2020) Singapore-MIT Alliance Graduate Fellowship (2017) Dr. Dai actively mentors multiple Ph.D. students and research assistants, with several of his students' papers accepted to top conferences. His research has received significant attention, with invitations to serve as Area Chair for NeurIPS 2025 and ICLR 2025, reflecting his growing influence in the machine learning community. His work bridges theoretical machine learning with practical applications in large-scale AI systems.
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.
Sharan Vaswani is an Assistant Professor in the School of Computing Science at Simon Fraser University (SFU). His research focuses on designing algorithms for sequential decision-making under uncertainty, stochastic optimization, and their interplay with machine learning generalization. He holds a PhD from the University of British Columbia (2019) and postdoctoral experiences at the University of Alberta and Mila. His academic journey includes MSc (UBC, 2015) and BTech (BITS Pilani, 2012) degrees. Education: PhD (UBC, 2019), MSc (UBC, 2015), BTech (BITS Pilani, 2012) Postdoctoral Work: University of Alberta (2020-2021), Mila (2019-2020) Teaching includes courses on Probability and Computing (CMPT 210), Optimization for Machine Learning (CMPT 409/981), and Theoretical Foundations of Reinforcement Learning (CMPT 419/983). His research group focuses on developing scalable optimization algorithms with theoretical guarantees. He advises multiple PhD and MSc students, contributing to areas like constrained MDPs, adaptive learning rates, and reinforcement learning theory. Research Highlights: Contributions to bandit algorithms, stochastic gradient methods, and reinforcement learning theory. Notable work includes global convergence analysis of policy gradients and variance-reduced optimization frameworks.
Pan Xu is a tenure-track assistant professor with joint appointments in the Department of Biostatistics & Bioinformatics, Department of Computer Science, and Department of Electrical & Computer Engineering at Duke University. Previously, Xu was a Postdoctoral Scholar Research Associate at Caltech's Department of Computing and Mathematical Science and earned a Ph.D. in Computer Science from UCLA. Xu's research focuses on developing computationally- and data-efficient machine learning algorithms with strong empirical performance and theoretical guarantees. Xu's research interests center around Machine Learning with broad applications in Artificial Intelligence, Data Science, Optimization, Reinforcement Learning, and High Dimensional Statistics. The research specifically targets real-world problems in Bioinformatics and Healthcare, with recent work emphasizing distributionally robust decision making, efficient exploration strategies, and multi-agent systems. Xu has developed novel algorithms that address the challenges of exploration in sequential decision making and robustness to distributional shifts between training and deployment environments. Xu's recent publications demonstrate a strong trend toward developing theoretically grounded yet practical algorithms for reinforcement learning and bandit problems, with particular emphasis on distributionally robust methods, efficient exploration techniques, and applications to healthcare. The work spans both theoretical analysis (providing minimax optimal regret bounds) and practical implementations (validated on benchmarks like Atari games and real healthcare datasets). Whitehead Scholar award from Duke University School of Medicine (2023) Best Paper Award at ACM FAccT 2023 for Queer In AI paper PIMCO Postdoctoral Fellowship in Data Science (2022) TMLR Featured Certification (2023) NSF award on approximate sampling based exploration (2023) Xu actively mentors multiple Ph.D. students across Duke's Biostatistics & Bioinformatics, Computer Science, and Electrical & Computer Engineering programs, with several alumni now pursuing doctoral studies at top institutions. The research group has secured competitive funding including an NSF award for approximate sampling based exploration for sequential decision making. Xu serves as an action editor for TMLR and as an area chair for major conferences including ICML, NeurIPS, AAAI, ICLR, and AISTATS. Xu leads a dynamic research group focused on sequential decision making, with projects spanning theoretical algorithm development, implementation of practical systems, and applications to healthcare and bioinformatics. The group maintains active collaborations across Duke's medical and engineering schools, with recent work applying machine learning to epidemic forecasting during the pandemic.
Rochester Institute of Technology (RIT)United States
Cecilia O. Alm is a Professor in the Department of Psychology within the College of Liberal Arts at Rochester Institute of Technology (RIT), where she serves as the Artificial Intelligence Program Director. She holds multiple leadership roles including Director of the Center for Human-aware AI and Director of the Computational Linguistics and Speech Processing Lab (CLaSP). Her institutional affiliations span the School of Information, Ph.D. Programs in Cognitive Science and Computing and Information Sciences, Department of Computer Science, and MS in Data Science program. Dr. Alm earned her Ph.D. from the University of Illinois at Urbana-Champaign. Her research focuses on human-centered artificial intelligence with particular emphasis on linguistic and multimodal sensing, affective computing, and natural language processing. She investigates how AI systems can better understand and respond to human communication through multimodal dialogue processing, with applications in accessibility, education, and healthcare. Her recent publications demonstrate a strong trend toward developing inclusive AI systems, particularly through projects addressing Deaf community needs (MULTICOLLAB-ASL), subtle emotion recognition (FUSE corpus), and bias mitigation in NLP. The work consistently integrates multimodal data streams (speech, gaze, gesture) to create more responsive human-AI interaction frameworks. Current research directions emphasize diversity in AI education, visual prosody in sign languages, and human-in-the-loop AI development. Dr. Alm leads several significant NSF-funded initiatives including the AWARE-AI program, IRES AI-PROWIL international research experience, and collaborative projects with Gallaudet University focused on Deaf scientist-centered AI research. She has secured over $2.5 million in external funding for her work on human-aware AI systems. She directs the CLaSP lab which provides research opportunities for PhD, MS, and undergraduate students, with graduates employed at major technology companies including Amazon, Apple, Microsoft, and Facebook. The lab focuses on real-world AI applications in accessibility, human-robot interaction, and multimodal communication systems.
Arpit Agarwal is an Assistant Professor in the Department of Computer Science & Engineering at the Indian Institute of Technology, Bombay. He previously held postdoctoral positions at FAIR Labs (Meta) working with Max Nickel and at the Data Science Institute at Columbia University hosted by Prof. Yash Kanoria and Prof. Tim Roughgarden. He completed his PhD from the Department of Computer & Information Science at the University of Pennsylvania under the guidance of Prof. Shivani Agarwal. His research focuses on the intersection of human behavior and machine learning systems, with particular interest in learning from implicit, strategic, and heterogeneous human feedback. His work spans multiple dimensions of human-AI interaction including understanding long-term dynamics between humans and AI systems, designing responsible AI, and studying misalignment between user preferences and system objectives. His research methodology often combines theoretical machine learning with practical applications in recommendation systems and social AI. His recent publications reveal a strong focus on bandit algorithms, preference learning, and recommendation systems, with increasing attention to responsible AI design and human-centered considerations. His work demonstrates expertise in theoretical machine learning with applications to real-world problems, particularly in understanding how humans interact with and are influenced by AI systems over time. Dr. Agarwal teaches advanced courses including CS767 Theoretical Machine Learning (Autumn 2025) and CS6103 Human-Centered AI: From Learning Models to Responsible Systems (Spring 2025), which covers topics such as AI alignment, learning from pairwise comparisons, crowdsourcing, human-in-the-loop decision making, recommendation systems, interpretability, privacy, fairness, causality, and AI governance.
Viswanath Nagarajan is an Associate Professor of Industrial & Operations Engineering and Computer Science Engineering (courtesy) at the University of Michigan. His research focuses on combinatorial optimization, approximation algorithms, and stochastic models for routing, scheduling, and location problems. He previously served as an Assistant Professor at the University of Michigan (2014–2020) and a Research Staff Member at IBM T.J. Watson Research Center (2009–2014). He holds a Ph.D. in Algorithms, Combinatorics, and Optimization from Carnegie Mellon University (2004–2009) and a B.Tech. in Computer Science from IIT Bombay (1999–2003). His research explores uncertainty management in optimization, including stochastic models and approximation algorithms for decision-making under uncertainty. He has contributed to adaptive algorithms, submodular optimization, and applications in logistics, network design, and scheduling. Education: Ph.D., Algorithms, Combinatorics, and Optimization (Carnegie Mellon University, 2009) B.Tech., Computer Science and Engineering (IIT Bombay, 2003) Prof. Nagarajan has organized major conferences like IPCO 2019 and served on editorial boards for journals including Operations Research , ACM Computing Surveys , and ACM Transactions on Algorithms . His service includes program committees for SODA, APPROX, and IPCO. He advises Ph.D. students focusing on optimization theory and applications, with advisees securing positions at Yahoo! Research, the University of Chicago, Ford Motor Company, and Georgia Tech.
Cathy Wu is an Associate Professor at MIT, with affiliations in the Laboratory for Information and Decision Systems (LIDS), Department of Civil and Environmental Engineering (CEE), and Institute for Data, Systems, and Society (IDSS). Her research group focuses on integrating machine learning with model-based optimization to solve complex problems in transportation systems and cyber-physical systems. Academic Leadership: Class of 1954 Career Development Associate Professor (MIT) Research Grants: NSF CAREER Award, Amazon Robotics, Mathworks, MIT Mobility Initiative, US DOT, Microsoft Research, Cintra, Symbotic Research Interests : Wu's work bridges AI and engineering challenges in transportation. Key areas include: Hybrid ML/Model-based Optimization (large neighborhood search, branch-and-cut) Sustainable Mobility (Project Greenwave, eco-driving) Multi-Agent Coordination (warehouse automation, cooperative driving) Cyber-Professional Systems (generalization in RL, transfer learning) Recent work demonstrates significant advances in eco-driving (11-22% emissions reduction), large-scale multi-agent path finding (1000+ agents), and foundational RL methods for traffic control. Her group has produced 15+ major publications since 2015, with notable media coverage in Science, Wired, and NewScientist. Selected Scientific Awards NSF CAREER Award (2023) Ole Madsen Mentoring Award (2025) IEEE ITSS WiE/YP Fellowship (2024) Harold L. Hazen Teaching Award (2022) Her lab has advised 12+ graduate students and postdocs, including: Vindula Jayawardana (PhD '24, now at Anthropic) Sirui Li (PhD '25, now at Microsoft Research) Yining Ma (Postdoc, active researcher) Zhongxia Yan (PhD '24, now at Anthropic)
Nicolò Cesa-Bianchi is a Professor of Computer Science at the University of Milan, where he serves as head of the Computer Science programs. He is also associated with the Department of Electronics, Information and Bioengineering (DEIB) at Politecnico di Milano. Cesa-Bianchi holds significant leadership roles including Board member, Fellow and co-director of the Milan unit of the European Laboratory for Learning and Intelligent Systems (ELLIS), and membership in the prestigious Accademia Nazionale dei Lincei. He is also involved with The European Lighthouse on Secure and Safe AI (ELSA), The European Lighthouse of AI for Sustainability (ELIAS), and The FAIR foundation. Professor Cesa-Bianchi's research focuses on the theoretical foundations of machine learning, with special emphasis on sequential decision making and online learning algorithms. His work spans multiple areas including multi-armed bandit problems, regret analysis, prediction with expert advice, and learning on graphs. He has made significant contributions to understanding the theoretical limits of learning algorithms and developing efficient methods for various learning scenarios. His research has important applications in online markets, social networks, and bioinformatics. His monographs 'Prediction, Learning, and Games' and 'Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems' are considered seminal works in the field. His recent publications demonstrate continued leadership in advancing the theoretical understanding of machine learning, with 2024-2025 papers covering cooperative online learning, multitask learning, fair trade mechanisms, and refined analyses of bandit algorithms. The research shows increasing focus on practical economic applications while maintaining strong theoretical foundations. Google Research Award Xerox Foundation UAC Award Member of the Accademia Nazionale dei Lincei ELLIS Fellow Cesa-Bianchi has been deeply involved in academic service, having served as action editor for the Machine Learning Journal, IEEE Transactions on Information Theory, and the Journal of Machine Learning Research. He currently serves as associate editor for the Journal of Information and Inference and TheoretiCS. He has held leadership positions including President of the Association for Computational Learning and member of the steering committee for the EC-funded Network of Excellence PASCAL2. He was program chair of the 13th Annual Conference on Computational Learning Theory and the 13th International Conference on Algorithmic Learning Theory. He leads the Laboratory for AI and Learning Algorithms (ALGA) at the University of Milan, which focuses on theoretical and applied research in machine learning. His international collaborations are extensive, with visiting positions at UC Santa Cruz, Graz Technical University, Ecole Normale Supérieure in Paris, Google, and Microsoft Research. As an educator, he teaches advanced courses including Reinforcement Learning and Statistical Methods for Machine Learning, and has supervised numerous students through the years.
Esther Rolf is an Assistant Professor in the Department of Computer Science at the University of Colorado Boulder. Her research focuses on blending methodological and applied machine learning techniques to address social and environmental challenges, emphasizing usability, data-efficiency, and fairness. Her work includes developing algorithms for environmental monitoring with satellite imagery and advancing geospatial ML systems. Her research explores the multifaceted role of data representation in machine learning, particularly how spatial distribution and data acquisition impact model fairness and efficacy. Projects include formalizing representivity in training data and tackling evaluation challenges in geospatial ML applications. Recent publications highlight her expertise in satellite-based poverty mapping, multimodal data efficiency, and geospatial foundation models. She integrates specialized architectures and domain-specific benchmarks into her work. Best Paper Award, ICML (2018) Best Paper Award, NeurIPS Workshop on AI for Social Good (2019) NSF Graduate Research Fellowship Google Research Fellowship Esther's lab at CU Boulder recruits PhD students and postdocs interested in statistical/geospatial ML and context-driven research for real-world problems. She teaches graduate courses in machine learning and geospatial ML at CU Boulder.
Alan Montgomery is a Professor of Marketing at Carnegie Mellon University's Tepper School of Business, where he has held a tenured position since 2018 (previously as Associate Professor from 2005-2017). He also maintains an affiliation with the Machine Learning Department at CMU's School of Computer Science, demonstrating his interdisciplinary research approach at the intersection of marketing, economics, and computational methods. Dr. Montgomery earned his educational credentials from prestigious institutions: Ph.D. in Marketing/Economics, University of Chicago (1994) MBA, University of Chicago (1994) BS in Economics, University of Illinois at Chicago (1989) His research focuses on applying advanced quantitative methods to marketing problems, with particular expertise in consumer behavior modeling, clickstream data analysis, pricing strategies, and micro-marketing. Dr. Montgomery's work bridges traditional marketing theory with computational approaches, making significant contributions to both academic literature and practical business applications. His research often involves large-scale data analysis to uncover patterns in consumer decision-making processes, with recent work exploring mental accounting, bandit algorithms, and the impact of digital phenomena like movie piracy on traditional markets. Dr. Montgomery has received notable recognition including the 1999 Mitchell Prize from the American Statistical Association for his paper "Estimating Price Elasticities with Theory-based Priors." His work has been published in top-tier journals across marketing, economics, and computer science disciplines, demonstrating the interdisciplinary impact of his research. As an educator and mentor, Dr. Montgomery has advised numerous PhD students and collaborated extensively with researchers across multiple institutions. His interdisciplinary approach has led to collaborations with computer scientists studying web browsing behavior and economists examining consumer decision frameworks. His research has been supported by various grants throughout his career, enabling extensive data collection and analysis projects. Dr. Montgomery's work spans multiple research environments, including collaborations with the Machine Learning Department at CMU's School of Computer Science. His research group likely focuses on applying computational methods to marketing problems, particularly in the areas of consumer behavior modeling, clickstream analysis, and data-driven marketing strategies. His recent work shows increasing integration of machine learning techniques with traditional marketing research methodologies.
Michael C. Frank is the Benjamin Scott Crocker Professor of Human Biology at Stanford University and Director of the Symbolic Systems Program. He leads the Stanford Language and Cognition Lab and has pioneered large-scale collaborative projects including Wordbank (open vocabulary data), MetaLab (developmental meta-analyses), ManyBabies (replication network), childes-db (language transcripts), and Peekbank (eye-tracking repository). His research examines children's language learning and its interaction with social cognition, utilizing computational modeling, large datasets, and open science frameworks. Key interests include: Mechanisms of early language acquisition Pragmatic inference in social contexts Cross-cultural variability in cognitive development Data-driven approaches to developmental science Reproducibility and meta-scientific innovation Recent publications (2022-2025) demonstrate strong emphases on: 1) Novel methods for measuring language environments and cognitive abilities, 2) Computational models of learning and perception, 3) Cross-cultural investigations of social cognition, and 4) Infrastructure for open developmental science. The majority employ multimodal data, meta-analytic techniques, and large-scale collaborations. He teaches courses including Experimental Methods, Developmental Psychology, and interdisciplinary seminars on language, cognition, and computation. His lab maintains active research teams across multiple continents through initiatives like ManyBabies and LEVANTE.
