Tamara Broderick is an Associate Professor in the Department of Electrical Engineering and Computer Science at MIT, specializing in machine learning and statistics. Her research focuses on developing methods for uncertainty quantification in data analysis, Bayesian nonparametrics, and scalable inference algorithms. She leads a research group advising PhD students and postdocs in statistical machine learning. Her work spans Bayesian modeling, variational inference, spatial statistics, and applications in epidemiology and environmental science. Recent projects involve uncertainty-aware forecasting, robustness analysis of statistical methods, and efficient algorithms for high-dimensional inference. Broderick teaches Bayesian Modeling and Inference and contributes to MIT's statistics and data science initiatives.
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.
François-Xavier Briol is an Associate Professor in the Department of Statistical Science at University College London (UCL). He co-leads the Fundamentals of Statistical Machine Learning research group and holds roles including theme lead for Computational Statistics and Machine Learning (CSML), co-director of the UCL CDT in Data-Intensive Science, and ELLIS scholar. His research focuses on merging scientific models with data through robust statistical and machine learning methods, emphasizing computational efficiency and model misspecification robustness. Education: BSc/MMORSE from the University of Warwick, PhD from the joint Warwick-Oxford CDT in Statistics. Postdoctoral roles at Imperial College London (Mathematics) and University of Cambridge (Engineering), followed by a Group Leader position at The Alan Turing Institute (2020–2023). Research interests include probabilistic numerical methods, Bayesian inference for intractable models, Stein’s method, and kernel-based approaches. His work has been recognized via awards like the AISTATS Best Paper Award and Blackwell-Rosenbluth Award, with funding from EPSRC and Amazon. Advising: Supervised PhD students in areas like Bayesian quadrature, robust inference, and Gaussian processes. Current students focus on topics such as Bayesian filtering and sensitivity analysis. Grants include EPSRC funding and an Amazon Research Award. Labs/Teams: Active in UCL’s ELLIS unit, CSML, and Turing Institute collaborations. Editorships include SIAM/ASA Journal on Uncertainty Quantification and Bayesian Analysis.
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
Professor Ben Goldys is a distinguished academic at The University of Sydney's School of Mathematics and Statistics, where he conducts research at the intersection of pure mathematics and applied sciences. His work spans multiple disciplines including stochastic analysis, partial differential equations, and financial mathematics, with significant contributions to both theoretical frameworks and practical applications in science and finance. Goldys' research interests center on stochastic (ordinary and partial) differential equations and their applications. His specific focus areas include stochastic partial differential equations, stochastic geometric PDEs, stochastic boundary value problems, stochastic fluid dynamics, ergodic theory of infinite-dimensional diffusions, and applications in financial mathematics such as interest rate derivatives, credit risk, and stochastic volatility. His work bridges pure mathematical theory (Functional Analysis, PDEs, Ergodic Theory) with complex real-world problems across multiple domains. His research aligns with the University of Sydney Faculty of Science Research Strengths including Understanding the Universe, Fundamental Laws of Nature, Complex Systems, and Next Generation Materials. Professor Goldys has secured multiple significant research grants from the Australian Research Council, including recent projects such as 'Mathematics for future magnetic devices' (2024), 'Mathematics for breaking limits of speed and density in magnetic memories' (2019), and 'Novel Approaches for Problems with Uncertainties' (2015). His current research projects focus on geometric stochastic partial differential equations and applications in micromagnetism, mean field games in finance, stochastic boundary value problems, and stochastic Navier-Stokes equations on the rotating sphere. He maintains extensive international collaborations with institutions in Germany (University of Tuebingen), Italy (LUISS University), Poland (Institute of Mathematics Polish Academy of Sciences), and the United Kingdom (University of York), working on projects involving optimal control, stochastic systems with memory, and geometric stochastic PDEs. Goldys is an active member of the Applied Mathematics Research Group and The University of Sydney Nano Institute, contributing to interdisciplinary research initiatives that connect mathematical theory with cutting-edge technological applications.
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.
Gil Kalai is a Professor of Mathematics at the Hebrew University of Jerusalem since 1992, where he holds the Henry and Manya Noskwith Chair. He also serves as an Adjunct Professor of Mathematics and Computer Science at Yale University since 2004 in a long-term part-time visiting position. His academic career includes visiting positions at prestigious institutions including MIT, Cornell, IAS Princeton, Berkeley, Bell-labs, IBM, and Microsoft. Professor Kalai's research spans multiple areas within mathematics and theoretical computer science. His work in combinatorics encompasses geometric, probabilistic, and topological approaches. He has made significant contributions to the study of convex sets and polytopes, linear programming, and theoretical computer science. His influential 1988 paper with Kahn and Linial on Boolean functions pioneered applications of Fourier analysis in theoretical computer science. Kalai's research has evolved to include the application of Fourier analysis to thresholds, influences, symmetries, noise, percolation, and social choice. He has developed theories in algebraic shifting and studied face-numbers and other combinatorial invariants of polytopes. His work on the diameter of polytopes and randomized simplex algorithms has been influential in optimization theory. In 1993, his collaboration with Kahn produced a groundbreaking counterexample to Borsuk's Conjecture in 1325 dimensions. Professor Kalai's publications reveal a consistent focus on the intersection of combinatorics, geometry, and theoretical computer science. His work shows a progression from foundational combinatorial geometry to increasingly sophisticated applications of harmonic analysis in discrete mathematics. The recurring themes across his 30+ year career include Boolean functions, polytope theory, and probabilistic methods in combinatorics, demonstrating remarkable coherence in his research trajectory. 2016 European congress of Mathematics, plenary speaker 2013 ERC advanced grant 2012 Rothschild Prize 1994 International Congress of Mathematicians invited section talk, Zurich 1994 Fulkerson Prize 1993 Erdos Prize 1992 Polya Prize Though specific details of his advising are not provided in the source material, Kalai has written over 70 scientific papers and maintains an active research blog entitled "Combinatorics and More." His 2013 ERC advanced grant indicates significant research funding for his work. His extensive collaborations with researchers across multiple institutions suggest a robust research program with numerous PhD students and postdoctoral researchers, though specific names are not mentioned in the provided texts. Professor Kalai maintains active research connections across multiple institutions including Hebrew University, Yale, and various research centers worldwide. His work bridges pure mathematics and theoretical computer science, creating a unique interdisciplinary research environment that influences both fields.
Anders Rantzer is a Professor of Automatic Control at the Department of Control Engineering, Faculty of Engineering, Lund University, Sweden. He has held visiting positions at Caltech (2004–2005) and the University of Minnesota (2015–2016) as the Taylor Family Distinguished Visiting Professor. His academic journey began with a PhD from KTH Stockholm in 1991, followed by a postdoc at the Institute for Mathematics and its Applications (IMA), University of Minnesota. His research interests center on modeling, analysis, and synthesis of control systems , with a strong focus on scalability, adaptation, and applications in energy networks . He is particularly known for foundational work in positive systems and integral quadratic constraints (IQCs) . These theoretical frameworks are critical in analyzing stability and robustness of large-scale interconnected systems. His work bridges mathematical rigor with practical engineering applications, especially in sustainable energy and networked systems. The recent publications and lecture materials reflect a consistent trajectory in scalable and robust control, optimization, and distributed systems. Themes such as large-scale convex optimization , nonlinear and stochastic control , and network dynamics dominate his scholarly output, indicating a sustained commitment to advancing control theory for complex, real-world systems. Scientific honors include: Fellow of IEEE Member of the Royal Swedish Academy of Engineering Sciences (IVA) Chairman of the Swedish Scientific Council for Natural and Engineering Sciences Chairman of the Royal Physiographic Society of Lund Rantzer has supervised numerous students and contributed extensively to academic leadership and education. He has been involved in major national and international research initiatives such as WASP (Wallenberg AI, Autonomous Systems and Software Program) and ELLIIT. His work includes developing educational tools and courses in control, optimization, and machine learning. He leads and contributes to research projects on autonomous systems, cloud control, and smart energy networks. He is affiliated with the Control Lab at LTH and participates in collaborative efforts such as the Nordic University Hub on Industrial Internet of Things (HI2OT). His work integrates theoretical advances with practical implementations in robotics, biomedical systems, and industrial automation.
Vladimir Spokoiny is a Professor at the Departments of Mathematics and Economics of the Humboldt University of Berlin and Head of the Research Group "Stochastic Algorithms and Nonparametric Statistics" at the Weierstrass Institute for Applied Analysis and Stochastics (WIAS) in Berlin, Germany. His research spans multiple areas of statistics, machine learning, and financial mathematics, with significant contributions to nonparametric statistics, high-dimensional data analysis, and statistical methods in finance. Spokoiny received his M.Sc. in applied mathematics from the Moscow Institute of Railway Engineering in 1981 and his Ph.D. in mathematics from Lomonosov Moscow State University in 1988. He completed his Habilitation at Humboldt University in 1996. His academic career includes positions at the All-Union Institute of Railway Transport in Moscow, the Institute for Information Transmission Problems in Moscow, and the Institute for Applied Analysis and Statistics in Berlin before joining the Weierstrass Institute and Humboldt University where he has been a professor since 2002. Spokoiny's research focuses on adaptive nonparametric smoothing and hypothesis testing, high dimensional data analysis, statistical methods in finance, image analysis with applications to medicine, classification, and nonlinear time series. His work often addresses the challenges of nonstationarity in time series data and develops innovative methods for volatility estimation and risk management. He has made significant contributions to the development of adaptive weights smoothing procedures, which have applications in image processing, community detection, and manifold learning. His recent work has expanded into high-dimensional statistics, Bayesian inference, and optimization methods for machine learning, with publications demonstrating novel approaches to Gaussian approximation, Laplace methods, and statistical inference in non-Euclidean spaces. Spokoiny has supervised numerous PhD students including Oliver Reiss, Danilo Mercurio, Ying Chen, Elmar Diederichs, and Mstislav Elagin, whose research has focused on mathematical finance, time series analysis, and statistical methods. He serves as an Associate Editor for The Annals of Statistics (since 2004) and Statistics and Decisions (since 2002), and has previously served on the editorial board of the Journal of Statistical Planning and Inference. His professional activities include reviewing for major statistical journals including Annals of Statistics, Bernoulli, Econometrica, and Journal of American Statistical Association, as well as reviewing grant proposals for the National Science Foundation (USA), German Research Foundation, and Netherlands Organisation for Scientific Research. Spokoiny is a member of several professional societies including the International Statistical Institute, American Statistical Association, Institute of Mathematical Statistics, and Bernoulli Society. He is fluent in Russian (mother tongue), English, and German, and has good knowledge of French. His research group at WIAS focuses on developing novel statistical methodologies with applications across various scientific domains, particularly emphasizing adaptivity and robustness in complex data environments. The group's work has significant implications for financial risk management, medical imaging, and machine learning applications, with recent publications addressing fundamental questions in high-dimensional statistics and nonparametric inference.
David Jerison is a Professor of Mathematics at the Massachusetts Institute of Technology (MIT), where he conducts research in Fourier analysis and partial differential equations. His work focuses primarily on free boundary problems and, more recently, on internal Diffusion Limited Aggregation (internal DLA), a stochastic growth model. He maintains an active research program with numerous publications in leading mathematical journals. Professor Jerison's research spans several interconnected areas of mathematical analysis. His primary interests include Fourier analysis and partial differential equations, with particular emphasis on free boundary problems. In recent years, he has expanded his research to include internal Diffusion Limited Aggregation, a stochastic growth model that has connections to probability theory and mathematical physics. His work often bridges geometric analysis, spectral theory, and probabilistic methods, demonstrating the deep connections between different branches of mathematics. Analysis of Professor Jerison's recent publications reveals a consistent focus on geometric aspects of partial differential equations, particularly free boundary problems. His research shows progression from classical PDE theory toward more stochastic and probabilistic approaches, as evidenced by his work on internal DLA. The publications demonstrate interdisciplinary connections between mathematical analysis, probability theory, and mathematical physics, with applications ranging from geometric measure theory to quantum mechanics. Professor Jerison is actively involved in teaching and mentoring at MIT. He has taught courses including Differential Equations (18.03), Fourier Analysis and Applications (18.103), and Differential Analysis (18.155). He also directs the Summer Program for Undergraduate Research (SPUR), which is exclusively for MIT undergraduates, and organizes the mathematics section of the Research Science Institute (RSI) for high school students. His teaching materials are available through MIT's Open Courseware platform, indicating his commitment to educational outreach and accessibility.
Jin Ma is a Professor in the Department of Mathematics at the University of Southern California (USC), where he has served since 2007. He previously held professorships at Purdue University (1994–2008). His research focuses on stochastic analysis, stochastic differential equations, mathematical finance, and control theory. He directs USC's Mathematical Finance Program and serves on editorial boards for journals like Probability, Uncertainty and Quantitative Risk and SIAM Journal on Control and Optimization . Ma received his Ph.D. in Mathematics from the University of Minnesota (1992) and M.S./B.S. in Applied Mathematics from Fudan University (1985/1982). His work bridges theoretical stochastic analysis and applied domains like finance and insurance, with notable contributions to forward-backward SDEs and mean-field games. Research Highlights: Developed frameworks for stochastic control and backward SDEs in financial and insurance contexts. Advanced mean-field game models for limit order book dynamics and equilibrium analysis. Explored set-valued stochastic differential equations and their applications in risk management. Grants & Advising: Advised numerous graduate students in stochastic processes and mathematical finance. Research supported by NSF grants and industry collaborations.
Gary King is the Albert J. Weatherhead III University Professor at Harvard University and Director of the Institute for Quantitative Social Science. He is based in the Department of Government within Harvard's Faculty of Arts and Sciences. One of only 22 University Professors at Harvard, this represents the institution's most distinguished faculty position. King received his B.A. from SUNY New Paltz in 1980 and his Ph.D. from the University of Wisconsin-Madison in 1984. His academic journey has led him to become one of the most influential scholars in political methodology and quantitative social science. Professor King's research spans numerous areas of methodological innovation in the social sciences. His work focuses on developing and applying empirical methods across various domains. Key research interests include: Ecological Inference - developing methods to infer individual behavior from group-level data Automated Text Analysis - creating techniques for extracting knowledge from massive text collections Causal Inference - methods for detecting and reducing model dependence in causal effect estimation Missing Data and Measurement Error - statistical approaches to handle incomplete or imperfect data Survey Research - developing methods for more accurate cross-cultural survey comparisons Unifying Statistical Analysis - integrating diverse methodological approaches into coherent frameworks King's recent publications demonstrate a continued focus on methodological innovation with practical applications. His work spans political science, public health, and data science, with particular emphasis on privacy-preserving data analysis, maternal health metrics, survey methodology, and media effects. A notable trend is the increasing interdisciplinary nature of his research, bridging political methodology with public health, computer science, and demography. His work on census data privacy, maternal mortality disparities, and media influence represents cutting-edge applications of social science methodology to critical societal issues. His scientific achievements have been recognized with numerous prestigious awards: Fellow of the National Academy of Sciences (2010) Fellow of the American Statistical Association (2009) Fellow of the American Academy of Arts and Sciences (1998) Guggenheim Foundation Fellow (1994-1995) Career Achievement Award (2010) Warren Miller Prize (2008) Multiple awards for research software and methodology King has mentored numerous students and postdocs, many of whom now hold faculty positions at leading universities. His research has been supported by major funding agencies including the National Science Foundation, Centers for Disease Control and Prevention, World Health Organization, and National Institute of Aging. He has collaborated with over seventy scholars on research publications and served on numerous editorial boards and professional organization councils. His work on the Mexican universal health insurance program represents one of the largest randomized health policy experiments to date, demonstrating his commitment to rigorous evaluation of real-world policy interventions. As Director of the Institute for Quantitative Social Science, King leads a vibrant research community focused on methodological innovation. His work has practical applications in diverse areas including legislative redistricting (used by the U.S. Supreme Court), health policy evaluation (including the largest randomized health policy experiment to date in Mexico), Chinese censorship analysis (revealing government fabrication of 450 million social media comments annually), and automated text analysis (through Crimson Hexagon, a company he co-founded).
Erik Waingarten is an assistant professor at the University of Pennsylvania in the Computer and Information Science department. His research focuses on algorithms for massive datasets, including similarity search, streaming/sketching, property testing, and distribution testing. Former postdoctoral researcher at Stanford's CS Department under Moses Charikar PhD from Columbia University advised by Xi Chen and Rocco Servedio Key research areas: High-dimensional geometry Streaming algorithms Property testing Sketching techniques Clustering and metric optimization Recent article trends show expertise in: 2025 publications on monotonicity testing and metric property analysis 2024 work on Earth Mover's Distance and kernel evaluations 2023 papers on clustering, optimal transport, and MST algorithms 2022-2020 foundations in sublinear algorithms and entropy estimation Scientific recognition: NSF CAREER Award (2023) CCC Best Paper Award (2017) Invited to Journal of the ACM (2017) Academic advising includes PhD students: Ashwin Padaki Tian Zhang Nicolas Menand Krish Singal Junkai Song
Rina Foygel Barber is the Louis Block Professor in the Department of Statistics at the University of Chicago, where she also serves as Co-chair of the Committee on Community, Diversity, and Inclusion (CCDI) and is a member of the Committee on Computational and Applied Mathematics (CCAM). Her educational background includes: PhD in Statistics, University of Chicago (2012), advised by Mathias Drton and Nati Srebro MS in Mathematics, University of Chicago (2009) ScB in Mathematics, Brown University (2005) NSF postdoctoral fellow, Stanford University Department of Statistics (2012-13), supervised by Emmanuel Candès Professor Barber's research focuses on the theoretical foundations of statistical problems in estimation, prediction, and inference, particularly in high-dimensional settings where classical methods may not be reliable. She specializes in distribution-free inference methods such as conformal prediction, multiple testing methods, algorithmic stability, and shape-constrained inference. Her work also extends to modeling and optimization problems in medical imaging reconstruction. Her recent publications demonstrate a strong focus on distribution-free inference, with particular emphasis on conformal prediction, false discovery rate control, and algorithmic stability. Her work bridges theoretical statistics with practical applications, especially in the medical imaging domain. Professor Barber has received numerous prestigious awards: Elected to National Academy of Sciences (2025) MacArthur Fellowship (2023) IMS Fellow (2023) COPSS Presidents' Award (2020) Peter Gavin Hall Early Career Prize (2020) She actively mentors students and collaborators, with many co-authored publications across statistics, machine learning, and medical imaging. Her research has been supported by significant grants that enable her work on theoretical foundations of statistical inference and practical applications in medical imaging. Professor Barber also co-organizes the International Seminar on Selective Inference. Her research group focuses on developing and analyzing estimation, inference, and optimization tools for structured high-dimensional data problems. They work on false discovery rate control, distribution-free inference, and applications in medical imaging reconstruction.
Anna Levina is an Assistant Professor for Computational Neuroscience at the University of Tübingen , affiliated with the Department of Computer Science under the Faculty of Science. Her research focuses on the self-organization of neuronal activity, critical dynamics in neural networks, and the excitation/inhibition balance in cortical circuits. Current positions: Assistant Professor (since 2018), Group Leader (2017-2018), Equality Officer (Computer Science) Previous roles: IST Fellow (2015-2017), Associated Researcher (2011-2015), Postdoc/PI (2011-2015), Postdoc (2008-2011) Her research integrates mathematical modeling , statistical physics , and computational neuroscience to study criticality phenomena, neural avalanches, and adaptive network dynamics. Key interests include: Self-organized criticality in neural systems Excitation/Inhibition balance mechanisms Network topology and dynamics Timescale analysis in neural processing Stochastic modeling of neural activity Recent publications reveal trends in understanding critical dynamics across biological and artificial networks, with applications to memory systems, sensorimotor integration, and disease modeling. She has received recognition as an IST Fellow .
