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

• Machine Learning
• Probability
• Mathematical Physics
• +۶ مورد دیگر

Boris Hanin is an Associate Professor at Princeton University's Department of Operations Research and Financial Engineering (ORFE) and Associated Faculty at the Program in Applied and Computational Mathematics (PACM). Prior to Princeton, he held academic positions at Texas A&M University (Assistant Professor of Mathematics), MIT (NSF Postdoctoral Fellow), and Northwestern University (PhD in Mathematics under Steve Zelditch). He works part-time at Foundry, an AI/computing startup, leading the Foundry Institute. PhD in Mathematics, Northwestern University NSF Postdoctoral Fellowship, MIT Mathematics Associate Professor, Princeton ORFE Part-Time Leader, Foundry Institute His research spans machine learning, probability theory, and mathematical physics, focusing on neural network theory (approximation power, optimization guarantees), random matrix theory, and spectral asymptotics. He has made foundational contributions to understanding gradient behavior, initialization, and infinite-width limits in deep learning. Boris has supervised numerous PhD students and postdocs, with former members securing prestigious positions at Harvard, MIT, and Huawei. He serves as Associate Editor for journals like Pure and Applied Analysis and Mathematics of Operations Research , and has taught short courses at Oxford, Luxembourg, and Tor Vergata on statistical physics of neural networks and deep learning theory. 2024 Sloan Fellowship in Mathematics NSF CAREER grant DMS-2143754 NSF grant DMS-2133806 His research group collaborates on topics including hyperparameter transfer, architecture-aware scaling, and spectral analysis of random waves and neural networks. He actively contributes to theoretical machine learning through foundational publications in venues like Probability Theory and Related Fields , Journal of Machine Learning Research , and Communications in Mathematical Physics .

• Machine Learning
• Data Privacy
• Robust Learning
• +۳ مورد دیگر

Amartya Sanyal is a Tenure Track Assistant Professor at the Department of Computer Science (DIKU), University of Copenhagen, specializing in Machine Learning. He also serves as an Adjunct Professor at the Indian Institute of Technology Kanpur (2023–2025). His research focuses on critical areas of AI safety, data privacy, and robust learning. University: University of Copenhagen Department: Department of Computer Science Academic Rank: Assistant Professor Adjunct Role: IIT Kanpur (2023–2025) His work addresses challenges like differential privacy , data poisoning attacks , machine unlearning , and robust mixture learning . Recent publications analyze privacy-preserving techniques for large language models, fairness in collective action algorithms, and certified data release mechanisms. Amartya has received the Villum Young Investigator Award (2025). His research outputs emphasize online learning , adversarial robustness , and privacy-utility tradeoffs through rigorous theoretical frameworks and practical implementations. Scientific Award: Villum Young Investigator Award His collaborations span institutions like IIT Kanpur and involve interdisciplinary projects with industry partners. Current activities include talks on privacy with correlated data and machine unlearning advancements.

Daniel M. Kaneمشاهده پروفایل

استاد

• Number Theory
• Combinatorics
• Complexity Theory
• +۳ مورد دیگر

Daniel M. Kane is a Professor at the University of California, San Diego (UCSD), holding a joint appointment in the Department of Mathematics and the Department of Computer Science and Engineering (CSE). His research spans mathematics and theoretical computer science, with a focus on number theory, combinatorics, complexity theory, and computational statistics. He earned a Ph.D. in Mathematics from Harvard University (2011) and dual BS degrees in Mathematics with Computer Science and Physics from MIT (2007). Prior to UCSD, he was a postdoctoral researcher at Stanford University (2011–2014) on an NSF fellowship. His research interests include robust statistics, machine learning, polynomial threshold functions, and algorithmic methods for high-dimensional data. Notable achievements include co-authoring the book Algorithmic High-Dimensional Robust Statistics (Cambridge University Press, 2023) and receiving the Best Paper Award at the Conference on Computational Complexity (2013), as well as gold medals at the International Mathematical Olympiad (2002 and 2003). Current teaching includes courses such as Math 96 (Putnam Seminar), Math 154 (Graph Theory), CSE 101 (Algorithms), and CSE 203A (Randomized Algorithms). He has consulted for companies like CASPER Labs and AIble, and his work extends to cryptographic protocols, including quantum money schemes based on quaternion algebras. Key contributions include breakthroughs in robust mean estimation, list-decodable learning, and the development of efficient algorithms for statistical problems. His research often bridges foundational theory with practical applications in machine learning and data analysis.

