Find Academic Supervisors

Sicun Gao is an Associate Professor in the Computer Science and Engineering department at the University of California, San Diego. His research focuses on practical algorithms for NP-hard search and optimization problems in computational systems, emphasizing combinatorial perspectives in numerical and statistical contexts to achieve reliable autonomy. Research Interests: Automated reasoning, Hamilton-Jacobi reachability, safe reinforcement learning, control barrier functions, and optimization in cyber-physical systems. Teaching: Courses on AI search, optimization, and graduate research seminars. The 15 most recent publications highlight advancements in safe AI control, motion planning, and policy optimization, often integrating neural networks with formal verification. Awards include the IEEE Power & Energy Society Technical Committee Prize Paper Award and the IROS RoboCup Best Paper Award. He advises PhD students working on AI-driven control and robotics, with alumni placed at institutions like Seoul National University, Amazon, and Apple. Grants include NSF Career, Air Force Young Investigator, and DARPA Assured Autonomy funding. His lab develops tools like dReal for automated reasoning in nonlinear theories over the reals.

• Algorithms and Optimization
• Automated Reasoning
• Cyber-Physical Systems
• +3 more

Daniel Dominic Kaplan Sleator is a Professor of Computer Science at Carnegie Mellon University's School of Computer Science. He maintains an office in the Gates-Hillman Center (7205 Gates-Hillman) and teaches various courses in algorithms and theoretical computer science. Professor Sleator's research spans several areas of theoretical computer science and algorithms. His primary interests include: Algorithms and Data Structures Amortized Analysis and Competitive Analysis Persistent and Self-Adjusting Data Structures Computational Geometry and Combinatorial Optimization Combinatorial Game Theory and Mathematical Games Music Analysis using Computational Methods His extensive publication record shows a consistent focus on efficient data structures and algorithms. Over the years, his work has evolved from foundational data structures like splay trees and skew heaps to applications in diverse areas such as music analysis and combinatorial games. A notable trend in his work is the development of self-adjusting data structures that achieve excellent amortized performance without maintaining explicit structural constraints. His papers on splay trees, skew heaps, and persistent data structures have become classics in the field. Professor Sleator has made significant contributions across multiple domains of computer science. His work on competitive algorithms for paging and list update problems has been particularly influential, establishing fundamental results in online algorithms. His research extends beyond traditional computer science into interdisciplinary areas like computational music theory, demonstrating the broad applicability of algorithmic thinking. He teaches a variety of courses including Algorithms 15-451/651, Competition Programming 15-295, and specialized topics like mathematical games.

• Algorithms
• Data Structures
• Theoretical Computer Science
• +5 more

Howie Choset is a Professor of Robotics at the Robotics Institute, Carnegie Mellon University. He directs the Undergraduate Robotics Minor and leads the Biorobotics Laboratory, where his research focuses on snake robots, motion planning, and medical robotics. He is also affiliated with the Manufacturing Futures Institute. Ph.D., Mechanical Engineering, California Institute of Technology (1996) M.S., Mechanical Engineering, California Institute of Technology (1995) B.S.E., Computer Science and Engineering, University of Pennsylvania (1990) B.S., Economics, The Wharton School of Business (1990) Choset's research centers on robotics for confined and complex environments, particularly through the development of snake robots. His work integrates mechanism design, path and motion planning, and estimation to enable applications in surgery, manufacturing, infrastructure inspection, and search and rescue. He is a pioneer in medical robotics and has co-founded Medrobotics to commercialize minimally invasive surgical robots. His recent publications highlight a strong focus on ergodic exploration, multi-agent systems, motion planning under uncertainty, and medical robotics. Themes include optimizing robot trajectories for information gathering, solving complex path planning problems with dynamic obstacles, and advancing autonomous systems for disaster response and space exploration (e.g., the EELS robot for Enceladus). MIT Technology Review Top 100 Innovators under 35 (2002) Best Paper Award, RIA (1999) Best Paper Award, ICRA (2003) Best Paper, IEEE Bio Rob (2006) Best Video, ICRA (2011) Nominations for best papers at ICRA, IROS, and CLAWAR Choset has advised numerous students, many of whom have won top awards. His lab has received significant funding for robotics research, including projects in surgical robotics, additive manufacturing, and autonomous exploration. He is the lead author of the textbook Principles of Robot Motion and is actively involved in educational innovation through custom robotics labs. He leads the Biorobotics Laboratory at CMU, which develops advanced robotic systems like snake robots and the EELS (Exobiology Extant Life Surveyor) robot for NASA missions. The lab collaborates with industry and government agencies on applications ranging from surgery to space exploration.

