Find Academic Supervisors

Kaiming HeView profile

Associate Professor

• Computer Vision
• Deep Learning
• Machine Learning
• +6 more

Kaiming He is an Associate Professor with tenure in the Department of Electrical Engineering and Computer Science (EECS) at the Massachusetts Institute of Technology (MIT), holding the Douglas Ross (1954) Career Development Professor of Software Technology chair. He also works part-time as a Distinguished Scientist at Google DeepMind. Prior to joining MIT in 2024, he was a research scientist at Facebook AI Research (FAIR) from 2016 to 2024, and a researcher at Microsoft Research Asia (MSRA) from 2011 to 2016. Dr. He received his PhD from the Chinese University of Hong Kong in 2011 and his Bachelor of Science from Tsinghua University in 2007. His academic journey reflects a strong foundation in computer science and engineering that has led to transformative contributions in artificial intelligence. His research primarily focuses on computer vision and deep learning, with pioneering work on deep residual networks (ResNets), visual object detection and segmentation, and self-supervised learning. He is best known for his work on Deep Residual Networks (ResNets), recognized as the most-cited paper of the twenty-first century. The residual connections he pioneered are now fundamental components in modern deep learning architectures including Transformers, AlphaGo Zero, AlphaFold, and various generative AI models. His recent publications demonstrate continued innovation across generative models, transformer architectures, and cross-disciplinary AI applications. His work bridges theoretical advances in neural network design with practical implementations that address real-world challenges in physics, biology, and other scientific domains. PAMI Young Researcher Award (2018) Best Paper Award, CVPR (2009, 2016) Best Paper Award, ICCV (2017) Best Student Paper Award, ICCV (2017) Everingham Prize, ICCV (2021) Most-cited paper of the twenty-first century Dr. He advises graduate students including Jake Austin, Xingjian Bai, and Mingyang Deng, and teaches advanced courses such as "6.S978: Deep Generative Models" (Fall 2024) and "6.8300/6.8301: Advances in Computer Vision" (Spring 2024). His research group actively explores how AI can serve as a unifying framework across scientific disciplines, breaking down traditional barriers between fields through shared methodologies and tools.

• Machine Learning
• Probability
• Mathematical Physics
• +6 more

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 .

Catherine GreenhillView profile

Professor

• Combinatorics
• Graph Theory
• Applied Probability
• +6 more

Professor Catherine Greenhill is a faculty member at the School of Mathematics and Statistics, UNSW Sydney , where she serves as Professor and head of the Combinatorics group. Her academic career spans institutions including the University of Queensland, University of Oxford, University of Leeds, University of Melbourne, and Australian National University. D.Phil., University of Oxford (1996) M.Sc. (Research) in Combinatorics (1992) B.Sc. (Hons) in Pure Mathematics (1991) Her research focuses on the intersection of discrete mathematics , theoretical computer science , and probability , particularly in asymptotic combinatorics , probabilistic methods , and analysis of algorithms . Her work includes asymptotic enumeration of combinatorial structures and design of randomized algorithms for graph sampling and counting. Her recent publications (2025–2021) center on random graphs and hypergraphs , with key contributions to switch Markov chains , degree sequence analysis , and chromatic number bounds . These works reflect her expertise in probabilistic combinatorics and algorithmic complexity . Scientific Awards: Fellow of the Australian Academy of Science (2022) Christopher Heyde Medal in Pure Mathematics (2015) June Griffith Fellowship (2013) Hall Medal (2010) Advising and Grants: She has supervised numerous PhD/Masters students and secured multiple ARC Discovery Grants (2019–2021, 2014–2016, 2012–2014). Her grants address topics like hypergraph modeling, random discrete structures, and network analysis in illicit drug trafficking.

Shivaram KalyanakrishnanView profile

Associate Professor

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

