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 .
Jun-Kun Wang is an Assistant Professor at the University of California, San Diego (UCSD), with a joint appointment in the Department of Electrical and Computer Engineering and the Halicioğlu Data Science Institute. He joined UCSD in July 2023, previously serving as a postdoc at Yale University. His research focuses on optimization, sampling, and machine learning, emphasizing acceleration techniques and theoretical guarantees. He explores connections between optimization and areas like no-regret learning, sampling, and hypothesis testing. Education: PhD in Computer Science from Georgia Tech (advised by Jacob Abernethy), M.S. in Communication Engineering and B.S. in Electrical Engineering from National Taiwan University. Research Interests: Acceleration in optimization and sampling, trustworthy machine learning, momentum methods, and algorithmic convex optimization. His work bridges theoretical foundations and practical applications, with publications in top-tier venues like COLT, ICML, ICLR, and NeurIPS. Teaching: Courses include ECE 174 (Linear/Nonlinear Optimization), ECE 273 (Convex Optimization), and DSC 211 (Optimization). His lectures cover topics such as gradient descent, duality theory, mirror descent, and non-convex optimization. Lab/Team: Leads the Optimization and Machine Learning Group, advising PhD students Can Chen and Maria-Eleni Sfyraki, and MS student Yi Liu. His group focuses on theoretical and applied aspects of optimization algorithms.
Massachusetts Institute of TechnologyUnited States
Gabriele Farina is an Assistant Professor at MIT in the Department of Electrical Engineering and Computer Science (EECS) and the Laboratory for Information and Decision Systems (LIDS), with additional affiliations at the Operations Research Center (ORC). Holding the X-Window Consortium Career Development Chair, his research focuses on theoretical and algorithmic foundations for learning and computational decision-making under imperfect information, integrating game theory, machine learning, optimization, and statistics. He previously served as a Research Scientist at Meta's Fundamental AI Research (FAIR) group, where he contributed to Cicero, a human-level AI agent combining strategic reasoning and natural language. Ph.D. in Computer Science from Carnegie Mellon University (advisor: Tuomas Sandholm) Facebook Fellowship (2019-2020) in Economics and Computation Recipient of multiple awards including ACM SIGecom dissertation award, NSF CAREER, and AI2050 Early Career Fellow His research spans four key areas: (1) No-Regret Learning Dynamics in extensive-form games; (2) Correlation and Mediated Equilibria in sequential decision-making; (3) Team Games and Team Max-Min Equilibria; and (4) Human Modeling and Equilibrium Perfection. His work addresses challenges in scalable equilibrium computation, stability of learning algorithms, and robustness to mistakes in multi-agent systems. Recent publications highlight advancements in polynomial-time equilibrium computation, cautious optimism algorithms, and connections between regret minimization and mirror descent. These contributions appear in top venues like COLT, NeurIPS, ICML, and AAAI, with keywords spanning game theory, optimization, and machine learning. NSF CAREER award AI2050 Early Career Fellow Facebook Fellowship ACM SIGecom dissertation award GameSec 2024 best paper award ICLR 2023 outstanding paper honorable mention His research group at MIT collaborates on projects involving strategic reasoning, human-level AI agents, and equilibrium refinements, with applications to games like Diplomacy and poker. Current efforts include developing faster algorithms for correlated equilibria and exploring connections between machine learning and economic theory.
Swiss Federal Institute of Technology in LausanneSwitzerland
Giancarlo Ferrari Trecate is an Adjunct Professor at the Swiss Federal Institute of Technology Lausanne (EPFL) , affiliated with the School of Engineering and the SCI-STI-GFT department. He is also involved in teaching and research through the STI-SGM and EDRS-ENS programs. Research Interests : Automatic control, state estimation, system identification, machine learning, distributed control, hybrid systems, microgrids, biochemical networks, voltage and frequency stabilization in AC/DC microgrids. Publications Trends : His recent work focuses on integrating Neural ODEs and Hamiltonian structures for stable control systems, regret minimization in distributed control, and robust state estimation under uncertainty. Applications include autonomous mobility-on-demand , power grid optimization , and secure microgrid control against cyber-attacks. Scientific Awards : No specific awards mentioned in the provided data. Teaching & Advising : He supervises PhD students in mechanical engineering and teaches courses on Multivariable control and Networked control systems . His lab, DECODE , specializes in Dependable Control and Decision systems.
Aaron Roth is the Henry Salvatori Professor of Computer and Cognitive Science at the University of Pennsylvania, affiliated with the Department of Computer and Information Science in the School of Engineering and Applied Science. He holds a secondary appointment in the Department of Statistics and Data Science at the Wharton School and is associated with several research centers including PRiML, the Warren Center for Network and Data Sciences, and the AMCS program. He received his PhD from Carnegie Mellon University under Avrim Blum and was a postdoc at Microsoft Research New England. His research focuses on algorithms and machine learning, particularly in private data analysis, fairness in machine learning, game theory, mechanism design, and learning theory. His work bridges theoretical computer science with societal concerns, advocating for ethically aware algorithm design. He co-authored the book The Ethical Algorithm with Michael Kearns, which explores how to embed social values like privacy and fairness into algorithmic systems. His recent publications show a strong trend toward uncertainty quantification, multicalibration, conformal prediction, and fairness in reinforcement learning and high-dimensional settings. He frequently publishes in top-tier venues such as STOC, FOCS, ICML, NeurIPS, and COLT, often with a focus on rigorous theoretical foundations with practical implications. Hans Sigrist Prize Presidential Early Career Award for Scientists and Engineers (PECASE) Alfred P. Sloan Research Fellowship NSF CAREER award Google Faculty Research Award Amazon Research Award Yahoo Academic Career Enhancement award Roth has advised numerous PhD students and postdocs, many of whom now hold academic or industry research positions. He is also an Amazon Scholar at AWS and has served in advisory roles for companies like Apple, Facebook, Leapyear, and Spectrum Labs. He has been active in organizing workshops and tutorials on differential privacy, fairness, and adaptive data analysis, and has given keynotes at major conferences and institutions worldwide. He leads research groups and collaborates widely across Penn, focusing on responsible AI, privacy, and algorithmic fairness. His lab produces foundational work on calibration, unlearning, privacy-preserving learning, and equitable decision-making systems.
University of Illinois Urbana-ChampaignUnited States
Jeff Shamma is the Department Head and Professor of Industrial and Enterprise Systems Engineering (ISE) at the University of Illinois at Urbana-Champaign, holding the Jerry S. Dobrovolny Chair. He is also courtesy Professor in Aerospace Engineering and Mechanical Science and Engineering. Formerly, he held the Julian T. Hightower Chair at Georgia Institute of Technology and faculty positions at KAUST. Dr. Shamma earned his PhD in Systems Science and Engineering from MIT (1988) and a BS in Mechanical Engineering from Georgia Tech (1983). He is a Fellow of IEEE and IFAC, recipient of the IFAC High Impact Paper Award, AACC Donald P. Eckman Award, and NSF Young Investigator Award. His research spans Decision and Control , Game Theory , and Multi-Agent Systems , focusing on human-machine networks, distributed autonomy, and adaptive robotic systems. Recent work examines crowd dynamics, risk-sensitive control, and feedback linearization for constrained optimization. Jeff has served as Editor-in-Chief of IEEE Transactions on Control of Network Systems (2020–2024) and held editorial roles in journals like Annual Reviews in Control and IEEE Transactions on Robotics . His 15 most recent publications (2024–2025) analyze learning dynamics, multi-agent optimization, and UAV-crawler systems, reflecting trends in autonomous systems, game-theoretic modeling, and industrial inspection technologies. Scientific distinctions include: Fellow of IEEE and IFAC IFAC High Impact Paper Award (2020) AACC Donald P. Eckman Award (1996) NSF Young Investigator Award (1992) Mohammed Dahleh Distinguished Lecture Award (2013) Dr. Shamma advises current PhD students Hassan Abdelraouf, Aya Hamed, and Nawaf Otaibi, with former advisees including Sarah Toonsi (2025) and Fat-hy Rajab (2025). His lab integrates theoretical research with applied projects like FalconScan, a UAV-crawler system for industrial inspection, and develops magnetic legs for curved surface UAV landing.
Ioannis Panageas is an Assistant Professor in Computer Science at UC Irvine's Donald Bren School, directing the GOALLab. His research develops theory for learning in multi-agent systems, game dynamics, and optimization. Funded by NSF and NRF, he focuses on last-iterate convergence guarantees in games, efficient equilibrium computation, and multi-agent reinforcement learning. Recent Work: Provides first exponential lower bounds for fictitious play in potential games (NeurIPS 2023), efficient Nash equilibrium computation methods (ICLR 2023), and semi-bandit learning dynamics with no-regret guarantees (ICML 2023). Teaching: Offers courses in Algorithmic Game Theory and Optimization for Machine Learning. Currently advising 3 PhD students and 2 MS students.
Anant Sahai is the Qualcomm Chair Professor in the Department of Electrical Engineering and Computer Sciences (EECS) at the University of California, Berkeley. He holds affiliations with the Berkeley Artificial Intelligence Research Lab (BAIR), Berkeley Laboratory for Information and System Sciences (BLISS), and the Berkeley Wireless Research Center (BWRC). His academic journey includes a BS from UC Berkeley (1994), and MS (1996) and PhD (2001) degrees from MIT. He previously worked at Enuvis, Inc., focusing on adaptive software radio techniques for low-SNR GPS environments. Research interests span machine learning, wireless communication, information theory, signal processing, and decentralized control, with a focus on intersections between these fields. Key areas include spectrum sharing, ultra-reliable low-latency wireless protocols, and the foundations of overparameterized machine learning. Recent work explores in-context learning in modern AI models. He has received awards such as the IEEE ComSoc Leonard G. Abraham Prize (2012) and teaching/mentorship accolades at Berkeley. He advises UC Berkeley’s Eta Kappa Nu chapter and coordinates machine learning efforts for NSF’s SpectrumX. Current teaching includes CS 182/282A on deep neural networks. His lab focuses on theoretical and applied challenges in communication systems, AI, and control theory. Awards: IEEE ComSoc Leonard G. Abraham Prize (2012), Teaching Excellence Awards (2015–2017) Grants: NSF Center for Spectrum Innovation (SpectrumX), multiple collaborative projects in wireless and AI Labs/Teams: BLISS, BAIR, BWRC
Jiyun Kang serves as an Associate Professor at Purdue University's White Lodging-J.W. Marriott, Jr. School of Hospitality and Tourism Management within the College of Health and Human Sciences. Her research examines consumer behavior, well-being, and sustainable practices across fashion, luxury, and retail sectors, with emphasis on artificial intelligence applications, crisis management, and corporate social responsibility initiatives. Her academic credentials include: PhD in Human Ecology from Louisiana State University (2010) MS in Business/Marketing from Seoul National University (2005) BA in English Language and Literature from Korea University (2002) Dr. Kang's research spans consumer psychology, sustainable consumption, and digital innovation in retail. She investigates decision fatigue in luxury contexts, AI-driven mitigation of purchase hesitation, and psychological ownership in fashion subscription models. Her work consistently employs quantitative methods including machine learning and causal modeling to analyze brand-consumer dynamics during ethical crises and sustainability transitions. Analysis of her 2022-2025 publications reveals three dominant trends: (1) blockchain/NFT applications for luxury authentication, (2) AI ethics in retail crisis management, and (3) intersectional approaches to sustainable fashion through psychological ownership frameworks. Methodologically, she increasingly integrates natural language processing with traditional consumer behavior models to examine corporate social responsibility perceptions. Scientific awards: No awards are documented in the provided materials. Advising and grants: The source text contains no information regarding graduate student mentorship or externally funded research projects.
Chicheng Zhang is an Assistant Professor in the Computer Science Department at the University of Arizona, where he conducts research in the theory and applications of interactive machine learning. He earned his Ph.D. in Computer Science from the University of California, San Diego (UCSD) in 2017 under the supervision of Professor Kamalika Chaudhuri, and was previously an undergraduate student at Peking University working with Professor Liwei Wang. From 2017 to 2019, he was a postdoctoral researcher at the Machine Learning Group at Microsoft Research NYC. His research lies at the intersection of learning theory and practical algorithm design, focusing on interactive machine learning paradigms such as reinforcement learning, contextual bandits, active learning, and imitation learning. He aims to develop algorithms that are data-efficient, computationally tractable, and robust, with applications in healthcare, wireless communication, and fair AI systems. His work emphasizes principled algorithm design with theoretical guarantees and empirical validation. The most recent publications reflect a strong trend in developing efficient, theoretically grounded methods for sequential decision-making and interactive learning. Key themes include sample efficiency, robustness to noise, fairness in algorithmic decisions, and application-driven research in domains like oral cancer detection and mmWave network optimization. His work frequently bridges theoretical analysis with real-world deployment considerations. While no scientific awards are mentioned in the provided text, Dr. Zhang actively mentors prospective PhD students and encourages collaboration. He has contributed to interdisciplinary projects involving fairness-aware bandit algorithms for network coexistence, interpretable classifiers for cancer detection, and LLM-based initialization for reinforcement learning. His lab focuses on developing intelligent agents that actively learn from environments and human experts. He can be reached at chichengz@arizona.edu .
Jordan Etkin is an Associate Professor of Marketing at Duke University’s Fuqua School of Business, specializing in studies of goal pursuit, motivation, and time management. She explores how goal structures, variety in activities, and personal quantification impact behavior and well-being. Her research bridges consumer behavior, psychology, and decision science, with frequent publications in top-tier journals like the Journal of Consumer Research and Journal of Marketing Research. Education: PhD (Year not specified, but teaches since 2013) Her research interests focus on the interplay between goals and personal resources (e.g., time), including unintended consequences of tracking behaviors like step-counting. Key themes include motivation dynamics, goal conflict resolution, and temporal resource allocation. She frequently engages with popular media, appearing in outlets like the New York Times and BBC. Recent work (2020–2024) highlights topics such as time limits paradoxically increasing consumption, variety’s role in goal conflict, and machine learning’s applications in behavioral research. Her 2019 JCR Award underscores scholarly impact. Awards: 2019 JCR Awards Announcements (Recipient) Teaching responsibilities include the Marketing Core class for Fuqua’s MBA program. While no lab teams are explicitly mentioned, her research themes suggest collaborative work in behavioral science and consumer studies.
Dr. Kevin G. Jamieson is a faculty member at the University of Washington , School of Computer Science , with prior affiliations at the University of California, Berkeley (Department of Electrical Engineering and Computer Sciences) and the University of Wisconsin-Madison (Department of Electrical and Computer Engineering). His work spans machine learning, reinforcement learning, bandit algorithms, and robotics. Current university: University of Washington Academic rank: Professor His research focuses on: Bandit algorithms and sequential decision-making Optimization in non-stationary environments Reinforcement learning with real-world applications Multi-agent systems and game theory Efficient data selection for multimodal learning Human-in-the-loop AI systems Recent publications highlight his expertise in pure exploration strategies, robotic manipulation, and bridging simulation-to-reality gaps in RL. He has mentored numerous collaborators, though formal student advising details are not explicitly listed here. No scientific awards are mentioned in the provided data.
Max Planck Institute for Evolutionary AnthropologyGermany
Mahsa Ghasemi is an Assistant Professor in the Elmore Family School of Electrical and Computer Engineering at Purdue University, leading the AKADEMI Group. Her research focuses on theoretical advancements in trustworthy sequential decision-making for autonomous systems, emphasizing human-aware collaboration and adaptation to dynamic environments. She is affiliated with the Institute for Control, Optimization and Networks (ICON). Education: PhD in Electrical and Computer Engineering from The University of Texas at Austin (2021), MSE in Mechanical Engineering (2017), and BSc in Mechanical Engineering from Sharif University of Technology (2014). Research Interests: Reinforcement learning, control theory, active perception, multi-agent systems, robotics, and online learning. Applications span disaster response, healthcare, and autonomous systems design. Key methodological directions include compositional learning, human-AI collaboration, and adaptive decision-making under uncertainty. Teaching: Courses include Reinforcement Learning Theory (ECE 59500), Introduction to Reinforcement Learning (ECE 49595), and Python for Data Science (ECE 20875). Awards: Finalist for Student Best Paper Award at the 2018 American Control Conference (ACC). Students: Current advisees include Maheed H. Ahmed, Jayanth Bhargav, and Somtochukwu Oguchienti. Past members include Lai Wei and Juan Sebastian Mateo Ruiz Bulla. Service: Editorial roles at ICRA, ICCPS, and IFAC workshops. Reviewer for top conferences (NeurIPS, ICML) and journals (Automatica, IEEE TAC). Labs/Teams: Leads the AKADEMI Group, focusing on algorithmic and theoretical research in autonomous decision-making systems.
Tianyi Lin serves as an Assistant Professor in the Department of Industrial Engineering and Operations Research (IEOR) at Columbia Engineering, Columbia University, a position he assumed in 2024. He holds dual affiliations as a verified Data Science Institute (DSI) Member and an Affiliated Member of both the Financial and Business Analytics Center and the Foundations of Data Science Center. His academic credentials include: Ph.D. in Electrical Engineering and Computer Science, UC Berkeley Postdoctoral Researcher, Laboratory for Information & Decision Systems (LIDS), MIT (2023-2024) M.S. in Operations Research, UC Berkeley M.S. in Pure Mathematics and Statistics, University of Cambridge B.S. in Mathematics, Nanjing University Dr. Lin's research spans optimization theory , game-theoretic models , and machine learning algorithms , with emphasis on nonconvex minimax problems , variational inequalities , and data science applications . His work bridges theoretical guarantees with practical implementations in high-dimensional settings, particularly focusing on convergence properties and computational efficiency in complex systems. Analysis of his 15 most recent publications (2022-2025) reveals dominant themes in high-order optimization methods , no-regret learning in games , and optimal transport algorithms . His contributions demonstrate consistent innovation in developing doubly optimal algorithms for monotone games, spectral regularization techniques for policy optimization, and structure-driven approaches for nonconvex problems, reflecting strong interdisciplinary connections between operations research, computer science, and applied mathematics. No scientific awards or honors were documented in the provided source material. Information regarding student advising and research grants remains unspecified in the current documentation, though his center affiliations suggest active participation in collaborative research initiatives. Dr. Lin maintains significant interdisciplinary engagement through his affiliations with Columbia's Data Science Institute and specialized research centers, positioning his work at the intersection of theoretical optimization and real-world data science applications.
Samory Kpotufe is an Associate Professor of Statistics at Columbia University's Faculty of Arts and Sciences, affiliated with the Data Science Institute (DSI) as a Foundations of Data Science Co-Chair. He holds additional affiliations in Cybersecurity, Health Analytics, and Smart Cities. His academic journey includes a PhD in Computer Science from UC San Diego (2010), followed by research roles at the Max Planck Institute, Toyota Technological Institute at Chicago, and Princeton University's ORFE department. His research focuses on nonparametric methods and high-dimensional statistics, emphasizing adaptive procedures that self-tune to unknown data structures (e.g., manifolds, sparsity) while addressing modern application constraints like computational efficiency and labeling costs. Key themes include transfer learning, active learning, and online algorithms. Notable contributions span theoretical guarantees for nearest-neighbor methods, covariate shift adaptation, and contextual bandits. His work often bridges statistical theory and practical machine learning challenges, with applications in IoT, cybersecurity, and anomaly detection. He has led collaborative grants, such as the NSF CPS project on data augmentation for IoT systems. As a DSI member and Foundations Co-Chair, he contributes to advancing data science foundations through interdisciplinary collaboration. His lab's research frequently explores the interplay between algorithmic performance and intrinsic data properties.
