Find Academic Supervisors

Mark SchmidtView profile

Professor

• Machine Learning
• Artificial Intelligence
• Mathematical Optimization
• +6 more

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.

Olga Sorkine-HornungView profile

Professor

• Digital Content Creation
• Geometry Processing
• Shape Representation and Editing
• +5 more

Olga Sorkine-Hornung is a Professor of Computer Science at ETH Zurich and head of the Institute of Visual Computing. She leads the Interactive Geometry Lab, focusing on theoretical and practical advancements in digital content creation, geometry processing, and shape modeling. Current position: ETH Zurich, Department of Computer Science Previous roles: Courant Institute (NYU), Technical University of Berlin Education: BSc and PhD from Tel Aviv University, postdoc at TU Berlin Her research spans shape representation, digital fabrication, computer animation, and fundamental geometry processing. Key contributions include Laplacian surface editing, as-rigid-as-possible deformation, and generalized winding numbers. She works on applications in VR, AR, and autonomous systems. Awards include Test of Time Awards (2024), ACM Fellow (2020), ERC Consolidator Grant (2020), and EUROGRAPHICS Young Researcher Award (2008). She has supervised numerous students and co-developed software libraries like libigl and Instant Meshes . Co-chair roles for SIGGRAPH, Eurographics, and Pacific Graphics Editorial board member for ACM Transactions on Graphics and other journals Keynote speaker at VMV, CVPR, and SIAM conferences Her work bridges mathematical rigor with practical implementation, advancing computer graphics and geometry processing through intuitive algorithms that maintain surface detail while enabling efficient computation.

Adam RunionsView profile

Researcher

• Computational Modeling
• Developmental Biology
• Computer Science
• +4 more

Adam Runions is a researcher in the Department of Computer Science at the University of Calgary, leading the MPG Partner Group in computational analysis of leaf development through collaborative work with Miltos Tsiantis. His group is embedded in the Graphics Cluster, focusing on interdisciplinary problems at the intersection of computer science and developmental biology. University of Calgary - Department of Computer Science MPG Partner Group (2022) Graphics Cluster affiliation His research explores computational modeling and analysis of plant form and development across multiple scales, integrating geometric modeling, physically-based simulation, and computer-aided design. Key themes include plant morphogenesis, self-organization of natural forms, and cross-disciplinary applications in computer graphics and animation. Recent publications emphasize plant development (leaf shape, bark patterning), mathematical modeling (auxin-driven patterning), and geometric techniques (subdivision surfaces, PUPs). Collaborations span institutions like the Max Planck Institute for Plant Breeding Research. Scientific Awards Marie Sklodowska-Curie Fellowship Best Paper Award (International Conference on Cyberworlds 2015) Best Student Paper Award (Computer Graphics International 2011) The group actively recruits BSc, MSc, and PhD students with backgrounds in computer science and mathematics for projects on plant form simulation and digital content creation. Research integrates evolutionary biology, biomechanical modeling, and computational techniques.

Nina BalcanView profile

Professor

• Machine Learning
• Artificial Intelligence
• Theoretical Computer Science
• +12 more

Nina Balcan is a Professor at Carnegie Mellon University and holds the Cadence Design Systems Professorship in Computer Science. She is affiliated with the School of Computer Science, specifically the Machine Learning Department (MLD) and Computer Science Department (CSD). Her research spans foundational aspects of machine learning, artificial intelligence, theoretical computer science, algorithmic game theory, and interdisciplinary connections in learning theory. Machine Learning Artificial Intelligence Theoretical Computer Science Algorithmic Game Theory Multi-Agent Systems Data-Driven Algorithm Design Her recent work focuses on advancing algorithm design through machine learning, robustness in adversarial environments, and economic modeling. Key contributions include Learning to Branch (JACM 2024), Regret Minimization in Stackelberg Games (NeurIPS 2024), and Learning Accurate Decision Trees (UAI 2024, Outstanding Student Paper Award). She has pioneered novel approaches to data-driven optimization, semi-supervised learning, and privacy-preserving clustering. Nina has received prestigious accolades including ACM Fellow AAAI Fellow Simons Investigator 2019 ACM Grace Murray Hopper Award Her teaching at CMU includes graduate courses on machine learning, advanced machine learning, and specialized topics like algorithmic game theory.

