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
Fatma Kılınç-Karzan is an Associate Professor of Operations Research at Carnegie Mellon University's Tepper School of Business, with a courtesy appointment as Associate Professor of Computer Science. She is also affiliated with the Algorithms Combinatorics and Optimization (ACO) PhD Program and was a Visiting Scientist at Berkeley's Simons Institute for the Theory of Computing during Fall 2017. Her educational background includes a PhD from Georgia Institute of Technology's H. Milton Stewart School of Industrial & Systems Engineering with a minor in Mathematics, supervised by Prof. Arkadi Nemirovski. She earned her B.S. and M.S. degrees from the Industrial Engineering Department of Middle East Technical University with a minor in Information Systems. Dr. Kılınç-Karzan's research spans mathematical optimization with emphasis on convex and non-convex optimization theory, algorithms, and applications. Her work bridges theoretical foundations with practical implementations in optimization under uncertainty (robust optimization, chance constraints, distributionally robust optimization), machine learning (preference learning from limited data), and business analytics. She develops foundational theory for large-scale optimization problems with applications in decision making under uncertainty and high-dimensional statistical inference. Analysis of her recent publications reveals a strong focus on convex hull characterizations, semidefinite programming relaxations, distributionally robust optimization, and online convex optimization frameworks. Her work demonstrates increasing integration of optimization theory with machine learning applications, particularly in developing data-driven approaches for decision making under uncertainty. NSF CAREER Award (2015) INFORMS Optimization Society Young Researcher Prize (2015) INFORMS Junior Faculty Interest Group (JFIG) Best Paper Award (2014) BP Junior Faculty Chair (2014-2015) Faculty Giving Chair (2012-2013) Wimmer Fellowship (2012-2013) Dr. Kılınç-Karzan has successfully mentored numerous PhD students who have received prestigious awards, including the 2021 INFORMS Optimization Society Best Student Paper (1st prize) and multiple honorable mentions. Her research has been supported by significant grants including an NSF CAREER Award, an ONR grant (with S. Küçükyavuz), and an AFOSR grant. She serves on editorial boards for Mathematical Programming, Operations Research, Mathematics of Operations Research, and other leading journals, and has held leadership positions in professional societies including the Mathematical Optimization Society and INFORMS Computing Society. Through her affiliations with CMU's Tepper School, Computer Science Department, and ACO Program, she collaborates across disciplines to advance optimization theory and its applications. Her professional service includes committee chair roles for major INFORMS competitions and program committee leadership for international optimization conferences.
Joan Bruna is a Full Professor of Computer Science, Data Science, and affiliated Mathematics at New York University's Courant Institute and Center for Data Science. He leads the CILVR group and co-founded the MaD group. His research focuses on mathematical foundations of machine learning, deep learning, signal processing, and their applications in computational science, climate modeling, and geophysics. He holds a Ph.D. in Applied Mathematics from École Polytechnique and has held roles at UC Berkeley, the Institute for Advanced Study, and the Flatiron Institute. Education: Ph.D. (2013) and M.Sc. (2005) in Applied Mathematics, École Polytechnique and ENS Cachan; dual B.Sc./M.Sc. in Telecommunications and Mathematics from UPC Barcelona (2002–2004). Awards include the NSF CAREER Award (2019) and Alfred P. Sloan Fellowship (2018). Research interests span theoretical aspects of deep learning, optimization, and statistical methods, with applications to climate science and inverse problems. He has advised numerous PhD students and postdocs, contributing to seminal work on scattering networks, geometric deep learning, and neural ODEs. Professional service includes editorial roles at TMLR, JMLR, and TPAMI, plus program chairs for major conferences. His work bridges mathematics and machine learning, emphasizing rigorous analysis and real-world impact.
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).
Andrew M. Stuart is a Professor at the California Institute of Technology's Division of Engineering and Applied Science. His research bridges computational mathematics, machine learning, and physical modeling, focusing on inverse problems, partial differential equations, and multiscale systems. He has pioneered methodologies integrating Gaussian processes, Kalman inversion, and neural operators for scientific computing. His recent publications highlight innovations in competitive protein dimerization networks, nonlinear Bayesian inference, and operator learning. Articles span applications in materials science, geophysics, and biochemical signal processing, emphasizing data-driven discovery of differential equations and scalable algorithms for high-dimensional problems. Stuart's work addresses challenges in structural error modeling, uncertainty quantification, and graph-based learning, with implications for climate modeling and dynamical systems. Despite extensive contributions, the scraped data does not specify students, awards, or contact details.
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.
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.
Dr. Jean-Christophe Nave is an Associate Professor in the Department of Mathematics and Statistics at McGill University, specializing in applied mathematics, numerical analysis, and computational methods. His research focuses on numerical methods for partial differential equations, fluid mechanics, interface problems, and computer graphics. He holds a PhD from UCSB (2004) and has held academic positions at MIT and McGill since 2005. Currently, he serves on committees such as the Steering Committee of the Institut des Sciences Mathematiques and the CRM Applied Mathematics Lab. His educational background includes a PhD under Professors Xu-Dong Liu and Sanjoy Banerjee. Key research areas include level set methods, fluid-structure interaction, and invariant numerical methods. Notable works include the Correction Function Method for interface problems and the Characteristic Mapping Method for advection problems. Nave’s publications span topics like Poisson equations with discontinuous coefficients, fluid dynamics simulations, and high-order numerical schemes. He has advised numerous graduate and undergraduate students, contributing to their research in applied mathematics and computational science. His work bridges theoretical rigor and practical applications in engineering and physics. He teaches advanced courses such as Numerical Analysis I/II and Computational Methods in Applied Mathematics. His research group collaborates on projects involving fluid dynamics, elasticity, and geometric algorithms, with a focus on developing robust numerical tools for complex systems.
William Yang Wang serves as the Mellichamp Professor of Artificial Intelligence at the University of California, Santa Barbara (2019-present). He directs the UCSB Center for Responsible Machine Learning, the Mind and Machine Intelligence Initiative, and the UCSB NLP Group. His research focuses on theoretical foundations and practical algorithms for AI, particularly in NLP, LLMs, and neuro-symbolic reasoning. PhD in Computer Science from Carnegie Mellon University Active in AI theory and applications (2016-present) Research interests span multiple AI domains, with special emphasis on NLP and responsible machine learning. He has pioneered datasets like HybridQA, TabFact, and VaTeX, enabling advancements in multi-hop QA, fact verification, and video-language tasks. His work combines statistical relational learning with modern deep learning paradigms. Recent publications center around multimodal reasoning, knowledge graph integration, and responsible AI development. He has received numerous accolades including the IEEE SPS Pierre-Simon Laplace Award (2024) and NSF CAREER Award (2021). Karen Sparck Jones Award (2022) DARPA Young Faculty Award (2018) IBM Faculty Award Mentoring 15+ PhD and postdoc researchers who now hold positions at Microsoft Research, Amazon, Meta GenAI, and academic institutions like Arizona and Rutgers. His lab maintains active collaborations with industry partners through initiatives like ChipAgents.ai, which he founded as CEO.
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
Manuel Del Pino is Professor at the University of Bath's Department of Mathematical Sciences and Royal Society Professor specializing in nonlinear partial differential equations. His research focuses on singularity formation, geometric evolution equations, and asymptotic analysis in fluid dynamics and mathematical physics. His investigations encompass blow-up phenomena in heat equations, vortex dynamics in Euler flows, and minimal surface theory. Current projects examine infinite-time singularity formation in parabolic equations and asymptotic properties of vortex configurations. Del Pino has received the Royal Society Professorship and leads multiple grants including 'Asymptotic patterns in nonlinear evolution problems' (EPSRC). He maintains collaborations with researchers globally through projects on singularity formation in PDEs.
Raphael Hauser is an Associate Professor in Numerical Mathematics at the University of Oxford's Mathematical Institute, Director of Graduate Studies - Teaching, and Tanaka Fellow in Applied Mathematics at Pembroke College. His affiliations include membership in the Data Science, Numerical Analysis, and Mathematical and Computational Finance research groups, as well as a fellowship at the Alan Turing Institute. Education: PhD in Operations Research, Cornell University, Ithaca, USA Dipl. Math. ETH, Swiss Federal Institute of Technology (ETH Zurich), Switzerland Research interests span data science, numerical optimisation, medical imaging, distributed computing, and applied probability/statistics. His work integrates mathematical rigor with practical applications, particularly in optimization algorithms, machine learning theory, and medical imaging technology. Publications focus on optimization theory, stochastic processes, medical imaging systems, and computational finance, with recurring themes in non-convex optimization guarantees, PCA variants, and X-ray tomography innovations. Awards: Oxford University Teaching Award (2007) SIAM Optimization Prize (2005) SIAM Student Paper Prize (2000) Advising includes 15+ DPhil students and 40+ MSc students, with projects in optimization, finance, imaging, and machine learning. Current postdocs and students are affiliated with the Alan Turing Institute and industrial partners like Siemens and Macquarie Group. He leads teams in the Mathematical Institute's research groups and collaborates with the Alan Turing Institute on large-scale data science initiatives.
Eamonn Keogh is a Professor in the Computer Science and Engineering Department at the University of California, Riverside. His pioneering work centers on the Matrix Profile, a transformative approach to time series data mining enabling efficient solutions for motif discovery, anomaly detection, and similarity search. His algorithms (STAMP, STOMP, SCRIMP, DAMP, SCAMP) offer exact, parameter-free, and scalable solutions across domains like seismology, bioinformatics, and industrial IoT. Research areas include: Development of ultra-fast algorithms for time series joins and motif discovery at unprecedented scales (breaking the 100 million barrier) GPU acceleration for time series mining Domain-agnostic methods for semantic segmentation and anomaly detection Novel primitives like Time Series Chains, Snippets, and Consensus Motifs His work is highly cited and recognized by industry and academia, with applications ranging from NASA's Cassini mission to detecting BGP anomalies in computer networks.
Asaf Ferber is Associate Professor in Mathematics at University of California, Irvine, School of Physical Sciences. His research spans discrete mathematics including combinatorial games, random graphs, extremal hypergraph theory, and quantum computation. Research explores Hamiltonian cycles in random graphs, structural properties of pseudorandom graphs, and quantum algorithms for combinatorial problems. Recent work develops quantum approaches to graph learning and sparse recovery in random matrices. Awards: NSF CAREER Award Sloan Fellowship Distinguished Early Career Faculty Award for Research Air Force Research Grant NSF-BSF Grant Organizes conferences including SoCalDM Symposium and Desert Discrete Math Workshop, mentoring graduate students through UCI's Probability and Combinatorics Seminar.
Meng Cheng is an Assistant Professor of Physics at Yale University, specializing in condensed matter theory. He holds a B.S. from Nanjing University (2008) and a Ph.D. in Condensed Matter Theory from the University of Maryland (2013). After a postdoctoral position at Microsoft Research Station Q (2013–2016), he joined Yale in 2017. His research focuses on quantum criticality, fractonic phases, and symmetric topological phases, with a particular emphasis on classification and characterization of exotic quantum matter. He has received prestigious awards including the NSF CAREER Award (2019) and the Alfred P. Sloan Fellowship (2019). Key research interests include topological superconductivity, global symmetry interactions, and applications in quantum information. His work bridges theoretical frameworks with experimental implications, exploring topics like Wilson loop operators, disorder operators, and entanglement entropy in gapless systems. He has contributed to advancements in understanding symmetry-enriched topological phases and their surface topological order. Publications span high-impact journals and cover topics such as fractionalization in electronic insulators, quantum Hall effects, and topological stabilizer models. His talks highlight interdisciplinary approaches, including seminars at the Perimeter Institute and Université de Montréal on fractonic topological phases and infinite-component Chern-Simons theories. Awards and grants underscore his contributions to advancing theoretical physics, with a focus on fostering innovation in quantum materials and computational methods. Teaching and mentorship activities further his commitment to education within the Yale Physics Department.
