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.
Jiatao Gu is an Assistant Professor in the Department of Computer and Information Science (CIS) at the University of Pennsylvania, with a part-time role as Staff Research Scientist at Apple (MLR). He holds a Ph.D. in Electrical and Electronic Engineering from the University of Hong Kong (2018) and a B.Eng. in Electronic Engineering from Tsinghua University (2014). His research focuses on generative machine learning and AI agent interaction with the physical world, emphasizing multi-modal systems spanning language, images, videos, and 3D. Key themes include efficient modeling , flexible architecture design , and scalable decision-making frameworks . 2025: ICLR paper on DART framework 2024: TMLR work on GFlowNet alignment 2023: NeurIPS research on diffusion stability 2022: ACL papers on speech translation Recent publications explore diffusion models for text-to-image synthesis, 3D reconstruction, and efficient sampling techniques. His work addresses fundamental challenges in attention mechanisms, entropy collapse, and multi-stage distillation while advancing non-autoregressive translation and vision-language reasoning . Prospective students can apply through his recruitment process at UPenn. Prior affiliations include Meta AI (FAIR Labs) and academic collaborations with institutions like New York University's CILVR Lab.
Aleksandar Jeremic is an Associate Professor in both the Electrical & Computer Engineering department and the McMaster School of Biomedical Engineering at McMaster University. His research focuses on biomedical signal processing, statistical signal processing, and biometrics, with applications in healthcare and biomedical systems. He holds a Dipl. Ing. from the University of Belgrade, and an M.S. and Ph.D. from the University of Illinois at Chicago. His expertise spans physiological signal analysis (e.g., ECG/EEG), medical imaging, and machine learning for biomedical applications. He has authored over 50 technical articles and two book chapters, and has been recognized with a teaching award from the McMaster Electrical and Computer Engineering Society (2018). He supervises graduate students in both theoretical and applied research areas. Dr. Jeremic teaches advanced courses such as Biomedical Signal Modeling and Processing and Advanced Probability and Random Processes , emphasizing practical applications of signal processing in healthcare. His work includes clinical implementations like neonatal seizure monitoring software and microwave imaging for breast cancer detection.
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).
Asaf Ferber is Associate Professor in Mathematics at University of California, Irvine, School of Physical Sciences. His research spans discrete mathematics including combinatorial games, random graphs, extremal hypergraph theory, and quantum computation. Research explores Hamiltonian cycles in random graphs, structural properties of pseudorandom graphs, and quantum algorithms for combinatorial problems. Recent work develops quantum approaches to graph learning and sparse recovery in random matrices. Awards: NSF CAREER Award Sloan Fellowship Distinguished Early Career Faculty Award for Research Air Force Research Grant NSF-BSF Grant Organizes conferences including SoCalDM Symposium and Desert Discrete Math Workshop, mentoring graduate students through UCI's Probability and Combinatorics Seminar.
Peter Benner is a Professor and Director at the Max Planck Institute for Dynamics of Complex Technical Systems in Magdeburg, where he leads the Computational Methods in Systems and Control Theory group. He also holds an Honorarprofessor position for Mathematics at Otto-von-Guericke Universität Magdeburg since 2011. Benner has previously served as Managing Director of the Max Planck Institute during multiple periods (2013-2014, 2021-2022, and 2025-2026), demonstrating his leadership in the field. Benner's research focuses on Scientific Machine Learning, Numerical Linear and Multilinear Algebra, Model Order Reduction and Reduced-order Modeling, Numerical Methods in Systems and Control Theory, PDE Constrained Optimization, High-performance and Power-aware Computing, and Mathematical Software development. His work bridges theoretical mathematics with practical engineering applications, particularly addressing challenges in large-scale dynamical systems. Analysis of his recent publications reveals a strong emphasis on developing efficient computational methods for complex systems. Benner has pioneered approaches combining model order reduction with tensor methods to tackle high-dimensional problems in uncertainty quantification and PDE-constrained optimization. His work shows a consistent trend toward integrating data-driven techniques with traditional model-based approaches, particularly for nonlinear and parametric systems. Throughout his career, Benner has actively mentored students and collaborated with researchers worldwide, delivering numerous invited talks at prestigious institutions and conferences across Europe, North America, and Asia. His research has received significant funding, supporting the development of mathematical software and computational methods for industrial applications. Benner leads the Computational Methods in Systems and Control Theory department at the Max Planck Institute, which focuses on developing and implementing advanced numerical methods for large-scale dynamical systems. The group maintains strong connections with both theoretical mathematics and practical engineering applications, particularly in fluid dynamics, energy systems, and control theory.
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.
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.
Jianqi Liu is a Hans Rademacher Research Fellow in the Department of Mathematics at the University of Pennsylvania, affiliated with the School of Arts and Sciences. His research focuses on vertex operator algebras (VOAs) and 2D conformal field theory (CFT), with an emphasis on algebraic structures such as fusion rules, Zhu’s algebras, Borel-type subalgebras, and connections to the classical Yang-Baxter equation. He also explores geometric aspects of VOAs and their physical interpretations. He earned his Ph.D. in Mathematics from the University of California, Santa Cruz (2018–2023), under the supervision of Chongying Dong. Prior to his current role, he held teaching roles at both UPenn and UCSC, instructing courses ranging from advanced linear algebra to complex analysis and number theory. His research publications address topics such as twisted conformal blocks, Rota-Baxter operators, and the interplay between algebraic structures and integrable systems. Liu collaborates with researchers like Angela Gibney and Daniel Krashen, focusing on advancing theoretical frameworks in mathematical physics and algebraic geometry.
Stephen A. Vavasis is a Professor in the Department of Combinatorics and Optimization at the University of Waterloo, part of the Faculty of Mathematics. He holds a PhD in Computer Science from Stanford University (1989) and has held academic positions at Cornell University (1989–2006) before joining Waterloo. His research focuses on continuous optimization, data science, first-order methods, scientific computing, and computational mechanics. Current teaching includes courses on convex optimization and portfolio optimization methods. He has served as Associate Dean of Computing (2017–2020) and Interim Director of Data Science graduate programs. His work is supported by NSERC grants. Notable awards include the Hertz Fellowship, Churchill Scholarship, and Guggenheim Fellowship. Vavasis's research emphasizes applications of optimization to clustering, machine learning, and fracture mechanics. His publications span convex optimization frameworks, algorithmic analysis of gradient methods, and numerical methods in mechanics. Recent work explores unifying analyses of first-order optimization algorithms and robust optimization techniques for high-dimensional data problems.
Andrea Montanari is a Professor of Mathematics and Statistics at Stanford University, affiliated with the Department of Mathematics and Statistics. His research focuses on high-dimensional statistics, machine learning theory, optimization algorithms, and statistical physics, with applications to neural networks and complex systems. He has contributed extensively to understanding generalization in overparametrized models, spin glass theory, and algorithmic methods like approximate message passing. His work bridges theoretical computer science and mathematical physics, addressing challenges in data analysis and learning from high-dimensional datasets. Notable themes include analyzing neural network dynamics, optimizing high-dimensional landscapes, and developing efficient algorithms for sparse and low-rank matrix estimation. Montanari’s publications explore topics such as the interplay between statistical and computational limits, the behavior of gradient-based methods, and the theoretical foundations of modern machine learning. His recent research demonstrates a focus on fundamental questions in learning theory, including the study of phase transitions in statistical estimation, the role of overparametrization in generalization, and the mathematical underpinnings of contemporary algorithms. While no specific awards are listed here, his contributions reflect significant impact in interdisciplinary fields.
Vladimir Kazeev is an Assistant Professor at the Faculty of Mathematics, University of Vienna , where he has held a faculty position since 2019. He also held previous academic appointments as a Szegő Assistant Professor at Stanford University (2017–2019), a postdoctoral researcher at the University of Geneva (2015–2017), and research positions at ETH Zurich (2011–2015), Russian Academy of Sciences (2008–2011), and Moscow Institute of Physics and Technology (2009). His research focuses on adaptive, data-driven numerical methods for differential equations, nonlinear low-parametric approximation, and numerical linear algebra. His work intersects computational mathematics, tensor methods, and high-dimensional problem-solving, particularly in the context of partial differential equations (PDEs) and stochastic modeling. The 15 most recent publications reveal a strong emphasis on quantized tensor-structured methods for PDEs, low-rank approximations, and high-dimensional numerical analysis. His research spans theoretical advancements in tensor decomposition, practical applications in chemical reaction networks, and novel discretization techniques for multiscale and degenerate diffusion problems. Scientific awards include the prestigious ETH Medal for outstanding doctoral theses (2016) Russian Academy of Sciences Medal for outstanding student works in mathematics (2011) Advising and teaching activities include supervising Jason Zhu (Stanford, 2019) and Simon Etter (ETH Zurich, 2014), as well as teaching advanced courses in tensor methods, numerical analysis, and PDEs at the University of Vienna, Stanford University, and the University of Geneva. His service to the community includes peer review for 15+ journals and co-organizing minisymposia at SIAM meetings.
Prof. Dan Jiao is the Synopsys Professor of Electrical and Computer Engineering at Purdue University's Elmore Family School. She leads the Rapid-Heterogeneous Integration (Rapid-HI) Design Institute and serves as Editor-in-Chief of the IEEE Journal on Multiscale and Multiphysics Computational Techniques. Her research focuses on computational electromagnetics, multiphysics modeling, and AI-driven design automation for advanced integrated circuits and quantum systems. She has held academic positions since 2005, progressing from Assistant to Full Professor, and has extensive industry experience at Intel Corporation (2001–2005). Education: PhD in Electrical Engineering, University of Illinois at Urbana-Champaign (2001) Senior Staff Engineer at Intel Corporation (2001–2005) Research Interests: Fast numerical methods for large-scale electromagnetic analysis AI/ML integration in design automation (EDA/MDA) Quantum circuits and spin qubit systems Heterogeneous integration and advanced packaging Multiphysics co-simulation for nano-scale devices Signal/power integrity in high-speed systems Key Projects: Leads the NSTC AIDRFIC program (first NSTC R&D Jump Start project), the DARPA NGMM Rapid-HI Design Institute, and the GENIE-RFIC generative design tool initiative. Also directs the Consortium for Electromagnetic Science and Technology. Awards & Honors: 2022 ACES Computational Electromagnetics Award IEEE Fellow (2016) Intel Outstanding Researcher Award (2019) MTT-S Distinguished Microwave Lecturer (2020–2023) 2013 Schelkunoff Prize Paper Award Advising & Grants: Advised over 30 PhD/master's students and led projects funded by NSF, DARPA, Intel, SRC, and industry partnerships. Key grants include NSF CAREER (2008), ONR Young Investigator (2006), and multiple industry-sponsored initiatives. Labs & Teams: Rapid-HI Design Institute (DARPA NGMM) Quantum device co-design group Multiphysics modeling team
Professor Paul Goulart is a full Professor of Engineering Science at the University of Oxford and Tutorial Fellow at St Edmund Hall, positions he has held since 2014. He leads research and teaching in robust optimization, control systems, and high-speed numerical methods, with applications spanning fluid flows, traffic networks, and economics. Education SB & MSc, Aeronautics and Astronautics – Massachusetts Institute of Technology (MIT) PhD, Control Engineering – University of Cambridge (Gates Scholar, 2007) Research Interests Professor Goulart’s work lies at the intersection of control engineering and optimization . His core expertise includes: Robust and high-speed convex optimization Model predictive control (MPC) and control barrier functions Neural-network-based control and system identification Optimization over traffic and economic networks Real-time and embedded optimization solvers These interests are reflected in prolific publication output and active supervision of doctoral researchers. Publications & Trends From 2020 to 2025 Professor Goulart has co-authored more than thirty papers. A dominant theme is the development of fast, reliable algorithms for conic optimization and robust control , often leveraging machine-learning techniques to enhance scalability and real-time performance. Recent works emphasize safety certificates, GPU-accelerated solvers, and neural-network controllers for uncertain systems. Awards & Honors Gates Cambridge Scholar (2003) Advising & Grants Professor Goulart actively seeks DPhil students in control engineering and optimization . He leads the Control Group within the Department of Engineering Science and has been involved in multiple industrially funded projects, although specific grant identifiers are not provided in the supplied text. Laboratory & Teams He is a member of the Control Group , Department of Engineering Science, University of Oxford, and serves as Secretary to the Governing Body of St Edmund Hall (Michaelmas Term 2024).
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)