Olga Sorkine HornungView profile

Professor

• Computer Graphics
• Geometric Modeling
• Geometry Processing
• +3 more

Prof. Olga Sorkine Hornung is a Full Professor of Computer Science at ETH Zürich, leading the Interactive Geometry Lab. She holds a BSc and PhD from Tel Aviv University (2000 and 2006) and conducted postdoctoral research at Technical University Berlin. Her research focuses on computer graphics, geometric modeling, and geometry processing, with applications in shape editing, digital fabrication, and animation. She has received numerous accolades, including the ACM Fellowship (2020), ERC Consolidator Grant (2020), and the Golden Owl Teaching Award (2021). Her work bridges theoretical foundations and practical algorithms, addressing challenges in parameterization, surface compression, and interactive design tools. Her research interests span: Computer Graphics & Visualization Geometric Modeling & Processing 3D Content Creation & Digital Fabrication Garment Design & Simulation Human Motion Analysis & Animation Awards and grants include: 2024: Best Paper Honorable Mention (EUROGRAPHICS) 2023: Member of Swiss Academy of Engineering Sciences (SATW) 2020: ERC Consolidator Grant 2017: Rössler Prize (ETH Zurich) Her lab focuses on developing novel methods for interactive geometry processing, with recent advancements in garment modeling (e.g., AIpparel, Rags2Riches) and motion retargeting systems like WalkTheDog. She actively collaborates on interdisciplinary projects, including biomedical applications and sustainable fashion technology.

Dai ZhongxiangView profile

Assistant Professor

• Large Language Models Inference
• Prompt Optimization
• In-context Learning
• +5 more

Dai Zhongxiang is an Assistant Professor and Presidential Young Fellow at the School of Data Science, The Chinese University of Hong Kong, Shenzhen (CUHKSZ), where he joined in August 2024. Previously, he was a Postdoctoral Associate at MIT's Laboratory for Information and Decision Systems (January-June 2024) and a Postdoctoral Fellow at the National University of Singapore's Department of Computer Science (April 2021-December 2023). He completed his Ph.D. in Artificial Intelligence at NUS under the supervision of Bryan Kian Hsiang Low and Patrick Jaillet. Dr. Dai's research focuses on the intersection of theoretical and practical AI, with particular emphasis on large language models (LLMs) and optimization techniques. His work spans both theoretical foundations of multi-armed bandits and Bayesian optimization, as well as practical applications in LLM inference, including prompt optimization, in-context learning, personalization of LLMs, LLM-based agents, and scaling up test-time computation of LLMs. His research approach often bridges theoretical principles with real-world applications, particularly in AI4Science problems. His recent publications demonstrate a clear trend toward advancing LLM capabilities through optimization techniques, with increasing focus on practical deployment challenges. The research spans both theoretical contributions to optimization theory and applied work on enhancing LLM performance in real-world scenarios. His work on dueling bandits, neural bandits, and zeroth-order optimization has been consistently published in top-tier venues including NeurIPS, ICML, ICLR, and ACL. Presidential Young Fellow, CUHKSZ (2024) Dean's Graduate Research Excellence Award, NUS (2021) Research Achievement Award × 2, NUS (2019 & 2020) Singapore-MIT Alliance Graduate Fellowship (2017) Dr. Dai actively mentors multiple Ph.D. students and research assistants, with several of his students' papers accepted to top conferences. His research has received significant attention, with invitations to serve as Area Chair for NeurIPS 2025 and ICLR 2025, reflecting his growing influence in the machine learning community. His work bridges theoretical machine learning with practical applications in large-scale AI systems.

Carlo HarveyView profile

Professor

