جست‌وجوی استاد و پژوهشگر

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

Shivaram Kalyanakrishnanمشاهده پروفایل

دانشیار

• Artificial Intelligence
• Machine Learning
• Reinforcement Learning
• +۵ مورد دیگر

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 .

• Reinforcement Learning
• Multi-Agent Systems
• Deep Learning
• +۲ مورد دیگر

Shimon Whiteson is Professor of Computer Science at the University of Oxford, leading the Whiteson Research Lab focused on reinforcement learning, multi-agent systems, and deep learning. His research develops algorithms for efficient learning in complex environments. Current work explores meta-reinforcement learning frameworks that enable agents to rapidly adapt to new tasks, with applications in autonomous driving simulation and robotics. Recent innovations include novel methods for offline reinforcement learning, multi-agent coordination, and morphology-aware control. Publications demonstrate advances in: Meta-RL algorithm design for few-shot adaptation Multi-agent reinforcement learning environments and benchmarks Imitation learning in autonomous driving Bayesian methods for sample-efficient learning Research outputs include widely used benchmarks and tools including JaxMARL for accelerated multi-agent RL research. Current doctoral supervision focuses on temporal abstraction in RL, multi-agent coordination, and reinforcement learning theory.

Jason D. Leeمشاهده پروفایل

دانشیار

• Machine Learning
• Deep Learning
• Artificial Intelligence
• +۷ مورد دیگر

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.

Andrew Stuartمشاهده پروفایل

استاد

• Applied and Computational Mathematics
• Bayesian Inverse Problems
• Data Assimilation
• +۶ مورد دیگر

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 Guoمشاهده پروفایل

استاد

• Mathematical Finance
• Financial Engineering
• FinTech
• +۷ مورد دیگر

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.

Aarti Singhمشاهده پروفایل

استاد

• Reinforcement Learning
• Bandit Algorithms
• Active Learning
• +۷ مورد دیگر

Aarti Singh is a Professor in the Machine Learning Department at Carnegie Mellon University and Director of the NSF AI Institute for Societal Decision Making. She leads research at the intersection of machine learning, statistics, and decision making, with applications to scientific and societal domains. Her work focuses on designing principled interactive algorithms for learning and decision making under uncertainty. Education: Ph.D. in Electrical Engineering, University of Wisconsin-Madison (2008) M.S. in Electrical Engineering, University of Wisconsin-Madison (2003) B.E. in Electronics and Communication Engineering, University of Delhi (2001) Research Interests: Professor Singh's research centers on developing interactive machine learning algorithms that go beyond finding input-output associations to make higher-level decisions about the most informative data and actions. Her work spans autonomous decision making, including active sampling, stochastic optimization, bandits, and reinforcement learning that are statistically optimal, computationally tractable, and robust. She also investigates human factors in decision making, designing algorithms that model and leverage human feedback while accounting for bias, memory effects, and calibration. Her research has applications in material science, cosmology, and peer review systems. Research Trends: Professor Singh's recent publications demonstrate a strong focus on reinforcement learning, particularly in developing more efficient and robust algorithms for decision making under uncertainty. Her work bridges theoretical foundations with practical applications, spanning from fundamental algorithm development to real-world implementation in scientific domains. There's a clear trajectory toward integrating human factors into decision-making algorithms, with significant contributions to peer review systems and preference learning. Scientific Awards: NSF Career Award United States Air Force Young Investigator Award A. Nico Habermann Faculty Chair Award Harold A. Peterson Best Dissertation Award Multiple paper awards Advising and Grants: Professor Singh has advised numerous PhD and master's students, many of whom have gone on to faculty positions or research roles at leading institutions. Her research is supported by prestigious grants from ONR, Simons Foundation, AFRL, ARL, and NSF. She serves as General Chair (2025) and Program Chair (2020) for the International Conference on Machine Learning (ICML) and has held leadership roles in multiple professional organizations. Research Team: Professor Singh leads a vibrant research group within the Machine Learning Department at CMU, with current PhD students working on topics including reinforcement learning, human-AI collaboration, and decision making under uncertainty. She also directs the NSF AI Institute for Societal Decision Making, which brings together researchers from multiple disciplines to develop AI systems that support human decision making in societal contexts.

