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

Osman Yağanمشاهده پروفایل

استاد پژوهش

• Machine Learning
• Data Science
• Network Science
• +۷ مورد دیگر

Osman Yağan is a Research Professor in the Department of Electrical and Computer Engineering at Carnegie Mellon University (CMU), with affiliate faculty status in the School of Computer Science. He is also a core member of CyLab Security and Privacy Institute. Prior to joining CMU in 2013, he was a Postdoctoral Research Fellow at CyLab. He holds a Ph.D. in Electrical and Computer Engineering from the University of Maryland (2011) and a B.S. from Middle East Technical University (2007). His research focuses on modeling, analysis, and optimization of computing systems, leveraging applied probability, network science, data science, and machine learning. Key areas include multi-armed bandits, resilient machine learning, contagion processes in networks, and cybersecurity. Research Interests include Machine Learning, Data Science, Network Science, Cybersecurity, and Robustness in Cyber-Physical Systems. He has advised numerous students, including current PhD candidates Yurun Tian, Orkun İrsoy, and Ishank Juneja, as well as notable alumni such as Mansi Sood (now at MIT) and Jun Zhao (Assistant Professor at Nanyang Technological University). Key Awards include the CIT Dean's Early Career Fellowship, IBM Academic Award, and Best Paper Awards at ICC 2021, IPSN 2022, and ASONAM 2023. His work spans theoretical contributions (e.g., contagion models in multi-layer networks) and applied research (e.g., mitigating cascading failures in power systems). He leads or co-leads grants from ONR, NSF, and ARO, focusing on resilient machine learning, network robustness, and pandemic modeling.

Daniel Dominic Kaplan Sleatorمشاهده پروفایل

استاد

• Algorithms
• Data Structures
• Theoretical Computer Science
• +۵ مورد دیگر

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.

Gauri Joshiمشاهده پروفایل

دانشیار

• Distributed Machine Learning
• Federated Learning
• Stochastic Modeling
• +۷ مورد دیگر

Gauri Joshi is an Associate Professor in the Electrical and Computer Engineering (ECE) department at Carnegie Mellon University, with affiliate appointments in the Machine Learning Department and Robotics Institute. Her work focuses on system-aware algorithms for distributed machine learning, combining optimization, probability, and coding theory to address communication and computational constraints in edge networks. MIT Ph.D. in EECS (2016) IIT Bombay B.Tech/M.Tech in Electrical Engineering (2010) Research themes include federated learning with communication efficiency, erasure coding for non-linear computations, and reinforcement learning for heterogeneous queueing systems. She leads the Optimization, Probability and Learning (OPAL) lab , affiliated with the Parallel Data Lab (PDL), CyLab, and FLAME Center. Recent publications highlight advances in: federated fine-tuning with low-rank adaptation, robust PCA for model aggregation, privacy-preserving prediction mechanisms, and adaptive reinforcement learning for job dispatching systems. Her group has received 15+ paper awards across SIGMETRICS, MobiHoc, and NeurIPS workshops. Scientific recognition includes: IEEE Goldsmith Lecturer (2025), MIT Technology Review '35 Innovators Under 35' (2022), ONR Young Investigator Award (2023), NSF CAREER (2021), and ACM SIGMETRICS Best Paper (2020). She has advised 20+ graduate students, many now at tech giants like Google, Apple, and Meta. Service contributions span program co-chair roles (MLSys 2025), associate editorships (IEEE/ACM Transactions on Networking), and workshop organization (ICML, NeurIPS). Her NSF AI-EDGE Institute leadership (2021-present) drives next-generation intelligent edge networks for robotics and aerospace applications.

Nihar B. Shahمشاهده پروفایل

دانشیار

• Machine Learning
• Peer Review Systems
• Algorithmic Fairness
• +۴ مورد دیگر