• Virtual Reality
• Game Design
• Computer Graphics
• +8 more

Professor Carlo Harvey is a creative technologist at the School of Digital Arts (SODA), Manchester Metropolitan University. His interdisciplinary research merges games , machine learning , virtual production , and cultural heritage reinterpretation . He leads industry collaborations with entities like Jaguar Land Rover and Epic Games, focusing on AI-driven interactive audio, real-time visualization, and accessibility solutions. Award-winning projects : TIGA, Innovate UK, and Epic Games MegaGrant for Accession Industry partnerships : Automotive sector, cultural institutions His research spans human-computer interaction , multisensory virtual environments , and acoustic-visual cross-modal perception . Recent publications address robotic simulations, motion alignment, and haptic feedback systems. Scientific recognition : TIGA Award, Innovate UK Funding, Epic Games MegaGrant Advocacy : Digital inclusion, creative collaboration, social impact of technology

• Machine Learning
• Deep Learning
• AI Safety
• +12 more

Tim G. J. Rudner is an Assistant Professor in the Department of Statistical Sciences at the University of Toronto, a Faculty Member at the Vector Institute, and a Title A Fellow at Trinity College, University of Cambridge. He was previously an Assistant Professor and Faculty Fellow at New York University. University: University of Toronto School: Faculty of Arts and Science Department: Department of Statistical Sciences Affiliation: Vector Institute, Trinity College (Cambridge) He holds a PhD in Computer Science and an MSc in Statistics from the University of Oxford, where he was advised by Yee Whye Teh and Yarin Gal, and a BS in Applied Mathematics and Economics from Yale University. PhD: Computer Science, University of Oxford MSc: Statistics, University of Oxford BS: Applied Mathematics and Economics, Yale University His research focuses on building robust, transparent, and trustworthy machine learning systems, particularly for high-stakes applications. He develops probabilistic models that improve generalization under distribution shifts, provide reliable uncertainty estimates, and enable fair and interpretable predictions. His work spans generative models, large language models, healthcare, and biomedical discovery. The recent publications highlight a strong trend toward function-space modeling, Bayesian regularization, and AI safety. Tim's work emphasizes principled uncertainty quantification, robustness to subpopulation and semantic shifts, and the development of frameworks for AI governance and specification. His research bridges theoretical advances with real-world applications, especially in safety-critical domains like medicine and defense. Tim has received numerous accolades including being named a Rhodes Scholar, Qualcomm Innovation Fellow, and 2024 Rising Star in Generative AI. He was awarded a $700,000 Foundational Research Grant and a $30,000 Apple Seed Grant for improving LLM trustworthiness. Rhodes Scholar Qualcomm Innovation Fellow AISTATS Notable Paper Award (2024) Outstanding Paper Award, ICLR GenAI4DM Workshop (2024) Apple Seed Grant ($30,000) Foundational Research Grant ($700,000) NeurIPS Spotlight Talk 2024 Rising Star in Generative AI He actively mentors students, particularly first-generation and low-income scholars, and has contributed to major policy frameworks including the OECD AI Classification Framework and a series of CSET issue briefs on AI safety. His work demonstrates a strong commitment to responsible AI development, combining technical rigor with societal impact. Tim leads research efforts at the intersection of machine learning theory and practical deployment, with ongoing projects in generative modeling, reliable LLMs, and AI governance. His lab produces high-impact work regularly published at top-tier conferences such as NeurIPS, ICML, and AISTATS.

• Machine Learning
• Deep Learning
• Theoretical Foundations of AI
• +11 more

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.

Amit KumarView profile

Professor

• Combinatorial Optimization
• Online Algorithms
• Clustering Algorithms
• +5 more

