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

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.

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

Colin Raffel , currently an Associate Professor at the University of Toronto and Associate Research Director at the Vector Institute , is a leading researcher in machine learning and natural language processing . His career spans roles at Hugging Face (Faculty Researcher), Google Brain (Senior Research Scientist), and UNC Chapel Hill (Assistant Professor). Education: PhD in Electrical Engineering (Columbia), MA in Music/Science (Stanford), BA in Mathematics (Oberlin) Key affiliations: Google Brain (2016-2020), Hugging Face (2021-present), Vector Institute (2023-present) His research focuses on language model development , attention mechanisms , efficient machine learning , and music information retrieval . Recent work explores model merging , parameter-efficient fine-tuning , and data-constrained language models . Teaching : Has instructed courses at University of Toronto and UNC Chapel Hill on Neural Networks , Deep Learning , and Information Theory . Academic service includes organizing ICLR workshops and serving as Senior Area Chair for NeurIPS and EMNLP . Notable awards : NSF CAREER (2022), Caspar Bowden Award (2023), NeurIPS Outstanding Paper (2023) Key contributions : Core developer of WT5 , Git-Theta , and mir_eval software

• Machine Learning
• Natural Language Processing
• Music Information Retrieval
• +۱۲ مورد دیگر

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.

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

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.

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

Geoffrey Pleiss is an Assistant Professor in the Department of Statistics at the University of British Columbia's Faculty of Science. He is also a CIFAR AI Chair at the Vector Institute and an inaugural member of CAIDA's AIM-SI (AI Methods for Scientific Impact) cluster. His work bridges statistical theory, machine learning, and computational methods with applications across various scientific domains. Pleiss received his PhD from the Computer Science department at Cornell University in 2020, where he was advised by Kilian Weinberger and worked closely with Andrew Gordon Wilson. Prior to his faculty position at UBC, he was a postdoctoral researcher at Columbia University with John P. Cunningham. His research focuses on the intersection of deep learning and probabilistic modeling, particularly on developing heuristic and approximate notions of uncertainty from machine learning models. His work has significant implications for reliable and optimal decision-making in experimental design and scientific discovery. Major research thrusts include neural network uncertainty quantification, Bayesian optimization, Gaussian processes, and ensemble methods. Pleiss develops theoretical frameworks while maintaining strong connections to practical applications across scientific domains. An analysis of his recent publications reveals a strong focus on uncertainty quantification in deep learning models, with particular attention to the limitations and capabilities of ensemble methods in the era of overparameterized models. His work increasingly addresses practical challenges in Bayesian optimization for scientific discovery, especially in materials science. There's also a growing emphasis on computational efficiency in Gaussian process methods, reflecting his commitment to making advanced statistical techniques accessible for real-world applications. CIFAR AI Chair Pleiss currently advises several graduate students including Donney Fan (PhD, Computer Science), Tim G. Zhou (MSc, Computer Science), Zachary Lau (MSc, Statistics), Nathan Cantafio (BSc, Statistics), and Tristan Cinquin (Research Intern at Vector Institute). His research is supported by multiple funding sources including his CIFAR AI Chair position, which provides significant research resources for advancing machine learning methodologies with scientific impact. Pleiss co-created and maintains GPyTorch, a highly efficient and modular implementation of Gaussian processes in PyTorch designed for speed, modularity, and prototyping. He is also involved with CoLA (Compositional Linear Algebra), a library for structured linear algebra operations in JAX and PyTorch that enables fast linear algebra computations by automatically exploiting matrix structure.

• Machine Learning
• Deep Learning
• Gaussian Processes
• +۵ مورد دیگر