Nihar B. Shah is an Associate Professor at Carnegie Mellon University with joint appointments in the Machine Learning and Computer Science departments within the School of Computer Science. His research focuses on developing theoretically grounded algorithms for evaluating scientific work, with applications in peer review, fairness, and human-AI collaboration. His work has impacted over 100,000 research papers and grant evaluations. Education: Ph.D. in EECS, UC Berkeley M.E. in Telecommunications, Indian Institute of Science B.Tech. in Electronics, NIT Karnataka Research Interests: Shah's group investigates the science of evaluation through machine learning, optimization, and large-scale experiments. Key areas include peer review systems, algorithmic fairness, LLM applications in science, and human-AI collaboration frameworks. Research addresses fundamental questions about research validity, funding allocation, and equitable assessment. Publication Trends: Recent work focuses on improving peer review through randomized controlled trials, security against collusion, LLM-based review systems, and bias mitigation. Publications consistently appear in premier venues (NeurIPS, PLOS ONE, AAAI) with growing emphasis on real-world deployments. Awards & Honors: Young Alumnus Medal (IISc 2024) NSF CAREER Award (2020-2025) Google Research Scholar Award (2021) Multiple best paper awards (HCOMP, ICLR) Research Group & Funding: Leads a focused research team with NSF, Google, and JP Morgan support. Alumni hold positions in academia and industry. Current projects involve large-scale evaluations of scientific work and algorithmic fairness.

Kathryn Roederمشاهده پروفایل

استاد

• Statistical Genetics
• Genomics
• Biostatistics
• +۵ مورد دیگر

Kathryn Roeder is the UPMC University Professor of Statistics and Life Sciences at Carnegie Mellon University (CMU), affiliated with the Dietrich College of Humanities and Social Sciences and the Departments of Statistics & Data Science and Computational Biology. Her research focuses on developing statistical methods for genetic and genomic data, particularly in identifying autism risk genes and analyzing single-cell multi-omic data. She earned her Ph.D. in Statistics from Penn State University and has been at CMU since 1994, previously serving as Vice Provost for Faculty (2015–2019). Education: Ph.D. in Statistics, Penn State University (1988) B.S. in Wildlife Resources, University of Idaho (1982) Research Interests: Her work integrates modern statistical techniques (high-dimensional statistics, machine learning, networks) to study complex diseases like autism and schizophrenia. Recent efforts include tools for analyzing single-cell RNA-seq and proteomic data, such as UNICORN, DAWN, and SCEPTRE. Key Awards: COPSS Distinguished Achievement Award (2020) National Academy of Sciences Member (2019) COPSS Presidents’ Award (1997) AAAS Fellow (2020) Advising & Grants: She has advised over 20 Ph.D. students, many contributing to landmark studies in autism genetics. Her grants include NIH funding for projects like the Autism Sequencing Consortium. Current research teams focus on computational biology and statistical genetics. Labs & Collaborations: Her lab develops software tools (e.g., TADA, MIND) and collaborates with the Autism Sequencing Consortium and iPSYCH-BROAD Consortium on large-scale genomic studies.

Pedro Ferreiraمشاهده پروفایل

استاد

• Information Systems
• Education Technology
• Media Analytics
• +۵ مورد دیگر

Pedro Ferreira is a Full Professor at Carnegie Mellon University (CMU), holding a joint appointment in the School of Information Systems & Management at the Heinz College and the Department of Engineering and Public Policy within the College of Engineering. His research focuses on how technology influences education, media consumption, and peer effects, leveraging large datasets from randomized experiments. Ferreira has been recognized with the 2018 INFORMS Early Career Award and Top 17th worldwide research scholar ranking (2020–2022). He co-founded CMU's Initiative for Teaching and Education Analytics (iTEA) and advises numerous students in areas like AI/ML in education and media analytics. Education: BSc in Computer Science (IST), MSc in Electrical Engineering and Computer Science & Technology Policy (MIT), PhD in Telecommunications Policy (CMU). He has taught at MIT, IST, and invited roles at Católica-Lisbon and the University of Cambridge. Research Interests: Impact of digital technologies on education outcomes (e.g., smartphones in classrooms, video analytics), peer influence in media industries (e.g., binge-watching, recommender systems), and empirical methods using randomized experiments. Current projects include AI-driven education improvement and policy implications of AI/ML technologies. Notable Achievements: Over 15 peer-reviewed articles in top journals like Management Science and MIS Quarterly. Key grants include Gates Foundation funding for video-based education research and Koch Foundation support for online certification studies. He serves as Associate Editor for Management Science and previously for MIS Quarterly. Advising & Grants: Advised 23 PhD students, many now in academia and industry. Current students research facial recognition in education and hybrid recommender systems. Ferreira has led grants totaling millions, including studies on GDPR's impact on piracy tracking and worldwide VoD availability. Professional Service: Organized conferences like the Symposium on Statistical Challenges in eCommerce Research (SCECR). Served on NSF review panels and CMU’s Portugal PhD program steering committee.曾参与葡萄牙知识社会局(UMIC)的国家级政策制定，推动宽带学校项目。

