Find Academic Supervisors

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 .

• Machine Learning
• Active Learning
• Multi-Armed Bandits
• +4 more

Benjamin Van Roy is a Professor at Stanford University since 1998, affiliated with the Departments of Electrical Engineering and Management Science and Engineering, and the Institute for Computational and Mathematical Engineering. He leads the Efficient Agent Team at Google DeepMind and previously held leadership roles at Morgan Stanley, Unica, and Enuvis. He holds SB, SM, and PhD degrees in Computer Science and Electrical Engineering from MIT, advised by John Tsitsiklis. His research focuses on reinforcement learning, alignment, and information theory, with contributions to machine learning foundations, optimization, and finance. He has authored over 150 publications, including influential works on Thompson Sampling, approximate dynamic programming, and exploration strategies. His honors include INFORMS and IEEE Fellowships and the INFORMS Lanchester Prize. Van Roy advises doctoral students across academia and industry, with graduates at top institutions and companies like Meta, Tesla, and Citadel. He teaches courses on reinforcement learning, stochastic control, and optimization. His open-source projects include Epistemic Neural Networks and the Neural Testbed for evaluating machine learning models. Key contributions include foundational work in reinforcement learning theory, scalable methods for recommendation systems, and applications in finance and resource allocation. His research bridges theoretical insights with practical applications, emphasizing alignment and safety of AI systems.

• Reinforcement Learning
• Machine Learning
• Artificial Intelligence
• +4 more

David B. Shmoys is the Laibe/Acheson Professor of Business Management & Leadership Studies at Cornell University's School of Operations Research and Information Engineering (ORIE) and holds a joint appointment in the Department of Computer Science. He is a leading researcher in approximation algorithms, stochastic optimization, and computational sustainability. His work emphasizes data-driven decision-making in enterprise and society, with applications ranging from healthcare logistics to environmental conservation. Shmoys has advised 27 Ph.D. students and served as an editorial board member for top journals like Operations Research and Mathematics of Operations Research. Education: Ph.D. in Computer Science, University of California, Berkeley (1984). Postdoctoral positions at MSRI and Harvard University, followed by faculty roles at MIT before joining Cornell. Research Interests: Design and analysis of approximation algorithms for NP-hard problems, stochastic optimization, scheduling, facility location, and inventory management. Applications include computational sustainability, epidemiological modeling, and political districting optimization. Articles Trends: Focus on optimization under uncertainty, computational sustainability, and real-world applications like air ambulance routing, bike-sharing systems, and gerrymandering analysis. Notable works include the 2018 Wagner Prize-winning paper on bike-sharing analytics and the 2013 Lanchester Prize-winning textbook on approximation algorithms. Awards: Lanchester Prize (2013), Daniel H. Wagner Prize (2018), Fellowships from ACM, INFORMS, and SIAM, NSF Presidential Young Investigator (1987). Advising & Grants: Over 27 advised Ph.D. students, with former students at MIT, Waterloo, Brown, and D-Wave. Active in grants related to data science and sustainability. Labs/Teams: Involved in the Institute of Computational Sustainability at Cornell, focusing on applying algorithms to environmental challenges. Collaborates with organizations like Motivate (bike-sharing) and Ornge (air ambulance services).

• Operations Research
• Computer Science
• Optimization
• +4 more

Robert Ghrist is the Andrea Mitchell University Professor at the University of Pennsylvania with dual appointments in the Department of Mathematics and the Department of Electrical and Systems Engineering. He serves as Associate Dean for Undergraduate Education for Penn Engineering. His educational background includes a B.S. in Mechanical Engineering from the University of Toledo (1991), and M.S. and Ph.D. degrees in Applied Mathematics from Cornell University (1994, 1995). Ghrist's research bridges pure and applied mathematics, focusing on applied algebraic topology , dynamical systems , and geometric methods in data science. His work extends to network theory, topological data analysis, and computational geometry, with applications spanning robotics, neuroscience, and social dynamics. Key innovations include developing sheaf-theoretic approaches for networked systems and persistence homology techniques for high-dimensional data. Analysis of his recent publications reveals a strong emphasis on lattice-theoretic frameworks , topological robotics , and network dynamics , with emerging applications in neural data interpretation and geometric computing. His research consistently integrates category theory with real-world engineering challenges. Significant scientific recognition includes: Presidential Early Career Award (PECASE, 2004) Scientific American 'Top 50' Research Leader (2007) Mathematical Association of America's Chauvenet Prize (2013) University of Pennsylvania Lindback Award for Distinguished Teaching (2015) DoD National Security Science and Engineering Faculty Fellowship (NSSEFF, 2015) Ghrist leads multiple federally funded research initiatives supported by AFOSR, DARPA, NSF, and ONR. He directs the development of educational tools including the Calculus BLUE/GREEN Project video series and custom GPTs for mathematical pedagogy. His open online courses have reached over 100,000 learners globally.