Amit Kumar is the Jaswinder and Tarwinder Chadha Chair Professor in the Department of Computer Science and Engineering at IIT Delhi. His research focuses on combinatorial optimization, online algorithms, and algorithmic fairness. He has taught courses such as Approximation Algorithms (COL 754), Design and Analysis of Algorithms (COL 351), and Numerical Analysis (COL 726). His work spans theoretical computer science with applications to clustering, scheduling, and fairness in evaluation processes. Research Interests Kumar's research emphasizes developing efficient algorithms for online and dynamic settings, particularly in constrained optimization and biased evaluation systems. He explores theoretical foundations of clustering, load balancing, and resource allocation, with recent contributions to fair food delivery systems and coreset constructions. Publications His recent work includes advancements in online convex paging (STOC 2025), consensus clustering (SODA 2025), and fairness-aware algorithms (AAAI 2024). Over 70 papers across top venues like STOC, SODA, and ICML reflect his expertise in algorithm design and analysis. Awards Best Paper Award at ISAAC 2023 for 'Clustering What Matters in Constrained Settings' Teaching & Mentorship Kumar instructs graduate and undergraduate courses in algorithms, data structures, and numerical methods. He advises students through these courses and collaborates with researchers on NSF-funded projects related to approximation algorithms and streaming systems.

Iason SiderisView profile

Researcher

• Additive Manufacturing
• Advanced Materials Processing
• Path Planning Optimization
• +3 more

Dr. Iason Sideris is affiliated with ETH Zürich's Department of Neue Fertigungstechnologien (New Manufacturing Technologies), holding a Researcher position within the Professorship for Advanced Manufacturing. His work focuses on advancing additive manufacturing techniques, particularly in path planning optimization, temperature control, and material processing. He contributes to fields like Direct Energy Deposition, Wire-Arc Additive Manufacturing (WAAM), and data-driven finite volume methods. Key Research Areas: Additive Manufacturing, Thermal Modeling, Process Optimization, Materials Science Recent research emphasizes scalable path planning for temperature uniformity in AM processes, with publications addressing challenges in WAAM thermal management and real-time simulation methods. His work combines computational modeling with experimental validation to enhance manufacturing efficiency and material properties.

Jan DreierView profile

Research Fellow

• Structural Graph Theory
• Algorithmic Meta-theorems
• Computational Complexity
• +1 more

Jan Dreier is a Research Fellow at the Institute of Logic and Computation at Vienna University of Technology. His research centers on structural graph theory and algorithmic meta-theorems, particularly exploring the boundaries of tractability for model checking problems. Dreier's work bridges theoretical computer science and discrete mathematics, focusing on graph decompositions, parameterized complexity, and logical expressiveness. Key research themes include monadic stability in graph classes, applications of model theory to computer science, and efficient algorithms for logical queries on structured graphs. His publication record shows consistent focus on graph sparsity concepts and algorithmic applications of logic, with recent work expanding into approximation methods for counting queries. Research demonstrates sophisticated applications of combinatorial methods to fundamental problems in computational complexity.

• Combinatorics
• Graph Theory
• Discrete Mathematics
• +3 more

Sophie Spirkl is an Associate Professor (with tenure) in the Department of Combinatorics and Optimization at the University of Waterloo. Previously, she held postdoctoral positions at Princeton University (as an NSF postdoc and instructor, supervised by Maria Chudnovsky) and at Rutgers University (under Jeff Kahn). She earned her PhD from Princeton University under the guidance of Maria Chudnovsky and Paul Seymour. Her research focuses on graph theory and combinatorics, with notable contributions to induced subgraphs, tree decompositions, chromatic number properties, and structural graph theory. She is a recipient of the 2023 Sloan Research Fellowship and co-founded the diamond open-access journal Innovations in Graph Theory . Education: PhD in Mathematics, Princeton University (2016–2020) Postdoctoral Fellowships: Princeton (2020–2022), Rutgers (2018–2020) Research Interests: Dr. Spirkl’s work spans multiple areas of combinatorics, including structural graph theory, extremal graph theory, and algorithmic graph theory. She has published extensively on topics such as induced subgraph obstructions, χ-boundedness, tree decompositions, and the Erdős–Hajnal conjecture. Her research often intersects with theoretical computer science, particularly in parameterized complexity and graph colorings. Awards & Recognition: 2023 Sloan Research Fellowship Contributions to the Innovations in Graph Theory journal Academic Contributions: Her articles address foundational problems in graph theory, such as the Erdős–Hajnal conjecture for C₅, logarithmic treewidth in even-hole-free graphs, and induced saturation for cycles. She collaborates with leading researchers like Maria Chudnovsky and Paul Seymour, advancing the field through rigorous combinatorial analysis. Community Engagement: She coordinates the Women in Math Directed Reading Program at Waterloo, supporting underrepresented groups in mathematics. Her spouse, Logan Crew, is a Research Assistant Professor at the same institution.

