جست‌وجوی استاد و پژوهشگر

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

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.

• Mathematics of Data
• Numerical Linear Algebra
• Randomized Algorithms
• +۵ مورد دیگر

Liza Rebrova is an Assistant Professor in the Department of Operations Research and Financial Engineering (ORFE) at Princeton University's School of Engineering and Applied Science. She is also an associated faculty member of the Program in Applied and Computational Mathematics (PACM) and the Center for Statistics and Machine Learning (CSML). Her research focuses on randomized numerical linear algebra and the mathematics of data science, with connections to high-dimensional probability and stochastic optimization. She develops mathematically justified randomized algorithms for large-scale data, particularly interested in settings where data exhibits mathematical structure such as spectral decay, multi-modality, or non-negativity. Her work addresses challenges in data compression, recovery, and optimization under structured noise conditions. Dr. Rebrova's recent publications show a strong trend toward developing robust algorithms for linear systems, tensor data compression, and nonnegative matrix factorization. Her work bridges theoretical foundations with practical applications in machine learning and data science, with emphasis on memory efficiency and handling corrupted or incomplete data. NSF DMS-2309685 (Single PI, 2024-2026): "Outliers are not what they seem: data-aware, flexible, and robust randomized iterative methods" NSF DMS-2108479 (Collaborative, 2022-2024): "Fast, Low-Memory Embeddings for Tensor Data with Applications" (co-PIs Mark Iwen and Deanna Needell) She currently advises three PhD students (Jackie Lok, Shambhavi Suryanarayanan, and Sofiia Shvaiko) and has previously advised Abraar Chaudhry (PhD 2024) and Nicolo Grometto (Masters thesis 2023). At Princeton, she teaches graduate courses including ORF526 (Graduate Probability), ORF387 (Networks), and ORF523 (Convex and Conic Optimization).

Farzad Mashayekمشاهده پروفایل

استاد

• Turbulent Reacting Flow
• Plasma Flow
• Electrostatic Atomization
• +۹ مورد دیگر

Farzad Mashayek is a Professor and Department Head of Aerospace and Mechanical Engineering at the University of Arizona, College of Engineering. He is a member of the Graduate Faculty and leads the Computational Multiphase Transport Laboratory. His research integrates high-fidelity simulations, machine learning, and experimental validation across diverse domains in fluid dynamics and energy systems. Educational Background: PhD in Mechanical Engineering, State University of New York at Buffalo, Buffalo, NY MS in Mechanical Engineering, Sharif University of Technology, Tehran, Iran BS in Mechanical Engineering, Sharif University of Technology, Tehran, Iran His research interests include turbulent reacting flows, plasma dynamics, electrostatic atomization, solid-ion and lithium batteries, computational fluid dynamics, and machine learning applications in engineering. He employs high-order spectral element methods, phase-field modeling, and deep neural networks to study complex multiphysics phenomena such as drop impact, battery degradation, and turbulence modeling. The recent publications reflect a strong trend toward integrating machine learning with multiphysics simulations, particularly in battery safety (thermal runaway prediction), materials characterization (STEM image analysis), and fluid dynamics (modal analysis of turbulence). His work often involves collaboration with experimental groups to validate models, especially in dental aerosol suppression and electrohydrodynamics. Scientific Awards: Sustained Service Award, American Institute of Aeronautics and Astronautics (AIAA), Spring 2022 Best Presentation Award, The 20th International Conference on Computational Mathematics, Parallel and Distributed Computing, Summer I 2018 Dr. Mashayek has secured funding from NSF (GOALI program) for controlled coating via charged droplet deposition. He advises graduate students and postdoctoral researchers in computational mechanics and energy systems, fostering interdisciplinary research. He has contributed to engineering education, particularly during the pandemic, with active learning strategies in online instruction. He leads a dynamic research team focused on advancing simulation tools and applying them to real-world challenges in energy, manufacturing, and public health.

Han Liuمشاهده پروفایل

استاد

• Artificial Intelligence
• Computer Systems
• Statistical Machine Learning
• +۴ مورد دیگر

