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

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

Zongyi Liمشاهده پروفایل

پژوهشگر ارشد

• Machine Learning
• Scientific Computing
• Partial Differential Equations
• +۵ مورد دیگر

Zongyi Li is a Research Fellow at Massachusetts Institute of Technology , hosted by Kaiming He. They are currently pursuing a Ph.D. in Computing and Mathematical Sciences at Caltech (2019-2025), mentored by Anima Anandkumar and Andrew Stuart. Ph.D. candidate: Computing and Mathematical Sciences, Caltech (2019-2025) B.Sc. in Computer Science and Mathematics with a Jazz minor from Washington University in St. Louis (2015-2019) They focus on Neural Operators for learning solution operators in Partial Differential Equations (PDEs) , particularly in fluid mechanics and earth science . Their work models physical simulations with chaotic behaviors and complex geometries, showing applications in weather forecasting , carbon storage , and aerodynamics simulation . Publications emphasize resolution-invariant models , chaotic systems , and zero-shot super-resolution capabilities. Their research combines Fourier analysis , graph networks , and physics-informed loss functions to achieve state-of-the-art performance in PDE solving with up to 1000x speedup over traditional solvers. Fellowships: Kortschak Scholarship PIMCO Fellowship Amazon AI4Science Fellowship Nvidia Fellowship MIT Novo Nordisk AI Fellowship Code & Open-Source: Co-developer of the NeuralOperator library Implementations for Fourier Neural Operators , Graph Neural Operators , and Tensorized Neural Operators Media Recognition: Quanta Magazine MIT Tech Review NVIDIA Features Towards Data Science

Amit Kumarمشاهده پروفایل

استاد

• Combinatorial Optimization
• Online Algorithms
• Clustering Algorithms
• +۵ مورد دیگر

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

Mohsen Ghaffariمشاهده پروفایل

دانشیار

• Theoretical Computer Science
• Distributed Algorithms
• Parallel Algorithms
• +۳ مورد دیگر

Mohsen Ghaffari is an Associate Professor at MIT's Department of Electrical Engineering and Computer Science (EECS), holding the Steven and Renee Finn Chair. His research focuses on theoretical computer science, particularly distributed and parallel algorithms, graph theory, and network optimization. Formerly, he was a tenured CS faculty member at ETH Zurich until 2022. PhD in Computer Science from MIT (2016) His research interests include distributed algorithms, parallel computing, graph decomposition, and network congestion management. His recent work addresses coreness decomposition, spanner construction, and Euclidean k-center optimization in massive parallel computation frameworks. Notable scientific awards include the ACM Doctoral Dissertation Award (Honorable Mention), ACM-EATCS Doctoral Dissertation Award, and multiple best paper awards at FOCS, PODC, and SODA. He has advised numerous PhD and Master's students, many of whom have transitioned to academic and industry roles. He has taught courses at MIT and ETH Zurich on distributed algorithms, advanced algorithms, and massively parallel computation. His professional activities include serving on program committees for SODA, FOCS, STOC, and organizing workshops like Highlights of Algorithms (HALG) and Workshop on Local Algorithms (WOLA).

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.

Sainyam Galhotraمشاهده پروفایل

استادیار

• Artificial Intelligence
• Causal Inference
• Database Systems
• +۴ مورد دیگر

Sainyam Galhotra is an Assistant Professor in the Department of Computer Science at Cornell University. His research focuses on developing data science tools for trustworthy analytics, integrating causal inference, data management, and machine learning to enhance robustness, explainability, and fairness in algorithmic systems. PhD: University of Massachusetts Amherst (2020), advised by Barna Saha B.Tech: Indian Institute of Technology Delhi (2014), advised by Amitabha Bagchi Postdoctoral Research: University of Chicago (Computing Innovation Fellow) His work spans artificial intelligence, causal inference, and responsible data science, emphasizing ethical algorithm design and reliable data integration. Recent publications highlight advancements in fair clustering, causal feature selection, and entity resolution frameworks. His research trends from 2023–2024 include contributions to spatio-temporal data correlation, community detection in geometric graphs, and distribution-aware dataset search. Key themes are fairness in machine learning, causal modeling, and scalable data management solutions. Computing Innovation Fellowship (2021) DAAD AInet Fellow (2021) ACM SIGMOD Entity Resolution Programming Contest Finalist (2021) Krithi Ramamritham Computer Science Scholarship (2019) BEST Paper Award in SIGSOFT FSE 2017 He actively seeks PhD or Master’s students interested in data science and trustworthy AI. Contact via email: sg@cs.cornell.edu .