• Statistics
• Optimization
• Machine Learning
• +۳ مورد دیگر

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.

• Marketing
• Applied Economics
• Econometrics
• +۱۰ مورد دیگر

Alan Montgomery is a Professor of Marketing at Carnegie Mellon University's Tepper School of Business, where he has held a tenured position since 2018 (previously as Associate Professor from 2005-2017). He also maintains an affiliation with the Machine Learning Department at CMU's School of Computer Science, demonstrating his interdisciplinary research approach at the intersection of marketing, economics, and computational methods. Dr. Montgomery earned his educational credentials from prestigious institutions: Ph.D. in Marketing/Economics, University of Chicago (1994) MBA, University of Chicago (1994) BS in Economics, University of Illinois at Chicago (1989) His research focuses on applying advanced quantitative methods to marketing problems, with particular expertise in consumer behavior modeling, clickstream data analysis, pricing strategies, and micro-marketing. Dr. Montgomery's work bridges traditional marketing theory with computational approaches, making significant contributions to both academic literature and practical business applications. His research often involves large-scale data analysis to uncover patterns in consumer decision-making processes, with recent work exploring mental accounting, bandit algorithms, and the impact of digital phenomena like movie piracy on traditional markets. Dr. Montgomery has received notable recognition including the 1999 Mitchell Prize from the American Statistical Association for his paper "Estimating Price Elasticities with Theory-based Priors." His work has been published in top-tier journals across marketing, economics, and computer science disciplines, demonstrating the interdisciplinary impact of his research. As an educator and mentor, Dr. Montgomery has advised numerous PhD students and collaborated extensively with researchers across multiple institutions. His interdisciplinary approach has led to collaborations with computer scientists studying web browsing behavior and economists examining consumer decision frameworks. His research has been supported by various grants throughout his career, enabling extensive data collection and analysis projects. Dr. Montgomery's work spans multiple research environments, including collaborations with the Machine Learning Department at CMU's School of Computer Science. His research group likely focuses on applying computational methods to marketing problems, particularly in the areas of consumer behavior modeling, clickstream analysis, and data-driven marketing strategies. His recent work shows increasing integration of machine learning techniques with traditional marketing research methodologies.

Phillip B. Gibbonsمشاهده پروفایل

استاد

• Parallel Computing
• Distributed Systems
• Databases
• +۴ مورد دیگر

Phillip B. Gibbons is a Professor in both the Computer Science Department and Electrical & Computer Engineering Department at Carnegie Mellon University. He received his Ph.D. in Computer Science from the University of California at Berkeley in 1989 and has held research positions at AT&T Bell Laboratories, Lucent Bell Laboratories, and Intel Research Pittsburgh before joining CMU's faculty. His research spans parallel computing, distributed systems, databases, computer architecture, and machine learning. Gibbons' work bridges theory and systems, with publications in top-tier conferences including SOSP, OSDI, SIGMOD, VLDB, NeurIPS, and many others across computer science and engineering disciplines. His research has been supported by significant funding from NSF, Intel, and other organizations. Gibbons has made substantial contributions to streaming algorithms, parallel computing frameworks, distributed systems security, and large-scale machine learning systems. His work on data stream algorithms with Alon, Matias, and Szegedy has been particularly influential in the field. He has served in numerous leadership roles including Editor-in-Chief of ACM Transactions on Parallel Computing (2012-2018) and on the editorial boards of Journal of the ACM and IEEE Transactions on Cloud Computing. He has also been active on program committees for major conferences in systems, databases, and theory. IEEE Fellow (2014) - For contributions to parallel computing and databases ACM Fellow (2006) - For contributions to parallel computing, databases, and sensor networks Selected for Oral Presentation at NeurIPS '13 (only 20 selected out of 1420 submissions) Co-winner of the best paper award for NSDI '06 Gibbons has advised numerous students and mentored researchers who have gone on to make significant contributions in academia and industry. His research has been supported by major grants including the $15M Intel Science and Technology Center for Cloud Computing (2011-2015) where he served as Co-PI/Co-Director. He currently leads research projects on write-efficient algorithms, big learning systems, and visual cloud systems. His laboratory work focuses on bridging theoretical computer science with practical systems implementation, particularly in the areas of parallel and distributed computing. Current research directions include adapting algorithms for emerging memory technologies and optimizing machine learning systems for large-scale deployment.