Han Liu is a Professor in the Department of Computer Science at Northwestern University's McCormick School of Engineering. He directs the MAGICS (Modern Artificial General Intelligible and Computer Systems) Lab and the Center for Foundation Models and Generative AI at Northwestern, with prior roles as director of the Deep Reinforcement Learning Center at Tencent AI Lab and professor at Princeton and Johns Hopkins Universities. PhD in Machine Learning and Statistics from Carnegie Mellon University (2012), advised by John Lafferty and Larry Wasserman Han Liu's research focuses on integrating artificial intelligence with computer systems, particularly through foundation models and probabilistic graphical models. His work aims to revolutionize science, engineering, and business by deploying statistical machine learning methods in edge and cloud computing environments. Recent research trends include transformer-based models, modern Hopfield networks, genomic foundation models, and theoretical analysis of attention mechanisms. His 2025 publications explore topics like species differentiation with DNA embeddings, universal approximation capabilities of transformers, and metaverse spatial reasoning. Alfred P Sloan Fellowship in Mathematics IMS Tweedie New Researcher Award ASA Noether Young Scholar Award NSF CAREER Award Presidential Early Career Awards for Scientists and Engineers Han Liu serves as associate editor for the Journal of American Statistical Association, Electronic Journal of Statistics, Technometrics, and the Journal of Portfolio Management. He has directed research centers at Northwestern and contributed to major conferences as area chair (NeurIPS, ICML, ICLR).

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

استاد

• Machine Learning
• Bayesian Optimization
• Gaussian Processes
• +۳ مورد دیگر

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

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

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

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
• Artificial Intelligence
• Algorithms
• +۳ مورد دیگر

Zaid Harchaoui is an Adjunct Professor in the Department of Statistics at the University of Washington. His research focuses on machine learning, generative AI, and algorithmic optimization, with applications spanning ecology, neuroscience, and artificial intelligence. He explores learning under distributional shifts and develops tools for scalable generative models in language and vision domains. University: University of Washington Department: Statistics Research Focus: Learning from data with computational, inferential, and mathematical rigor; distributional shift adaptation; generative model scaling Email: zaid@uw.edu His recent work emphasizes generative AI applications in ecology and neuroscience, stochastic optimization for robustness, and algorithmic efficiency in large-scale learning. Key contributions include techniques for distributionally robust optimization, interpretable authorship obfuscation, and uncertainty quantification in behavior classification. Scientific awards and honors are not explicitly mentioned in the provided text. Collaborative efforts often intersect with nonlinear control algorithms, spectral analysis, and privacy-preserving machine learning frameworks.

Ajit Rajwadeمشاهده پروفایل

استاد

• Artificial Intelligence
• Machine Learning
• Signal Processing
• +۶ مورد دیگر

Ajit Rajwade is a Professor at the Department of Computer Science and Engineering , Indian Institute of Technology Bombay. His research spans Artificial Intelligence , Compressed Sensing , and Medical Imaging , with affiliations to the Centre for Machine Intelligence and Data Science and the Koita Centre for Digital Health . Education : PhD in Computer and Information Science and Engineering, University of Florida (2010) MSc in Computer Science, McGill University (2004) BTech in Computer Engineering, University of Pune (2002) His research interests focus on intelligent data acquisition, particularly in neural network analysis , graph signal processing , and medical imaging . He develops compressed sensing algorithms for inverse problems like tomography and MRI reconstruction , alongside applying group testing to pandemic response. Scientific awards include the Prof. S. P. Sukhatme Award (2024) and Departmental Teaching Excellence (2019). His publications demonstrate expertise in image restoration , noise modeling , and epidemiological algorithms . He has advised PhD students like Sabyasachi Ghosh and Jerin Geo James , with a focus on computationally efficient methods in medical imaging and machine learning .

Kai Xuمشاهده پروفایل

استادیار مهمان

• Geometric Analysis
• Calculus of Variations
• Metric Geometry
• +۴ مورد دیگر

Kai Xu is a Morrey Visiting Assistant Professor in the Mathematics department at the University of California, Berkeley, mentored by Richard Bamler. Appointed in 2025, he holds a PhD from Duke University supervised by Hubert Bray. His research addresses foundational problems at the intersection of differential geometry and analysis. His educational background includes: PhD in Mathematics, Duke University (2025), supervised by Hubert Bray Xu's research spans geometric analysis, calculus of variations, and metric geometry with concentrated focus on 3D scalar curvature geometry, weak inverse mean curvature flow, nonlinear potential theory (p-harmonic functions for $1 \leq p \leq \infty$), and spectral Ricci curvature bounds. His work systematically explores connections between curvature constraints, topological properties, and geometric flows through rigorous analytical methods. His publication record (2022-2025) reveals consistent advancement in scalar curvature theory, inverse mean curvature flow, and spectral Ricci geometry. Key contributions include spectral splitting theorems, drawstring constructions for scalar curvature constraints, and topological gap theorems for positive scalar curvature 3-manifolds. His collaborative work with leading mathematicians appears in journals including Duke Mathematical Journal and Calculus of Variations and Partial Differential Equations. No scientific awards are mentioned in the provided text. Teaching responsibilities include Math 104 in Fall 2025. Information regarding student advising and grant funding is not specified in available materials. No dedicated laboratory or research team structure is described in the source text.

• Data Science
• Machine Learning
• Computational Harmonic Analysis
• +۶ مورد دیگر