• Data Visualization
• Human-Computer Interaction
• Big Data Analytics
• +۱۳ مورد دیگر

Huamin Qu is a Chair Professor in the Department of Computer Science and Engineering at the Hong Kong University of Science and Technology (HKUST). He serves as the Founding Dean of the Academy of Interdisciplinary Studies (AIS), Founding Head of the Division of Emerging Interdisciplinary Areas (EMIA), and was the Founding Acting Head of Computational Media and Arts (CMA) at HKUST(GZ). Qu directs the VisLab and coordinates the Human-Computer Interaction (HCI) group. He obtained his BS in Mathematics from Xi'an Jiaotong University and MS/PhD in Computer Science from Stony Brook University. Qu's research integrates Data Visualization , Human-Computer Interaction , and Human-Centered AI , with applications in urban informatics, social networks, and explainable AI. His work focuses on developing interactive systems for big data analytics, visual storytelling, and AI-driven decision support. Research extends to multimodal communication, fintech, and augmented reality applications. His publications emphasize visual analytics for complex datasets (mobility, social media, financial), interaction techniques for immersive environments, and AI-enhanced visualization tools. Recent works explore explainable AI interfaces and large-scale data communication frameworks. IEEE Visualization Academy (2020) IEEE VGTC Technical Achievement Award AI 2000 Most Influential Scholar (2019, 2023, 2024) 21 Best Paper/Honorable Mention awards IBM Faculty Award (2009) APICTA Merit Award (2015) Yelp Dataset Grand Prize (2018) Qu has advised 48 PhD graduates (21 now faculty at institutions like UC Davis, University of Minnesota, Texas A&M) and 30 MPhil students. He secured major grants including RGC theme-based projects (digital citizenship, air pollution), UGC AoE (slope safety), and China's 973 Program. As VisLab director, he leads 20+ researchers in visualization/HCI projects adopted by Microsoft, IBM, Huawei, and Tencent.

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

استاد

• Optimization Theory
• Control Theory
• Dynamical Systems
• +۷ مورد دیگر

Amir Ali Ahmadi is a Professor at Princeton University's Department of Operations Research and Financial Engineering (ORFE), with affiliations across multiple disciplines including PACM, Computer Science, Mechanical & Aerospace Engineering, Electrical Engineering, and the Center for Statistics and Machine Learning. He serves as Director of Princeton's Optimization and Quantitative Decision Science Certificate Program and has taken temporary roles at Citadel GQS (2021-2022) and Google Brain (2020-2021). His research bridges optimization theory , dynamical systems , and control theory , focusing on scalable algorithms for complex problems in robotics, autonomous systems, and machine learning. He has pioneered DSOS/SDSOS relaxations as alternatives to traditional sum-of-squares methods, enabling faster solutions through linear/second-order cone programming. Recent publications explore: Higher-order Newton methods for socially responsible investment Data-efficient learning of dynamical systems Computational complexity of local minima Robust-to-dynamics optimization frameworks Award highlights include: 2024 Egon Balas Prize in Optimization 2024 Princeton Engineering Council Teaching Award 2023 Distinguished Teaching Award (Princeton SEAS) 2019 NSF CAREER Award 2017 DARPA Young Faculty Award 2017 Sloan Fellowship in Computer Science He advises prominent researchers like Georgina Hall (Tucker Prize finalist) and Bachir El Khadir (Goldstine Fellow), and leads the Princeton Optimization Seminar and MURI project on Control-Oriented Learning on the Fly.

Heather Batteyمشاهده پروفایل

استاد

• Statistical Theory
• High-Dimensional Inference
• Sparsity in Statistics
• +۳ مورد دیگر