• Robotics
• Medical Robotics
• Snake Robots
• +11 more

Jiaoyang Li is an Assistant Professor at the Robotics Institute, Carnegie Mellon University , where she leads research in large-scale multi-robot coordination. She earned her Ph.D. in Computer Science from the University of Southern California (2022) under Professor Sven Koenig and holds a B.Eng. in Automation from Tsinghua University (2017) . Ph.D. (2022): University of Southern California B.Eng. (2017): Tsinghua University Research Focus : Jiaoyang Li's work centers on algorithms for multi-robot coordination in dynamic environments. Key areas include: Multi-Agent Path Finding (MAPF) Lifelong Planning for Autonomous Systems Kinodynamic Motion Planning Warehouse and Transportation Automation Human-Robot Collaboration Integration of Planning and Machine Learning Swarm Robotics Publication Trends : Recent work spans 2023-2025 , showing emphasis on: Scalable coordination for 10,000+ robots Bézier curve optimization for dual-arm assembly Diffusion models in multi-robot motion planning Guidance graph optimization for airport/railway traffic Multi-objective search in warehouse automation Temporal plan graphs for switchable passing orders Scientific Honors : ICAPS-24 Best Student Paper Award Three top dissertation awards (ICAPS-23, IFAAAMAS, USC) 2023 League of Robot Runners champion Outstanding student paper award at ICAPS-20 Technology Commercialization Award from USC Student Leadership : Advises 5 Ph.D. students and 1 Master's student at CMU, with alumni now at MIT (Ying Feng) and USC (Yimin Tang). Collaborates with visiting students from National University of Singapore and Tsinghua University. Lab Affiliation : Directs the Artificial Intelligence for Robot Coordination at Scale (ARCS) Lab , focusing on: Warehouse automation with thousands of robots Multi-arm LEGO assembly systems Railway coordination algorithms Cooperative assembly with multiple manipulators

• Multi-Robot Coordination
• Artificial Intelligence
• Planning and Scheduling
• +5 more

Andrew Li is an Associate Professor of Operations Research at Carnegie Mellon University's Tepper School of Business since 2024, previously serving as Assistant Professor since 2018. His research bridges statistics, optimization, and machine learning with applications to healthcare operations and retail management. Current teaching: Optimization, Business Analytics Capstone, and Topics in Optimization and Statistics PhD from MIT's Operations Research Center (2018), BS in Operations Research/Applied Mathematics from Columbia University (2012) Research Focus: Dr. Li develops data-driven decision frameworks for complex systems. Key areas include: Experience-based learning models with fairness constraints (organ allocation) Anomaly detection in low-rank matrices (retail inventory accuracy) Nanoparticle-based diagnostic systems for CAD and Alzheimer's Nonstationary demand forecasting in supply chains Publication Trends: Recent work combines bandit algorithms with healthcare applications (split liver transplants, CAD detection) and retail operations (inventory accuracy). Theoretical contributions include regret-optimal policies and entrywise anomaly detection guarantees. Scientific Honors: INFORMS Nicholson Award (2018) INFORMS Pierskalla Award (2021) NSF CAREER Award (2023) Professional Leadership: Active in INFORMS and CMU committees including MBA Analytics Curriculum, Thompson Award, and ENAiBLE AI-driven retail collaborative co-founder since 2021.

• Statistics
• Optimization
• Machine Learning
• +3 more