Shivaram Kalyanakrishnan is an Associate Professor at the Department of Computer Science and Engineering , Indian Institute of Technology Bombay , specialising in Artificial Intelligence and Machine Learning . His research spans sequential decision making , multiagent learning , multi-armed bandits , and humanoid robotics , with applications in robot soccer , computer games , and online advertising . He teaches advanced courses like CS 747: Foundations of Intelligent and Learning Agents and CS 748: Advances in Intelligent and Learning Agents , focusing on end-to-end system design and theoretical analysis. His scientific awards include the Best Student Paper Award at RoboCup International Symposium 2006 and nomination for Best Student Paper Award at AAMAS 2007 . His work on reinforcement learning and policy iteration has been published in leading venues such as IJCAI , ICML , and COLT , with recent contributions to railway scheduling and bandit algorithms. While no explicit list of advisees is provided, his research projects and publications suggest mentorship of students in collaborative efforts. Contact : shivaram@cse.iitb.ac.in .

Yee Whye TehView profile

Professor

• Statistical Machine Learning
• Probabilistic Learning
• Deep Learning
• +4 more

Yee Whye Teh is a Professor at the Department of Statistics, University of Oxford, and a research scientist at DeepMind. His work focuses on statistical machine learning, including probabilistic learning, Bayesian nonparametrics, deep learning, and Monte Carlo methods. He co-directs the ELLIS programme on Robust Machine Learning and has held roles such as Programme Co-chair for ICML 2017. Teh has delivered keynotes at UAI 2019, an IMS Medallion Lecture at JSM 2019, and the Breiman Lecture in 2017. His research emphasizes scalable inference algorithms, hierarchical models, and applications in genetics and natural language processing. Teh's educational background includes a PhD from the University of Toronto (2003) and a Master's from the same institution (2000). He has contributed to widely used software tools like the Sequence Memoizer and has been recognized for his work through prestigious lectureships. Research interests span Bayesian nonparametric models, MCMC methods, and their applications in genetics and data compression. His lab collaborates on projects like fragmentation-coagulation processes for genetic variation modeling and Mondrian forests for online learning. Teh advises students through Oxford's graduate programs, though he notes high demand for mentorship. His work often bridges theory and practice, addressing challenges in big data learning and small data problems.

Polina GollandView profile

Professor

• Biomedical Image Analysis
• Medical Vision
• AI & Machine Learning
• +8 more

Polina Golland is a Professor in the Department of Electrical Engineering and Computer Science (EECS) at MIT and a Principal Investigator in the Computer Science and Artificial Intelligence Laboratory (CSAIL). Her research focuses on developing novel techniques for biomedical image analysis and understanding, particularly in medical vision, AI/ML, and health care applications. She leads the Medical Vision Group and collaborates with the Vision Group at CSAIL. Her work emphasizes statistical modeling of medical images, shape modeling, and predictive analytics for biological processes. Current projects include fetal MRI analysis, cardiac MRI segmentation, and quantitative assessment of pulmonary edema in chest X-rays. She has secured grants from NIH, MIT-IBM Watson AI Lab, and other institutions to support her research. Dr. Golland teaches courses on inference, probability, and probabilistic systems. She advises graduate students in MIT's EECS program and has mentored numerous postdocs and researchers. Her lab focuses on translating advanced imaging techniques into clinical workflows, with applications in neuroimaging, fetal health monitoring, and cardiovascular disease analysis. Notable collaborations include work with Harvard Medical School affiliates, Brigham and Women's Hospital, and the MIT Jameel Clinic. Her research aims to bridge computational methods with clinical needs, improving diagnostic tools and treatment planning through machine learning and medical imaging innovation.

Andrew StuartView profile

Professor

• Applied and Computational Mathematics
• Bayesian Inverse Problems
• Data Assimilation
• +6 more

Andrew Stuart is the Bren Professor of Computing and Mathematical Sciences at the California Institute of Technology (Caltech), joining in 2016. He previously held faculty positions at the University of Warwick (1999–2016), Stanford University (1992–1999), and Bath University (1989–1992). He earned his PhD from the University of Oxford's Computing Laboratory in 1986. Professor Stuart's research focuses on applied and computational mathematics , particularly Bayesian inverse problems , data assimilation for dynamical systems , and stochastic modeling . His work bridges mathematical theory, algorithm development, and applications in geophysics, materials science, and biological systems. His recent publications emphasize operator learning , machine learning for PDEs , and uncertainty quantification . Key areas include ensemble Kalman methods , Gaussian processes , and neural operators for solving and learning from complex systems. Scientific awards include the Vannevar Bush Faculty Fellowship and election to the Royal Society of Great Britain . He advises graduate students in applied mathematics, computational science, and geophysics, including Edoardo Calvello , Hojjat Kaveh , and Florian Wolf .

