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

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

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

Seth Lloydمشاهده پروفایل

استاد

• Quantum Information Science
• Quantum Computation
• Quantum Communications
• +۵ مورد دیگر

Seth Lloyd is a Professor of Mechanical Engineering at the Massachusetts Institute of Technology (MIT), where he directs the Center for Extreme Quantum Information Theory (xQIT). His work bridges theoretical physics, quantum information science, and complex systems theory. He has made significant contributions to the foundations of quantum computing and quantum information processing. Lloyd received his education from prestigious institutions: B.A. from Harvard College (1982) M.Phil from Cambridge University (1984) as a Marshall Scholar Ph.D. in Physics from Rockefeller University (1988) Lloyd's research focuses on quantum information science, particularly quantum computation and quantum communications. He has pioneered work in quantum analog computation, quantum error correction, and quantum metrology. His research explores how quantum mechanics can be harnessed for information processing tasks, with applications ranging from quantum computing to understanding biological processes like photosynthesis. Lloyd is also known for his work on complex systems and the relationship between information and physical systems, arguing that the universe itself can be viewed as a quantum computer. His publication record shows a clear progression from foundational quantum computing work to applications in quantum machine learning and quantum biology. The most recent articles reveal a strong focus on quantum algorithms for machine learning, quantum metrology, and the intersection of quantum mechanics with biological systems. His work on the HHL algorithm for solving linear systems has been particularly influential in quantum machine learning, though its practical advantages have been debated following Ewin Tang's classical algorithms. Lloyd has received numerous scientific honors: Lindbergh Fellow (1994) Finmeccanica Professorship (1996) Edgerton Prize (2001) Fellow of the American Physical Society (2007) Quantum Communication Award (2012) International Quantum Communication Award (2012) Throughout his career, Lloyd has mentored numerous students and researchers in quantum information science. He has secured significant research funding for his work in quantum computing and complex systems. His research has been supported by various foundations and government agencies interested in advancing quantum technologies. Lloyd has also been involved in interdisciplinary collaborations, particularly with biologists studying quantum effects in photosynthesis. Lloyd directs the Center for Extreme Quantum Information Theory (xQIT) at MIT, which brings together researchers from physics, computer science, and engineering to tackle fundamental challenges in quantum information processing. His lab has been at the forefront of developing theoretical frameworks for quantum computing and exploring practical implementations of quantum information protocols.

Jelani Nelsonمشاهده پروفایل

استاد

• Theoretical Computer Science
• Algorithms
• Data Streams
• +۸ مورد دیگر

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

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.

Imre Leaderمشاهده پروفایل

استاد

• Extremal Combinatorics
• Ramsey Theory
• Combinatorial Number Theory
• +۳ مورد دیگر

Professor Imre Leader is a distinguished mathematician at the University of Cambridge, where he serves as Professor of Pure Mathematics in the Department of Pure Mathematics and Mathematical Statistics (DPMMS), which is part of the Faculty of Mathematics. His office is located in room C2.02 at the DPMMS building. Professor Leader's research primarily focuses on Extremal Combinatorics and Ramsey Theory , two fundamental areas of discrete mathematics. His work explores deep connections between combinatorial structures, set theory, and algebraic properties. He has made significant contributions to understanding partition regularity, monochromatic structures, extremal set theory, and combinatorial geometry. His research often bridges the gap between pure combinatorics and applications in computer science and theoretical mathematics. Over his prolific career, Professor Leader has published numerous influential papers in top mathematical journals, collaborating with leading mathematicians worldwide. His work spans various aspects of combinatorics including hypergraph theory, geometric combinatorics, additive number theory, and combinatorial game theory. He has been particularly active in advancing our understanding of Ramsey-type phenomena in infinite structures and developing new techniques in extremal combinatorics. Research Group: Combinatorics Email: I.Leader@dpmms.cam.ac.uk Telephone: 01223 765902 Personal homepage: https://www.dpmms.cam.ac.uk/~ibl10

David Bindelمشاهده پروفایل

دانشیار

