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 .
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.
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.
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.
Mohammadtaghi Hajiaghayi is the Jack and Rita G. Minker Professor of Computer Science at the University of Maryland, College Park. He is affiliated with the Robert H. Smith School of Business and holds Research Affiliate positions at MIT CSAIL and the Center for Discrete Mathematics and Theoretical Computer Science (DIMACS). His research focuses on algorithms, game theory, and network design, supported by NSF, ONR, and industry grants. He has received prestigious awards including ACM Fellow (2018) and EATCS Nerode Prize (2015) for his work on bidimensionality theory. Education: PhD from MIT (2005), postdocs at CMU and MIT, MSc from University of Waterloo, and BSc from Sharif University. He teaches courses like Data Science and Algorithms at UMD. Industry experience includes roles at Amazon, Google, and AT&T Labs. Over 20 students have graduated under his advisement, many in academia and industry. His work spans approximation algorithms, game theory, and big data. Projects include BigDND with Erik Demaine. He serves on editorial boards of Algorithmica, SODA, and others. Awards also include IEEE Fellow (2020) and Blavatnik Honoree (2020).
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.
Roy Dong is an Assistant Professor at the University of Illinois at Urbana-Champaign, affiliated with the Coordinated Science Laboratory. His research bridges Control Theory Economics Statistics Optimization to address challenges in cyber-physical systems and the Internet of Things, focusing on data manipulation, privacy, and strategic behavior in interconnected systems. His academic journey includes a Ph.D. in Electrical Engineering and Computer Sciences from UC Berkeley (2017) and dual B.S. degrees in Economics and Computer Engineering from Michigan State University (2010). At Illinois, he teaches courses ranging from Control Systems to Convex Optimization , with multiple teaching excellence awards. Roy's research explores Closed-loop effects of machine learning Causality in decision systems Incentive design for strategic agents Privacy-utility tradeoff optimization Human behavior modeling with applications in smart grids, transportation networks, and semi-autonomous vehicles. His work formulates privacy-preserving mechanisms as optimization problems, balancing data utility against user privacy in dynamic systems. Article trends show expertise in Game theory for strategic data sources Energy disaggregation techniques Nonlinear basis pursuit algorithms Privacy-aware control systems with a focus on cyber-physical systems and human-in-the-loop applications. Scientific recognition includes 'Teacher Ranked as Excellent' awards (ECE 120, ECE 486, ECE 515) Contributions to smartSDH building control and CPRL compressive sensing Roy leads the Privacy-aware Control Systems research group, collaborating with institutions like UC Berkeley and Michigan State University , and directs projects funded by grants including the New USDA NIFA grant for agricultural robot autonomy .
Laura Toni is an Associate Professor in the Department of Electronic and Electrical Engineering at University College London's Faculty of Engineering Sciences. She serves as the leader of a research team focused on advanced signal processing and machine learning applications, documented at https://lasp-ucl.github.io . Additionally, she holds prestigious affiliations as an ELLIS (European Laboratory for Learning and Intelligent Systems) Member and Turing Fellow Alumni. PhD in Electrical Engineering, University of Bologna (2009) MS in Electrical Engineering, University of Bologna (2005) Professor Toni's research spans theoretical and applied aspects of machine learning with particular emphasis on graph-based approaches. Her work integrates signal processing techniques with modern AI methodologies to address complex problems in communication systems, multimedia processing, and scientific discovery. She has made significant contributions to reinforcement learning theory, graph signal processing, and their applications across diverse domains including drug discovery and immersive technologies. Analysis of her recent publications reveals a strong focus on graph-based machine learning approaches, with increasing emphasis on reinforcement learning applications. Her work demonstrates a progression from theoretical foundations to practical implementations, particularly in multimedia processing, network science, and drug discovery applications. Many of her recent papers combine graph neural networks with diffusion models and reinforcement learning for complex prediction and generation tasks. Professor Toni has received notable recognition through her ELLIS membership and Turing Fellow Alumni status, which represent significant achievements in the European AI research community. ELLIS (European Laboratory for Learning and Intelligent Systems) Member Turing Fellow Alumni As an academic leader, Professor Toni supervises postgraduate students and leads a research team at UCL, focusing on cutting-edge projects at the intersection of signal processing and machine learning. Her team has secured research funding through various channels including European initiatives and industry partnerships, enabling them to pursue ambitious projects in graph learning, reinforcement learning, and multimedia processing. The team actively collaborates with institutions worldwide, including previous connections with UCSD and EPFL. Professor Toni leads the LASP research group at UCL (https://lasp-ucl.github.io), which focuses on Large-scale Adaptive Signal Processing for intelligent systems. The team comprises researchers working on graph signal processing, reinforcement learning, and multimedia applications, with strong connections to both theoretical foundations and practical implementations across various domains including healthcare, communications, and immersive technologies.
Cameron Musco is an Assistant Professor in the Manning College of Information and Computer Sciences at the University of Massachusetts Amherst. He is affiliated with the Theory Group and conducts research at the intersection of theoretical computer science, numerical linear algebra, and machine learning. His work focuses on randomized algorithms, streaming, and distributed computation, with applications in data science. Education: PhD in Computer Science, MIT (2019) BS in Computer Science and Applied Mathematics, Yale University Research Interests: Musco's research emphasizes algorithm design for large-scale data analysis, including fast randomized methods for linear algebraic problems. He explores topics such as low-memory computation, matrix approximations, and graph algorithms, driven by applications in machine learning and distributed systems. Publications: His recent work spans advancements in hierarchical matrix approximation, graph-based nearest neighbor search, and fair resource allocation, reflecting expertise in both theoretical foundations and practical algorithmic innovation. Awards: He has received an NSF Career Award, Google Research Scholar Award, and recognition for anti-racism leadership. He actively reviews for top conferences in theoretical computer science and machine learning. Advising & Grants: Musco advises multiple PhD students and has grants from NSF and Google. His lab collaborates on projects like low-rank matrix approximation and causal discovery. Labs/Teams: He is part of the Theoretical Computer Science Group and the Center for Data Science at UMass.
Onesun Steve Yoo is a Professor of Operations and Marketing Analytics at the UCL School of Management, University College London, and Co-Director of the UCL Centre for Sustainable Business. He holds a PhD from UCLA Anderson School of Management, alongside advanced degrees in Electrical Engineering and Applied Mathematics from UC Berkeley and UCLA. His research focuses on innovation and entrepreneurship, examining operational and marketing strategies for firms launching innovative products/services. Key areas include consumer behavior analysis, pricing policies, sequential product launches, and the impact of technologies like surge pricing and AI-driven data analytics on business operations. Recent work integrates sustainability initiatives with AI to enhance operational transparency in supply chains and regulatory compliance. Yoo’s research has been published in top journals such as Marketing Science , Operations Research , and Manufacturing & Service Operations Management . His findings have been cited by US policymakers and featured in media outlets like the Wall Street Journal . He serves as a senior editor at Production and Operations Management and associate editor at Manufacturing & Service Operations Management . His academic service includes grants from Innovate-UK (UKRI) to collaborate with industry on sustainable business practices. Yoo’s work bridges theoretical research with practical applications, emphasizing data-driven decision-making and interdisciplinary collaboration between operations, marketing, and sustainability domains.
Krishna Jagannathan is a full-time Professor in the Department of Electrical Engineering at the Indian Institute of Technology Madras (IIT Madras), India. He specializes in stochastic modeling, communication networks, information theory, and queuing theory. He obtained his B.Tech from IIT Madras in 2004, followed by S.M. and Ph.D. degrees from MIT in 2006 and 2010, respectively. After post-doctoral positions at Caltech and MIT, he joined IIT Madras in 2011. Education: B.Tech in Electrical Engineering, IIT Madras (2004) S.M. in Electrical Engineering and Computer Science, MIT (2006) Ph.D. in Electrical Engineering and Computer Science, MIT (2010) Research Interests: His research focuses on stochastic modeling and analysis of communication networks , information theory , and queuing theory . He has made significant contributions to understanding network performance, resource allocation, and risk-aware decision-making in complex systems. He leads the Networks and Stochastic Systems lab at IIT Madras, mentoring a large cohort of Ph.D. and M.S. students working on cutting-edge problems in networking, optimization, and stochastic systems. Scientific Awards: Best Paper Award at WiOpt 2013, Tsukuba, Japan Young Faculty Recognition Award for Excellence in Teaching and Research, IIT Madras (2014) Teaching & Mentorship: He has taught a wide range of courses including Probability Foundations , Stochastic Modeling and Queuing Theory , Convex Optimization , and Signals & Systems , consistently receiving high teaching evaluations. He has supervised over 15 Ph.D. and M.S. students to completion and continues to guide several active researchers.
Csaba Szepesvari is a Professor in the Department of Computing Science at the University of Alberta and Canada CIFAR AI Chair at Amii. His research focuses on developing efficient learning algorithms for sequential decision making problems, with particular emphasis on reinforcement learning theory, online learning, and bandit algorithms. Research interests include: Foundations of reinforcement learning and online decision making Convergence properties of learning algorithms Bandit problems and exploration-exploitation tradeoffs Function approximation in machine learning His publications demonstrate consistent theoretical contributions to understanding algorithmic convergence, complexity, and efficiency in reinforcement learning. Recent work explores LLM uncertainty estimation, policy gradient methods, and offline-to-online learning transitions. Leadership roles include: Foundations team lead at DeepMind Organizer of RL Theory Virtual seminar series He mentors graduate students in theoretical machine learning through the University of Alberta and Amii research programs.
Travis Desell is a Professor in the Department of Software Engineering at Rochester Institute of Technology (RIT), part of the B. Thomas Golisano College of Computing and Information Sciences. His research focuses on data science and machine learning applied to large-scale datasets using high-performance and distributed computing. He specializes in neuro-evolution, combining evolutionary algorithms with neural networks, particularly through his EXACT and EXAMM algorithms. He leads the D2S2 Lab and has developed the SALSA programming language based on the actor model. Currently funded projects include the National General Aviation Flight Information Database (NGAFID) and an NSF award exploring contextual bandits for decision-making in cyber-physical systems. His work emphasizes practical scientific applications, including stock forecasting, power plant data prediction, and explainable time series models. Education details are not explicitly provided, but his roles and publications indicate advanced academic credentials. Research interests span neuro-evolutionary techniques, recurrent neural networks, and distributed computing frameworks. Key projects include EXAMM for time series forecasting and NGAFID for flight safety analysis. Collaborations involve students and teams at RIT and beyond, with a focus on advancing AI-driven solutions in dynamic environments. Lab affiliations include the D2S2 Lab, where he mentors students and conducts cutting-edge research. Current opportunities exist for PhD students with backgrounds in software engineering and expertise in areas like NLP, web development, and distributed systems.