Xin GuoView profile

Professor

• Mathematical Finance
• Financial Engineering
• FinTech
• +7 more

Xin Guo is Professor and Department Chair of Industrial Engineering and Operations Research (IEOR) at UC Berkeley's College of Engineering, holding the Coleman Fung Chair in Financial Modeling. Her research bridges mathematical finance, stochastic control, and machine learning with applications in risk analytics and quantitative trading. Education: Ph.D. in Mathematics, Rutgers University (1999) Research Interests: Professor Guo's work centers on mathematical finance , stochastic games , and reinforcement learning . She develops theoretical frameworks for α-potential games and mean-field systems while applying signature methods and GANs to financial data. Her research addresses critical problems in portfolio optimization, fraud detection (e.g., Medicare analytics), and market forecasting, emphasizing the intersection of stochastic control with machine learning for real-world decision-making under uncertainty. Publication Trends: Recent work (2023-2025) shows increasing focus on multi-agent reinforcement learning through mean-field game theory, with applications spanning finance (corporate bonds, trading), healthcare (fraud detection), and transportation (rate forecasting). Key innovations include BSDE approaches for stochastic games, signature-based time series analysis, and theoretical guarantees for GAN training dynamics. Scientific Awards: Holds the prestigious Coleman Fung Chair in Financial Modeling, reflecting significant contributions to quantitative finance research. Advising and Grants: As IEOR Department Chair, Professor Guo mentors graduate students in stochastic modeling and financial engineering. Her research is supported by the Coleman Fung Endowment Fund, with collaborations spanning finance, healthcare, and transportation sectors through industry partnerships. Labs and Teams: Leads the Risk Analytics & Data Analysis Research (RADAResearch) Lab ( https://risklab.ieor.berkeley.edu/ ), which develops cutting-edge methodologies for risk assessment, data-driven decision-making, and game-theoretic solutions to complex systems. The lab fosters interdisciplinary work connecting mathematical theory with practical applications in FinTech and beyond.

Amitabha BagchiView profile

Professor

• Data Algorithmics
• Probability and Networks
• Theoretical Computer Science
• +7 more

Amitabha Bagchi is a Professor in the Department of Computer Science and Engineering at IIT Delhi. His research spans data algorithmics, probability, networks, and theoretical computer science, with applications in distributed systems, social networks, and AI-driven platforms. He has published extensively in leading venues such as SIGMOD, VLDB, ICDE, AAAI, and KDD, often collaborating with students and researchers on problems involving graph algorithms, fairness, and large-scale data analysis. Research Interests: His primary research interests include Data Algorithmics, Probability and Networks, Theoretical Computer Science, Distributed Algorithms, Graph Algorithms, and Machine Learning Theory. He investigates algorithmic foundations for real-world problems such as food delivery optimization, social network analysis, and efficient data structures for streaming and large graphs. Publication Trends: Recent publications focus on fairness in gig economy platforms, efficient solvers for graph Laplacians, generalization in neural networks, and temporal graph querying. His work combines theoretical rigor with practical impact, often involving GPU acceleration, distributed computing, and data-aware algorithm design. Scientific Service: Editor, Algorithms (2020–present) Editor, Journal of Discrete Algorithms , Elsevier (2006–2018) Guest Editor, special issue on Algorithms for Shortest Paths in Dynamic and Evolving Networks , Algorithms (2021) Volume Editor for proceedings of ESA, ATMOS, COCOON, and others Conference Leadership: He has served on numerous program committees and as chair for conferences including ESA (Engineering Track, 2016), ATMOS (2020), and ICALP (2019). His involvement spans algorithmic engineering, transportation optimization, and theoretical computer science forums. Teaching: He currently teaches COL863: Special Topics in Theoretical Computer Science on concentration inequalities and their applications. He has previously taught advanced courses in algorithms and data structures.

Samuel J. GershmanView profile

Professor

• Learning
• Memory
• Decision Making
• +6 more

Samuel J. Gershman is a Professor of Psychology at Harvard University, affiliated with both the Department of Psychology and the Center for Brain Science. He directs the Computational Cognitive Neuroscience Lab (CCNLab), where he investigates how the brain acquires richly structured knowledge about the environment and uses this knowledge to guide adaptive behavior. Gershman received his B.A. in Neuroscience and Behavior from Columbia University in 2007 and his Ph.D. in Psychology and Neuroscience from Princeton University in 2013, followed by postdoctoral training in the Department of Brain and Cognitive Sciences at MIT (2013-2015). His research spans computational neuroscience, cognitive psychology, and machine learning. His primary research interests include learning, memory, decision making, and computational neuroscience. Gershman's work integrates behavioral, neuroimaging, and computational techniques to understand cognitive processes. He has made significant contributions to understanding memory systems, reinforcement learning, and the computational principles underlying human cognition. Analysis of Gershman's recent publications reveals a strong focus on computational approaches to understanding cognitive processes, with particular emphasis on memory systems, decision-making mechanisms, and the intersection of artificial intelligence with cognitive neuroscience. His work often bridges theoretical computational models with empirical neuroscience data, exploring how the brain implements efficient cognitive algorithms. Gershman actively mentors graduate students and postdoctoral researchers, with current advisees working on diverse projects spanning computational modeling, neuroimaging, and behavioral experiments. His lab investigates topics ranging from dopamine signaling to social cognition using a combination of theoretical and experimental approaches. The CCNLab, which Gershman directs, brings together researchers from psychology, neuroscience, computer science, and related fields to explore the computational principles of cognition. The lab utilizes a range of methodologies including behavioral experiments, neuroimaging, computational modeling, and theoretical analysis to address fundamental questions about how the mind works.

Tommi JaakkolaView profile

Professor

• Machine Learning
• Artificial Intelligence
• Computational Biology
• +7 more

Tommi Jaakkola is the Thomas Siebel Professor of Electrical Engineering and Computer Science and the Institute for Data, Systems, and Society at the Massachusetts Institute of Technology. He received his MSc in theoretical physics from Helsinki University of Technology in 1992 and his PhD from MIT in computational neuroscience in 1997. After completing a postdoctoral position in computational molecular biology as a DOE/Sloan fellow at UCSC, he joined the MIT EECS faculty in 1998. His research advances how machines can learn, predict or control, and do so at scale in an efficient, principled, and interpretable manner. His work in machine learning extends from foundational theory to modern applications, focusing especially on statistical inference and estimation tasks that lie at the heart of complex learning problems. He designs new methods, theory and algorithms to automate the use and generation of semi-structured data such as natural language text, images, molecules, or strategies. Jaakkola applies and develops algorithms to solve multi-faceted recommender, retrieval, or inferential tasks (particularly in biomedical contexts), design and optimize molecules or reactions for drug design, and model strategic, game theoretic interactions. His recent work heavily focuses on diffusion models, protein structure prediction, molecular design, and generative AI, with significant publications in top conferences including ICML, NeurIPS, and ICLR. His scientific contributions span multiple disciplines with significant impact in both theoretical machine learning and practical applications in computational biology and chemistry, including notable work on antibiotic discovery published in Cell. Current advisees: Julia Balla, Bowen Jing, Hannes Stärk, Peter Holderrieth, Chenyu Wang Recent graduates: Gabriele Corso (Boltz PBC), Ezra Erives (DE Shaw), Jason Yim (Xaira) Jaakkola maintains an active research program through MIT's Computer Science and Artificial Intelligence Laboratory (CSAIL) and the Institute for Data, Systems, and Society (IDSS), with his office located in the Stata Center (32-G470). His work bridges theoretical machine learning with practical applications, making significant contributions to both the academic field and potential real-world impact in healthcare and drug discovery.

• Mathematics of Data
• Numerical Linear Algebra
• Randomized Algorithms
• +5 more

Liza Rebrova is an Assistant Professor in the Department of Operations Research and Financial Engineering (ORFE) at Princeton University's School of Engineering and Applied Science. She is also an associated faculty member of the Program in Applied and Computational Mathematics (PACM) and the Center for Statistics and Machine Learning (CSML). Her research focuses on randomized numerical linear algebra and the mathematics of data science, with connections to high-dimensional probability and stochastic optimization. She develops mathematically justified randomized algorithms for large-scale data, particularly interested in settings where data exhibits mathematical structure such as spectral decay, multi-modality, or non-negativity. Her work addresses challenges in data compression, recovery, and optimization under structured noise conditions. Dr. Rebrova's recent publications show a strong trend toward developing robust algorithms for linear systems, tensor data compression, and nonnegative matrix factorization. Her work bridges theoretical foundations with practical applications in machine learning and data science, with emphasis on memory efficiency and handling corrupted or incomplete data. NSF DMS-2309685 (Single PI, 2024-2026): "Outliers are not what they seem: data-aware, flexible, and robust randomized iterative methods" NSF DMS-2108479 (Collaborative, 2022-2024): "Fast, Low-Memory Embeddings for Tensor Data with Applications" (co-PIs Mark Iwen and Deanna Needell) She currently advises three PhD students (Jackie Lok, Shambhavi Suryanarayanan, and Sofiia Shvaiko) and has previously advised Abraar Chaudhry (PhD 2024) and Nicolo Grometto (Masters thesis 2023). At Princeton, she teaches graduate courses including ORF526 (Graduate Probability), ORF387 (Networks), and ORF523 (Convex and Conic Optimization).

Renjie FengView profile

Research Fellow

• Probability Theory
• Random Matrix Theory
• Machine Learning
• +5 more

Renjie Feng is a Research Fellow in Mathematics and AI at the School of Mathematics and Statistics and the Sydney Mathematical Research Institute , University of Sydney. His work bridges probability theory, statistics, and applications in machine learning, deep learning, and artificial intelligence. His research interests focus on probability theory and its applications to machine learning , random matrix theory , and statistical physics . He investigates extreme value problems, spectral properties of random matrices, and topological features of random fields over Riemannian manifolds. Recent publications highlight trends in random matrix theory (GUE, GOE, GSE), extreme gap problems , determinantal point processes , and Wiener chaos . Collaborative works with F. Götze, D. Yao, and R. Adler emphasize U-statistics , multivariate linear statistics , and random topology inspired by Poisson point process studies.

Lutz SchubertView profile

Researcher

• Operating Systems
• Distributed Computing
• Parallel Processing
• +3 more

Lutz Schubert is a researcher at the Institute of Computer Science , University of Cologne. He focuses on efficient distributed and parallel execution environments for heterogeneous systems, notably the MyThOS operating system in collaboration with Brandenburg University of Technology, Cottbus-Senftenberg. His interdisciplinary work bridges computer science and digital archaeology , addressing modeling of non-deterministic events from sparse excavation data and exploring human behavior constraints in archaeological contexts. Research Interests Design of modular, scalable operating systems for distributed systems Optimization of execution environments for heterogeneous hardware Application of complex systems modeling to digital archaeology Statistical and probabilistic methods for archaeological interpretation Autonomic resource distribution and adaptation in computing Publication Trends : His work spans operating systems , parallel computing , and digital humanities , with recent emphasis on probabilistic reasoning in archaeology and adaptive OS design for multicore architectures. Labs & Collaborations : He collaborates with Brandenburg University of Technology on MyThOS and leads research in computational archaeology as chair of Computer Applications and Quantitative Methods in Archaeology (CAA) , Germany.

Peter BühlmannView profile

Professor

• High-dimensional Statistics
• Causal Inference
• Machine Learning
• +3 more

Peter Bühlmann is a Professor at ETH Zürich within the Seminar für Statistik , focusing on high-dimensional statistics, causal inference, and machine learning. His work bridges theoretical advancements with practical software implementations in R packages like pcalg , mboost , and glmmlasso , impacting fields such as genomics, proteomics, and intensive care analytics. Key Contributions : Causal structure learning, stability selection, anchor regression, and deconfounding. Software : Developed widely used R packages for statistical modeling and causal inference. Teaching : Courses on high-dimensional statistics at ETH Zürich and international institutions. Research Trends : Recent articles emphasize causal robustness, domain adaptation, and applications in medicine. His work addresses challenges in heterogeneous data, missing values, and covariate shifts using methods like spectral deconfounding and residual prediction tests. Scientific Recognition : Co-author of a paper designated as a New Hot Paper (Meinshausen and Bühlmann, 2006) by Essential Science Indicators, indicating significant impact in high-dimensional multiple testing.