Nina Balcan is the Cadence Design Systems Professor of Computer Science at Carnegie Mellon University's School of Computer Science, with affiliations in both the Machine Learning Department (MLD) and Computer Science Department (CSD). She maintains her office in Gates Hillman Center (GHC) 8205 and is a prominent figure in theoretical machine learning and algorithmic game theory. Her research spans multiple critical areas in computer science, with a strong focus on the theoretical foundations of machine learning, algorithm design and analysis, and computational approaches to game theory and economics. Balcan has made significant contributions to developing principled algorithms for deep learning, learning with limited supervision, representation learning, and life-long learning. Her work uniquely bridges theoretical computer science with practical applications, particularly in the analysis of complex objects and processes, including algorithmic learning and multi-agent systems. Analysis of her recent publications reveals a strong trend toward data-driven algorithm design, with particular emphasis on learning to optimize combinatorial algorithms, revenue-maximizing mechanisms, and robust learning frameworks. Her work consistently demonstrates how theoretical guarantees can inform practical algorithm development across diverse domains from optimization to economics. Major Awards and Honors: ACM Fellow AAAI Fellow Simons Investigator 2019 ACM Grace Murray Hopper Award (awarded to the outstanding young computer professional of the year) Winner of Outstanding Student Paper Award at UAI 2024 Winner of Exemplary Artificial Intelligence Track Paper Award at ACM EC 2019 Runner Up Best Paper Award at COLT 2012 Professor Balcan has served as Program Committee Co-chair for major conferences including NeurIPS 2020, ICML 2016, and COLT 2014, demonstrating her leadership in the machine learning community. Her teaching portfolio at CMU includes foundational courses such as 10-701 Machine Learning, 10-315 Machine Learning, and 10-715 Advanced Introduction to Machine Learning, where she has mentored numerous students in both theoretical and applied aspects of the field. Her research group focuses on developing theoretically sound yet practically applicable machine learning algorithms, with particular attention to algorithm configuration, data-driven optimization, and learning in strategic environments. Current projects involve learning to improve combinatorial algorithms, designing revenue-maximizing mechanisms, and developing robust learning frameworks that can operate effectively in challenging environments.

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

Yiming Yang is a Professor at the Language Technologies Institute and Machine Learning Department within the School of Computer Science at Carnegie Mellon University , where he has held faculty positions since 2003. His research spans foundational and applied aspects of machine learning , artificial intelligence , and scientific computing . Professor, Carnegie Mellon University (2003–Present) Associate Professor, Carnegie Mellon University (1996–2003) Yang's research focuses on LLM-based problem-solving agents , combinatorial optimization , and scalable oversight frameworks . His work explores diffusion models, Langevin dynamics, and Fourier neural operators for NP-hard problems, while advancing reinforcement learning techniques for self-play supervision and principle-driven fine-tuning of large language models. Recent publications highlight his contributions to code synthesis , PDE solving , and multi-agent reinforcement learning . Key methodologies include demonstration-guided control, retrieval-augmented reasoning, and test-time scaling laws. His team has developed frameworks like FEEDER for efficient in-context learning and μTransfer-FNO for zero-shot hyperparameter transfer in PDE solvers. Notable scientific achievements include: Best Student Paper Runner Up (2013) Best Theoretical Paper Award (1994) Best Theoretical Paper Award (1993) Yang has mentored over 20 PhD students and postdocs, including Shengyu Feng , Zhiqing Sun , and Aman Madaan , across domains like graph learning , extreme multi-label classification , and language model alignment .

• Machine Learning
• Artificial Intelligence
• Combinatorial Optimization
• +13 more

Tathagata Srimani is an Assistant Professor in the Department of Electrical and Computer Engineering at Carnegie Mellon University (CMU), affiliated with the College of Engineering. He previously served as a Postdoctoral Scholar in Electrical Engineering at Stanford University. His academic journey includes a Ph.D. and S.M. in EECS from MIT (2022 and 2018 respectively) and a B.Tech. in E&ECE from IIT Kharagpur (2016). Research Focus: Srimani’s work centers on nanoelectronics and transformative NanoSystems. Key areas include: Carbon nanotube field-effect transistors (CNFETs) and their monolithic 3D integration with silicon Ultra-dense 3D integration of logic and memory to address the 'memory wall' in AI/ML Technology-architecture co-design frameworks for energy-efficient computing Key Achievements: Developed first silicon fab-compatible CNFET processes (TNANO ’18, Nature ’19) Enabled CNFET RISC-V microprocessor and monolithic 3D integration with Analog Devices/SkyWater Recipient of MIT Presidential Fellowship (2016) and Morris Joseph Levin Award (2018) Teaching & Outreach: Teaches semiconductor devices and hardware design, including hands-on 'Hacker Fab' courses. Leads the NEXUS Research Group exploring heterogeneous nanomaterials (e.g., magnetic and oxide semiconductors) and thermal/power management in 3D systems. Future Directions: Expanding into probabilistic computing hardware, co-design frameworks for application-specific systems, and scaling 3D NanoSystem technologies for industrial adoption.