Hadi Daneshmandمشاهده پروفایل

استادیار

• Foundations of Machine Learning
• Understanding neural networks
• Optimization for machine learning
• +۳ مورد دیگر

Hadi Daneshmand is an Assistant Professor of Computer Science at the University of Virginia, specializing in theoretical machine learning. Prior to joining UVA, he completed postdoctoral research at FODSI (jointly hosted by MIT and Boston University), Princeton University, and INRIA Paris following his 2020 PhD in Computer Science from ETH Zurich. Education Ph.D. in Computer Science, ETH Zurich, 2020 His research bridges computational perspectives and neural network theory, focusing on theoretical guarantees for deep learning systems. Key interests include understanding neural network mechanisms through optimization frameworks, foundations of machine learning, and stochastic processes in learning systems. His work reveals how neural networks implement computational primitives like gradient descent and optimal transport through architectural components. Recent publications demonstrate a cohesive trajectory analyzing transformers' computational capabilities, batch normalization's theoretical properties, and optimization dynamics in deep learning. His studies consistently establish formal connections between neural architectures and classical optimization methods, particularly in in-context learning scenarios. Scientific Awards Stanford CPAL Rising Star Award Spotlight award at ICML In-context Learning workshop (2024) Postdoc fellowship of the Foundation of Data Science Institute (FODSI) Early Postdoc Mobility grant from SNSF Best poster award at Max Planck ETH deep learning workshop (2016) Reviewer awards for ICML (2022, 2019) and NeurIPS (2020) Dr. Daneshmand actively mentors graduate students, with advisees including PhD candidates at ETH Zurich who have secured positions at Harvard, Yale, Meta, and NVIDIA. His research is supported by competitive grants including the SNSF Early Postdoc Mobility award and FODSI fellowship. He serves the community as Area Chair for NeurIPS 2023-2024 and ICML 2025, and regularly reviews for top machine learning conferences and journals. He teaches specialized courses including "Neural Networks: A Theory Lab" at UVA, emphasizing experimental-theoretical connections in neural computation through hands-on coding exercises.

Stephen A. Vavasisمشاهده پروفایل

استاد

• Continuous Optimization
• Data Science
• First-Order Methods
• +۴ مورد دیگر

Stephen A. Vavasis is a Professor in the Department of Combinatorics and Optimization at the University of Waterloo, part of the Faculty of Mathematics. He holds a PhD in Computer Science from Stanford University (1989) and has held academic positions at Cornell University (1989–2006) before joining Waterloo. His research focuses on continuous optimization, data science, first-order methods, scientific computing, and computational mechanics. Current teaching includes courses on convex optimization and portfolio optimization methods. He has served as Associate Dean of Computing (2017–2020) and Interim Director of Data Science graduate programs. His work is supported by NSERC grants. Notable awards include the Hertz Fellowship, Churchill Scholarship, and Guggenheim Fellowship. Vavasis's research emphasizes applications of optimization to clustering, machine learning, and fracture mechanics. His publications span convex optimization frameworks, algorithmic analysis of gradient methods, and numerical methods in mechanics. Recent work explores unifying analyses of first-order optimization algorithms and robust optimization techniques for high-dimensional data problems.

Mohammad Mohammadi Amiriمشاهده پروفایل

استادیار

• Large Language Models
• Data Valuation
• Federated Learning
• +۵ مورد دیگر

