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

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

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 .

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.

Priyanka Rainaمشاهده پروفایل

استادیار

• Domain-Specific Architectures
• Hardware/Software Co-design
• Energy-Efficient Computing
• +۳ مورد دیگر

Priyanka Raina is an Assistant Professor of Electrical Engineering at Stanford University, with a courtesy appointment in Computer Science. She leads the Stanford Accelerate research group, focusing on domain-specific hardware architectures and agile hardware-software co-design. Her work emphasizes high-performance, energy-efficient accelerators for emerging technologies. Education: B.Tech. from IIT Delhi (2011), M.S. and Ph.D. from MIT (2013/2018). Postdoctoral experience includes NVIDIA Research (2018) and Amazon Visiting Academic (2023–present). Awards include the Sloan Research Fellowship (2024), NSF CAREER Award (2023), and Terman Faculty Fellowship (2018). Research Interests: Domain-specific architectures, near-memory computing, design productivity, and machine learning acceleration. Her group develops frameworks like AHA (Agile Hardware) for efficient accelerator design and compilers. Awards: Over 10 major awards, including best paper recognitions at VLSI, MICRO, and JSSC. Active roles as Associate Editor for IEEE JSSC and Program Chair for IEEE Hot Chips (2020). Advising & Teaching: Supervises multiple PhD and MS students in hardware design, CGRAs, and ML accelerators. Teaches VLSI design courses (EE271/272/372) and oversees independent studies in embedded systems and chip design. Labs & Collaborations: Affiliated with Stanford PORTAL Center, AHA Center, and SystemX Alliance. Projects include MINOTAUR (edge AI accelerator), Amber (CGRA-based SoC), and EMBER (RRAM macros).

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

Nina Balcanمشاهده پروفایل

استاد

• Machine Learning
• Artificial Intelligence
• Theoretical Computer Science
• +۱۲ مورد دیگر

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.

Bahar Asgariمشاهده پروفایل

استادیار

• Computer Architecture
• Domain-Specific Architecture Design
• Near Memory Processing
• +۳ مورد دیگر

Bahar Asgari is an Assistant Professor in the Department of Computer Science at the University of Maryland, College Park. She holds appointments in CS, UMIACS, and ECE, and directs the Computer Architecture and Systems Lab (CASL). Her research focuses on domain-specific architecture design, near memory processing, and reconfigurable computing. Before joining UMD, she worked at Google, contributing to system optimization and memory utilization strategies. Education: Ph.D., Georgia Institute of Technology, 2021. Research Interests: Developing energy-efficient architectures for sparse problems, scientific computing acceleration, FPGA optimizations, and reconfigurable hardware systems. Her work addresses challenges in memory efficiency, parallelization, and hardware-software co-design across domains like machine learning and IoT. Key Awards: 2024 UMD Excellence in Teaching Award 2023 DOE Early Career Award Advising & Grants: Supervises 9 graduate students and leads projects sponsored by NSF, DOE, and industry partnerships. Her lab explores systolic arrays, near-data processing, and fault-tolerant computing. Labs/Teams: Directs CASL, which builds next-generation computing systems through hardware innovation and algorithm-architecture co-design.

• Quantum Information Theory
• Quantum Many-Body Systems
• Quantum Dissipative Evolutions
• +۲ مورد دیگر