Michael D. Smithمشاهده پروفایل

استاد

• Information Systems
• Digital Economics
• Consumer Behavior in Online Markets
• +۴ مورد دیگر

Michael D. Smith is a Professor of Information Technology and Public Policy at Carnegie Mellon University, with joint appointments at Heinz College and Tepper School of Business. His research employs economic and statistical methods to analyze digital markets, focusing on firm and consumer behavior in online environments. Education: B.Sc. in Electrical Engineering (Summa Cum Laude), University of Maryland M.Sc. in Telecommunications Science, University of Maryland Ph.D. in Management Science and Information Technology, MIT Research Interests: Professor Smith investigates the economics of digital information markets, consumer behavior in online platforms, and policy implications of technological disruption. His work spans copyright enforcement, digital advertising, and the impact of piracy on legal media consumption. Publications: His recent studies examine AI’s role in copyright policy, effectiveness of anti-piracy measures, and market dynamics in digital streaming. Articles often bridge economics, computer science, and public policy. Awards: National Science Foundation CAREER Award Multiple Best Teacher Awards at CMU Recognized as a Top 100 Emerging Engineering Leader (NAE, 2020) Best Paper Runner-Up (Information Systems Research, 2006) Editorial and Industry Roles: Served as Senior Editor at Information Systems Research and Associate Editor at Management Science . Prior to academia, he worked in telecommunications at GTE and Booz Allen Hamilton, earning a patent for AI applications in network design. Contact: mds@cmu.edu | Office: 4800 Forbes Avenue, Hamburg Hall 2204, Pittsburgh PA 15213

• Theoretical Computer Science
• Error-Correcting Codes
• Approximation Algorithms
• +۴ مورد دیگر

Venkatesan Guruswami is a Chancellor's Professor in the Department of Electrical Engineering and Computer Sciences and Professor in the Department of Mathematics at the University of California, Berkeley. He previously served as faculty at Carnegie Mellon University for 13 years and held a Miller Research Fellowship at UC Berkeley. His research focuses on Theoretical Computer Science , particularly in Error-Correcting Codes , Approximation Algorithms , Quantum Computing , and Hardness of Approximation . Guruswami has made groundbreaking contributions to list decoding and quantum code constructions, with works featured in Science Magazine and the Journal of the ACM (where he serves as Editor-in-Chief). Education : B.Tech (1997, IIT Madras), Ph.D. (2001, MIT), Miller Research Fellowship (2001-02, UC Berkeley) Research Areas : Theory of error-correcting codes, approximation algorithms, pseudorandomness, probabilistically checkable proofs, and quantum coding theory Guruswami's recent work explores quantum LDPC codes , parameterized inapproximability , and stream decodable codes . He has received prestigious awards including the NSF CAREER award , David and Lucile Packard Fellowship , and Sloan Research Fellowship . His advising spans a wide range of students and postdocs, with notable contributions to coding theory and computational complexity .

• Statistical Machine Learning
• Algorithmic Statistics
• Robust Statistics
• +۱۱ مورد دیگر

Sivaraman Balakrishnan is a Professor at Carnegie Mellon University with joint appointments in the Department of Statistics and Data Science and the Machine Learning Department. His research bridges statistical machine learning, algorithmic statistics, and robust inference. Education: Ph.D. in Computer Science from Carnegie Mellon University (Language Technologies Institute, advised by Jaime Carbonell); postdoctoral work at UC Berkeley (Department of Statistics, advised by Martin Wainwright and Bin Yu). Research Interests: Spanning robust statistics, domain adaptation, minimax hypothesis testing, assumption-light inference, causal inference, statistical optimal transport, non-parametric statistics, ranking, crowdsourcing, optimization, and topological data analysis. Key Research Trends: Recent work focuses on domain adaptation under label/misingness shifts, robust gradient estimation, smooth optimal transport maps, and conditional independence testing. He explores minimax optimal methods, univariate mean estimation, and high-dimensional regression with missing data. Scientific Awards: IMS Lawrence D. Brown Student Award (2021, 2020) NVIDIA Pioneer Award (2018) Franklin V. Taylor Memorial Best Paper Award (2018) Grants and Editorial Roles: NSF grants (CCF-1763734, DMS-1713003, DMS-2113684, DMS-2310632), Amazon Research Award (2021), Google Research Scholar Award (2021). Associate Editor for JASA and JRSSB ; Editorial Board member for Foundations and Trends in Statistics . Collaborative Groups: Co-organizes the Statistics and Machine Learning Reading Group and participates in the Causal Inference Working Group at CMU.

