Find Academic Supervisors

• 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 .

Kevin JamiesonView profile

Associate Professor

• Machine Learning
• Active Learning
• Multi-Armed Bandits
• +4 more

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 .

Jason D. LeeView profile

Associate Professor

• Machine Learning
• Deep Learning
• Artificial Intelligence
• +7 more

Jason D. Lee is an associate professor of Electrical Engineering and Computer Sciences (EECS) and Statistics at the University of California, Berkeley. Previously, he held academic positions at Princeton University as an associate professor, and was a research scientist at Google DeepMind. He completed his Ph.D. in Computational and Mathematical Engineering at Stanford University under the advisement of Trevor Hastie and Jonathan Taylor. For students and collaborators, his primary contact email is jasonlee@princeton.edu, though prospective students and postdocs are asked to include "filter_student" in the subject line. Ph.D., Computational and Mathematical Engineering, Stanford University (2015) B.Sc., Mathematics, Duke University (2010) Lee's research lies at the intersection of machine learning, statistics, and optimization, focusing on the theoretical foundations of artificial intelligence. His work addresses fundamental questions in deep learning, including optimization landscapes, representation learning, and reinforcement learning theory. He has made significant contributions to understanding how gradient descent operates in neural network training and has developed provably efficient algorithms for various learning scenarios. His ten most recent publications represent a diverse yet coherent body of work across machine learning theory, focusing on topics such as Gaussian multi-index models, transformer learning capabilities, shallow neural networks, and optimization techniques. These publications appear in top venues including COLT, ICML, NeurIPS, and JMLR. Among his notable accolades are: Samsung AI Researcher of the Year Award (2023) NSF Career Award (2022) ONR Young Investigator Award (2021) Sloan Research Fellow in Computer Science (2019) NIPS Best Student Paper Award (2016) Princeton Commendation for Outstanding Teaching (ECE538B) Lee has advised numerous students including Alex Damian, Wenhao Zhan, Eshaan Nichani, Tianle Cai, Zixuan Wang, and Yunwei Ren. Former advisees have gone on to positions at institutions like NYU Courant, Facebook AI Research, UW, MIT, Duke, and Microsoft Research. His research group and collaborators span multiple institutions, working on theoretical and applied aspects of machine learning and artificial intelligence, with a particular focus on the optimization and learning dynamics of neural networks and transformer models.

• Machine Learning
• Statistics
• Theoretical Machine Learning
• +7 more

Fanny Yang is an Assistant Professor in the Computer Science Department at ETH Zurich . She previously held postdoctoral positions at Stanford University and a Junior Fellowship at the Institute for Theoretical Studies at ETH Zurich, advised by Nicolai Meinshausen . Her PhD was completed at the EECS Department of UC Berkeley , supervised by Martin Wainwright . Research Interests : Theoretical foundations of machine learning and statistics , particularly focusing on overparameterized models and high-dimensional data . Developing trustworthy ML models with emphasis on distributional robustness , domain generalization , and interpretability . Applications in medical diagnostics and treatment effect analysis , aiming to address reliability issues in real-world domains. Recent Work Trends : 2025 Articles : Theoretical analysis of semi-supervised multi-objective learning , test-time scaling with verifiers, and foundation models for efficient randomized experiments . 2024 Articles : Studies on robust mixture learning , privacy-preserving data synthesis via optimal transport , confounding quantification in causal inference , and semi-private learning frameworks. 2023 Articles : Investigations into active vs. passive learning in high dimensions, inductive bias in noisy interpolation , and semi-supervised novelty detection using model ensembles .

Sewoong OhView profile

Professor

• Machine Learning
• Artificial Intelligence
• Security & Privacy
• +4 more