• Mathematics of Data
• Numerical Linear Algebra
• Randomized Algorithms
• +۵ مورد دیگر

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 Fengمشاهده پروفایل

پژوهشگر ارشد

• Probability Theory
• Random Matrix Theory
• Machine Learning
• +۵ مورد دیگر

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.

Johnny Guzmánمشاهده پروفایل

استاد

• Numerical Analysis
• Partial Differential Equations
• Scientific Computing
• +۵ مورد دیگر

Johnny Guzmán is a Professor of Applied Mathematics at Brown University, specializing in numerical analysis of partial differential equations and scientific computing. He holds a Ph.D. in Applied Mathematics from Cornell University (2005) and a B.S. in Mathematics from California State University, Long Beach (1999). His research focuses on numerical methods for PDEs, including discontinuous Galerkin methods, mixed finite element methods, and fluid-structure interaction problems. Key contributions include work on hybridizable and mixed finite element methods, discontinuous Galerkin discretizations, and stability analysis of numerical schemes. He has been funded by multiple NSF grants, including a Postdoctoral Fellowship (2005–2008) and awards totaling over $1M in research support. Notable recognitions include the Comfort and Urry Family Fund Prize (2013). Guzmán collaborates with institutions globally and serves on editorial boards for journals like Journal of Numerical Mathematics and Calcolo . His teaching spans computational linear algebra, numerical methods for differential equations, and finite element analysis.

Trevor Campbellمشاهده پروفایل

دانشیار

• Bayesian Inference
• Bayesian Nonparametrics
• Machine Learning
• +۵ مورد دیگر

Trevor Campbell is an Associate Professor in the Department of Statistics at the University of British Columbia (UBC), Vancouver. He holds a Ph.D. in Machine Learning and Statistics from MIT and a B.A.Sc. in Aerospace Engineering from the University of Toronto. His research focuses on automated, scalable Bayesian inference algorithms, Bayesian nonparametrics, and streaming data analysis. Campbell is a core contributor to probabilistic programming tools like Pigeons.jl and has developed influential methods for coreset-based Bayesian inference. Education : Ph.D. in Machine Learning and Statistics (2016), MIT M.S. in Aeronautics and Astronautics (2013), MIT B.A.Sc. in Aerospace Engineering (2011), University of Toronto Research Interests : His work emphasizes scalable Bayesian computation, including variational inference, MCMC optimization, and coresets. He develops algorithms that balance statistical accuracy with computational efficiency, particularly for large-scale datasets. His recent work explores adaptive samplers (e.g., AutoStep, autoMALA) and theoretical guarantees for coreset methods. Applications span astrophysics, materials science, and network analysis. Awards & Grants : NSERC Discovery Grant (2025) Blackwell-Rosenbluth Award (2021) PIMS Early Career Award (2023) Google Perception Academic Funding (2020) Advising & Labs : He supervises a team of PhD and M.Sc. students at UBC, focusing on Bayesian methodology and computational tools. His lab collaborates with institutions like SFU and MIT on projects involving distributed sampling and probabilistic modeling. He co-organizes workshops on Bayesian computation and serves on editorial boards for Bayesian Analysis and TMLR.

Raman Aroraمشاهده پروفایل

دانشیار

• Machine Learning
• Statistical Signal Processing
• Stochastic Approximation Algorithms
• +۱۶ مورد دیگر