Mohammad Mohammadi Amiri serves as an Assistant Professor in the Department of Computer Science at Rensselaer Polytechnic Institute (RPI), appointed in Fall 2023. His research focuses on advancing artificial intelligence through strategic data utilization, with emphasis on large language models, data valuation, federated learning, and deep learning. Previously, he held postdoctoral appointments at Princeton University and MIT Media Lab, building on his strong educational foundation from Imperial College London, University of Tehran, and Iran University of Science and Technology. Education: Ph.D. in Electrical and Electronic Engineering, Imperial College London (2019) - Best Ph.D. Thesis Award recipient M.Sc. in Electrical and Computer Engineering, University of Tehran (2014) - Ranked 1st among all M.Sc. students B.Sc. in Electrical Engineering, Iran University of Science and Technology (2011) - Ranked 1st among all B.Sc. students Dr. Amiri's research centers on optimizing artificial intelligence systems through innovative data strategies. His work addresses critical challenges in large language models including efficiency, memory usage, alignment, and reasoning capabilities. In data valuation, he develops principled methods to quantify data worth for fair trading platforms. His federated learning research tackles privacy concerns, heterogeneous data distribution, and communication overhead in decentralized environments. The deep learning component explores theoretical foundations to improve model interpretability and robustness. Analysis of his recent publications reveals a strong focus on making AI systems more efficient and accessible, with particular emphasis on large language model optimization, federated learning advancements, and data valuation frameworks. His work bridges theoretical foundations with practical applications in wireless communications and distributed computing environments. Scientific Awards: IEEE Communications Society Young Author Best Paper Award (2022) Best PhD Thesis Award from IEEE Information Theory Chapter of UK and Ireland (2019) Eryl Cadwallader Davies Prize for Outstanding PhD Thesis (2019) EEE Departmental Scholarship at Imperial College London (2015-2019) Ranked 1st among M.Sc. students at University of Tehran (2014) Ranked 1st among B.Sc. students at Iran University of Science and Technology (2011) Dr. Amiri actively mentors graduate students, currently supervising five Ph.D. candidates and one M.Sc. student working on efficient LLM fine-tuning, inference, and storage. His research has attracted significant attention, evidenced by numerous keynote invitations at prestigious institutions including Bell Labs, MIT, King's College London, and various IEEE conferences. He serves on program committees for major conferences including IEEE Globecom and ICC, demonstrating his growing influence in the academic community. His research group operates at the intersection of machine learning and wireless communications, developing innovative solutions for resource-constrained environments while addressing fundamental theoretical challenges in AI systems. Current projects focus on making advanced AI more scalable and accessible through efficiency improvements in model training and inference.

Nina Balcanمشاهده پروفایل

استاد

• Machine Learning
• Artificial Intelligence
• Theoretical Computer Science
• +۵ مورد دیگر

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.

Pragya Surمشاهده پروفایل

استادیار

• High-dimensional Statistics
• Machine Learning
• Artificial Intelligence
• +۳ مورد دیگر

Pragya Sur is an Assistant Professor of Statistics at Harvard University and currently on leave as a Visiting Professor at MIT’s Laboratory for Information and Decision Systems (LIDS). Her research focuses on high-dimensional statistics, machine learning, and artificial intelligence, particularly in overparametrized models, causal inference, and learning under distribution shifts. She has held postdoctoral positions at Harvard’s Center for Research on Computation and Society (hosted by Cynthia Dwork) and was a Simons Institute Long-Term Participant at UC Berkeley. She earned her Ph.D. in Statistics from Stanford University under Emmanuel Candès, and completed her B.Stat and M.Stat at the Indian Statistical Institute, Kolkata. Sur’s work has been supported by NSF awards, the Eric and Wendy Schmidt Fund, and the William F. Milton Fund. She was named an International Strategy Forum (ISF) Fellow (2023) and led the Institute of Mathematical Statistics (IMS) New Researchers Group (2022–2024). She serves as an Associate Editor for Statistical Science and Guest Co-Editor for a special issue on AI and statistics. Her research contributions span theoretical guarantees for machine learning, transfer learning, and debiasing techniques in high-dimensional inference. Awards: NSF CAREER Award, Theodore W. Anderson Dissertation Award, Ric Weiland Fellowship Education: Ph.D. in Statistics (Stanford, 2019); M.Stat (ISI Kolkata, 2014); B.Stat (ISI Kolkata, 2012) Professional Roles: Associate Editor, Statistical Science ; ISF Fellow (2023); former IMS New Researchers Group Lead Her current research emphasizes statistical theory for modern machine learning, including foundational work on overparametrized models and robust inference across heterogeneous environments.

Sofya Raskhodnikovaمشاهده پروفایل

استاد

