جستجوی استاد راهنمای دانشگاهی

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
• +۴ مورد دیگر

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
• +۵ مورد دیگر

Caglar Gulcehre is a Tenure Track Assistant Professor at École Polytechnique Fédérale de Lausanne (EPFL) and Principal Investigator of the CLAIRE (Caglar Gulcehre Laboratory of Artificial Intelligence Research) lab. Previously, he worked as a Staff Research Scientist at Google DeepMind, Microsoft Research, and IBM Research. His research focuses on reinforcement learning , foundation models , LLM alignment , and sequence modeling . Current Position : Assistant Professor, EPFL Lab : CLAIRE Lab Previous Roles : Staff Research Scientist at DeepMind, MSR, IBM Research His work spans reinforcement learning , deep learning , and neural architecture design , with a focus on safety , trustworthy AI , and real-world applications . He has published in top venues including Nature , NeurIPS , ICML , and JMLR . Scientific contributions include: Best paper award at NeurIPS Nonconvex Optimization workshop Honorable mention for best paper at ICML 2019 Co-organizer of seven workshops at NeurIPS, ICML, and ICLR He supervises PhD students in areas related to AI for algorithm discovery , neural architectures , and foundation models , including: Skander Moalla Justin Samuel Deschenaux Liangze Jiang Xiuying Wei Yitao Xu

• Reinforcement Learning
• Foundation Models
• Large Language Models
• +۶ مورد دیگر

Paul Gölz is an Assistant Professor at Cornell University's School of Operations Research and Information Engineering (ORIE), with affiliations in Computer Science. His research focuses on computational social choice, algorithmic fairness, and AI ethics, addressing topics like democratic innovation, fair resource allocation, and AI systems for diverse users. Education: Undergraduate studies at Saarland University (Germany), PhD in Computer Science from Carnegie Mellon University, followed by postdoctoral research at Harvard University, UC Berkeley, and the Simons Laufer Mathematical Sciences Institute. His work has been recognized with awards including the JPMorgan Chase AI Research Fellowship (2021) and honorable mentions for prestigious dissertation awards (Dantzig and ACM SIGecom). Research Highlights : Developed Panelot, a tool for selecting citizens' assemblies using state-of-the-art algorithms. His work on fair refugee resettlement and apportionment methods has been featured in Operations Research and Nature . Recent projects include AI alignment distortion analysis and generative social choice mechanisms. Teaching : Teaches Optimized Democracy (Spring 2025) and Mathematical Programming (Fall 2024). Supervises PhD students in ORIE, focusing on interdisciplinary applications of optimization and social choice. Awards & Grants : Received a $40K Structural Democracy Fellowship (Crankstart) and an OpenAI grant for Democratic Inputs to AI. Active in policy briefs (e.g., mini-public selection strategies). Labs/Tools : Co-developed Panelot.org , a nonprofit platform for fair citizen assembly selection. Active in open-source tool development for social choice applications.

• Social Choice Theory
• Algorithmic Fairness
• AI Ethics
• +۳ مورد دیگر

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
• +۴ مورد دیگر

Yang P. Liu is an Assistant Professor at Carnegie Mellon University 's Department of Computer Science . He received his PhD from Stanford University under the supervision of Aaron Sidford and previously studied at MIT . Fields of Interest : Graph Algorithms, Optimization, High-Dimensional Geometry, Additive Combinatorics, Theoretical Computer Science. His research focuses on algorithmic design and analysis for graph problems, optimization, and combinatorics, with applications in machine learning and complexity theory. Recent work includes advancements in parallel repetition games , combinatorial lines , and dynamic graph algorithms . In 2024, his research spanned FOCS , STOC , and RANDOM conferences, addressing problems in k-CSPs , min-cost flow , and hypergraph sparsification . Earlier contributions (2023) included deterministic flow algorithms and spectral hypergraph techniques. Scientific Awards : NDSEG Fellowship (2018-2021), Google PhD Fellowship (2022-2023), FOCS Best Paper (2022), STOC Best Student Paper (2022), FOCS Best Student Paper (2021). He teaches CS 15-759 , a graduate course on convex optimization theory and applications, covering gradient descent, interior point methods, and algorithmic sparsification techniques.

• Graph Algorithms
• Optimization
• High-Dimensional Geometry
• +۳ مورد دیگر

Paul Goldberg is a Professor of Computer Science and Director of the MSc in Mathematics and Foundations of Computer Science (MFoCS) at the University of Oxford. He holds a BA in Mathematics from Oxford University and a PhD in Computer Science from the University of Edinburgh. His research focuses on algorithmic game theory, computational complexity, and machine learning, with notable contributions to equilibrium computation, complexity classes of total search problems, and decentralized systems. Affiliations: Department of Computer Science, Oxford; Editorial Board of ACM Transactions on Economics and Computation. Education: PhD in Computer Science (1993), University of Edinburgh MSc in Computer Systems Engineering (1989), University of Edinburgh and Université Paris-Sud BA in Mathematics (1988), Oxford University Research Interests: Algorithmic game theory, computational complexity (especially total search problems like CLS and PPAD), decentralized computation of equilibria, and applications in machine learning and AI. His work bridges theoretical computer science and economics, with a focus on algorithm design and complexity analysis. Publications and Awards: Over 120 papers, including influential work on Nash equilibrium complexity (2009), gradient descent (2023), and fair division algorithms. Notable awards include the ACM SIGecom Test of Time Award (2022) and a SIAM Outstanding Paper Prize (2011). Grants and Students: Leads EPSRC-funded projects on game theory and machine learning. Supervised 11 PhD graduates and currently advises Giannis Tyrovolas and others. Active in mentoring MSc and undergraduate projects. Labs/Teams: Part of the Algorithms and Complexity Theory group at Oxford, contributing to research on optimization, equilibrium dynamics, and fair division.