Raman Arora is an Associate Professor in the Department of Computer Science at Johns Hopkins University, with affiliations to the Mathematical Institute for Data Science (MINDS), the Center for Language and Speech Processing (CLSP), and the Institute for Data-Intensive Engineering and Science (IDIES). His research spans theoretical and practical aspects of machine learning, focusing on robustness, privacy, representation learning, and optimization. Research Interests: Machine Learning Theory Representation Learning (e.g., Deep CCA, Multi-view Learning) Privacy-Preserving Machine Learning (Differential Privacy) Robustness in Deep Learning Online and Reinforcement Learning Stochastic Optimization Algorithms His recent publications, primarily in top-tier venues like NeurIPS, ICML, and ICLR, demonstrate a strong focus on the theoretical foundations of adversarial robustness, multi-task learning, offline reinforcement learning, and differentially private optimization. His work often bridges theory and practice, with applications in speech, language, and data-intensive systems. Scientific Awards and Honors: NSF CAREER Award (2020) ICML Test-of-Time Award Finalist (2023) for Deep CCA Member, Institute for Advanced Study (2019–2020) Visiting Scientist, Simons Institute (2019, 2020, 2022) Advising and Grants: Raman Arora has advised numerous PhD and master’s students, many of whom are now researchers at leading tech companies like Google, Meta, and Microsoft. His research is supported by significant grants from the NSF (including CAREER, BIGDATA, TRIPODS, and CRCNS awards), DARPA, and other agencies, focusing on foundational aspects of machine learning such as inductive biases, privacy, robustness, and computational neuroscience. Laboratory and Research Group: He leads a dynamic research group at Johns Hopkins, comprising current PhD students and postdoctoral researchers working on the intersection of theory and applications in machine learning. The group is actively involved in projects related to adversarial robustness, meta-learning, offline reinforcement learning, and private optimization.

Clifford Steinمشاهده پروفایل

استاد

• Algorithms
• Combinatorial Optimization
• Operations Research
• +۴ مورد دیگر

Clifford Stein is a Professor of Industrial Engineering and Operations Research (IEOR) and Computer Science at Columbia University, and Associate Director for Research at the Data Science Institute. He holds a Ph.D. (1992), M.S. (1989), and B.S.E. (1987) from MIT and Princeton University, respectively. His research focuses on algorithms, combinatorial optimization, operations research, scheduling, and computational biology. A co-author of the best-selling textbook Introduction to Algorithms , Stein has published widely in top venues and holds prestigious awards like ACM Fellow and NSF Career Award. His work includes foundational contributions to minimum cut algorithms, scheduling theory, and network optimization, supported by NSF and Sloan Foundation grants. Stein has advised over 40 graduate and undergraduate students, many now in academia and industry.

• Functional Analysis
• Artificial Intelligence
• Foundations of Computational Mathematics
• +۱۵ مورد دیگر

Professor Anders C. Hansen is a mathematician at the University of Cambridge and University of Oslo, leading the Applied Functional and Harmonic Analysis group. His work bridges functional analysis, artificial intelligence, and computational mathematics, focusing on the Solvability Complexity Index (SCI) hierarchy and stability issues in deep learning. He has held prestigious fellowships, including a Royal Society University Research Fellowship and Peterhouse Bye-Fellowship. Educated at the University of Cambridge, UC Berkeley, and the Norwegian University of Science and Technology Developed groundbreaking theories in compressed sensing and deep learning, revealing algorithmic instability paradoxes Organized workshops on computational mathematics and AI interpretability His research explores the SCI hierarchy , exposing computational barriers in AI, quantum mechanics, and inverse problems. Key projects include Smale’s 18th problem and analyzing neural network stability. His work has transformed understanding of compressed sensing, particularly in medical imaging. Recent scientific awards include the Whitehead Prize (2019), IMA Prize (2018), and Leverhulme Prize (2017). Collaborations span institutions like Caltech, MIT, and the University of Vienna. As an educator, he teaches NST Part IA Mathematical Methods , Part II Numerical Analysis , and a Part III course on Compressed Sensing . His group has mentored 17 PhD and postdoctoral researchers since 2012.

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

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