Aayush Jainمشاهده پروفایل

استادیار

• Cryptography
• Theoretical Computer Science
• Applied Cryptography
• +۳ مورد دیگر

Aayush Jain is an Assistant Professor in the Computer Science Department at Carnegie Mellon University. Previously, he was a Postdoctoral Fellow at NTT Research and a PhD student at UCLA, advised by Professor Amit Sahai. His work bridges theoretical and applied cryptography with core computer science principles. Education PhD in Computer Science, University of California, Los Angeles (UCLA) Postdoctoral Fellowship, NTT Research Research Focus His research explores: foundational cryptography, indistinguishability obfuscation, functional encryption, lattice-based cryptography, secure multi-party computation, and post-quantum security. Work emphasizes rigorous theoretical frameworks with practical implications. Publication Trends Recent articles (2021-2024) demonstrate consistent focus on cryptographic primitives, obfuscation techniques, and security reductions. Dominant venues include CRYPTO, EUROCRYPT, FOCS, and STOC with emerging work in machine learning interfaces. Awards Best Paper Award at STOC 2021 for foundational contributions to indistinguishability obfuscation Advising and Collaboration Current PhD advisees: Alper Cakan, Quang Dao (co-advised), Sagnik Saha, Noah Singer (co-advised). Mentored postdocs: Mitali Bafna (2022-2023) and Rex Fernando (2022-2023). Teaches graduate courses in cryptography and theoretical tools. Leadership Leads the CMU Cryptography research group; organized the CMU Cryptography Workshop. Program committee member for FOCS, TCC, ITCS, and ICALP.

Yihan Sunمشاهده پروفایل

استادیار

• Parallel Computing
• Algorithms
• Data Structures
• +۱۲ مورد دیگر

Yihan Sun is an Assistant Professor at the University of California, Riverside (UCR) since January 2020. He earned his Ph.D. in Computer Science from Carnegie Mellon University (CMU) , advised by Guy Blelloch , and holds a Bachelor's degree in Computer Science from Tsinghua University . Research Interests: Yihan Sun focuses on the theory and practice of parallel computing , including Parallel algorithms and data structures Write-efficient algorithms for Non-Volatile Memory (NVM) Computational geometry (range trees, Delaunay triangulations) Graph algorithms (SSSP, SCC, cluster-based BFS) Concurrent and persistent data structures Multi-version concurrency control (MVCC) with garbage collection Applications in databases, transactional systems, and computational biology Recent Research Trends: His work on join-based parallel balanced trees has been foundational, supporting four balancing schemes (AVL, red-black, weight-balanced, treaps) and enabling efficient implementations in graph analytics, spatial queries, and dynamic programming. Recent publications focus on output-sensitive algorithms , scalable graph libraries (PASGAL) , and pedagogical approaches to teaching parallel algorithms. Teaching: He teaches CS260 (Parallel Algorithms) at UCR and has served as a guest lecturer for MIT 6.886 (Algorithm Engineering) and CMU 15-859 (Algorithms in the real world) . He also contributed to algorithm education through a tutorial at the ACM Symposium on Principles and Practice of Parallel Programming (PPoPP 2019) . Labs & Collaborations: Yihan is a core contributor to the PAM (Parallel Augmented Maps) library, which has been integrated into systems like Aspen (graph-streaming) and C-trees . He collaborates with teams at CMU-Parlay , PBBS , and Ligra , with his code available on Github for community feedback.

• Algorithms
• Data Streams
• Machine Learning
• +۳ مورد دیگر

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.