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.
Tzu-Mao Li is an Assistant Professor in the Department of Computer Science and Engineering (CSE) at the University of California, San Diego (UCSD), affiliated with the Center for Visual Computing. His research focuses on differentiable graphics algorithms, combining classical visual computing with modern machine learning techniques. He holds a Ph.D. from MIT CSAIL under Frédo Durand and a postdoc at MIT and UC Berkeley with Jonathan Ragan-Kelley. His work spans rendering, programming languages for graphics, Monte Carlo methods, and inverse problems. Education: B.S. and M.S. from National Taiwan University (2011-2013), advised by Yung-Yu Chuang. Ph.D. from MIT CSAIL (Computer Graphics Group), advised by Frédo Durand. Postdoctoral research at MIT and UC Berkeley with Jonathan Ragan-Kelley. Research Interests: Differentiable rendering, Monte Carlo integration, programming language design for visual computing, physical simulation, adversarial machine learning, and applications in computer vision and robotics. Key areas include rendering algorithms (path tracing, bidirectional methods), optimization techniques (MCMC, gradient-based), and neural representations (SDFs, neural fields). Publications focus on advancing rendering algorithms, differentiable systems, and applications in inverse problems. Notable contributions include edge sampling for differentiable rendering, warped-area sampling, and diffusion models for BSDF sampling. Awards: ACM SIGGRAPH 2020 Outstanding Doctoral Dissertation Award, multiple Best Paper Awards at SIGGRAPH, and oral presentations at ICCV. Teaching: Courses include CSE 167 (Computer Graphics), CSE 168 (Rendering), and CSE 272 (Advanced Image Synthesis), emphasizing physically-based methods and programming.
Alexander Gorodnik is a Professor of Mathematics at the University of Zurich, focusing on the interplay between dynamical systems and number theory. His work bridges ergodic theory, homogeneous dynamics, and Diophantine approximation, with applications to arithmetic counting problems and geometric distribution of lattice orbits. Current lectures include MAT121: Analysis I and MAT221: Analysis III at the University of Zurich Co-author of the book The ergodic theory of lattice subgroups (Princeton University Press, 2010) Editor of the journal Ergodic Theory and Dynamical Systems His research explores Diophantine approximation through dynamical systems, investigating how orbits of group actions distribute in homogeneous spaces. Key topics include mixing properties , central limit theorems , and metric theorems for multiplicative approximation. Recent publications address automorphic density estimates , discrepancy in intrinsic Diophantine approximation , and effective equidistribution of translated measures. His work often employs tools from representation theory and spectral analysis . Current working group members include Zhiyuan Deng , Zouhair Ouaggag , and Yuval Yifrach . He has taught courses at institutions in Zurich, Bristol, Princeton, and Mumbai, with lecture materials covering topics from ergodic theorems to Každan's property (T) .
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.
Dr. Primoz Skraba is a Professor in Applied and Computational Topology at the School of Mathematical Sciences, Queen Mary University of London. As Deputy Head of the Centre for Probability, Statistics and Data Science, he bridges theoretical topology with practical applications in data analysis, machine learning, and optimization. Education : PhD in Electrical Engineering from Stanford University (2009) Prior Roles : Positions at INRIA, France; Jozef Stefan Institute, Slovenia; University of Primorska; University of Nova Gorica His research focuses on applying topological methods to analyze complex data. Key areas include: Stability of persistence diagrams for quantitative control in finite sampling Variants of persistence (zig-zag, robustness, multiparameter) Algorithmic Complexity in computational topology Stochastic Topology for random geometric models (Poisson, Boolean) Recent publications emphasize persistent homology in random geometric complexes, universality theorems, and integrating topological methods into machine learning. He received grants from the Leverhulme Trust, EPSRC, and Alan Turing Institute for projects on topological universality and AI foundations. His advisee Gabryel Mason-Williams explores wireless sensor network applications of homology.
Pan Xu is a tenure-track assistant professor with joint appointments in the Department of Biostatistics & Bioinformatics, Department of Computer Science, and Department of Electrical & Computer Engineering at Duke University. Previously, Xu was a Postdoctoral Scholar Research Associate at Caltech's Department of Computing and Mathematical Science and earned a Ph.D. in Computer Science from UCLA. Xu's research focuses on developing computationally- and data-efficient machine learning algorithms with strong empirical performance and theoretical guarantees. Xu's research interests center around Machine Learning with broad applications in Artificial Intelligence, Data Science, Optimization, Reinforcement Learning, and High Dimensional Statistics. The research specifically targets real-world problems in Bioinformatics and Healthcare, with recent work emphasizing distributionally robust decision making, efficient exploration strategies, and multi-agent systems. Xu has developed novel algorithms that address the challenges of exploration in sequential decision making and robustness to distributional shifts between training and deployment environments. Xu's recent publications demonstrate a strong trend toward developing theoretically grounded yet practical algorithms for reinforcement learning and bandit problems, with particular emphasis on distributionally robust methods, efficient exploration techniques, and applications to healthcare. The work spans both theoretical analysis (providing minimax optimal regret bounds) and practical implementations (validated on benchmarks like Atari games and real healthcare datasets). Whitehead Scholar award from Duke University School of Medicine (2023) Best Paper Award at ACM FAccT 2023 for Queer In AI paper PIMCO Postdoctoral Fellowship in Data Science (2022) TMLR Featured Certification (2023) NSF award on approximate sampling based exploration (2023) Xu actively mentors multiple Ph.D. students across Duke's Biostatistics & Bioinformatics, Computer Science, and Electrical & Computer Engineering programs, with several alumni now pursuing doctoral studies at top institutions. The research group has secured competitive funding including an NSF award for approximate sampling based exploration for sequential decision making. Xu serves as an action editor for TMLR and as an area chair for major conferences including ICML, NeurIPS, AAAI, ICLR, and AISTATS. Xu leads a dynamic research group focused on sequential decision making, with projects spanning theoretical algorithm development, implementation of practical systems, and applications to healthcare and bioinformatics. The group maintains active collaborations across Duke's medical and engineering schools, with recent work applying machine learning to epidemic forecasting during the pandemic.
Mikaela Iacobelli is an Associate Professor in the Department of Mathematics at ETH Zürich. During the 2024-25 academic year, she was a von Neumann Fellow at the Institute for Advanced Study in Princeton. Previously, she held faculty positions at Durham University and a research fellowship at the University of Cambridge. Her educational background includes: PhD in Mathematics from Sapienza University of Rome and École Polytechnique in Paris (2015) Master's degree from Sapienza University of Rome (2012) Bachelor's degree from Sapienza University of Rome (2009) Mikaela's research lies at the interface of analysis, kinetic theory, and statistical mechanics. She studies partial differential equations that model the collective behavior of many-particle systems, with a focus on Vlasov-type plasmas and gravitational dynamics. Her current projects range from quasineutral and singular-limit problems for Vlasov-type systems to quantization of measures, ultrafast diffusion, and gradient-flow structures that link microscopic particle models to macroscopic fluid descriptions. She makes extensive use of PDEs techniques, optimal transport, probability, calculus of variations, and Riemannian geometry in her work. Her recent publications demonstrate a strong focus on Vlasov-type equations, particularly examining quasineutral limits, stability properties, and connections to other physical systems like Euler equations and magnetohydrodynamics. She has made significant contributions to understanding Landau damping, quantization problems on manifolds, and the mathematical foundations of plasma physics. Her notable scientific awards include: SNSF Starting Grant (Swiss ERC) Challenges and Breakthroughs in the Mathematics of Plasmas (2025-2030) von Neumann Fellow at the Institute for Advanced Study, Princeton (2024-2025) Invited speaker at the International Congress of Mathematical Physics (2021) CO-PI of the Germaine de Staël Funding Program for French-Swiss cooperation (2021-2023) L'Oréal prize for Women in Science (2015) Mikaela actively mentors postdocs, PhD, Master's, and Bachelor's students. Her current mentees include postdocs Dennis Chemnitz, Rishabh Gvalani, Stefano Rossi, and Simon Becker, as well as PhD students Thérèse Moerschell, Ata Deniz Aydin, and Antoine Gagnebin. She has served as PI for the Starting Research Grant from the University of Rome Sapienza and is currently the PI for the SNSF Starting Grant. She co-organizes several academic seminars including the Zurich Colloquium in Mathematics, the PDE and Mathematical Physics seminar at ETH Zürich and UZH, and the Analysis Seminar. She also serves on various committees including as Chair of the European Mathematical Society Committee for Women in Mathematics.
Andrew Li is an Associate Professor of Operations Research at Carnegie Mellon University's Tepper School of Business since 2024, previously serving as Assistant Professor since 2018. His research bridges statistics, optimization, and machine learning with applications to healthcare operations and retail management. Current teaching: Optimization, Business Analytics Capstone, and Topics in Optimization and Statistics PhD from MIT's Operations Research Center (2018), BS in Operations Research/Applied Mathematics from Columbia University (2012) Research Focus: Dr. Li develops data-driven decision frameworks for complex systems. Key areas include: Experience-based learning models with fairness constraints (organ allocation) Anomaly detection in low-rank matrices (retail inventory accuracy) Nanoparticle-based diagnostic systems for CAD and Alzheimer's Nonstationary demand forecasting in supply chains Publication Trends: Recent work combines bandit algorithms with healthcare applications (split liver transplants, CAD detection) and retail operations (inventory accuracy). Theoretical contributions include regret-optimal policies and entrywise anomaly detection guarantees. Scientific Honors: INFORMS Nicholson Award (2018) INFORMS Pierskalla Award (2021) NSF CAREER Award (2023) Professional Leadership: Active in INFORMS and CMU committees including MBA Analytics Curriculum, Thompson Award, and ENAiBLE AI-driven retail collaborative co-founder since 2021.
Rima Alaifari is currently an Assistant Professor for Applied Mathematics at ETH Zürich , where she works on applied analysis, inverse problems, and scientific machine learning. Her research emphasizes stability analysis and regularization of inverse problems, applied harmonic analysis, phase retrieval, and operator learning. She is an associated member of the ETH AI Center and will transition to a full professorship at RWTH Aachen University in 2025 as Chair of Analysis and its Applications. Education : PhD in Mathematics (2010–2014, Vrije Universiteit Brussel); MSc in Applied and Industrial Mathematics (2005–2010, Johannes Kepler University) Research Focus : Stability estimates for inverse problems, phase retrieval in wavelet/Gabor transforms, operator learning with neural networks, and deep learning robustness. Article Trends : Her recent work bridges harmonic analysis with machine learning, focusing on phase retrieval stability, adversarial perturbations in imaging, and mathematically grounded neural operator frameworks like ReNO and CNO. Advising : She has supervised PhD students like Tandri Gauksson and Matthias Wellershoff. Former postdoctoral researchers include Francesca Bartolucci (now at TU Delft) and Jesse Railo (Finnish Inverse Prize winner).
Jason Schweinsberg is a Professor in the Department of Mathematics at the University of California, San Diego (UCSD), where he has been a faculty member since Fall 2004. His academic journey began with a Ph.D. in Statistics from the University of California, Berkeley in 2001, followed by a three-year NSF Postdoctoral Fellowship at Cornell University. His research focuses on probability theory with applications to evolutionary biology and population genetics. Schweinsberg's work centers on stochastic processes involving coalescence, branching Brownian motion, and their connections to biological phenomena. He has made significant contributions to understanding population models undergoing selection, cancer evolution, and spatial mutation processes. Recent publications reveal a strong emphasis on coalescent theory (particularly Λ-coalescents and nested coalescents), branching processes with absorption, and spatial evolutionary models. His work often bridges rigorous mathematical analysis with biological applications, especially in population genetics and cancer modeling. The 15 most recent articles demonstrate consistent focus on asymptotic analysis of stochastic processes, genealogical structures, and mutation dynamics in evolving populations. Scientific Awards: Fellow of the Institute of Mathematical Statistics NSF Postdoctoral Research Fellowship While specific student names aren't listed in the source material, Schweinsberg has delivered numerous lecture series at international institutions including the Indian Institute of Science (Bangalore), Centre de Recherches Mathématiques (Montreal), and the Isaac Newton Institute (Cambridge), indicating active mentorship and academic leadership. His collaborations span multiple institutions, with frequent co-authorship with researchers like Julien Berestycki, Nathanaël Berestycki, and Rick Durrett. Though no formal lab structure is mentioned, Schweinsberg participates in interdisciplinary research communities through workshops at institutions like BIRS (Banff International Research Station), where he presented on mutation patterns in spatially structured populations in May 2025. His work connects probability theory with biological applications through sustained collaborations across mathematics, statistics, and computational biology fields.
Prof. Dr. Gudrun P. Kiesmüller is a full professor of Operations Management at TUM Campus Heilbronn since 2019. Previously, she held full professorships at Kiel University (Supply Chain Management) and Otto von Guericke University Magdeburg (Operations Management). She studied mathematics at Julius-Maximilians-University of Würzburg and later worked as a postdoc and assistant professor at Eindhoven University of Technology. Her research focuses on supply chain management, inventory management (particularly spare parts), maintenance process planning, and manufacturing system design. She develops optimization approaches for decision support, with publications in journals like IISE Transactions and Production and Operations Management . Key awards include an Honorary Doctorate (2023), ISIR Service Award (2022), and multiple teaching and reviewer awards. She has contributed to advancing stochastic inventory models and operational efficiency in complex systems. Her work integrates theoretical rigor with practical applications, addressing challenges in inventory routing, buffer allocation, and component reliability optimization. Current research emphasizes dynamic maintenance planning and capital goods design.
Garvesh Raskutti is an Associate Professor in the Department of Statistics at the University of Wisconsin–Madison, affiliated with the School of Computer, Data & Information Sciences. He holds joint affiliations with the Departments of Computer Science, Electrical and Computer Engineering, and the Wisconsin Institute of Discovery Optimization Group. His research focuses on statistical machine learning, optimization, graphical/network modeling, and information theory, with applications to systems biology and neuroscience. Education: MEng from the University of Melbourne (2008), PhD from UC Berkeley (2012, advised by Martin Wainwright and Bin Yu), and postdoctoral work at SAMSI. Teaching awards include Honored Instructor (2014, 2017) and Madison Teaching and Learning Excellence Fellow (2015). He advises multiple PhD and undergraduate students, including Yuan Li, Hyebin Song, and Lili Zheng. His grants include NGA HM0476-17-1-2003 (Co-PI), ARO W911NF-17-1-0357 (Co-PI), and NSF-DMS 1407028 (Sole PI). Research interests span large-scale statistical inference, computational-statistical trade-offs, and applications in systems biology and neuroscience. His work bridges optimization (e.g., gradient descent, convex regularization), high-dimensional regression, and network analysis. Recent trends in publications emphasize methods for non-convex optimization, sparse models, and network structure learning. Awards include teaching recognition and grants in statistical methodology. Advising spans theoretical and applied projects, with former students like Gunwoong Park (now at University of Korea). Collaborations include interdisciplinary teams in machine learning and signal processing.
Andrea Pinamonti is an Associate Professor at the University of Trento. His research focuses on geometric analysis, partial differential equations, calculus of variations, and functional analysis in metric measure spaces, particularly in sub-Riemannian and Carnot group settings. He frequently collaborates with researchers from institutions such as the Universities of Pisa, Jyväskylä, and others, addressing topics like geometric measure theory, regularity of solutions, and nonlocal functionals. His recent work examines structures in Heisenberg groups, such as perimeter minimization, CR geometry, and differentiability theorems. He has also explored equations involving the p-Laplacian, fractional operators, and universal differentiability sets in non-Euclidean spaces. These studies reflect a sustained engagement with the interplay between geometry and analysis in sub-Riemannian frameworks. Events and Contributions: Speaker at Warsaw Analysis Days Event WADE25 (2025), Summer school in fluid dynamics (2024), and Workshop on Synthetic Curvature Bounds (2024). Organizer of Three days between Analysis and Geometry in Trento (2025, 2024) and EUregio School on Control Theory and Applications (2024). He has maintained a prolific publication record across high-impact journals such as Journal of Geometric Analysis , Advances in Mathematics , and Communications in Contemporary Mathematics . His academic activities include promoting collaborative research through workshops and open positions at his institution.
Lutz Warnke is a Professor of Mathematics at the University of California, San Diego, with prior affiliations at Georgia Institute of Technology (where he received tenure in 2021) and Peterhouse, Cambridge University (Junior Research Fellow until 2016). His research focuses on probabilistic combinatorics, random graphs, phase transitions, and combinatorial probability, with applications to extremal combinatorics and Ramsey theory. Education : Ph.D. in Mathematics from the University of Oxford (2012), supervised by Oliver Riordan. Dr. Warnke's research explores the structure and evolution of random graphs and processes, including Achlioptas processes, Ramsey numbers, and extremal problems. His work often bridges probabilistic methods with algorithmic applications and theoretical computer science. His publications from 2022–2025 reveal trends in random graph isomorphisms, clique coloring thresholds, extremal subgraph counts, and hardness of online algorithms. Key subfields include percolation, phase transitions, and probabilistic methods applied to combinatorial structures. Scientific Awards : Dénes König Prize (2016), Alfred P. Sloan Research Fellowship (2018), NSF CAREER Award (2020), Richard Rado Prize (2014). Dr. Warnke actively supervises PhD students and postdocs, including Matthew Cho (PhD ongoing), Erlang Surya (PhD 2025), Emily Zhu (PhD 2025), and He Guo (PhD 2021). He has received teaching accolades at Georgia Tech and contributes to graduate courses in probabilistic combinatorics, random graph theory, and stochastic processes.
Scott Armstrong is a Professor of Mathematics at the Courant Institute of Mathematical Sciences, New York University. His research focuses on partial differential equations, calculus of variations, and probability theory, with a specialization in stochastic homogenization of PDEs in random media and related statistical mechanical systems. He holds a Ph.D. from UC Berkeley (2009) and a B.S. from Texas A&M University (2002). Education: Ph.D. in Mathematics, University of California, Berkeley, USA (2009) B.S. in Mathematics, Texas A&M University, USA (2002) Research Interests: Scott's work addresses fundamental questions in homogenization theory, including quantitative estimates for elliptic and parabolic equations in random media, renormalization group methods, and applications to statistical mechanics. His contributions bridge analysis, probability, and mathematical physics, with a focus on rigorous mathematical frameworks for understanding macroscopic behavior from microscopic models. Publications: His recent work includes studies on anomalous diffusion, renormalization group techniques, and quantitative homogenization in high-contrast media. Over 50 peer-reviewed articles highlight his expertise in stochastic PDEs, elliptic regularity, and variational methods. Awards: No specific awards listed in the provided text. Advising & Grants: No student advisees or grant details explicitly mentioned in the text. Labs/Teams: No dedicated labs or collaborative teams explicitly noted, though his research likely involves interdisciplinary collaborations within the Courant Institute.