• Nanotechnology
• Beyond-silicon CMOS technologies
• 3D Integration
• +7 more

Steve Hanneke is an Assistant Professor in the Computer Science Department at Purdue University, specializing in statistical learning theory, machine learning, and algorithmic information theory. His research focuses on understanding the fundamental limits of learning from data, including questions about what can be learned and how efficiently it can be done. Prior to Purdue, he held positions at Toyota Technological Institute at Chicago (2018–2021), Carnegie Mellon University (2009–2012), and Princeton University (2018 visiting lecturer). He earned his PhD from Carnegie Mellon University in 2009, advised by Eric Xing and Larry Wasserman, with a thesis on active learning foundations. Key research interests include active learning, adversarial robustness, online learning, and the theoretical analysis of learning algorithms. He has contributed to foundational work on PAC learning, sample complexity, and universal learning frameworks. Notable awards include the Best Paper Awards at ALT 2021 and COLT 2020, and his 2007 ICML paper received an Honorable Mention for the ICML Test of Time Award in 2017. Teaching experience includes courses at Purdue (Machine Learning Theory, Data Mining and Machine Learning), Princeton (Statistical Learning and Nonparametric Estimation), and Carnegie Mellon (Advanced Probability and Statistical Theory). His work has been published in top venues like COLT, NeurIPS, and the Journal of Machine Learning Research, with over 50 peer-reviewed articles. Research highlights include developing the theory of universal learning under general stochastic processes, characterizing minimax rates in active and online learning, and exploring adversarial robustness in PAC learning frameworks. Current projects focus on bandit learning, non-stationary environments, and the theoretical limits of learning algorithms.

• Machine Learning
• Statistical Learning Theory
• Artificial Intelligence
• +5 more

David P. Woodruff is a Professor in the Department of Computer Science at Carnegie Mellon University, part of the Theory Group within the School of Computer Science. He is actively involved in academic leadership roles, including chairing the CATCS (Conference on Theoretical Computer Science) and serving as PC chair for SODA 2024 and ICALP 2022. His research focuses on algorithms, data streams, machine learning, numerical linear algebra, sketching, and sparse recovery. He has been recognized with awards such as the Herbert Simon Award for teaching and the PODS Best Paper Award. Woodruff has advised numerous students and postdocs, including notable scholars like Ainesh Bakshi, Rajesh Jayaram, and Hongyang Zhang. His work often addresses foundational challenges in theoretical computer science, with contributions to distributed computing, streaming algorithms, and privacy-preserving techniques. He has published extensively in top conferences like NeurIPS, ICML, FOCS, and STOC, covering topics ranging from low-rank approximation to adversarial robustness in data streams. His teaching includes courses like Algorithms for Big Data and core algorithms courses, reflecting his commitment to both research and education. Collaborations span academia and industry, with applications in genomics and secure computation. Woodruff is a key contributor to the Foundations of Data Science program at the Simons Institute.

• Algorithms
• Data Streams
• Machine Learning
• +3 more

Michael Trick is the Senior Associate Dean for Faculty and Research and Higgins Professor of Operations Research at the Tepper School of Business, Carnegie Mellon University. His research focuses on combinatorial optimization, sports scheduling, constraint programming, and operations research applications. He has contributed to seminal work on sports timetabling (e.g., scheduling college basketball conferences) and the traveling tournament problem. Trick's work bridges theoretical advancements with practical applications, including integer programming, branch-and-price methods, and stochastic dynamic programming. He has led initiatives in operations research education and served as President of INFORMS, emphasizing the field's societal impact. His research also spans voting systems, optimization for newspaper zoning, and algorithmic design for complex scheduling problems. Trick's expertise spans academic leadership, research methodology, and cross-disciplinary applications. His articles address topics like auction design for spectrum allocation, bike-sharing logistics, and robust scheduling strategies. He collaborates across academia and industry, contributing to both theoretical advancements and real-world operational challenges. His work often highlights the practical utility of mathematical programming techniques in diverse domains.