• Applied Topology
• Dynamical Systems
• Algebraic Topology
• +5 more

Clifford Stein is a Professor of Industrial Engineering and Operations Research (IEOR) and Computer Science at Columbia University, and Associate Director for Research at the Data Science Institute. He holds a Ph.D. (1992), M.S. (1989), and B.S.E. (1987) from MIT and Princeton University, respectively. His research focuses on algorithms, combinatorial optimization, operations research, scheduling, and computational biology. A co-author of the best-selling textbook Introduction to Algorithms , Stein has published widely in top venues and holds prestigious awards like ACM Fellow and NSF Career Award. His work includes foundational contributions to minimum cut algorithms, scheduling theory, and network optimization, supported by NSF and Sloan Foundation grants. Stein has advised over 40 graduate and undergraduate students, many now in academia and industry.

• Algorithms
• Combinatorial Optimization
• Operations Research
• +4 more

Suhas Diggavi is a Professor in the Department of Electrical and Computer Engineering at the University of California, Los Angeles, within the Henry Samueli School of Engineering and Applied Science. His primary research area is Signals and Systems, with a strong focus on information theory and its interdisciplinary applications. His research interests span Information Theory , Machine Learning , Differential Privacy , Federated Learning , Cyber-Physical Systems , and Bio-informatics . He investigates fundamental limits and practical algorithms for secure, efficient, and robust data processing in distributed and networked environments. The recent publications highlight a strong trend in privacy-preserving machine learning, particularly in the shuffled model of differential privacy , communication-efficient distributed SGD , and robust optimization . His work bridges theoretical information-theoretic foundations with real-world applications in federated learning, wireless networks, and genomic data analysis. Notable scientific awards include: Guggenheim Foundation Fellow (2021) ACM CCS Best Paper Award (2021) IEEE Fellow (2013) IEEE Donald G. Fink Prize Paper Award (2006) Multiple Google, Amazon, and Facebook Research Awards Suhas Diggavi actively advises graduate students and leads a research group focused on learning, information, and optimization. His work is supported by major industry grants and collaborations, particularly in privacy and distributed learning. He has made significant contributions to information-theoretic models in bio-sequencing and wireless security. He leads the LIOS (Learning, Information, Optimization, and Stochastic Systems) research group at UCLA, where his team develops theoretical frameworks and practical algorithms for next-generation data-driven systems.

• Information Theory
• Machine Learning
• Differential Privacy
• +9 more

Kazuhiro Saitou is a Professor of Mechanical Engineering at the University of Michigan, affiliated with the College of Engineering. His research focuses on computational design synthesis, topology optimization, and manufacturing process integration. He leads the Algorithmic Synthesis Laboratory (ASL), advancing algorithms for automated design and optimization of mechanical systems. Education: Ph.D. (1996), MIT; M.S. (1992), MIT; B.Eng. (1990), University of Tokyo. He has held tenured positions since 1997, including roles as Founding CEO of Comnext, Inc. (2007–2012) and visiting professorships at École Centrale Paris and Donghua University. Research interests include multi-material topology optimization (M^3 TO), AI-driven design, and sustainable manufacturing. Key projects address additive manufacturing, composite structures, and energy-efficient production systems. He has pioneered methods for manufacturability-driven design and assembly optimization. Notable awards include IEEE Fellow (2018), ASME Kos-Ishii Award (2015), and NSF CAREER Award (1999). He serves as Editor-in-Chief for IEEE Transactions on Automation Science and Engineering and holds leadership roles in ASME and IEEE societies. Teaching includes courses on design optimization, CAD, and global product development. His lab has advised over 30 students, with alumni in academia and industry. Current research explores biomechanical modeling, traffic flow optimization, and medical image registration algorithms.