• Applied Numerical Linear Algebra
• Eigenvalue Problems
• Network Analysis
• +۵ مورد دیگر

David Bindel is an Associate Professor in the Department of Mathematics at Cornell University, affiliated with the College of Arts and Sciences, College of Engineering, and Cornell Ann S. Bowers College of Computing and Information Science. He earned his Ph.D. in Mathematics from the University of California, Berkeley in 2006. His research focuses on applied numerical linear algebra, eigenvalue problems, and their applications in plasma physics, network analysis, and nonlinear systems. He develops methods for analyzing complex systems, including magnetic confinement in stellarators, stability of MHD systems, and community detection in networks. His work bridges theoretical foundations with practical computational tools, such as formal verification of linear algebra algorithms and scalable Gaussian process models. Bindel’s research explores the interplay between structure and computation, leveraging eigenvalue analysis to address challenges in computer vision, opinion dynamics, and engineering design. He has contributed to advancements in numerical methods for large-scale systems, including iterative solvers, spectral approximation techniques, and stochastic optimization. His interdisciplinary approach spans applied mathematics, computer science, and physics, with applications in fusion energy, machine learning, and network science. Recent work highlights include high-order expansions for magnetic confinement, adaptive filtering for dynamical systems, and Bayesian optimization strategies. His publications emphasize rigorous analysis alongside computational scalability, addressing both theoretical and practical aspects of modern scientific computing. Despite no explicitly listed awards, his contributions reflect significant impact in his fields.

Illya V. Hicksمشاهده پروفایل

استاد

• Combinatorial Optimization
• Integer Programming
• Graph Theory
• +۵ مورد دیگر

Illya V. Hicks is a Professor in the Computational and Applied Mathematics Department at Rice University. He holds a PhD from Rice University (2000) and a BS from Texas State University (1995). His research focuses on combinatorial optimization, integer programming, graph theory, and matroid theory, with applications in social networks, cancer treatment, and network design. He has advised numerous doctoral, post-doctoral, and masters students. Education: PhD and MA in Computational and Applied Mathematics, Rice University, 2000 BS in Mathematics, Texas State University, 1995 Research Interests: Utilizing graph decomposition techniques to solve NP-complete problems, including branch decompositions and matroid circuit problems. Applications include sensor network design, healthcare logistics, and algorithmic graph theory. Awards: Recognized with the 2015 Presidential Mentoring Award (Rice University), 2010 Forum Moving Spirit Award (INFORMS), and the 2005 Optimization Prize for Young Researchers. Grants and Projects: Includes NSF-funded research on branch decomposition techniques, submodular optimization, and healthcare service distribution. Active in promoting minority participation in operations research through travel grants and mentoring initiatives. Labs/Teams: Engaged in collaborative research on graph algorithms, combinatorial optimization, and interdisciplinary applications in healthcare and engineering.

Ali Vakilianمشاهده پروفایل

عضو هیئت علمی

• Algorithmic Foundations of Machine Learning
• Data Science
• Streaming Algorithms
• +۱۸ مورد دیگر