Heather Battey is a Professor in the Department of Mathematics at Imperial College London's Faculty of Natural Sciences. Her work bridges foundational statistical theory with practical scientific applications, focusing on parametrization effects, sparsity, and high-dimensional inference. Education PhD, University of Cambridge (2008-2011) Research Interests Battey's research examines how model structure and parametrization influence inferential procedures, particularly in high-dimensional settings. She investigates the equivalence between sparsity and reparametrization, and challenges traditional Fisherian statistical abstractions through modern practices. Her publications reveal a pattern of innovation in high-dimensional regression, covariance matrix analysis, and statistical methodology for complex data. Collaborations span disciplines including machine learning, economics, and biomedical research. Scientific Awards Fellow of the Institute of Mathematical Statistics (2023) EPSRC Early Career Research Fellowship (2020-2026) EPSRC Postdoctoral Research Fellowship (2017-2020) Advising and Grants Battey supervises PhD students Charlotte Edgar, Jakub Rybak, and Rebecca Lewis, with informal guidance to Henrique Hoeltgebaum. Over 15 pre-doctoral researchers have been mentored in topics ranging from support vector machines to spatial point processes. Current funding includes an EPSRC grant for theoretical foundations of inference with nuisance parameters and prior support for covariance matrix inference.

Brett Kolesnikمشاهده پروفایل

پژوهشگر ارشد

• Probability Theory
• Random Structures
• Bootstrap Percolation
• +۴ مورد دیگر

Brett Kolesnik is a Research Fellow in the Department of Statistics at the University of Warwick. His research focuses on probability theory, random structures, bootstrap percolation, and interactions with combinatorics. He has held postdoctoral fellowships at UC Berkeley, San Diego, and the University of Oxford, and was a Senior Demy at Magdalen College. His work includes organizing workshops on bootstrap percolation and collaborating with leading researchers in probability and combinatorics. Education: PhD in Mathematics from the University of British Columbia (advised by Omer Angel). Notable awards include the NSERC Postdoctoral Fellowship and the Florence Nightingale Bicentennial Fellowship in Statistics. Research interests span bootstrap percolation models, random graph dynamics, and stochastic processes. Recent work includes studies on Brownian map geometry, tournament score sequences, and Coxeter group structures. Selected articles explore topics such as critical beta-splitting processes, Catalan percolation, and random walks on algebraic structures. His publications appear in top journals like Electronic Journal of Probability and Annals of Applied Probability . Awards include the Florence Nightingale Fellowship and NSERC Postdoctoral Fellowship. Professional involvement includes organizing the 2024 BIRS workshop on Bootstrap Percolation and contributing to interdisciplinary collaborations in probability and combinatorics.

Daniel M. Kaneمشاهده پروفایل

استاد

• Number Theory
• Combinatorics
• Complexity Theory
• +۳ مورد دیگر

Daniel M. Kane is a Professor at the University of California, San Diego (UCSD), holding a joint appointment in the Department of Mathematics and the Department of Computer Science and Engineering (CSE). His research spans mathematics and theoretical computer science, with a focus on number theory, combinatorics, complexity theory, and computational statistics. He earned a Ph.D. in Mathematics from Harvard University (2011) and dual BS degrees in Mathematics with Computer Science and Physics from MIT (2007). Prior to UCSD, he was a postdoctoral researcher at Stanford University (2011–2014) on an NSF fellowship. His research interests include robust statistics, machine learning, polynomial threshold functions, and algorithmic methods for high-dimensional data. Notable achievements include co-authoring the book Algorithmic High-Dimensional Robust Statistics (Cambridge University Press, 2023) and receiving the Best Paper Award at the Conference on Computational Complexity (2013), as well as gold medals at the International Mathematical Olympiad (2002 and 2003). Current teaching includes courses such as Math 96 (Putnam Seminar), Math 154 (Graph Theory), CSE 101 (Algorithms), and CSE 203A (Randomized Algorithms). He has consulted for companies like CASPER Labs and AIble, and his work extends to cryptographic protocols, including quantum money schemes based on quaternion algebras. Key contributions include breakthroughs in robust mean estimation, list-decodable learning, and the development of efficient algorithms for statistical problems. His research often bridges foundational theory with practical applications in machine learning and data analysis.