Pierre Vandergheynst is a Full Professor at the Swiss Federal Institute of Technology Lausanne (EPFL) in the Department of Electrical Engineering, with a courtesy appointment in Computer and Communication Sciences. He serves as EPFL’s Vice-Provost for Education since 2015 and leads the Signal Processing Laboratory 2 (LTS2). His research spans harmonic analysis, sparse approximations, mathematical data processing, and applications in signal/image processing, computer vision, machine learning, and graph-based data analysis. PhD in Mathematical Physics (1998), Université catholique de Louvain Postdoctoral Researcher at EPFL (1998-2001) Assistant Professor at EPFL (2002-2007) His research explores geometry/symmetry in high-dimensional data, redundant dictionaries for dimensionality reduction, and computational harmonic analysis on manifolds. Recent work focuses on protein structure modeling, geometric deep learning, and graph-based signal processing. Key article trends include graph neural networks for protein analysis, geometric deep learning in neuroscience, and structured knowledge priors in neural models. His 2023-2025 publications emphasize interpretable AI, long-range dependencies in graphs, and molecular representation learning. Scientific Awards: IEEE Signal Processing Magazine Best Paper Award (2023) Signal Processing Society Best Paper Award (2022) Apple ARTS Award (2007) De Boelpaepe Prize, Royal Academy of Sciences of Belgium (2009-2010) He has supervised over 30 PhD theses and contributed to foundational work in graph signal processing, compressive sensing, and geometric deep learning. His lab develops tools for data science on non-Euclidean structures, with applications in medicine, astronomy, and wireless systems.

• Causal Inference
• Representation Learning
• Generative Models
• +۵ مورد دیگر

Arthur Gretton is a Professor at University College London (UCL), leading the Gatsby Computational Neuroscience Unit and serving as director of the Centre for Computational Statistics and Machine Learning. He also works as a Research Scientist at Google DeepMind. His research focuses on causal inference, representation learning, and nonparametric hypothesis testing with applications in machine learning and computational neuroscience. Academic Affiliations Gatsby Computational Neuroscience Unit, UCL Centre for Computational Statistics and Machine Learning, UCL Google DeepMind Arthur's research spans several key areas in modern machine learning, including: Kernel methods for causal effect estimation and two-sample testing Deep learning architectures for proxy causal learning with complex confounding Adaptive gradient flows for generative modeling Nonparametric statistical tests with theoretical guarantees Applications in distributional reinforcement learning and Bayesian inference His work addresses both methodological advancements and practical implementations, particularly for high-dimensional data settings. Recent publications demonstrate his focus on causal inference with hidden confounders (AISTATS 2025), deep learning adaptivity in instrumental variable regression (ICLR 2025), and novel approaches to two-sample testing with adaptive kernel selection (NeurIPS 2024). He has also contributed extensively to distributional reinforcement learning and hypothesis testing frameworks. As an advisor, he supervises multiple PhD students including Jakub Wornbard, Zikai (Steve) Shen, and Zonghao (Hudson) Chen, while co-supervising others. His methodological contributions are implemented in various software packages available at the Gatsby Unit, including tools for kernel-based covariate shift correction, independence testing, and maximum mean discrepancy calculations.

Andrew Childsمشاهده پروفایل

استاد

• Quantum Algorithms
• Quantum Information Processing
• Quantum Simulation
• +۲ مورد دیگر

Andrew Childs is a Professor at the University of Maryland, affiliated with the Department of Computer Science and the Institute for Advanced Computer Studies (UMIACS). He serves as Director of the NSF Quantum Leap Challenge Institute for Robust Quantum Simulation (RQS) and is a Fellow at the Joint Center for Quantum Information and Computer Science (QuICS). His research focuses on quantum algorithms for simulating physical systems, algebraic problems, and quantum walk protocols, with applications in quantum computing and computational complexity. University of Maryland Institute for Advanced Computer Studies (UMIACS) Joint Center for Quantum Information and Computer Science (QuICS) NSF Quantum Leap Challenge Institute for Robust Quantum Simulation Childs' research spans quantum simulation, quantum Fourier transform, phase estimation, and Hamiltonian dynamics. He has developed techniques to reduce quantum computational resources for simulating quantum systems and explored limitations of quantum computers through hidden subgroup problems and non-unitary dynamics. His publications cover diverse areas including quantum walk optimization, Hamiltonian simulation methods, and applications to cryptography and condensed matter physics. Recent works address spatial search algorithms, product formulas for commutators, and quantum routing protocols. As an educator, Childs has taught courses on quantum algorithms and information processing at both the University of Maryland and University of Waterloo, with lecture notes and materials spanning multiple years. Contact: amchilds@umd.edu | Office: ATL 3359 | Affiliated with University of Maryland's quantum research institutes.

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

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.