• Computational Design Synthesis
• Topology Optimization
• Manufacturing Process Optimization
• +7 more

Lijie Chen is an Assistant Professor in the Department of Electrical Engineering and Computer Sciences at UC Berkeley, where he is part of the Berkeley Theory Group. Previously, he was a Miller Research Fellow at UC Berkeley, hosted by Avishay Tal and Umesh Vazirani, and earned his Ph.D. from MIT under Ryan Williams. His research focuses on theoretical computer science, particularly computational complexity theory, with applications to quantum physics and AI safety. Education: Ph.D. in Computer Science from MIT (2022), B.Sc. from Yao Class at Tsinghua University. Research Interests: Complexity theory, quantum complexity, derandomization, circuit lower bounds, and foundational aspects of AI safety. Chen has made significant contributions to understanding fundamental questions in complexity theory, including circuit lower bounds and the connections between randomness and computation efficiency. His work often bridges theoretical insights with practical implications in quantum computing and algorithm design. Awards and Honors: Machtey Award for Best Student Paper (2019). Danny Lewin Best Student Paper Award (2019). Invited to SICOMP Special Issues for FOCS and STOC papers. He has organized workshops on complexity theory and derandomization, and his research has been recognized in venues like STOC, FOCS, and the Journal of the ACM.

• Theoretical Computer Science
• Computational Complexity Theory
• Quantum Complexity Theory
• +4 more

Nina Balcan is a Professor at Carnegie Mellon University and holds the Cadence Design Systems Professorship in Computer Science. She is affiliated with the School of Computer Science, specifically the Machine Learning Department (MLD) and Computer Science Department (CSD). Her research spans foundational aspects of machine learning, artificial intelligence, theoretical computer science, algorithmic game theory, and interdisciplinary connections in learning theory. Machine Learning Artificial Intelligence Theoretical Computer Science Algorithmic Game Theory Multi-Agent Systems Data-Driven Algorithm Design Her recent work focuses on advancing algorithm design through machine learning, robustness in adversarial environments, and economic modeling. Key contributions include Learning to Branch (JACM 2024), Regret Minimization in Stackelberg Games (NeurIPS 2024), and Learning Accurate Decision Trees (UAI 2024, Outstanding Student Paper Award). She has pioneered novel approaches to data-driven optimization, semi-supervised learning, and privacy-preserving clustering. Nina has received prestigious accolades including ACM Fellow AAAI Fellow Simons Investigator 2019 ACM Grace Murray Hopper Award Her teaching at CMU includes graduate courses on machine learning, advanced machine learning, and specialized topics like algorithmic game theory.

• Machine Learning
• Artificial Intelligence
• Theoretical Computer Science
• +12 more

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.

• Combinatorics
• Probability
• Graph Theory
• +3 more

Sung-Kyu Lim is a Professor and the Motorola Solutions Foundation Professor in the School of Electrical and Computer Engineering at the Georgia Institute of Technology, where he serves as director of the GTCAD Laboratory. His educational background includes: B.S. in Computer Science from the University of California, Los Angeles (UCLA) in 1994 M.S. in Computer Science from UCLA in 1997 Ph.D. in Computer Science from UCLA in 2000 Professor Lim's research focuses on advancing VLSI design automation through physical design methodologies, 3D circuit integration, quantum circuit layout, micro-architecture exploration, and reconfigurable circuit optimization. His work bridges theoretical graph theory with practical electronic design automation challenges to improve circuit performance and scalability. His notable scientific distinctions include: NSF CAREER Award (2006) Advisory Board Member of ACM SIGDA (since 2003) Technical Program Committee roles for ICCD, ISPD, ISCAS, ASPDAC, and GLSVLSI conferences He leads the GTCAD Laboratory at Georgia Tech, driving innovation in computer-aided design tools for next-generation integrated circuits and systems.

• Physical design automation for VLSI circuits
• 3D circuit/packaging layout automation
• Quantum circuit layout automation
• +3 more

