Find Academic Supervisors

• Machine Learning
• Probability
• Mathematical Physics
• +6 more

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 .

Michael KaessView profile

Associate Professor

• Robotics
• Computer Vision
• SLAM (Simultaneous Localization and Mapping)
• +6 more

Michael Kaess is an Associate Professor at the Robotics Institute, Carnegie Mellon University (CMU), within the School of Computer Science. He leads the Robot Perception Lab (RPL) and contributes to the Field Robotics Center (FRC) and Computer Vision Group (CV). His research focuses on efficient perception algorithms for mobile robots, particularly in 3D mapping, SLAM, and sensor fusion using vision, LiDAR, inertial, and sonar data. Kaess holds a PhD in Computer Science from Georgia Tech and was a postdoc at MIT's Marine Robotics Lab. Education: Georgia Institute of Technology, PhD in Computer Science (2008) MIT, Postdoctoral Associate (2008–2010) Research Interests: Kaess develops algorithms for robust and efficient inference in robotics, emphasizing factor graphs and linear algebra. His work spans underwater robotics, aerial systems, tactile SLAM, and multi-sensor integration. Key areas include SLAM with planes/lines, imaging sonar reconstruction, and neural field methods for LiDAR-visual fusion. Publications: Over 145 papers, including work on EDPLVO (visual odometry), HoloOcean (underwater simulation), and neural radiance fields with LiDAR. Recent trends focus on robust incremental smoothing, acoustic-optical fusion, and real-time volumetric mapping. Awards: Recognized with the RSS Test of Time Award (2020), Outstanding Associate Editor (2022), and paper awards at ICRA/ICRA. Active in conference organization (IROS/ICRA program committees). Advising & Grants: Supervises 10+ current PhD/MSc students, with past advisees contributing to CoRL/ICRA work. Manages grants in perception, autonomy, and marine robotics. Teaches courses like Robot Localization and Mapping (16-833). Labs/Teams: Directs RPL, collaborates with FRC on field robotics. Develops open-source tools like GTSAM (GNU Toolkit for Smoothing and Mapping).

Amitabha BagchiView profile

Professor

• Data Algorithmics
• Probability and Networks
• Theoretical Computer Science
• +7 more

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.

• Mathematics of Data
• Numerical Linear Algebra
• Randomized Algorithms
• +5 more

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

• Applied Topology
• Dynamical Systems
• Algebraic Topology
• +5 more

Robert Ghrist is the Andrea Mitchell University Professor at the University of Pennsylvania with dual appointments in the Department of Mathematics and the Department of Electrical and Systems Engineering. He serves as Associate Dean for Undergraduate Education for Penn Engineering. His educational background includes a B.S. in Mechanical Engineering from the University of Toledo (1991), and M.S. and Ph.D. degrees in Applied Mathematics from Cornell University (1994, 1995). Ghrist's research bridges pure and applied mathematics, focusing on applied algebraic topology , dynamical systems , and geometric methods in data science. His work extends to network theory, topological data analysis, and computational geometry, with applications spanning robotics, neuroscience, and social dynamics. Key innovations include developing sheaf-theoretic approaches for networked systems and persistence homology techniques for high-dimensional data. Analysis of his recent publications reveals a strong emphasis on lattice-theoretic frameworks , topological robotics , and network dynamics , with emerging applications in neural data interpretation and geometric computing. His research consistently integrates category theory with real-world engineering challenges. Significant scientific recognition includes: Presidential Early Career Award (PECASE, 2004) Scientific American 'Top 50' Research Leader (2007) Mathematical Association of America's Chauvenet Prize (2013) University of Pennsylvania Lindback Award for Distinguished Teaching (2015) DoD National Security Science and Engineering Faculty Fellowship (NSSEFF, 2015) Ghrist leads multiple federally funded research initiatives supported by AFOSR, DARPA, NSF, and ONR. He directs the development of educational tools including the Calculus BLUE/GREEN Project video series and custom GPTs for mathematical pedagogy. His open online courses have reached over 100,000 learners globally.

Michael A OsborneView profile

Professor

• Machine Learning
• Bayesian Optimization
• Gaussian Processes
• +3 more

Michael A Osborne is Professor of Machine Learning at the University of Oxford and leads the Bayesian Exploration Lab . He serves as Director of the EPSRC Centre for Doctoral Training in Autonomous Intelligent Machines and Systems and co-directs the Oxford Martin AI Governance Initiative. His research focuses on Bayesian optimization, Gaussian processes, and probabilistic numerics with applications in quantum devices, battery modeling, and AI governance. Key Positions: Professor of Machine Learning, University of Oxford Official Fellow, Exeter College Co-founder of Mind Foundry Lead Researcher, Oxford Martin Programme on Technology and Employment Research Themes: Probabilistic modeling for quantum systems Uncertainty quantification in energy storage AI safety and societal impact analysis Automated experimental design Quantum device calibration Probabilistic numerical methods Technical Contributions: Bridging reality gap in quantum devices Efficient Bayesian quadrature techniques Personalized neurostimulation algorithms Automated measurement protocols Quantum-classical hybrid ML