Alexandre Bouchard-Côté is a Professor of Statistics at the University of British Columbia (UBC), affiliated with the Department of Statistics within the Faculty of Science. His research focuses on computational statistics, Bayesian methods, and Monte Carlo techniques, with applications in evolutionary biology, cancer genomics, and computational linguistics. Education : PhD in Computer Science (with Designated Emphasis in Statistics) from UC Berkeley (2010), BSc in Mathematics and Computer Science from McGill University (2005). Affiliations : Director of the Blang probabilistic programming project and leader of the Bouncy Particle Sampler research group. Research Interests : Bouchard-Côté develops scalable Bayesian computational methods, including non-reversible Monte Carlo algorithms like the Bouncy Particle Sampler, and applies these to problems in cancer phylogenetics, evolutionary dynamics, and historical linguistics. His work emphasizes bridging theoretical foundations with practical tools for data science. Publications Trends : Recent work spans distributed sampling frameworks (e.g., Pigeons.jl), variational phylogenetic inference, and cancer clonal evolution modeling. His articles often address algorithmic scalability and interdisciplinary applications in biology and astronomy. Awards : CRM-SSC Prize in Statistics (2024) PIMS-UBC Mathematical Sciences Young Faculty Award (2018) Tweedie New Researcher Award (2016) Advising & Grants : Supervises graduate students (e.g., Son Luu, Nikola Surjanovic) and leads funded projects on distributed MCMC and cancer genomics. Collaborates with institutions like the Simons Foundation and the Canadian Statistical Sciences Institute (CANSSI). Labs/Teams : Core member of the UBC Statistical Machine Learning group, contributing to open-source tools like Blang and the Bouncy Particle Sampler implementation.

• Computational Statistics
• Bayesian Inference
• Monte Carlo Methods
• +۴ مورد دیگر

Michael Jong Kim is an Associate Professor at the Sauder School of Business, University of British Columbia, specializing in the Division of Operations and Logistics. His research focuses on dynamic programming, statistical learning, robust optimization, and the exploration vs exploitation trade-offs in sequential decision-making processes. BASc, M.Math, and PhD from the University of Toronto His work spans topics in stochastic optimization, supply chain dynamics, and information dissemination in uncertain environments. Publications highlight contributions to Bayesian inventory control, semi-Markovian system control, and variance regularization in optimization models. Dr. Kim teaches advanced business analytics courses, including Descriptive and Predictive Business Analytics and Advanced Predictive Business Analytics (MBAN) during the 2024-2025 academic year. He can be reached at mike.kim@sauder.ubc.ca or by phone at +1 604.822.8682.

• Dynamic Programming
• Statistical Learning
• Robust Optimization
• +۱ مورد دیگر

Mark Crowley is an Associate Professor in the Department of Electrical and Computer Engineering at the University of Waterloo, with a cross-appointment in the Cheriton School of Computer Science. He is a member of the Waterloo Artificial Intelligence Institute (WAII) and the Waterloo Institute for Complexity and Innovation (WICI), and serves as National Secretary of the Canadian Artificial Intelligence Association (CAIAC). His educational background includes a Ph.D. and M.Sc. in Computer Science from the University of British Columbia, where he worked in the Laboratory for Computational Intelligence, and a B.A. in Computer Science from York University. He completed a postdoctoral fellowship at Oregon State University working with Tom Dietterich's machine learning group. Crowley's research focuses on developing dependable and transparent algorithms to augment human decision-making in complex domains with multiple agents, spatial structure, or uncertainty. His work spans Reinforcement Learning , Deep Learning , Ensemble Methods , and Manifold Learning . He frequently collaborates with researchers in applied fields including Computational Sustainability, Sustainable Forest Management, Autonomous Driving, Medical Imaging, and Material Design. His research is motivated by both theoretical opportunities and real-world challenges such as forest fire management, automotive applications, and medical imaging. His recent publications demonstrate a strong focus on addressing challenges in reinforcement learning, particularly around observation costs, multi-agent systems, and causal representation learning. His work on ChemGymRL provides a significant contribution to digital chemistry and material design through reinforcement learning frameworks. The textbook Elements of Dimensionality Reduction and Manifold Learning represents a major contribution to the theoretical foundations of machine learning. Crowley actively supervises graduate students, with recent thesis completions including Shayan Shirahmadi Gale Bagi (PhD, Feb 2025) and Oleksandra Nahorna (MASc, Dec 2024). His lab, UWECEML (Waterloo ECE Machine Learning Lab), focuses on developing new algorithms at the intersection of Machine Learning, Optimization, and Probabilistic Modeling. He teaches courses including ECE 457C (Reinforcement Learning), ECE 657A (Data & Knowledge Modelling & Analysis), and ECE 457B (Fundamentals of Computational Intelligence). His blog Computationally Thinking explores AI, machine learning, and the societal impact of these technologies.