Sewoong Oh is a Professor at the Paul G. Allen School of Computer Science & Engineering at the University of Washington, where he has been faculty since 2019. His research focuses on the foundations of machine learning with particular emphasis on differential privacy, secure and robust machine learning, and federated learning. Prior to joining UW, he was at the Department of Industrial and Enterprise Systems Engineering at the University of Illinois at Urbana-Champaign from 2012-2019. He is affiliated with multiple NSF AI Institutes including ACTION (Agent-based Cyber Threat Intelligence and Operation), AI-EDGE (Future Edge Networks and Distributed Intelligence), and IFML (Foundations of Machine Learning). Oh received his PhD in Electrical Engineering from Stanford University in 2011 under Andrea Montanari, followed by postdoctoral work at MIT's Laboratory for Information and Decision Systems under Devavrat Shah. His educational background spans top institutions in theoretical computer science and electrical engineering. His research spans the critical intersection of machine learning security, privacy, and robustness. Oh's work addresses fundamental challenges in making AI systems reliable and trustworthy, with particular focus on defending against backdoor attacks, developing privacy-preserving algorithms, and creating efficient tokenization methods for language models. His recent SuperBPE work demonstrates how moving beyond traditional subword tokenization can significantly improve language model efficiency and performance. His research consistently bridges theoretical foundations with practical implementations, as evidenced by numerous open-source repositories containing production-ready code. Oh's publications reveal a consistent trajectory toward addressing security and privacy concerns in increasingly complex machine learning systems, with recent work focusing on language model tokenization, data-centric AI, and federated learning frameworks. His research shows strong interdisciplinary connections between theoretical computer science, statistics, and practical machine learning systems. ACM SIGMETRICS best paper award (2015) NSF CAREER award (2016) ACM SIGMETRICS rising star award (2017) GOOGLE Faculty Research Awards (2017, 2020) 2024 ICML Best Paper Award (for work by advisee Jon Hayase) Professor Oh maintains an active research group with numerous PhD students, postdocs, and undergraduate researchers. His students have secured prestigious positions at leading tech companies including Amazon, Google, and Snap, as well as academic appointments at institutions like University of Wisconsin-Madison and Shanghai Jiao Tong University. He has received substantial research funding through his participation in multiple NSF AI Institutes and industry research awards from Google. His lab maintains several active GitHub repositories implementing cutting-edge research in backdoor defense, robust statistics, and privacy-preserving machine learning.

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.

Oscar Randal-WilliamsView profile

Professor

• Algebraic Topology
• Geometric Topology
• Mapping Class Groups
• +8 more

Oscar Randal-Williams is the Sadleirian Professor of Pure Mathematics at the University of Cambridge, where he is affiliated with the Faculty of Mathematics and the Department of Pure Mathematics and Mathematical Statistics (DPMMS). His work is centered in the Differential Geometry & Topology research group, where he contributes to advancing knowledge in geometric and algebraic topology. Professor Randal-Williams specializes in Algebraic and Geometric Topology, with particular expertise in mapping class groups, moduli spaces, cobordism categories, spaces of manifolds, surgery theory, configuration spaces, characteristic classes, and K-theory. His research explores the deep connections between homotopy theory and geometric structures, with applications across various mathematical domains. His work often bridges abstract algebraic structures with concrete geometric problems, creating new frameworks for understanding topological phenomena. An analysis of Professor Randal-Williams' recent publications reveals a strong focus on homological stability phenomena, mapping class groups of high-dimensional manifolds, and the interplay between algebraic structures and geometric topology. His work frequently involves E ∞ -algebras, general linear groups, and the topology of diffeomorphism groups. A significant portion of his research investigates the structure of moduli spaces of manifolds and their connections to algebraic K-theory, with recent work extending to applications in mathematical physics through studies of symmetries in quantum field theories. Professor Randal-Williams maintains active collaborations with leading mathematicians worldwide, including Søren Galatius, Alexander Kupers, and Jeremy Miller, among others. His research has been published in top-tier mathematical journals including the Annals of Mathematics, Inventiones Mathematicae, and the Journal of the American Mathematical Society.

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.

Furong HuangView profile

