Renjie Feng is a Research Fellow in Mathematics and AI at the School of Mathematics and Statistics and the Sydney Mathematical Research Institute , University of Sydney. His work bridges probability theory, statistics, and applications in machine learning, deep learning, and artificial intelligence. His research interests focus on probability theory and its applications to machine learning , random matrix theory , and statistical physics . He investigates extreme value problems, spectral properties of random matrices, and topological features of random fields over Riemannian manifolds. Recent publications highlight trends in random matrix theory (GUE, GOE, GSE), extreme gap problems , determinantal point processes , and Wiener chaos . Collaborative works with F. Götze, D. Yao, and R. Adler emphasize U-statistics , multivariate linear statistics , and random topology inspired by Poisson point process studies.
Han Liu is a Professor in the Department of Computer Science at Northwestern University's McCormick School of Engineering. He directs the MAGICS (Modern Artificial General Intelligible and Computer Systems) Lab and the Center for Foundation Models and Generative AI at Northwestern, with prior roles as director of the Deep Reinforcement Learning Center at Tencent AI Lab and professor at Princeton and Johns Hopkins Universities. PhD in Machine Learning and Statistics from Carnegie Mellon University (2012), advised by John Lafferty and Larry Wasserman Han Liu's research focuses on integrating artificial intelligence with computer systems, particularly through foundation models and probabilistic graphical models. His work aims to revolutionize science, engineering, and business by deploying statistical machine learning methods in edge and cloud computing environments. Recent research trends include transformer-based models, modern Hopfield networks, genomic foundation models, and theoretical analysis of attention mechanisms. His 2025 publications explore topics like species differentiation with DNA embeddings, universal approximation capabilities of transformers, and metaverse spatial reasoning. Alfred P Sloan Fellowship in Mathematics IMS Tweedie New Researcher Award ASA Noether Young Scholar Award NSF CAREER Award Presidential Early Career Awards for Scientists and Engineers Han Liu serves as associate editor for the Journal of American Statistical Association, Electronic Journal of Statistics, Technometrics, and the Journal of Portfolio Management. He has directed research centers at Northwestern and contributed to major conferences as area chair (NeurIPS, ICML, ICLR).
Andrew Childs is a Professor at the University of Maryland, affiliated with the Department of Computer Science and the Institute for Advanced Computer Studies (UMIACS). He serves as Director of the NSF Quantum Leap Challenge Institute for Robust Quantum Simulation (RQS) and is a Fellow at the Joint Center for Quantum Information and Computer Science (QuICS). His research focuses on quantum algorithms for simulating physical systems, algebraic problems, and quantum walk protocols, with applications in quantum computing and computational complexity. University of Maryland Institute for Advanced Computer Studies (UMIACS) Joint Center for Quantum Information and Computer Science (QuICS) NSF Quantum Leap Challenge Institute for Robust Quantum Simulation Childs' research spans quantum simulation, quantum Fourier transform, phase estimation, and Hamiltonian dynamics. He has developed techniques to reduce quantum computational resources for simulating quantum systems and explored limitations of quantum computers through hidden subgroup problems and non-unitary dynamics. His publications cover diverse areas including quantum walk optimization, Hamiltonian simulation methods, and applications to cryptography and condensed matter physics. Recent works address spatial search algorithms, product formulas for commutators, and quantum routing protocols. As an educator, Childs has taught courses on quantum algorithms and information processing at both the University of Maryland and University of Waterloo, with lecture notes and materials spanning multiple years. Contact: amchilds@umd.edu | Office: ATL 3359 | Affiliated with University of Maryland's quantum research institutes.
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.
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.
Benjamin Landon is an Assistant Professor in the Department of Mathematics at the University of Toronto, where he has been faculty since 2021. His office is located in the Bahen Centre for Information Technology, Room 6264. Prior to joining the University of Toronto, he was a CLE Moore Instructor at the Massachusetts Institute of Technology from 2018-2021. Education: PhD in Mathematics, Harvard University (2018). Advisor: Horng-Tzer Yau M.Sc. in Mathematics, McGill University (2013). Advisors: Vojkan Jaksic and Robert Seiringer B.Sc., McGill University (2012) Dr. Landon's research focuses on Probability and Mathematical Physics, with particular expertise in Random Matrix Theory. His work spans various aspects of spectral statistics, eigenvalue distributions, and universality phenomena in random matrix ensembles. He has made significant contributions to understanding the behavior of extremal eigenvalues, linear spectral statistics, and connections to other areas of mathematical physics such as spin glasses and the KPZ universality class. His research often involves developing novel analytical techniques to establish precise asymptotic behavior in complex random systems. Analysis of Dr. Landon's publication record reveals a strong focus on the intersection of probability theory and mathematical physics. His work consistently explores universality phenomena across different random matrix ensembles and related stochastic systems. A notable trend is his investigation of connections between random matrix theory and other areas of mathematical physics, particularly spin glass models and the KPZ equation. His research demonstrates both technical depth in establishing rigorous asymptotic results and breadth in connecting seemingly disparate areas of mathematical physics.
Aaron Smith is an Associate Professor in the Department of Mathematics and Statistics at the University of Ottawa, affiliated with the Faculty of Science. He holds a PhD from Stanford University. His research focuses on applied probability, computational statistics, Monte Carlo methods, and Markov chains, with an emphasis on advancing theoretical understanding and practical applications of these methodologies. Dr. Smith's work includes contributions to community detection algorithms, Markov chain mixing times, and synthetic health data generation. His recent publications explore topics such as nonstandard Dirichlet form representations, perturbation analysis of MCMC algorithms, and sparse Bayesian multidimensional scaling. He advises students in applied probability and has supervised postdoctoral researchers in related fields. His research interests span a wide range of topics, including stochastic processes, statistical inference, and algorithm design. He is particularly known for his analysis of convergence rates in Markov chains and the development of efficient sampling techniques for complex models. His interdisciplinary work bridges theoretical mathematics and practical computational challenges in data science and healthcare. Dr. Smith collaborates on projects involving synthetic data frameworks for privacy-preserving applications and has contributed to foundational work on mixing times and perturbation effects in stochastic systems.
Elias Jarlebring is a Professor in Numerical Linear Algebra at the Department of Mathematics, KTH Royal Institute of Technology, Stockholm. He has held the position of Full Professor since 2021, following his tenure as Associate Professor (2013-2021) and Dahlquist Research Fellow (2011-2013). His research focuses on numerical analysis, numerical linear algebra, matrix computations, and scientific computing. Jarlebring develops linear algebra algorithms to solve problems from various fields including systems and control, acoustics, electromagnetics, data science, quantum mechanics, and quantum chemistry. He is a core developer of NEP-PACK, a scientific computing software package for nonlinear eigenproblems. His recent publications demonstrate significant contributions to computational methods for nonlinear eigenvalue problems, matrix functions, and parameterized linear systems. The research shows a clear trajectory toward increasingly complex applications in quantum computing, data science, and wave propagation problems. Project grant, Swedish research council (2019) Ruth och Nils-Erik Stenbäcks foundation, junior grant (2019) Göran Gustafsson Prize for junior researchers (2014) Project grant for junior researchers, Swedish research council (2014-2018) Professor Jarlebring has supervised numerous PhD students including Vilhelm Peterson Lithell, Gustaf Lorentzon, Siobhán Correnty, Parikshit Upadhyaya, Emil Ringh, Antti Koskela, and Giampaolo Mele. He has received multiple research grants from the Swedish Research Council and serves as editor for BIT Numerical Mathematics, Linear and Multilinear Algebra, NACO Numerical Algebra Control and Optimization, and CALCOLO. He is actively involved in the numerical linear algebra community as a member of ILAS (International Linear Algebra Society), GAMM Activity Group on Numerical Linear Algebra, and the Nordic Numerical Linear Algebra Association. He also contributes to open source projects, particularly in the Julia programming language ecosystem.
Zhuo Feng is Professor of Electrical and Computer Engineering at Stevens Institute of Technology, directing the HUDSON Lab and holding a Ph.D. from Texas A&M University. His research develops spectral graph methods for VLSI design, including circuit simulation, power grid verification, and machine learning applications. Funded by NSF CAREER and multiple grants, his work has produced award-winning algorithms like GRASS for graph sparsification. Recent publications focus on spectral methods for circuit stability analysis, physics-informed neural networks, and explainable AI frameworks. He teaches graduate courses in VLSI design and GPU programming while co-founding LeapLinear Solutions. NSF CAREER Award (2014) ACM/IEEE DAC Best Paper Award (2013) Multiple Best Paper Nominations (ICCAD 2008, 2006)
Satish Rao is a Professor in the Computer Science Division at the University of California, Berkeley. He is affiliated with the Simons Institute for the Theory of Computing and the Center for the Theoretical Foundations of Learning, Inference, Information, Intelligence, Mathematics and Microeconomics at Berkeley (CLIMB). His research focuses on algorithms, combinatorial optimization, graph theory, and theoretical computer science with applications to computational biology and machine learning. Rao has held teaching roles for courses such as CS 70 (Discrete Mathematics and Probability Theory) and CS 270 (Spring 2024). He has been recognized with prestigious awards including ACM Fellow (2013), the Delbert Ray Fulkerson Prize (2012), and the Okawa Research Grant (1999). Research Interests: Algorithm design, graph algorithms, combinatorial optimization, computational biology, and machine learning. Key Contributions: Pioneering work on metric embeddings, approximation algorithms, and network flow problems. Notable publications include foundational papers on tree metrics, distributed object location, and electrical flow-based optimization. Rao’s work bridges theoretical computer science with practical applications, including contributions to phylogeny estimation, anomaly detection, and parallel computing frameworks like the BSP model.
Ana Maria Alonso Rodriguez is a Full Professor of Numerical Analysis at the Department of Mathematics, University of Trento. She holds a PhD in Applied Mathematics from Universidad Complutense de Madrid (1993) and has held academic positions across Italy and Spain since 1990. Her research focuses on numerical methods for partial differential equations, computational electromagnetism, finite element methods, and domain decomposition techniques. She has organized international workshops and minisymposia, including the 2022 Oberwolfach workshop on Hilbert Complexes and the 2018 ICOSAHOM conference session on high-order methods. Her work bridges numerical analysis, topology, and applied electromagnetism, with recent contributions to Whitney finite elements and discrete potential theory. Education: PhD in Applied Mathematics, Universidad Complutense de Madrid (1988-1993) Licenciatura en Ciencias Matematicas, same institution (1982-1987) Research emphasizes high-order discretizations for electromagnetic problems, leveraging finite element exterior calculus and graph-based decomposition techniques. Recent work (2024) advances tree-cotree methods for curl operator spectra and Whitney form interpolation. She actively collaborates with international institutions like the CI2MA in Chile and the Laboratoire J. A. Dieudonné in France. Teaching includes courses on numerical PDEs, finite elements, computational electromagnetism, and MATLAB-based numerical analysis at both undergraduate and PhD levels. She has supervised numerous courses in Italy and Spain since 2000, integrating practical software tools like FreeFem and MODULEF into instruction.
Piotr Zwiernik is an Associate Professor in the Department of Statistical Sciences at the University of Toronto's Faculty of Arts and Science, with a cross-appointment in the Department of Mathematics. Currently on leave from the University of Toronto, he is based in Barcelona following his return in July 2025. His academic journey includes a PhD in Statistics from the University of Warwick (2011), research positions at prestigious institutions including Mittag Leffler Institute, IPAM, TU Eindhoven, UC Berkeley, and the University of Genoa, and an Assistant Professorship at Universitat Pompeu Fabra in Barcelona (2016-2021). His research spans the intersection of statistics, mathematics, and computational methods, with particular emphasis on graphical models, covariance matrix estimation, convex analysis, tensors, and algebraic and combinatorial methods in statistics. Zwiernik's work demonstrates a consistent focus on high-dimensional statistics, mathematical statistics, and elegant theoretical frameworks that bridge abstract mathematics with practical statistical applications. His recent publications reveal a deepening exploration of tensor analysis, algebraic statistics, and the geometric properties of statistical models. Zwiernik serves as an associate editor for leading journals including Biometrika, Scandinavian Journal of Statistics, and Algebraic Statistics. His research program includes the development of the GOLAZO R package for asymmetric regularization of log-likelihood in Gaussian graphical models. As an academic leader, he has served as Associate Chair for Research in his department and actively participates in numerous international conferences and workshops, reflecting his significant standing in the statistical community. His recent publications show a strong trend toward algebraic and geometric approaches to statistical problems, with increasing focus on tensor methods, positivity constraints in statistical models, and the theoretical foundations of graphical models. The work demonstrates remarkable continuity in exploring the mathematical structures underlying statistical models while adapting to emerging challenges in high-dimensional data analysis. Zwiernik is committed to mathematical accessibility and education, guided by Federico Ardila's four axioms which emphasize equitable distribution of mathematical potential, joyful mathematical experiences, mathematics as a malleable tool, and treating every student with dignity and respect. He actively seeks PhD students with strong mathematical backgrounds for research at UPF or the Institute of Mathematics of UPC.
Arnab Sen is an Associate Professor at the School of Mathematics, University of Minnesota. His research focuses on probability theory and discrete harmonic analysis, with emphasis on models from statistical physics such as spin glasses, random graphs, random matrices, and random polynomials. PhD in Statistics, UC Berkeley (2010), advised by Steven N. Evans and Elchanan Mossel Postdoctoral Fellow, Statistical Laboratory, University of Cambridge His research spans discrete probability , statistical physics , and random matrix theory , addressing topics like disorder chaos in spin glasses, eigenvalue distributions, and quantum percolation. He has taught graduate and undergraduate courses including Random Matrix Theory , Introduction to Stochastic Processes , and Multivariable Calculus . His recent publications analyze spin glass models, random matrices, and combinatorial systems.
Ron Peled is a Full Professor in the School of Mathematical Sciences at Tel Aviv University , currently on leave to serve as the Brin Professor in the Department of Mathematics at the University of Maryland starting summer 2024. During 2022–2024 he was a Member at Princeton University and the Institute for Advanced Study . Education & Career: While explicit degrees are not listed, his trajectory shows appointments at NYU (2009–2010), UC Berkeley and Tel Aviv University as a teaching assistant, followed by faculty positions culminating in full professorship. Research Interests: His work lies at the intersection of probability theory, statistical physics, and combinatorics . Key themes include: Disordered systems and random environments (random-field Ising, spin glasses) First-passage percolation and random metrics Random surfaces and height functions Loop models and critical phenomena Random matrices and band matrices Geometric probability and allocation problems Publications & Impact: With over 70 papers in top journals such as Annals of Mathematics , Annals of Probability , Inventiones Mathematicae , and Communications in Mathematical Physics , his recent work explores minimal surfaces in random environments, localization in random band matrices, and quantitative disorder effects in low-dimensional spin systems. Grants & Awards: Research has been continuously funded by: Israel Science Foundation (grants 1048/11, 861/15, 1971/19, 2340/23) ERC Starting Grant LocalOrder ERC Consolidator Grant Transitions Marie Skłodowska-Curie International Reintegration Grant SPTRF Teaching & Mentoring: Prof. Peled has taught a broad spectrum of courses at Tel Aviv University (Brownian motion, probability, percolation, random matrices, stochastic calculus) and NYU (combinatorics, discrete mathematics). He has supervised 13 post-doctoral fellows and 8 graduate students (PhD & MSc) to date. Service & Outreach: He co-organizes the Joint Israeli Probability Seminar and has organized numerous international workshops and conferences including at Oberwolfach, Technion, and Tel Aviv University.
Prof. Dr. Martin Burger is a leading scientist at DESY and a Full Professor in the Department of Mathematics at Universität Hamburg, where he leads the Computational Imaging Group. His research bridges applied mathematics, imaging sciences, and machine learning, with a focus on inverse problems, mathematical modeling, and partial differential equations. He has held professorial positions at Universität Münster and FAU Erlangen-Nürnberg prior to his current dual appointment. Full Professor, Universität Hamburg (2023–present) Leading Scientist, DESY, Hamburg (2023–present) Full Professor, FAU Erlangen-Nürnberg (2018–2023) Full Professor, Universität Münster (2006–2018) His research interests include inverse problems, variational regularization, optimal transport, kinetic models, and mathematical modeling in biology and social sciences. He has made significant contributions to imaging reconstruction, sparse neural networks, and the analysis of transformer architectures. His work often integrates theoretical analysis with computational methods, influencing both pure and applied mathematics. The most recent articles reflect a strong trend toward interdisciplinary applications, combining deep learning with PDE-based modeling, analyzing social and biological systems via kinetic and mean-field models, and advancing mathematical imaging through graph-based and optimal transport methods. His publications span high-impact venues in applied mathematics and computational science. Calderon Prize, Inverse Problems International Association (IPIA) ERC Consolidator Grant (2014) Invited speaker at ECM (2021), ICM (2022), and ICIAM (2023) Editor-in-Chief, European Journal of Applied Mathematics (since 2017) Prof. Burger has supervised numerous PhD students and postdoctoral researchers, many of whom appear as co-authors in his publications. His research is supported by major grants, including funding from the German Federal Ministry of Education and Research (BMBF). He is actively involved in collaborative projects across mathematics, physics, and engineering disciplines. He leads the Computational Imaging Group at DESY, fostering a collaborative environment for developing novel mathematical tools in imaging science. The group works on both theoretical foundations and practical implementations, contributing to advancements in tomography, machine learning, and data analysis.