• Reinforcement Learning
• Deep Learning
• Manifold Learning
• +۱۲ مورد دیگر

Mikhail (Misha) Belkin is a Professor at the Halicioglu Data Science Institute (HDSI) at the University of California San Diego , with an affiliated appointment in the Department of Computer Science and Engineering . He is also an Amazon Scholar , reflecting his impactful industry collaboration. Since January 2024, he has served as the Editor-in-Chief of the SIAM Journal on Mathematics of Data Science (SIMODS) . Research Interests: Belkin's research centers on the theoretical foundations of machine learning, particularly the mathematical understanding of modern deep learning. His work investigates interpolation , over-parameterization , and feature learning in neural networks. He is renowned for introducing the double descent risk curve, which reconciles classical bias-variance trade-offs with the success of overfitted models. His recent work identifies the Average Gradient Outer Product (AGOP) as a fundamental mechanism of feature learning, applicable across architectures like CNNs and transformers. Scientific Contributions and Trends: His recent publications, appearing in Science , PNAS , and NeurIPS , demonstrate a strong trend toward unifying theories of generalization and optimization in over-parameterized systems. He explores how interpolating models can be statistically optimal, how gradient descent converges in non-convex landscapes via the PL* condition, and how kernel methods can be enhanced to perform feature learning. ACM Fellow (2023) Editor-in-Chief, SIAM Journal on Mathematics of Data Science (2024–present) Advising and Grants: Belkin actively mentors students and collaborators such as Adityanarayanan Radhakrishnan , Daniel Beaglehole , and Chaoyue Liu , who are frequent co-authors. He is a Principal Investigator (PI) in the Collaboration on the Theoretical Foundations of Deep Learning , funded by the NSF and Simons Foundation. He is also an external collaborator with the Eric and Wendy Schmidt Center at the Broad Institute and part of the NSF-funded TILOS AI Institute . Laboratories and Teams: While not explicitly named, his research group at UCSD is deeply involved in theoretical machine learning, focusing on the intersection of statistics, optimization, and deep learning. His work often involves large-scale collaborations and is closely tied to initiatives like SIMODS and TILOS.

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

Murat Erdogdu is an Assistant Professor at the University of Toronto, jointly appointed in the Department of Computer Science and Department of Statistical Sciences . He is also a faculty member at the Vector Institute and holds the CIFAR Chair in Artificial Intelligence . PhD in Statistics, Stanford University (advised by Mohsen Bayati and Andrea Montanari) MSc in Computer Science, Stanford University BSc in Electrical Engineering and Mathematics, Bogazici University His research focuses on machine learning theory , high-dimensional statistics , and optimization . He has contributed to understanding gradient-based algorithms, sampling methods, and feature learning in structured data. Recent publications address problems in: Heavy-tailed sampling Mean-field Langevin dynamics Robust feature learning Minimax regression Stochastic optimization under infinite noise Scientific Awards: CIFAR Chair in Artificial Intelligence ICLR 2023 Spotlight NeurIPS 2019 & 2021 Spotlights He teaches graduate courses like STA 414/2104 (Statistical Methods for Machine Learning II) and STA 4273 (Modern Learning Theory) , emphasizing probabilistic modeling and theoretical analysis.

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