Angela Capel Cuevas is an Assistant Professor of Quantum Information Theory/Theoretical Quantum Computation at the University of Cambridge's Department of Applied Mathematics and Theoretical Physics (DAMTP). Previously, she held a Junior Professorship at Eberhard Karls Universität Tübingen (2021-2024) and was an MCQST Distinguished PostDoc at TU München (2020-2021). Her research focuses on the intersection of quantum information theory and quantum many-body systems, particularly studying thermalization dynamics via quantum functional inequalities. She is a recipient of the Simons Emmy Noether Fellowship and Forbes 30 Under 30 (Spain 2023). Education: PhD in Mathematics, Universidad Autónoma de Madrid/ICMAT (2015-2019) Master in Computational Engineering and Mathematics, URV/UOC (2016-2018) Bachelor in Mathematics, Universidad de Granada (2009-2014) Research: Angela's work applies analytic and geometric tools to quantum systems, emphasizing decay of correlations in Gibbs states and quantum dissipative evolutions. Key topics include entropy inequalities, modified logarithmic Sobolev inequalities, and thermalization rates in spin chains. Her recent work bridges quantum functional analysis with practical implications for quantum computing and thermalization phenomena. Grants & Roles: PI of CRC TRR 352 'Mathematics of Many-Body Quantum Systems' (7M€) Co-PI of QuantERA project TouQan (1.25M€) Organized workshops at BIRS and Tübingen (2023-2024) Awards: Simons Emmy Noether Fellowship (2023) Forbes 30 Under 30 (2023) Vicent Caselles RSME-FBBVA Award (2022) Labs/Teams: Leads a group studying quantum dissipative systems and thermalization at DAMTP. Collaborates with institutions globally on quantum functional inequalities and Gibbs state properties.

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

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.

• Artificial Intelligence
• Algorithmic Game Theory
• Multiagent Reinforcement Learning
• +۴ مورد دیگر

Amy R Greenwald is a Professor of Computer Science at Brown University. Her research spans artificial intelligence, algorithmic game theory, and computational economics, with a focus on multiagent reinforcement learning and market equilibrium computation. Education PhD, New York University (1999) MS, Cornell University (1995) MS, Oxford University (1992) BS, University of Pennsylvania (1991) Research Focus Greenwald's work explores strategic interactions in computational systems, including: Game-theoretic modeling of multiagent systems Algorithmic approaches to market equilibrium Simulation-based equilibrium learning Stackelberg game formulations for hierarchical decision making Applications to supply chain negotiations and economic design Her recent publications emphasize tractable equilibrium computation, social influence in economic models, and advanced reinforcement learning techniques for strategic settings. Teaching CSCI 0100 - Data Fluency for All CSCI 0180 - Computer Science: An Integrated Introduction CSCI 1440 - Algorithmic Game Theory CSCI 2440 - Advanced Algorithmic Game Theory CSCI 2951Z - Advanced Algorithmic Game Theory

Michael Baldeaمشاهده پروفایل

دانشیار

• Process Systems Engineering
• Energy Systems
• Nonlinear Optimization
• +۳ مورد دیگر

Michael Baldea is an Associate Professor in the Department of Chemical Engineering at the University of Texas at Austin . He holds a Ph.D. in Chemical Engineering from the University of Minnesota (2006), with prior degrees from 'Babeş-Bolyai' University in Romania (M.Sc. 2001, Diploma 2000). His research group develops theoretical and computational methods for Process and Energy Systems Engineering , focusing on integrated decision-making, performance optimization, and process intensification with industrial validation. Education: Ph.D., Chemical Engineering, University of Minnesota (2006) M.Sc., Interface Process Engineering, 'Babeş-Bolyai' University (2001) Diploma, Chemical Engineering, 'Babeş-Bolyai' University (2000) Research Thrusts: Integrated decision-making in chemical/energy supply chains Process performance monitoring and optimization Process integration and intensification Key applications include grid-responsive chemical plants, intensified distillation/column designs, and renewable energy integration for building systems. Scientific Awards: Frank A. Liddell, Jr. Fellowship NSF CAREER Award (2015-2020) Moncrief Grand Challenges Faculty Award (2014) AIChE Outstanding Young Researcher Award (2017) Implementation : His group has translated research into commercial tools through partnerships with industrial test beds and is working to integrate methods into commercial simulators. They explore predictive approaches for building energy management and strategic capital investment analysis in next-generation energy systems.

Afonso S. Bandeiraمشاهده پروفایل

استاد

• High Dimensional Probability
• Random Matrices
• Mathematical Statistics
• +۳ مورد دیگر

