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

Mark Schmidtمشاهده پروفایل

استاد

• Machine Learning
• Artificial Intelligence
• Mathematical Optimization
• +۶ مورد دیگر

Mark Schmidt is a Professor in the Department of Computer Science at the University of British Columbia, Faculty of Science. He holds the Canada Research Chair in Large-Scale Machine Learning and is a Canada CIFAR AI Chair at the Alberta Machine Intelligence Institute. His research spans multiple centers including CAIDA (Centre for Artificial Intelligence Decision-making and Action), the Data Science Institute, and the Machine Intelligence Learning Discovery (MILD) group. Dr. Schmidt's educational background includes a Ph.D. from UBC (2005-2010), an M.Sc. from the University of Alberta (2003-2005), and a B.Sc. from the University of Alberta (2000-2003). His academic career progressed from Postdoc positions at Simon Fraser University, Ecole Normale Superieure, and UBC to Assistant Professor (2014-2019), Associate Professor (2019-2024), and current Professor (2024-present) at UBC. His research focuses on machine learning optimization, with particular emphasis on improving numerical algorithms for large-scale machine learning applications. His work bridges theoretical optimization and practical applications across computer vision, natural language processing, and reinforcement learning. He has developed numerous optimization techniques including variants of stochastic gradient methods, coordinate descent algorithms, and natural gradient approaches. Analysis of his recent publications reveals a strong focus on optimization for over-parameterized models, particularly transformers and large language models. His work addresses critical challenges in step-size selection, convergence guarantees, and efficient implementation of optimization algorithms. His research has significant implications for training deep neural networks more effectively and understanding why certain optimization methods outperform others in practice. Among his notable awards are the Dorothy Killam Fellowship (2025), Arthur B. McDonald Fellowship (2024), Sloan Research Fellowship (2017), and multiple UBC teaching awards. He has also received the Lagrange Prize in Continuous Optimization and Best Paper Award at AISTATS 2021. Dr. Schmidt actively supervises numerous graduate students, with over 40 PhD and Master's students listed as current or alumni members of his research group. His laboratory maintains strong connections with industry partners, with many alumni securing positions at leading AI companies including Google, Amazon, Meta, and Microsoft.

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.

Benjamin Van Royمشاهده پروفایل

استاد

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

Benjamin Van Roy is a Professor at Stanford University since 1998, affiliated with the Departments of Electrical Engineering and Management Science and Engineering, and the Institute for Computational and Mathematical Engineering. He leads the Efficient Agent Team at Google DeepMind and previously held leadership roles at Morgan Stanley, Unica, and Enuvis. He holds SB, SM, and PhD degrees in Computer Science and Electrical Engineering from MIT, advised by John Tsitsiklis. His research focuses on reinforcement learning, alignment, and information theory, with contributions to machine learning foundations, optimization, and finance. He has authored over 150 publications, including influential works on Thompson Sampling, approximate dynamic programming, and exploration strategies. His honors include INFORMS and IEEE Fellowships and the INFORMS Lanchester Prize. Van Roy advises doctoral students across academia and industry, with graduates at top institutions and companies like Meta, Tesla, and Citadel. He teaches courses on reinforcement learning, stochastic control, and optimization. His open-source projects include Epistemic Neural Networks and the Neural Testbed for evaluating machine learning models. Key contributions include foundational work in reinforcement learning theory, scalable methods for recommendation systems, and applications in finance and resource allocation. His research bridges theoretical insights with practical applications, emphasizing alignment and safety of AI systems.

Kenji Kawaguchiمشاهده پروفایل

استادیار

• Deep Learning
• Machine Learning
• Theoretical Foundations of Deep Learning
• +۱۲ مورد دیگر

Kenji Kawaguchi is the Presidential Young Professor in the Department of Computer Science at the National University of Singapore (NUS), where he leads the Deep Learning Lab and is a faculty affiliate at the NUS Institute of Data Science. His research bridges theoretical and applied machine learning, focusing on deep learning, large language models, and physics-informed neural networks. His educational background includes a Ph.D. and S.M. in Computer Science and Electrical Engineering from the Massachusetts Institute of Technology (MIT), advised by Leslie Pack Kaelbling, and a postdoctoral fellowship at Harvard University’s Center of Mathematical Sciences and Applications. Dr. Kawaguchi’s research interests center on the theoretical foundations of deep learning, optimization, generalization, and applications in areas such as molecular modeling, AI safety, and efficient training of large models. He has made significant contributions to understanding in-context learning, diffusion models, and neural operators for partial differential equations. His recent publications (2023–2025) reflect a strong trend toward improving the efficiency, robustness, and interpretability of large-scale models, particularly in language and scientific domains. Key themes include LLM alignment and safety, diffusion model optimization, and physics-informed learning for high-dimensional problems. Presidential Young Professor He has served as Area Chair and PC Member for top-tier conferences including NeurIPS, ICML, ICLR, AAAI, and UAI, and as reviewer for journals such as JMLR and Annals of Statistics. He has delivered invited talks at Harvard, MIT, Stanford, CMU, Brown, and Google Research, reflecting his international recognition. He actively mentors students and welcomes PhD candidates and postdocs to join his research group.

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.

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 .

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.

Amitabha Bagchiمشاهده پروفایل

استاد

• Data Algorithmics
• Probability and Networks
• Theoretical Computer Science
• +۷ مورد دیگر

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.

David B. Shmoysمشاهده پروفایل

استاد

• Operations Research
• Computer Science
• Optimization
• +۴ مورد دیگر

David B. Shmoys is the Laibe/Acheson Professor of Business Management & Leadership Studies at Cornell University's School of Operations Research and Information Engineering (ORIE) and holds a joint appointment in the Department of Computer Science. He is a leading researcher in approximation algorithms, stochastic optimization, and computational sustainability. His work emphasizes data-driven decision-making in enterprise and society, with applications ranging from healthcare logistics to environmental conservation. Shmoys has advised 27 Ph.D. students and served as an editorial board member for top journals like Operations Research and Mathematics of Operations Research. Education: Ph.D. in Computer Science, University of California, Berkeley (1984). Postdoctoral positions at MSRI and Harvard University, followed by faculty roles at MIT before joining Cornell. Research Interests: Design and analysis of approximation algorithms for NP-hard problems, stochastic optimization, scheduling, facility location, and inventory management. Applications include computational sustainability, epidemiological modeling, and political districting optimization. Articles Trends: Focus on optimization under uncertainty, computational sustainability, and real-world applications like air ambulance routing, bike-sharing systems, and gerrymandering analysis. Notable works include the 2018 Wagner Prize-winning paper on bike-sharing analytics and the 2013 Lanchester Prize-winning textbook on approximation algorithms. Awards: Lanchester Prize (2013), Daniel H. Wagner Prize (2018), Fellowships from ACM, INFORMS, and SIAM, NSF Presidential Young Investigator (1987). Advising & Grants: Over 27 advised Ph.D. students, with former students at MIT, Waterloo, Brown, and D-Wave. Active in grants related to data science and sustainability. Labs/Teams: Involved in the Institute of Computational Sustainability at Cornell, focusing on applying algorithms to environmental challenges. Collaborates with organizations like Motivate (bike-sharing) and Ornge (air ambulance services).

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

Sicun Gaoمشاهده پروفایل

دانشیار

• Algorithms and Optimization
• Automated Reasoning
• Cyber-Physical Systems
• +۳ مورد دیگر

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.

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.

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.