• Sublinear-time algorithms
• Data Privacy
• Approximation Algorithms
• +۳ مورد دیگر

Sofya Raskhodnikova is a Professor in the Department of Computer Science at Boston University, part of the College of Arts and Sciences. She holds a Ph.D. from MIT and has held positions at Penn State University and postdoctoral fellowships at the Hebrew University of Jerusalem and the Weizmann Institute of Science. Her research focuses on sublinear-time algorithms, data privacy, approximation algorithms, and complexity theory. She is a recipient of the NSF CAREER Award and has contributed significantly to the theoretical foundations of privacy-preserving computation and algorithm design. Education: Ph.D. in Computer Science from MIT (2003), postdoctoral research at Hebrew University of Jerusalem and Weizmann Institute of Science (2003–2006). Visiting positions at UCLA, Harvard University, and the Simons Institute for the Theory of Computing. Research Interests: Sofya’s work bridges theoretical computer science and practical applications, emphasizing algorithms that operate efficiently on large datasets. Key areas include property testing (e.g., monotonicity, sortedness), differential privacy, and sublinear-time algorithms. She explores how algorithms can analyze data while preserving privacy guarantees and minimizing computational resources. Publications: Over 50 peer-reviewed articles in top venues such as STOC, FOCS, and SODA, with recent contributions focusing on dynamic graph algorithms under privacy constraints and robust property testing against adversarial noise. Professional Activities: Editor for ACM Transactions on Computation Theory and Algorithmica ; program committee chair for WOLA 2021 and CSR 2022; active in mentoring initiatives like Sigma Camp and Artemis. Advising & Students: Current advisees include Ephraim Linder and Debanuj Nayak. Notable alumni include Iden Kalemaj (Meta Research) and Nithin Varma (Max Planck Institute). She has supervised over 15 Ph.D. students and postdocs, fostering a collaborative research environment.

David Hongمشاهده پروفایل

استادیار

• Big Data Analysis
• Low-Rank Matrix and Tensor Methods
• Unsupervised Learning
• +۵ مورد دیگر

David Hong is an Assistant Professor in the Department of Electrical and Computer Engineering at the University of Delaware. He holds a PhD from the University of Michigan, where he was an NSF Graduate Research Fellow, and previously served as an NSF Postdoctoral Research Fellow at the University of Pennsylvania. His research focuses on developing robust methods for analyzing heterogeneous and high-dimensional data, particularly through low-rank matrix and tensor techniques. Applications span medical imaging, radar systems, genomics, and astronomy. He emphasizes theoretical guarantees and practical algorithms for signal extraction and inverse problems. Education: PhD in Electrical Engineering and Computer Science (University of Michigan), NSF Postdoctoral Research Fellowship (University of Pennsylvania). Research Interests: Low-rank matrix/tensor methods, heterogeneous data analysis, unsupervised learning, and applications in healthcare, imaging, and sensor systems. His work addresses noise robustness, scalable algorithms, and real-world deployment challenges. Scientific Awards: Recipient of the NSF Postdoctoral Research Fellowship (2020) and NSF Graduate Research Fellowship (2015). Advising & Grants: Advisor to graduate students in machine learning and signal processing (no named advisees listed). Active NSF grant recipient for foundational and applied research in data science. Labs/Teams: Engaged in interdisciplinary collaborations through the University of Delaware's Center for Computational Research and Data Science initiatives.

Kejun Huangمشاهده پروفایل

استادیار

• Machine Learning
• Signal Processing
• Optimization
• +۲ مورد دیگر

Kejun Huang is an Assistant Professor in the Department of Computer and Information Science and Engineering at the University of Florida's Herbert Wertheim College of Engineering. His primary research area is Machine Learning, with additional interests in algorithms, computer vision, and data science. He received his Ph.D. in Electrical Engineering from the University of Minnesota in 2016. His research focuses on machine learning, signal processing, optimization, and statistics. Recent work tackles unsupervised learning challenges and AI-powered medical research through NIH-funded projects. Dr. Huang's publications demonstrate consistent focus on optimization techniques for tensor decomposition, dictionary learning identifiability, and nonnegative matrix factorization. Key themes include algorithmic efficiency and theoretical guarantees in machine learning models.