Associate Professor

• Machine Learning
• Trustworthy Machine Learning
• Generative AI
• +7 more

Furong Huang is an Associate Professor at the University of Maryland's Department of Computer Science, with affiliations at the Institute for Advanced Computer Studies, Center for Machine Learning, Maryland Robotics Center, and Applied Mathematics, Statistics, and Scientific Computation Program. Her research bridges trustworthy machine learning, sequential decision-making, and foundation models for robotics, emphasizing reliability, interpretability, and ethical standards. Research Interests: Trustworthy AI Generative AI Reinforcement Learning AI Security Algorithmic Fairness Foundation Models for Robotics Recent Publications span leading conferences (NeurIPS, ICML, ICLR, CVPR) and journals, focusing on: Robustness in Vision-Language Systems Trustworthy Generative AI Foundation Models for Sequential Decision-Making AI Security and Watermarking Scientific Awards MIT TR35 Innovator Under 35 (Asia Pacific 2022) Best Paper Award, AdvML Frontier Workshop, NeurIPS 2024 NSF NAIRR Pilot Awardee Microsoft Accelerate Foundation Models Research Award (2023) JP Morgan Faculty Research Awards (2019–2022) Advising and Grants : Her lab has graduated students to roles at OpenAI, Google, Meta, and Netflix. Research funded by DARPA, NSF, ONR, AFOSR, and industry partners like Microsoft, Adobe, and Capital One. Labs & Teams : Leads research groups focused on Trustworthy AI and Robotics at the University of Maryland, collaborating with the Maryland Robotics Center and Applied Mathematics Program.

• 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).

Daniel J. HsuView profile

Professor

• Machine Learning
• Foundations of Data Science
• Theory of Computation
• +4 more

Dr. Daniel J. Hsu is a Professor of Computer Science at Columbia University, affiliated with the Foundations of Data Science Center and TRIPODS Institute. His research focuses on algorithmic statistics, machine learning theory, and their applications in public health informatics. He has advised numerous students and postdocs, and his work bridges foundational theory with practical systems like foodborne illness detection via social media analysis. Key roles: Associate Editor (ACM Transactions on Algorithms), Program Chair (ICML 2025, COLT 2019) Research areas: Foundations of Data Science, Machine Learning Theory, Fairness, and High-dimensional Statistics His work on detecting foodborne illnesses using Yelp reviews has been deployed by NYC Health departments. Recent contributions include advancements in transformer architectures, group fairness algorithms, and multi-group learning frameworks. Scientific awards include the Sloan Fellowship and multiple NSF grants. He has pioneered interactive machine teaching methods and developed algorithms for robust parameter estimation in high-dimensional settings.

Sicun GaoView profile

Associate Professor

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

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

Sham KakadeView profile

Professor

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

Sham Kakade is the Rampell Family Professor of Computer Science and Professor of Statistics at Harvard University, co-director of the Kempner Institute. His research focuses on advancing artificial general intelligence through foundational work in reinforcement learning, large-scale learning systems, and autonomous agent architectures. He earned his PhD in 2003 from the Gatsby Computational Neuroscience Unit at University College London. His work emphasizes scalable optimization algorithms, distributed systems for foundation models, and understanding emergent capabilities in neural architectures. Research interests include full-stack training pipelines for foundation models, mathematical principles of large-scale learning systems, and bridging language models with embodied intelligence. He advises prospective students with backgrounds in applied deep learning or theoretical computer science, offering access to the Kempner Institute's computational resources. He serves on committees for the ACM Prize in Computing and Sloan Research Fellowships, co-organizes the Simons Symposium on Theoretical Machine Learning, and chaired COLT 2011. His lab works at the intersection of theory and practice, addressing challenges in AI's societal impact and technical scalability. Labs/Teams: Co-directs the Kempner Institute, fostering collaborations between AI researchers and social scientists. Active in Harvard's SEAS community.

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.

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.