• Operations Research
• Optimization
• Combinatorial Optimization
• +6 more

Clinton Conley is an Associate Professor and Director of Graduate Studies in the Department of Mathematical Sciences at Carnegie Mellon University, part of the Mellon College of Science. He holds a Ph.D. in Mathematics from UCLA and has held postdoctoral appointments at the Kurt Gödel Research Center (Vienna, Austria) and Cornell University. His research focuses on descriptive set theory, measurable group actions, and Borel graphs, exploring intersections with ergodic theory, combinatorics, and set theory. Key research areas include measurable chromatic numbers, Borel combinatorics, and hyperfinite equivalence relations. His work often bridges abstract set-theoretic principles with concrete problems in dynamics and graph theory. Notable awards include the Julius Ashkin Award. Education: Ph.D. in Mathematics, University of California, Los Angeles Postdoctoral Appointments: KGRC (Vienna), Cornell University Recent publications span topics like measurable regular subgraphs, quasi-invariant measures, and hyperfiniteness in Borel combinatorics. Teaching includes advanced courses on descriptive set theory, set theory, and mathematical paradoxes. Advising and grants sections remain unspecified in available data. No lab or team affiliations are noted.

• Descriptive Set Theory
• Ergodic Theory
• Combinatorics
• +4 more

R Ravi is the Vasantrao Dempo Professor of Operations Research and Computer Science at Carnegie Mellon University's Tepper School of Business. He holds a B.E. from IIT Madras and M.S./Ph.D. from Brown University. Active since 1995, he served as Associate Dean for Intellectual Strategy and Chair of the Future Educational Delivery Committee. He currently directs Analytics Strategy and leads the Center for Intelligent Business. His research focuses on discrete optimization, network optimization, and applications in supply chain logistics and online advertising, supported by NSF, Google, and others. He has advised over two dozen doctoral students and developed graduate courses like Network Optimization. He received the 30-year Test of Time Award (2023) and is an INFORMS Fellow. His academic roles include editorial leadership in Operations Research and FOCS chairmanship.

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

Tze Meng Low is an Associate Research Professor in the Department of Electrical and Computer Engineering at Carnegie Mellon University (CMU), part of the College of Engineering. His research focuses on high-performance algorithms, formal methods, and hardware-software co-design, with an emphasis on achieving performance portability across architectures. He holds a Ph.D. and M.S. in Computer Science and dual B.A./B.S. degrees in Economics and Computer Science from the University of Texas at Austin. His research interests span parallel computing, graph algorithms, machine learning, and cyber-physical systems. He has contributed to projects like the DARPA BRASS initiative, collaborating on adaptive software systems for resource-challenged environments. His work also involves developing tools such as SMaLL and qLD, which address challenges in machine learning library instantiation and genomic analysis. Low has received the Dean’s Early Career Fellowship (2022) and led the $2.7M DARPA-funded BRASS project (2016–2020), supported by SpiralGen, Inc. and academic collaborators. His contributions include code generation frameworks like SPIRAL and advancements in linear algebra-based graph algorithms, emphasizing analytical models and automated code optimization. His research bridges theoretical formal methods with practical implementations, aiming to enhance software reliability and scalability in emerging domains. Collaborations include work on fault-tolerant coded computing and high-assurance systems for cyber-physical applications.

• Parallel and High Performance Computing
• Formal Methods
• Graph Algorithms
• +3 more

Benoit Hudson is an Assistant Professor at the Toyota Technological Institute at Chicago, specializing in computational geometry and algorithm design with theoretical guarantees. His work bridges practical implementation and theoretical analysis in mesh refinement, with applications to scientific computing and computer graphics. He has also contributed to auction theory and hybrid systems simulation. Research interests include: Computational geometry Mesh refinement algorithms Scientific computing Data structures Algorithm design His recent publications analyze: Volume mesh size complexity Linear-time surface reconstruction Delaunay refinement guarantees Dynamic mesh updating Parallel mesh generation He maintains the sparse-meshing.com resource and previously worked on spacecraft diagnosis systems at NASA Ames Research Center. His academic advisors included Gary Miller (Carnegie Mellon University) and Tuomas Sandholm during early PhD years.

• Computational Geometry
• Scientific Computing
• Mesh Refinement
• +7 more