Ali Vakilian is a Research Assistant Professor at the Toyota Technological Institute at Chicago (TTIC), with a strong academic background in theoretical computer science and algorithms. He will join the Department of Computer Science at Virginia Tech as an Assistant Professor in Fall 2025. His research bridges algorithmic theory and machine learning, focusing on scalable, fair, and efficient algorithms for massive data. Education: Ph.D. in EECS, Massachusetts Institute of Technology (MIT), advisors: Erik Demaine and Piotr Indyk M.S. in Computer Science, University of Illinois at Urbana-Champaign (UIUC), advisor: Chandra Chekuri B.S. in Computer Engineering, Sharif University of Technology Research Interests: Ali Vakilian's work centers on the algorithmic foundations of machine learning and data science. He develops streaming, sketching, and sublinear-time algorithms for massive datasets, and pioneers learning-augmented algorithms that use machine learning predictions to improve performance while maintaining worst-case guarantees. His research in trustworthy ML includes algorithmic fairness, fair clustering, and learning with strategic agents. He also contributes to combinatorial optimization and approximation algorithms for network design, set cover, and low-rank approximation. His recent publications (2023–2025) show a consistent focus on fair clustering (individual and group fairness), streaming graph algorithms , learning-augmented methods , and frequency estimation . These works appear in top venues such as NeurIPS, ICML, SODA, and ICALP, often with recognitions like oral or spotlight presentations. Scientific Awards: Outstanding Student Paper Highlight Award, AISTATS 2024 Notable-top-25% paper, ICLR 2023 Oral presentation, AISTATS 2024 Spotlight presentation, NeurIPS 2023 Advising and Grants: Ali Vakilian mentors several students and interns, including summer interns at TTIC and Fatima Fellows. His research is supported by the National Science Foundation (TRIPODS program), as noted in the press coverage of his work on LearnedSketch. He actively contributes to the academic community through advising, organizing workshops (e.g., Algorithms with Predictions, Learning-Augmented Algorithms), and serving on program committees (e.g., NeurIPS, ICML, AISTATS). Labs and Teams: He is affiliated with the theory and algorithms group at TTIC and collaborates with researchers at MIT, UIUC, and other institutions. His work on learning-augmented algorithms has led to influential workshops and collaborations with leading figures such as Piotr Indyk and Erik Demaine.

Daniel A. Spielmanمشاهده پروفایل

استاد

• Spectral Graph Theory
• Algebraic Graph Theory
• Laplacian Matrices
• +۷ مورد دیگر

Daniel A. Spielman is a Sterling Professor of Computer Science, Statistics & Data Science, and Mathematics at Yale University. He serves as the inaugural James A. Attwood Director of the Institute for Foundations of Data Science (FDS) and was previously co-Director of the Yale Institute for Network Science (YINS). He is also a member of TILOS, the NSF Institute for Learning-Enabled Optimization at Scale. His research interests span Spectral Graph Theory, Algebraic Graph Theory, Laplacian Matrices, Expander Graphs, and Random Walks on Graphs. Spielman has made fundamental contributions to understanding the mathematical foundations of data science, including work on smoothed analysis of algorithms, spectral sparsification, and solutions to the Kadison-Singer problem. Spielman's publications demonstrate a consistent focus on developing efficient algorithms with strong theoretical foundations. His work bridges pure mathematics, theoretical computer science, and practical applications in network analysis and machine learning. His research has evolved from foundational work on smoothed analysis to recent contributions in experimental design using discrepancy theory. His scientific honors include: Nevanlinna Prize for contributions to mathematical aspects of computer science Two Gödel Prizes (2008 and 2015) for outstanding papers in theoretical computer science MacArthur Fellowship ('Genius Grant') Simons Investigator award Membership in the National Academy of Sciences and American Academy of Arts and Sciences Spielman has advised numerous PhD students who have gone on to prominent positions in academia and industry. His teaching includes advanced courses in Spectral Graph Theory and Computation and Optimization. He has developed important software packages like Laplacians.jl for solving Laplacian linear equations and related problems.

Howard Elmanمشاهده پروفایل

استاد

• Scientific Computing
• Numerical Analysis
• Computational Fluid Dynamics
• +۶ مورد دیگر

Howard Elman is a Professor in the Department of Computer Science at the University of Maryland, with affiliations to the Institute for Advanced Computer Studies (UMIACS) and as an Affiliate Professor in the Department of Mathematics. His research spans numerical analysis, computational fluid dynamics, and uncertainty quantification, focusing on iterative solvers for partial differential equations. Education: PhD in Computer Science, Yale University (1982); BA in Mathematics, Columbia University (1975); Stuyvesant High School (1971) Elman's research integrates Scientific Computing with Numerical Linear Algebra , Computational Fluid Dynamics , and Uncertainty Quantification . His work addresses Stochastic Galerkin Methods , Reduced-Order Modeling , and Low-Rank Approximations for PDEs with random data. Recent publications emphasize Surrogate Models and Deep Learning in Bayesian inverse problems. His scientific awards include SIAM Fellowship (2009) and roles as Associate Editor for journals like Mathematics of Computation and SIAM Journal on Scientific Computing . He served as SIAM Editor-in-Chief (1998-2004) and Vice President for Publications. Contact: helman@umd.edu | Office: 4210 Iribe Center | Courses: AMSC/CMSC 460 Computational Methods