Elisha David Klonsky is a Professor in the Department of Psychology at the University of British Columbia, Faculty of Arts. His primary research classification is Clinical Psychology with a secondary focus in Social/Personality Psychology. He directs the Personality, Emotion, and Behaviour Lab (PEBLab) and maintains an active research program while accepting graduate students for the 2023/24 application cycle. Dr. Klonsky earned his PhD from the University of Virginia in 2005. His educational background has positioned him as a leading researcher in clinical psychology, particularly in suicide research. Dr. Klonsky's research interests center on suicide theory, motivations, and the transition from suicidal thoughts to attempts. His work also spans metascience, emotion research, and psychological/clinical assessment. He has developed the influential Three-Step Theory (3ST) of suicide, which operates within an ideation-to-action framework. His research examines how emotional pain, impulsivity, and nonsuicidal self-injury relate to suicidal behavior, with particular interest in developing better assessment tools for clinical practice. Recent work has expanded into metascience, addressing the replication crisis in psychology. His publication record shows consistent high-impact work primarily in suicide research, with recent emphasis on suicide motivations, emotion measurement, and theoretical frameworks. The research demonstrates strong clinical applicability while maintaining rigorous scientific methodology. Dr. Klonsky has received numerous prestigious awards including: UBC Killam Research Prize (2020) Killam Faculty Research Fellowship (2017) American Association of Suicidology: Edwin S. Shneidman Award (2015) Association for Psychological Science Rising Star (2011) David Shakow Early Career Award (2011) American Psychological Association Fellow (2010) Dr. Klonsky has successfully mentored numerous graduate students who have gone on to academic positions at institutions including Old Dominion University, McGill University, Wesleyan University, and Texas Tech University. His research has been supported by significant funding from organizations including the Social Sciences and Humanities Research Council, American Foundation for Suicide Prevention, and National Institute of Mental Health. Current projects include studies on suicidality in youth with autism spectrum disorder and advancing the measurement of emotional experience. The Personality, Emotion, and Behaviour Lab maintains active research programs in suicide, emotion, metascience, and related areas, with particular emphasis on developing parsimonious models of suicide and better understanding suicide motivations and warning signs.

• Suicide
• Metascience
• Emotion
• +۴ مورد دیگر

Kuldeep S. Meel is the Stephen Fleming Early-Career Associate Professor at the School of Computer Science, Georgia Institute of Technology, and an Associate Professor at the University of Toronto (on leave). He previously held a NUS Presidential Young Professorship at the National University of Singapore. His research focuses on automated reasoning, aiming to enable computing systems to handle uncertain real-world environments through scalable techniques integrating randomized algorithms, statistical inference, formal methods, distribution testing, and software engineering. Core research areas: Automated Reasoning, Formal Methods, Approximate Model Counting, Probabilistic Inference, Constraint Solving His research group has achieved significant recognition in both individual awards and publications. Key trends in his recent work include advancing model counting algorithms, developing frameworks for probabilistic explanations, and improving scalability in formal verification and constraint satisfaction. His tools have consistently ranked top in international competitions, demonstrating practical impact in automated reasoning. 2019 NRF Fellowship for AI 2022 ACP Early Career Researcher Award 2020 IEEE Intelligent Systems AI's 10 to Watch Top placements in Model Counting, SAT, and CAV competitions He mentors a diverse group of PhD and Master's students and collaborates with institutions worldwide. His group's publications span premier conferences in AI, formal methods, and design automation, reflecting interdisciplinary contributions to theoretical and applied computer science.

• Automated Reasoning
• Formal Methods
• Artificial Intelligence
• +۶ مورد دیگر