• Algorithmic Game Theory
• Computational Complexity Theory
• Machine Learning
• +۳ مورد دیگر

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
• +۵ مورد دیگر

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
• +۱۲ مورد دیگر

Teo Chung Piaw is the Stephen Riady Professor and Executive Director of the Institute of Operations Research and Analytics (IORA) at the National University of Singapore (NUS). He holds a PhD in Operations Research from MIT (1996) and has held academic positions including Head of Department and Acting Deputy Dean at NUS Business School. His research focuses on optimization under uncertainty, supply chain management, and combinatorial optimization. He serves as a department editor for Management Science and has led strategic initiatives in Singapore's Smart Nation Program. Teo's educational journey includes a Bachelor of Science (Honors) in Mathematics from NUS (1990). His corporate experience spans roles at Unilever, Hewlett Packard, and PSA International. He has received prestigious awards including the NUS Faculty Outstanding Researcher Award (2003, 2006) and has been a Fellow of the Singapore-MIT Alliance Program. His research addresses operational challenges in smart cities, healthcare scheduling, and supply chain resilience. Notable contributions include work on appointment scheduling under patient no-show behavior, disruption risk mitigation in supply chains, and flexible production network design. He has authored over 100 publications and serves on editorial boards of leading journals like Operations Research and Management Science .

• Operations Research
• Supply Chain Management
• Inventory Theory
• +۴ مورد دیگر

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
• +۶ مورد دیگر

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
• +۴ مورد دیگر

Gareth Roberts is an Associate Professor in the Department of Linguistics at the University of Pennsylvania, where he serves as Graduate Chair. He is also a faculty member of the Psychology Graduate Group, founder and director of the Cultural Evolution of Language Lab, and co-director of the Social and Cultural Evolution Working Group at Penn. Roberts earned his PhD in Linguistics from the University of Edinburgh in 2010, following an MSc in Evolution of Language and Cognition (2006) and a BA in German and Russian (2003) from the University of Nottingham. His academic journey includes postdoctoral positions at Yeshiva University and the University of Stirling before joining Penn as an Assistant Professor in 2014, where he was promoted to Associate Professor in 2022. His research focuses on the role of social and communicative pressures in shaping language emergence and evolution. Roberts investigates fundamental questions about linguistic variant spread, phonological system structuring, and how communication shapes linguistic structure. His work bridges linguistics, cognitive science, and cultural evolution through innovative experimental approaches using artificial languages and laboratory simulations. Analysis of Roberts' recent publications reveals a consistent focus on experimental semiotics, with particular attention to social biases in language evolution, phonological organization, indexicality emergence, and the dynamics of linguistic variation. His work often combines computational modeling with human experiments to isolate specific mechanisms driving language change. Linguistic Society of America Cognitive Science Society Philological Society Cultural Evolution Society Roberts has successfully secured substantial research funding including an NSF PAC Grant ($102,648), Penn URF Research Grants ($12,155), MindCORE initiative grant ($600,000), and multiple smaller grants totaling over $20,000. His lab currently includes researchers investigating diverse topics from case and gender marking emergence to AI agent effects on group dynamics, linguistic and genetic data in British history, and phonological space organization. The Cultural Evolution of Language Lab, which Roberts founded and directs, conducts cutting-edge research using experimental semiotics methodologies. Current projects examine how social factors influence language change, the emergence of linguistic structure through communication, and the interaction between iconicity and combinatoriality in communication systems.

• Language Evolution
• Language Change
• Language Variation
• +۷ مورد دیگر

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
• +۳ مورد دیگر

Peter Selinger is a Professor in the Department of Mathematics and Statistics at Dalhousie University , with a cross-appointment in Computer Science. He specializes in mathematical methods in computer science, particularly quantum computing and combinatorial game theory . His work on quantum programming languages like Quipper and foundational research in category theory has garnered international recognition. Education : Ph.D. in Mathematics (University of Pennsylvania, 1997), undergraduate studies in Mathematics (Technische Universität Darmstadt). Research Interests span quantum computing, category theory, and combinatorial game theory. He has pioneered formalisms for quantum programming languages, developed categorical models for quantum mechanics, and analyzed game-theoretic structures in games like Hex. His recent work includes linear dependent type theory , quantum circuit synthesis , and combinatorial game classification . Publications demonstrate expertise in quantum programming languages, categorical semantics, and game theory. Key trends include Hamiltonian simulation , Clifford+T circuits , and monotone game realization . Scientific Honors include the Killam Professorship (2017–2022), Faculty of Science Award for Excellence in Teaching (2023), and fellowships from the Alfred P. Sloan Foundation and German National Scholarship Foundation . Students he has supervised include PhD graduates Xiaoning Bian , Francisco Rios , and Neil J. Ross , along with MSc students like Fahimeh Bayeh and Seth Greylyn . He has advised 16 postdoctoral researchers.

• Quantum Computing
• Category Theory
• Mathematical Logic
• +۴ مورد دیگر