Afonso S. Bandeira is a Professor in the Department of Mathematics (D-MATH) at ETH Zurich, where he conducts research at the intersection of mathematics, statistics, and computer science. He maintains strong affiliations with several interdisciplinary research centers including the Institute For Operations Research (IFOR), the Max Planck ETH Center for Learning Systems, the ETH Foundations of Data Science, and the ETH AI Center, with a courtesy appointment at D-ITET. Bandeira actively teaches courses including Mathematics of Signals, Networks, and Learning, and Mathematics of Data Science. His research focuses on High Dimensional Probability, Random Matrices, Mathematical Statistics, Theoretical Computer Science, Combinatorics, and Mathematical Optimization. Bandeira's work often explores the theoretical foundations of data science, examining phase transitions in statistical problems, computational barriers, and the geometry of high-dimensional spaces. He maintains a research group blog called Randomstrasse101 that emphasizes open problems in his field. Analysis of his recent publications reveals a strong focus on matrix and tensor concentration inequalities, synchronization problems, nonconvex optimization landscapes, and computational-statistical tradeoffs in high-dimensional inference. His work bridges theoretical mathematics with practical applications in machine learning and data analysis, particularly examining where computational limitations arise in statistical problems. Bandeira actively mentors students and researchers, currently supervising several doctoral candidates including Daniil Dmitriev, Konstantin Donhauser, Anastasia Kireeva, Kevin Lucca, Chiara Meroni, Gil Kur, Petar Nizic-Nikolac, and Almut Roedder. He emphasizes that students working with him should participate in the DACO seminar and group meetings, and encourages prospective students to have completed his Mathematics of Signals, Networks, and Learning or Mathematics of Data Science courses. He leads a research group focused on the mathematics of data science, with regular group meetings and seminars. Bandeira has developed comprehensive lecture notes including 'A Tour Through the Mathematics of Signals, Learning, and Networks' (2025) and 'Mathematics of Machine Learning' (2021), and previously authored 'Ten Lectures and Forty-Two Open Problems in the Mathematics of Data Science' (2015).

Hayden Kwok Hay SOمشاهده پروفایل

دانشیار

• Reconfigurable Computing
• FPGA-Based Systems
• Computer Architecture
• +۷ مورد دیگر

Prof. Hayden Kwok Hay SO is an Associate Professor at the University of Hong Kong (HKU), affiliated with the Department of Electrical and Electronic Engineering. He currently serves as Acting Director of the School of Innovation and previously co-directed the Computer Engineering Program. His research focuses on reconfigurable computing systems, FPGA-based architectures, and their applications in AIoT, medical imaging, and high-performance computing. He holds a B.S., M.S., and Ph.D. in Electrical Engineering and Computer Sciences from UC Berkeley (1998–2007). Prof. So has been recognized with awards such as the IEEE-HKN Teaching Award (2021), Croucher Innovation Award (2013), and multiple teaching excellence awards. He leads the Computer Architecture & System Research Lab (CASR) and co-founded the Joint Lab on Future Cities (JLFC). His work spans FPGA overlay architectures, graph processing systems, and hardware-software co-design for efficient computing. Key research contributions include advancements in FPGA-based reconfigurable systems, sparse dataflow architectures, and medical imaging accelerators. He has secured grants for projects like 'Advanced machine vision guided aquatic surface vehicles' and 'Efficient and Productive Parallel Data Processing in Hybrid FPGA-CPU Clusters.' Prof. So has advised numerous students and researchers, contributing to over 150 peer-reviewed publications. His current projects explore AI hardware acceleration, neuromorphic computing, and FPGA-driven solutions for big data challenges.

Yin Tat Leeمشاهده پروفایل

دانشیار

• Convex Optimization
• Convex Geometry
• Graph Algorithms
• +۲ مورد دیگر

Yin Tat Lee is an Associate Professor at the Paul G. Allen School of Computer Science & Engineering , University of Washington, and a Senior Principal Researcher in Microsoft AI. His research spans convex optimization , convex geometry , graph algorithms , online algorithms , and differential privacy , with applications in machine learning and theoretical computer science.