David Steurerمشاهده پروفایل

دانشیار

• Theoretical Computer Science
• Algorithms
• Sum-of-Squares Method
• +۵ مورد دیگر

David Steurer is an Associate Professor in the Department of Computer Science at ETH Zurich, where he leads the Institute for Theoretical Computer Science. His research bridges theoretical computer science, mathematics, and practical applications in machine learning and statistics. Steurer has made significant contributions to the understanding of sum-of-squares methods, semidefinite programming, and high-dimensional estimation problems. Steurer earned his B.Sc. & M.Sc. in Computer Science from Saarland University in 2006, followed by a Ph.D. in Computer Science from Princeton University in 2010 under the supervision of Sanjeev Arora. His doctoral dissertation, "On the Complexity of Unique Games and Graph Expansion," received an Honorable Mention for the ACM Doctoral Dissertation Award in 2011. Steurer's research focuses on algorithm design through mathematical programming relaxations, particularly semidefinite programming and the sum-of-squares method. His work addresses computational complexity of high-dimensional estimation problems including tensor decomposition, clustering, Gaussian mixture models, and stochastic block models. He also investigates algorithmic aspects of robustness and differential privacy, especially for estimation tasks. His theoretical contributions have practical implications for machine learning and data analysis in the presence of noise and adversarial conditions. Analysis of Steurer's recent publications reveals a consistent trajectory in advancing the sum-of-squares framework for high-dimensional estimation and robust statistics. His work demonstrates how sophisticated mathematical programming techniques can provide certifiable guarantees for challenging problems in machine learning. The research spans theoretical foundations while maintaining relevance to practical applications, particularly in scenarios involving corrupted or noisy data. A notable trend is the extension of sum-of-squares methods to handle increasingly complex statistical models while providing rigorous performance guarantees. ERC Consolidator Grant (2019) Michael and Sheila Held prize (2018, with Raghavendra) Invited speaker at International Congress of Mathematicians (2018) STOC Best Paper Award (2015) Alfred P. Sloan Research Fellowship (2014) NSF CAREER Award (2014) Microsoft Research Faculty Fellowship (2014) FOCS Best Paper Award (2010) Steurer has advised numerous PhD students and postdocs who have gone on to prominent positions, including Sam Hopkins (now faculty at MIT), Jonathan Shi, and Aaron Potechin. His research is supported by multiple prestigious grants, including an ERC Consolidator Grant, an NSF CAREER Award, and a Microsoft Research Faculty Fellowship. He has served on numerous program committees for top theoretical computer science conferences and has been recognized for his service to the community through roles such as internal member of the Scientific Advisory Committee of the Institute for Theoretical Studies at ETH Zurich. As head of the Institute for Theoretical Computer Science at ETH Zurich, Steurer leads a research group focused on advancing the theoretical foundations of computer science with particular emphasis on mathematical optimization methods. His team explores the boundaries of what can be efficiently computed in high-dimensional settings, with applications spanning machine learning, statistics, and data science. The group maintains strong connections with both theoretical and applied researchers across ETH and the broader academic community.

Bei Jiangمشاهده پروفایل

دانشیار

• Biostatistics
• Functional Data Analysis
• Statistical Machine Learning
• +۶ مورد دیگر

Dr. Bei Jiang is an Associate Professor in the Department of Mathematical and Statistical Sciences at the University of Alberta , Canada. She holds the Canada CIFAR AI Chair and is affiliated with the Alberta Machine Intelligence Institute (Amii) . Her academic journey includes a PhD in Biostatistics (2014) from the University of Michigan, MS (2008) and BS (2004) from the University of Alberta and Beijing University of Technology, respectively. Current Positions : 2021–Present (Associate Professor), 2022–Present (CIFAR AI Chair) Past Appointments : Assistant Professor (2015–2021), Postdoctoral Fellow at Columbia University (2014–2015), Research Assistant at University of Michigan (2009–2013) Research Interests : Dr. Jiang specializes in methods for joint modeling of longitudinal and health outcome data , Bayesian hierarchical modeling , functional and imaging data analysis , and statistical machine learning . Her work integrates kernel machine regression , differential privacy , and synthetic data generation to address challenges in heterogeneous health data and neuroimaging. Scientific Awards : Highlights include the 2015 SAMSI New Research Fellow , multiple Rackham Conference Travel Awards (2013, 2012), and prestigious NSERC scholarships (2009–2012). She has also received the J Gordin Kaplan Graduate Award (2008) and Statistical Society of Canada Travel Award (2008). Grants : $375,000 (CIFAR AI Chairs, 2022–2027), $480,000 (MITACS Accelerate, 2022–2025), and $210,000 (Canadian Statistical Sciences Institute, 2022–2025) Students and Postdocs : She mentors numerous PhD , MSc , and Postdoctoral Fellows , including Junxi Zhang (2023–Present), Enze Shi (2022–Present), and former advisees like Wenxing Guo (now Lecturer at University of Essex) and Yafei Wang (Assistant Professor at University of Alberta).