Priyanka RainaView profile

Assistant Professor

• Domain-Specific Architectures
• Hardware/Software Co-design
• Energy-Efficient Computing
• +3 more

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

• Graph Algorithms
• Optimization
• High-Dimensional Geometry
• +3 more

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.

• Machine Learning
• Deep Learning
• Robustness
• +3 more

J. Zico Kolter is a Professor and Director of the Machine Learning Department at the School of Computer Science , Carnegie Mellon University. His research focuses on advancing deep learning algorithms to enhance their robustness, safety, and understanding of data impact on model functionality. Current Courses: 15-780 Graduate Artificial Intelligence (Spring 2024), 10-714 Deep Learning Systems Former Courses: 15-688 Practical Data Science, 15-780 Graduate Artificial Intelligence (Spring 2017), 15-884 Computational Methods for the Smart Grid He has led tutorials on Implicit Layers (NeurIPS 2020) and Adversarial Robustness (NeurIPS 2018), along with educational resources like a linear algebra refresher.

Bahar AsgariView profile

Assistant Professor

• Computer Architecture
• Domain-Specific Architecture Design
• Near Memory Processing
• +3 more

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
• +2 more

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.

• Uncertainty Reasoning and Decision Making in Artificial Intelligence
• Electronic Business
• Systems Analysis and Design
• +7 more

Liping Liu is a Professor in the Department of Management at The University of Akron's College of Business. He holds a Ph.D. in Business from the University of Kansas (1995), Master of Engineering in Systems Engineering (1991), and dual bachelor's degrees in Applied Mathematics (1986) and River Dynamics (1987). Ph.D., University of Kansas MS, Huazhong University of Science and Technology B.E., Wuhan University BS, Huazhong University of Science and Technology His research spans Artificial Intelligence , Electronic Business , Systems Analysis , Data Quality , and Belief Function Theory . He pioneered coarse utility theory and linear belief functions , now taught in top Ph.D. programs across multiple disciplines. Key trends in his publications include Belief Function Applications (2012-2024), Medical Data Systems (2003-2015), and Decision Theory (2004-2014). Recent works focus on Gamma Belief Functions (2024) and computational improvements in linear belief function operations (2019-2016). Scientific contributions recognized via: Microsoft Azure Educator Grant (2014-2016) Inclusion in Who's Who in America (2010-2013) and Who's Who in the World (2011-2013) As an editor and committee member for major conferences (INFORMS, AMCIS, Belief Functions conferences), he bridges academic research with practical systems implementation in e-business and healthcare domains.

Jelani NelsonView profile

Professor

• Theoretical Computer Science
• Algorithms
• Data Streams
• +8 more

Jelani Nelson is a Professor and Department Chair in the UC Berkeley EECS Department (College of Engineering). His work focuses on theoretical computer science , particularly algorithms , data streams , dimensionality reduction , and privacy-preserving computation . Advising : Current students include Ishaq Aden-Ali, Xin Lyu, Mihir Singhal, and Hongxun Wu (co-advised with leading researchers). Education : PhD from MIT (George M. Sprowls Award), M.Eng from MIT. Research Highlights : Developed foundational results in Johnson-Lindenstrauss dimensionality reduction (optimality, sparse embeddings). Advancements in differential privacy (lower bounds, private mean estimation, threshold learning). Pioneering work on streaming algorithms for heavy hitters, norm estimation, and graph problems. Innovations in compressed sensing and oblivious subspace embeddings . Scientific Awards : PODS Best Paper Award (2011, 2022) IBM Pat Goldberg Memorial Best Paper Award (2011) George M. Sprowls Award for MIT doctoral thesis (2009) NeurIPS 2020 Spotlight Presentation

• Machine Learning
• Deep Learning
• Gaussian Processes
• +5 more

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.

Anoosheh HeidarzadehView profile

Assistant Professor

• Information and coding theory
• Private and secure computing
• Fault-tolerant distributed computing
• +3 more

Anoosheh Heidarzadeh is an Assistant Professor in the Department of Electrical and Computer Engineering at Santa Clara University's School of Engineering. He holds a Ph.D. in Electrical and Computer Engineering from Carleton University (2012) and previously served as a Visiting Assistant Professor at Texas A&M University (2018-2022) and Associate Research Scientist at the same institution (2015-2017). His postdoctoral research was conducted at the California Institute of Technology (2013-2014). His research focuses on: Information and coding theory : Fundamental limits of data transmission and storage systems Private and secure computing : Protocols for confidential data processing in networked environments Fault-tolerant distributed systems : Resilient computation frameworks for large-scale applications Distributed machine learning : Scalable algorithms for collaborative learning architectures Recent publications (2021-2022) demonstrate strong emphasis on privacy-preserving computation (covering 73% of articles) and distributed coding techniques (67% of articles), with innovations in private information retrieval, matrix operations, and group testing methodologies. Theoretical contributions dominate (87%), while 13% address applied challenges like COVID-19 screening.