Primoz Skrabaمشاهده پروفایل

استاد

• Applied Topology
• Geometry
• Algebra
• +۵ مورد دیگر

Dr. Primoz Skraba is a Professor in Applied and Computational Topology at the School of Mathematical Sciences, Queen Mary University of London. As Deputy Head of the Centre for Probability, Statistics and Data Science, he bridges theoretical topology with practical applications in data analysis, machine learning, and optimization. Education : PhD in Electrical Engineering from Stanford University (2009) Prior Roles : Positions at INRIA, France; Jozef Stefan Institute, Slovenia; University of Primorska; University of Nova Gorica His research focuses on applying topological methods to analyze complex data. Key areas include: Stability of persistence diagrams for quantitative control in finite sampling Variants of persistence (zig-zag, robustness, multiparameter) Algorithmic Complexity in computational topology Stochastic Topology for random geometric models (Poisson, Boolean) Recent publications emphasize persistent homology in random geometric complexes, universality theorems, and integrating topological methods into machine learning. He received grants from the Leverhulme Trust, EPSRC, and Alan Turing Institute for projects on topological universality and AI foundations. His advisee Gabryel Mason-Williams explores wireless sensor network applications of homology.

Shirshendu Gangulyمشاهده پروفایل

دانشیار

• Probability Theory
• Statistical Mechanics
• Markov Chains
• +۳ مورد دیگر

Shirshendu Ganguly is an Associate Professor in the Department of Statistics at the University of California, Berkeley. His research focuses on probability theory, statistical physics, and their applications, including percolation models, phase transitions, Markov chains, and random graphs. He holds a PhD in Mathematics from the University of Washington and has held postdoctoral positions at UC Berkeley. Ganguly has been recognized with the 2019 Sloan Research Fellowship. Education: PhD in Mathematics, University of Washington, 2011–2016 Miller Postdoctoral Fellow, UC Berkeley, 2016–2018 Research Interests: Probability Theory, Statistical Mechanics, Markov Chains, Random Graphs, Percolation Theory, Sparse Combinatorial Structures His work explores geometric and probabilistic phenomena in disordered systems, including polymer models, self-organized criticality, and random matrix theory. He has advised multiple PhD students and contributes to teaching advanced probability courses at Berkeley. Awards: 2019 Sloan Research Fellowship

Brandon Sewardمشاهده پروفایل

دانشیار

• Ergodic theory
• Topological dynamics
• Descriptive set theory
• +۱ مورد دیگر

Brandon Seward is an Associate Professor of Mathematics at the University of California San Diego (UC San Diego), where they conduct research and teach in the Department of Mathematics. They use the pronouns they/them or he/him . Education Ph.D. in Mathematics, University of Michigan , 2015 Research Interests Their work lies at the intersection of ergodic theory, topological dynamics, descriptive set theory, and group theory . They investigate geometric, combinatorial, and entropic properties of actions of countable groups, with special emphasis on the divide between amenable and non-amenable groups. Publications & Research Impact Across 27 refereed papers (2014-2024), Seward has advanced entropy theory for non-amenable groups, Borel combinatorics of group actions, and structure theorems for measure-preserving actions. Their work has appeared in top journals such as Inventiones Mathematicae , Journal of the American Mathematical Society , and Duke Mathematical Journal . Scientific Awards Michael Brin Dynamical Systems Prize for Young Mathematicians (2018) – awarded for outstanding contributions to dynamical systems. Teaching & Mentorship Seward regularly teaches core undergraduate courses (e.g., Math 142A Introduction to Analysis) and organizes the UC San Diego Group Actions Seminar , a weekly research forum featuring international speakers. They serve as a faculty mentor and are actively involved in graduate student supervision and seminar coordination. Contact & Office Email: bseward@ucsd.edu Office: AP&M 5739, 9500 Gilman Drive, La Jolla, CA 92093-0112