Alexandre Jacquillat is the Maurice F. Strong Career Development Associate Professor and Associate Professor of Operations Research and Statistics at MIT Sloan School of Management. His research focuses on data-driven decision-making with applications in air traffic management, urban mobility, and decarbonization. He holds a PhD in Engineering and MS degrees from MIT and École Polytechnique. Education PhD in Engineering, MIT MS in Technology and Policy, MIT MS in Applied Mathematics, École Polytechnique Research Interests His work develops scalable optimization models for efficient, equitable, and sustainable operations. Key areas include stochastic optimization, large-scale systems design, and machine learning applications in transportation and public policy. Recent projects explore vertiport planning for urban aerial mobility and prescriptive analytics for pandemic response. Awards Harold W. Kuhn Award (2024) INFORMS Harvey Greenberg Research Award (2023) MIT Jamieson Prize for Excellence in Teaching (2023) Multiple INFORMS Best Paper Awards (2015-2023) Named Leading Academic Data Leader by Chief Data Officer Magazine (2021-2022) Teaching & Grants Teaches courses in optimization (15.093, 15.083) and analytics (15.072). His grants support work in robotic warehousing, air traffic scheduling, and disaster response logistics. Advises on transportation analytics for industry and government. Labs/Teams Leads MIT Sloan's operations research group, collaborating with industry partners like McKinsey & Co. and Booz Allen Hamilton on transportation analytics and optimization projects.

• Data-driven decision-making
• Stochastic optimization
• Integer optimization
• +6 more

Anoosheh Heidarzadeh is an Assistant Professor in the Department of Electrical and Computer Engineering at Santa Clara University's School of Engineering. He holds a Ph.D. in Electrical and Computer Engineering from Carleton University (2012) and previously served as a Visiting Assistant Professor at Texas A&M University (2018-2022) and Associate Research Scientist at the same institution (2015-2017). His postdoctoral research was conducted at the California Institute of Technology (2013-2014). His research focuses on: Information and coding theory : Fundamental limits of data transmission and storage systems Private and secure computing : Protocols for confidential data processing in networked environments Fault-tolerant distributed systems : Resilient computation frameworks for large-scale applications Distributed machine learning : Scalable algorithms for collaborative learning architectures Recent publications (2021-2022) demonstrate strong emphasis on privacy-preserving computation (covering 73% of articles) and distributed coding techniques (67% of articles), with innovations in private information retrieval, matrix operations, and group testing methodologies. Theoretical contributions dominate (87%), while 13% address applied challenges like COVID-19 screening.

• Information and coding theory
• Private and secure computing
• Fault-tolerant distributed computing
• +3 more

Quanquan C. Liu is an Assistant Professor in the Department of Computer Science at Yale University, part of the School of Engineering & Applied Science. His research focuses on algorithms for large data, dynamic/distributed/parallel graph algorithms, and differential privacy. He holds a PhD from MIT's Theory Group, advised by Erik Demaine and Julian Shun, with postdoctoral experience at Northwestern University and MIT. Liu has authored over 50 publications in top venues like FOCS, SPAA, and STACS, and received a Best Paper Award at SPAA 2022. He advises a team of 12+ students, including PhD and undergraduate researchers. His service roles include PC membership for PPoPP, ESA, and SPAA, and coaching for the USA Computing Olympiad (USACO) and ICPC teams. Notable research contributions include advancements in parallel algorithms for graph problems and privacy-preserving techniques.

• Algorithms
• Parallel Computing
• Graph Theory
• +4 more

Mohsen Ghaffari is an Associate Professor at MIT's Department of Electrical Engineering and Computer Science (EECS), holding the Steven and Renee Finn Chair. His research focuses on theoretical computer science, particularly distributed and parallel algorithms, graph theory, and network optimization. Formerly, he was a tenured CS faculty member at ETH Zurich until 2022. PhD in Computer Science from MIT (2016) His research interests include distributed algorithms, parallel computing, graph decomposition, and network congestion management. His recent work addresses coreness decomposition, spanner construction, and Euclidean k-center optimization in massive parallel computation frameworks. Notable scientific awards include the ACM Doctoral Dissertation Award (Honorable Mention), ACM-EATCS Doctoral Dissertation Award, and multiple best paper awards at FOCS, PODC, and SODA. He has advised numerous PhD and Master's students, many of whom have transitioned to academic and industry roles. He has taught courses at MIT and ETH Zurich on distributed algorithms, advanced algorithms, and massively parallel computation. His professional activities include serving on program committees for SODA, FOCS, STOC, and organizing workshops like Highlights of Algorithms (HALG) and Workshop on Local Algorithms (WOLA).

• Theoretical Computer Science
• Distributed Algorithms
• Parallel Algorithms
• +3 more