Lars RohwedderView profile

Associate Professor

• Algorithms
• Approximation Algorithms
• Online Algorithms
• +3 more

Lars Rohwedder is an Associate Professor in the Algorithms Group at the University of Southern Denmark (SDU) in Odense. He previously held positions as an Assistant Professor at Maastricht University (Netherlands) and postdoc researcher at EPFL, Lausanne (Switzerland). He earned his Ph.D. in Computer Science from CAU Kiel (Germany), advised by Klaus Jansen, and is a recipient of the 2019 PhD of the year award from Förderverein der TF of Kiel University. His research focuses on algorithms for combinatorial optimization, including approximation algorithms, online algorithms, parameterized algorithms, and integer programming. He has contributed to solving scheduling problems, resource allocation, and optimization under uncertainty. Rohwedder has served on program committees for conferences like MAPSP, SODA, STACS, and ICALP. He is funded by NWO's Open Competition M1 project on quasi-polynomial time algorithms. His teaching includes courses on advanced algorithms, operations management, and optimization at SDU and Maastricht University. Key achievements include a quasi-polynomial approximation for the restricted assignment problem, FPT algorithms for scheduling, and contributions to the Submodular Santa Claus problem. His work bridges theoretical foundations and practical applications, with a focus on algorithmic efficiency and robustness.

Jonathan M. BakerView profile

Assistant Professor

• Quantum Computing
• Quantum Computer Architecture
• Quantum Error Correction
• +4 more

Jonathan M. Baker is an Assistant Professor in the Department of Electrical and Computer Engineering at The University of Texas at Austin, holding the Advanced Micro Devices Chair in Computer Engineering. His research centers on quantum computer architecture with emphasis on practical quantum error correction implementation across the quantum computing stack. His educational background includes a Ph.D. in Computer Science from the University of Chicago (advised by Fred Chong) and dual B.S. degrees in Mathematics and Chemistry and Computer Science from the University of Notre Dame. Baker's research spans quantum compilation, logic synthesis, multi-radix architectures, and error mitigation for both near-term and fault-tolerant quantum systems. His work addresses critical challenges in quantum hardware-software co-design, with particular focus on optimizing quantum circuits for real-world hardware constraints and noise characteristics. Current projects emphasize qudit-based computing, neutral atom architectures, and efficient error correction implementations. His publication record shows strong focus on quantum architecture innovations, with recent work exploring qudit advantages, modular chiplet designs, and dynamic noise adaptation. Key trends include hardware-aware compilation techniques, communication optimization across quantum systems, and practical approaches to fault tolerance. Best Paper Award Runner Up, MICRO 2020 IEEE Micro Top Pick, 2020 (Virtualized Logical Qubits) IEEE Micro Top Pick, 2020 (Extending Frontier with Qutrits) IEEE Micro Top Pick, 2021 (Emerging Technologies) Best Poster Award, MICRO 2018 Baker actively mentors graduate students in quantum computing architecture research and serves on conference review committees including MICRO and ASPLOS. His teaching includes specialized quantum systems courses at UT Austin and online EdX modules covering quantum computation fundamentals and architecture. He collaborates with the Duke Quantum Center and maintains strong industry connections through the AMD Chair position, focusing on bridging academic research with practical quantum computing implementations.