• Reinforcement Learning
• Bandit Algorithms
• Learning Theory
• +۴ مورد دیگر

Claire Vernade is a Group Leader at the University of Tübingen within the Cluster of Excellence Machine Learning for Science. She holds an Emmy Noether award (2022) and an ERC Starting Grant (2024) for her projects FoLiReL and ConSequentIAL , focusing on theoretical reinforcement learning and non-stationary environments. Education: PhD from Telecom ParisTech (2017) Post-doctoral researcher at University of Magdeburg (2018) Her research bridges sequential decision making, bandit problems, and reinforcement learning theory. Recent work explores lifelong learning, distributional RL, and game-theoretic approaches to PCA, emphasizing mathematical rigor and algorithmic innovation. Recent publications highlight trends in non-stationary RL , continual learning , and bandit algorithms with complex feedback structures. Key subfields include meta-learning, adaptive control, and theoretical guarantees in dynamic programming. Scientific Awards: Emmy Noether Award (2022) ERC Starting Grant (2024) Outstanding Paper Award & Oral Presentation, ICLR (2021) She mentors PhD and master's students in theoretical machine learning, with current advisees including Nicolas Nguyen, Onno Eberhard, and Ziyad Sheebaelhamd. Her lab actively recruits candidates in bandit algorithms and RL theory through the IMPRS-IS and ELLIS doctoral programs. Claire co-leads diversity initiatives like Tübingen Women in Machine Learning and Women in Learning Theory, advocating for inclusivity in AI research. She has organized workshops at ICML and EWRL, and contributed to union activism in the tech industry.

David Garlanمشاهده پروفایل

استاد

• Software Engineering
• Software Architecture
• Self-Adaptive Systems
• +۴ مورد دیگر

David Garlan is a Professor at the Software and Societal Systems Department within the School of Computer Science at Carnegie Mellon University , where he also serves as Associate Dean for Master’s Programs . He received his Ph.D. from Carnegie Mellon in 1987 after working in industry as a software architect. His research focuses on controlling complexity in large software systems through formalized architectural design, self-adaptive systems, and cyber-physical systems. He developed AcmeStudio , a widely used architecture design environment, and pioneered formal representation and analysis of software architecture. Education : Ph.D. in Computer Science (Carnegie Mellon, 1987) Research Interests include: Software Architecture: Formal methods for architectural design, end-user composition, and architectural styles Self-Adaptive Systems: Stochastic planning, model checking, security adaptation, and uncertainty reduction Cyber-Physical Systems: Multi-view design methods, consistency checking, and automotive systems Recent Article Trends address microservice resiliency, hybrid planning (combining formal methods and ML), simulation-augmented robotics, and sustainable machine translation. Themes include stochastic modeling , probabilistic verification , and adaptive decision-making . Scientific Awards : Stevens Award Citation (2005) ACM SIGSOFT Outstanding Research Award (2011) Allen Newell Award for Research Excellence (2016) IEEE TCSE Distinguished Education Award (2017) Nancy Mead Award (2017) Fellow of IEEE and ACM Advising and Grants : He has advised 25+ graduate students and collaborated on projects with Toyota and the Software Engineering Institute. His work includes model-based adaptation, automated planning, and formal verification of adaptive systems. Labs & Teams : Affiliated with the Institute for Software Research and works on tools like AcmeStudio, Rainbow, and IPL for architectural modeling and self-adaptation.