Yiping Luمشاهده پروفایل

استادیار

• Machine Learning
• Scientific Machine Learning (AI4Science)
• Numerical Algorithms
• +۷ مورد دیگر

Yiping Lu is an Assistant Professor in the Department of Industrial Engineering and Management Sciences at Northwestern University's McCormick School of Engineering. His research focuses on developing interdisciplinary approaches combining domain knowledge (differential equations, stochastic processes), machine learning, and experiments. Key interests include scientific machine learning (AI4Science), stochastic simulation, and robust machine learning. Education: Ph.D. in Applied and Computational Mathematics, Stanford University (2023) B.S. in Computational Mathematics, Peking University (2019) Research Highlights: Hybrid research integrating ML with scientific domains like PDEs and inverse problems Development of Physics-Informed Learning frameworks Contributions to deep learning theory (ResNets, neural collapse) Advances in kernel operator learning and adversarial robustness Awards: CPAL Rising Star Award (2024) University of Chicago Data Science Rising Star (2022) Stanford Interdisciplinary Graduate Fellowship (2021) Labs/Teams: SCALE Lab (Scientific Computation and Learning at Northwestern) Collaborations with NYU's Courant Institute and Stanford

Jonathan A. Kelnerمشاهده پروفایل

استاد

• Algorithms
• Spectral Graph Theory
• Combinatorial Optimization
• +۷ مورد دیگر

Jonathan A. Kelner is a Professor of Applied Mathematics in the Department of Mathematics at the Massachusetts Institute of Technology (MIT) and a member of the MIT Computer Science and Artificial Intelligence Laboratory (CSAIL). His research focuses on applying techniques from pure mathematics to solve fundamental problems in algorithms and complexity theory, with the goal of developing practical algorithms for real-world questions. Dr. Kelner received his undergraduate degree from Harvard University and his Ph.D. in Computer Science from MIT in 2006. Before joining the MIT faculty, he spent a year as a member of the Institute for Advanced Study. His educational background has provided a strong foundation for his interdisciplinary research spanning mathematics and computer science. His research interests include combinatorial optimization, mathematical programming, spectral graph theory, distributed computing, machine learning, computational geometry and topology, computational biology, signal processing, and random matrix theory. Kelner's work demonstrates how deep theoretical insights can lead to practical algorithmic improvements, particularly in graph algorithms and optimization problems. His approach often involves connecting seemingly disparate areas of mathematics to create novel algorithmic techniques. Analysis of his recent publications reveals a strong focus on spectral graph theory, optimization algorithms, and the Sum-of-Squares method. His work frequently addresses fundamental questions in theoretical computer science with practical implications for algorithm design. A notable trend in his research is the development of nearly-linear-time algorithms for various graph problems, which represents significant improvements over previous approaches. NSF CAREER Award Alfred P. Sloan Research Fellowship NEC Award for Research in Computers and Communication Sprowls Doctoral Dissertation Award Best Student Paper Award at STOC 2004 Best Paper Award at STOC 2011 Kokusai Denshin Denwa Junior Faculty Chair 2008 Harold E. Edgerton Faculty Achievement Award 2011 School of Science Award for Excellence in Undergraduate Education 2012 Professor Kelner has been actively involved in mentoring students and has received recognition for his teaching excellence, including the School of Science Award for Excellence in Undergraduate Education in 2012. His research has been supported by prestigious grants including the NSF CAREER Award. He has collaborated extensively with researchers across multiple institutions, often working with other leading figures in theoretical computer science to produce groundbreaking results in algorithm design. At MIT, Kelner is part of both the Mathematics Department and CSAIL, positioning him at the intersection of theoretical mathematics and practical computer science. This dual affiliation reflects the interdisciplinary nature of his work, which bridges pure mathematical theory with concrete algorithmic applications.