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
Jan von Delft is a Professor (chair) at Ludwig-Maximilians-University (LMU) Munich, working in the Faculty of Physics within the Chair of Theoretical Solid State Physics. His research group consists of postdocs, PhD students, and master's students working on various aspects of strongly correlated electron systems, with physical space located at Theresienstr. 37 (Room A420) in Munich. von Delft's research focuses on correlated electron and spin systems, with particular interest in dynamical and transport properties, quantum impurity models, Hund metals, unconventional superconductors, quantum magnets, and quantum criticality. His methodological expertise includes many-body field theory, parquet formalism (FRG), DMFT, and tensor networks (NRG, DMRG, PEPS, XTRG, etc.). His work bridges theoretical concepts with computational approaches to understand complex quantum phenomena in condensed matter systems. He has developed a distinctive emphasis on real-frequency calculations and numerical methods for studying quantum critical phenomena. Analysis of von Delft's recent publications reveals a strong focus on developing and applying advanced computational methods to study strongly correlated electron systems. His group has made significant contributions to numerical renormalization group techniques, tensor network methods, and the parquet formalism for calculating real-frequency correlation functions. His research shows increasing sophistication in handling quantum criticality, particularly in heavy-fermion systems, and exploring unconventional superconductivity mechanisms. Notably, his group has developed specialized computational libraries like KeldyshQFT to make these advanced methods more accessible to the broader physics community. von Delft actively mentors a substantial research group consisting of one postdoc (Markus Scheb), eleven PhD students (Anxiang Ge, Sasha Kovalska, Mathias Pelz, Marc Ritter, Nepomuk Ritz, Changkai Zhang, Markus Frankenbacher, Felipe Picoli, Simone Fodera, Ming Huang), and two master's students (Ester Pages, Gianluca Grosso). His detailed Style Guide for scientific communication demonstrates his commitment to high-quality research presentation. The group appears well-funded with ongoing research activities spanning theoretical development, computational implementation, and physical interpretation of complex quantum phenomena.
Dr Henry Moss is a Researcher at the Department of Applied Mathematics and Theoretical Physics within the School of Physical Sciences at the University of Cambridge. His work focuses on machine learning applications in climate modeling, Bayesian optimization, and Gaussian processes, bridging computational mathematics with environmental science and chemistry. His research interests include: Bayesian optimization for environmental and chemical systems Reinforcement learning in climate modeling Gaussian processes for molecular property prediction High-throughput machine learning in scientific domains Interpretable AI for coastal flooding prediction Hybrid ML-physics modeling Dr Moss's publications highlight his contributions to federated learning for climate models, sparse Gaussian process techniques, and multi-objective optimization frameworks. These works span applications in weather prediction, chemical engineering, and oceanography. Email: hwm26@cam.ac.uk
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.
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.
Murat Erdogdu is an Assistant Professor at the University of Toronto, jointly appointed in the Department of Computer Science and Department of Statistical Sciences . He is also a faculty member at the Vector Institute and holds the CIFAR Chair in Artificial Intelligence . PhD in Statistics, Stanford University (advised by Mohsen Bayati and Andrea Montanari) MSc in Computer Science, Stanford University BSc in Electrical Engineering and Mathematics, Bogazici University His research focuses on machine learning theory , high-dimensional statistics , and optimization . He has contributed to understanding gradient-based algorithms, sampling methods, and feature learning in structured data. Recent publications address problems in: Heavy-tailed sampling Mean-field Langevin dynamics Robust feature learning Minimax regression Stochastic optimization under infinite noise Scientific Awards: CIFAR Chair in Artificial Intelligence ICLR 2023 Spotlight NeurIPS 2019 & 2021 Spotlights He teaches graduate courses like STA 414/2104 (Statistical Methods for Machine Learning II) and STA 4273 (Modern Learning Theory) , emphasizing probabilistic modeling and theoretical analysis.
Professor Scott Sisson is Director of the UNSW Data Science Hub (uDASH) and Professor of Statistics and Data Science at the University of New South Wales, School of Mathematics and Statistics. His research focuses on computational statistics, particularly solving 'intractable' statistical problems through Bayesian methods, big data techniques, simulation algorithms, and extreme value theory with environmental applications. Education includes a PhD in Statistics from Bristol University (2002), MSc in Environmental Statistics from Lancaster University (1997), and BSc in Mathematics and Statistics from Lancaster University (1996). Research interests span: Bayesian statistics and uncertainty quantification Big data analytics and scalable algorithms Machine learning integration with statistical methods Extreme value modeling for climate/environment Computational techniques for intractable problems Recent publications (2022-2025) demonstrate strong emphasis on Bayesian computation, spatiotemporal modeling, and interdisciplinary applications in materials science, oncology, quantum computing, transportation policy, and ecology. Methodological innovations include likelihood-free inference, modular Bayesian analyses, and symbolic data modeling. Awards and honors: 2020 Service Award (Statistical Society of Australia) 2017 ARC Future Fellowship 2015 G. N. Alexander Medal (Engineers Australia) 2011 Moran Medal (Australian Academy of Science) 2010 J.G. Russell Award (Australian Academy of Science) 2010 Queen Elizabeth II Research Fellowship As Director of uDASH, he leads data science initiatives across UNSW. He maintains sustained ARC funding and supervises students in computational statistics, Bayesian methods, extreme value theory, and machine learning. Professional service includes editorial roles for Statistics and Computing and past presidency of Statistical Society of Australia.
Siva Balakrishnan is an Associate Professor at Carnegie Mellon University with a joint appointment in the Department of Statistics and Data Science and the Machine Learning Department . He holds an affiliation with the Dietrich College of Humanities and Social Sciences. Previously, he was a postdoctoral researcher at UC Berkeley's Department of Statistics, advised by Martin Wainwright and Bin Yu, and earned his Ph.D. in Computer Science from CMU's Language Technologies Institute under Jaime Carbonell. His research focuses on statistical machine learning, causal inference, and high-dimensional statistics, with notable contributions to domain adaptation, optimal transport, and robust statistics. Education: Ph.D. in Computer Science, Carnegie Mellon University (Language Technologies Institute) Postdoctoral Researcher, University of California, Berkeley (Department of Statistics) Research Interests: His work bridges theoretical foundations and algorithmic development, emphasizing robust statistical methods and their applications in causal inference, public policy, and machine learning. Key areas include nonparametric methods, optimization, and high-dimensional data analysis. He has pioneered techniques in domain adaptation, such as the RLSbench framework for relaxed label shift scenarios. Awards & Grants: Amazon Research Award (2021) Google Research Scholar Award (2021) NVIDIA Pioneer Award (2018) IMS Lawrence D. Brown Student Award (2020, 2022) National Science Foundation Grants (CCF-1763734, DMS-1713003, etc.) Professional Activities: He serves as an Associate Editor for JASA and on the editorial boards of Foundations and Trends in Statistics . His work has been featured in top venues like NeurIPS, ICML, and the Annals of Statistics. He currently holds a sabbatical at UC Berkeley's Department of Statistics (Spring 2025). Labs & Collaborations: He actively participates in the Statistics and Machine Learning Reading Group and the Causal Inference Working Group , fostering interdisciplinary research in CMU's vibrant academic community.
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.
Anna Gottard is an Associate Professor of Statistics at the University of Florence, where she leads the Department of Statistics, Computer Science, and Applications. She directs the Florence Center for Data Science (FDS) and participates in the Technical Scientific Committee of the Tuscan Center for Big Data, Data Science, and AI (CBDAI). Her research focuses on multivariate statistical models, particularly graphical models, and extends to statistical machine learning, fair models, and directional data analysis. She is an Associate Editor for the Journal of the Royal Statistical Society Series A (JRSSA) and Statistical Methods & Applications (SMA). Her recent work includes Bayesian approaches for mixed graphical models, uncertainty-aware classification trees, and methodological advancements in latent uncertainty models. Her contributions span theoretical developments and applied research in interdisciplinary areas like biostatistics and sustainability. Her research interests emphasize bridging statistical theory with practical applications, including fairness in machine learning, interpretable models, and tree-based methodologies. She has actively contributed to open-source software, notably the Mix3Trees R package for mixed-effect tree models. Her work addresses challenges in variable selection, graphical model inference, and ethical AI practices. Current projects explore Bayesian frameworks for complex data structures and methodological improvements in graphical model interpretability. Anna has advised on interdisciplinary collaborations, such as studies on GDPR compliance in biobanking and epidemiological modeling of the SARS-CoV-2 pandemic in Tuscany. She collaborates with institutions like the CBDAI to advance data science applications in regional policy and healthcare. Her research trajectory reflects a commitment to both foundational statistical theory and real-world problem-solving across diverse domains.
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).
Peng Zhao is a tenure-track Assistant Professor in the Department of Applied Economics & Statistics at the University of Delaware, with affiliations to UD's Data Science Institute. His academic career includes a postdoctoral research position at Texas A&M University's Department of Statistics (August 2020–June 2023), following his Ph.D. training at Florida State University. Education Ph.D. in Statistics, Florida State University, 2020 B.S. in Statistics, Beijing Institute of Technology, 2015 Dr. Zhao's research focuses on cutting-edge statistical methodologies, including: High-dimensional statistical modeling and inference Network-based statistical analysis Multivariate data processing techniques Scalable Bayesian computational methods Nonparametric Bayesian approaches Dependency-aware statistical learning frameworks Optimization algorithms for complex models Regularization mechanisms in statistical learning He teaches graduate-level courses in regression analysis (STAT611) and mathematical statistics (STAT602) at the University of Delaware. Office location: Room 214, Townsend Hall, 531 S. College Avenue, Newark, DE 19716.
Hyunghoon Cho is an Assistant Professor at Yale School of Medicine in the Department of Biomedical Informatics & Data Science, with a secondary appointment in the Department of Computer Science. He received his PhD in Electrical Engineering and Computer Science from MIT (2019) and MS/BS in Computer Science from Stanford University (2013). His research focuses on computational challenges in biomedical data privacy, single-cell genomics, and network biology. Assistant Professor (Primary): Biomedical Informatics & Data Science Assistant Professor (Secondary): Computer Science Appointments: Yale School of Medicine | Broad Institute (Schmidt Fellow) Research Themes: Privacy-Enhancing Technologies for genomic and health data Scalable AI/ML tools for omics data analysis Structured biological modeling for system-level discovery His work includes secure GWAS, transcriptomic privacy assessment, and sfkit - a federated genomic analysis toolkit. He received the NIH Director's Early Independence Award and leads NSF-funded projects on confidential genome analytics. Awards: NIH Director's Early Independence Award Lab Members: Haris Smajlović (Postdoc), Vincent Angelo (CBB MS), Denis Loginov (Senior Software Engineer), Lucy Zheng (CBB PhD)
John Duchi is an Associate Professor at Stanford University, holding positions in the Department of Statistics and the Department of Electrical Engineering (with a courtesy appointment in Computer Science). He is affiliated with the School of Engineering. His research focuses on statistical learning, optimization, information theory, and computation, with an emphasis on balancing computational efficiency, privacy, and robustness. Key interests include developing algorithms for large-scale optimization, privacy-preserving techniques, and tools for evaluating machine learning systems' validity. Education: BS and MS in Computer Science (Stanford University, 2007–2008), MA in Statistics (UC Berkeley, 2012), and PhD in EECS (UC Berkeley, 2014). Research Interests: His work addresses three core areas: (1) optimizing trade-offs between computational resources and statistical performance, (2) creating scalable optimization methods, and (3) quantifying confidence in machine learning systems. Recent publications highlight contributions to privacy in federated learning, robust statistical validation, and uncertainty quantification. Articles: His recent work explores topics like distribution-free M-estimation, private federated learning, and instance-optimal mechanisms for statistical estimation. These studies emphasize privacy, robustness, and scalable solutions for modern data challenges. Advising & Grants: While no advisees are listed, his research has been supported by grants focused on optimization, privacy, and statistical theory.