Shai Ben-David is a Professor and University Research Chair at the Department of Computer Science, University of Waterloo. He is affiliated with the Cheriton School of Computer Science and can be reached at shai@uwaterloo.ca . His office is located in DC 2643. Education: Ph.D., Hebrew University, Jerusalem, Israel (1987) M.Sc., Hebrew University Jerusalem, Israel (1979) B.Sc., Hebrew University Jerusalem, Israel (1978) Research interests focus on foundational aspects of machine learning theory, including unsupervised learning (clustering), domain adaptation, fairness, interpretability, and alternative approaches to worst-case computational complexity. He also explores logic applications in computer science theory. His research trends emphasize theoretical challenges in machine learning, particularly clustering, fairness in representations, and the interplay between computational feasibility and learnability. He investigates how unlabeled data and sample compression techniques impact learning robustness and efficiency. No scientific awards are listed. His advising record shows no formal advisees listed here. Grants and funding details are not provided in the text. He has contributed to organizing events like the Dagstuhl Seminar on Foundations of Unsupervised Learning (2017) and co-edited MFCS 2016 proceedings. His work addresses both theoretical questions and practical gaps in ML implementation.

• Machine Learning Theory
• Unsupervised Learning and Clustering
• Domain Adaptation and Transfer Learning
• +۳ مورد دیگر

Chaitanya Swamy is a Professor and University Research Chair in the Department of Combinatorics & Optimization at the University of Waterloo, Canada. His primary affiliation is within the Faculty of Mathematics, and he holds positions in both the Department of Combinatorics & Optimization and the School of Computer Science. He obtained his Ph.D. in Computer Science from Cornell University under the supervision of David Shmoys, followed by postdoctoral research at Caltech's Center for the Mathematics of Information. Swamy’s research focuses on algorithms, particularly in combinatorial optimization, approximation algorithms, algorithmic game theory, stochastic optimization, network design, scheduling, and online algorithms. His work spans theoretical contributions and practical applications, including algorithm design for facility location, network routing, and mechanism design. He has contributed to foundational results in approximation algorithms, such as the development of primal-dual methods and LP-rounding techniques. Swamy has held significant editorial roles, including as an associate editor for Discrete Optimization and SIAM Journal on Computing . He has organized major conferences like CanaDAM 2021 and sessions at ISMP 2018. His teaching record includes courses on combinatorial optimization, scheduling, and algorithmic game theory. He has advised numerous Ph.D. and Master’s students, many of whom have gone on to prestigious academic and industry positions. Swamy’s research has been recognized through awards for his students, including the University of Waterloo Alumni Gold Medal. He actively contributes to the academic community through committee work for conferences like STOC, APPROX, and SODA, and his publications reflect a deep engagement with both theoretical and applied aspects of algorithms and optimization.

• Combinatorial Optimization
• Approximation Algorithms
• Algorithmic Game Theory
• +۴ مورد دیگر

Sharan Vaswani is an Assistant Professor in the School of Computing Science at Simon Fraser University (SFU). His research focuses on designing algorithms for sequential decision-making under uncertainty, stochastic optimization, and their interplay with machine learning generalization. He holds a PhD from the University of British Columbia (2019) and postdoctoral experiences at the University of Alberta and Mila. His academic journey includes MSc (UBC, 2015) and BTech (BITS Pilani, 2012) degrees. Education: PhD (UBC, 2019), MSc (UBC, 2015), BTech (BITS Pilani, 2012) Postdoctoral Work: University of Alberta (2020-2021), Mila (2019-2020) Teaching includes courses on Probability and Computing (CMPT 210), Optimization for Machine Learning (CMPT 409/981), and Theoretical Foundations of Reinforcement Learning (CMPT 419/983). His research group focuses on developing scalable optimization algorithms with theoretical guarantees. He advises multiple PhD and MSc students, contributing to areas like constrained MDPs, adaptive learning rates, and reinforcement learning theory. Research Highlights: Contributions to bandit algorithms, stochastic gradient methods, and reinforcement learning theory. Notable work includes global convergence analysis of policy gradients and variance-reduced optimization frameworks.

• Reinforcement Learning
• Optimization
• Machine Learning
• +۳ مورد دیگر