Andrew M. Stuart is a Professor at the California Institute of Technology's Division of Engineering and Applied Science. His research bridges computational mathematics, machine learning, and physical modeling, focusing on inverse problems, partial differential equations, and multiscale systems. He has pioneered methodologies integrating Gaussian processes, Kalman inversion, and neural operators for scientific computing. His recent publications highlight innovations in competitive protein dimerization networks, nonlinear Bayesian inference, and operator learning. Articles span applications in materials science, geophysics, and biochemical signal processing, emphasizing data-driven discovery of differential equations and scalable algorithms for high-dimensional problems. Stuart's work addresses challenges in structural error modeling, uncertainty quantification, and graph-based learning, with implications for climate modeling and dynamical systems. Despite extensive contributions, the scraped data does not specify students, awards, or contact details.
Vincent Aleven is a Professor in the Human-Computer Interaction Institute (HCII) at Carnegie Mellon University, where he leads the CATS Lab focused on developing 'smart classrooms' through human-AI collaboration in educational settings. His work bridges learning sciences, human-computer interaction, artificial intelligence, and education to create dynamic learning environments that leverage complementary strengths of learners, educators, and AI systems. His research centers on intelligent educational systems with core interests in cognitive modeling, metacognitive skill development, and case-based reasoning. Key initiatives include AI-based tutoring software for individual/collaborative learning (e.g., middle-school math equation solving), tools supporting self-regulated learning (help-seeking, self-assessment), teacher orchestration dashboards, and browser-based authoring tools like CTAT/Tutorshop that lower development barriers for intelligent tutoring systems. Current projects investigate smartphone-based homework solutions, gamified tutoring interfaces, and comparative effectiveness against platforms like Khan Academy. Scientific Awards: No specific awards mentioned in source materials. Professor Aleven advises graduate students including Kexin Bella Yang and Conrad Borchers. His research is supported by multiple grants, notably a $2M award for testing AI-based mobile tutoring software in underserved middle-school contexts. Major projects encompass: MEME Project : Boosting math outcomes through motivation and self-regulation Metacognition and Motivation : Pittsburgh Science of Learning Center initiative Rapid Tutor Development : Streamlining cognitive model creation Learning-Oriented Dialogue : Enhancing engagement via collaborative problem-solving The CATS Lab operates through deep collaboration with teachers and students in real classrooms, currently exploring how smartphone accessibility, targeted tutor redesign, and parental involvement optimize homework effectiveness. Future directions address AI support for tutors/parents, balancing self-regulatory development with domain learning, and democratizing tutor authoring for educators.
Yuriy Rogovchenko is a Professor in the Department of Mathematical Sciences at the University of Agder. His research spans differential equations, mathematical modeling, and education innovation, with applications in biology, social sciences, and engineering. Rogovchenko has contributed extensively to mathematics education through projects like PLATINUM (Erasmus+ Strategic Partnership) and CPEA-ST-2019/10067 (Eurasia project). PhD in differential equations (Institute of Mathematics, Kyiv, 1987) Regular Associate at Abdus Salam ICTP, Trieste (2004-2011) Editor for 11 international journals Referee for over 70 journals Research Interests: Qualitative theory of differential equations, perturbation methods, mathematical modeling in interdisciplinary contexts. He focuses on enhancing conceptual understanding through inquiry-based learning and nonstandard problems. Publications: Recent works include advancements in linear system observability, parameter identification methods, and educational studies on exact differential equations. His collaborations with Svitlana Rogovchenko and Matthias Pätzold highlight applications in engineering and biology. Awards: Sørlandet kompetansefonds research award (2016).
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) .
Zongyi Li is a Research Fellow at Massachusetts Institute of Technology , hosted by Kaiming He. They are currently pursuing a Ph.D. in Computing and Mathematical Sciences at Caltech (2019-2025), mentored by Anima Anandkumar and Andrew Stuart. Ph.D. candidate: Computing and Mathematical Sciences, Caltech (2019-2025) B.Sc. in Computer Science and Mathematics with a Jazz minor from Washington University in St. Louis (2015-2019) They focus on Neural Operators for learning solution operators in Partial Differential Equations (PDEs) , particularly in fluid mechanics and earth science . Their work models physical simulations with chaotic behaviors and complex geometries, showing applications in weather forecasting , carbon storage , and aerodynamics simulation . Publications emphasize resolution-invariant models , chaotic systems , and zero-shot super-resolution capabilities. Their research combines Fourier analysis , graph networks , and physics-informed loss functions to achieve state-of-the-art performance in PDE solving with up to 1000x speedup over traditional solvers. Fellowships: Kortschak Scholarship PIMCO Fellowship Amazon AI4Science Fellowship Nvidia Fellowship MIT Novo Nordisk AI Fellowship Code & Open-Source: Co-developer of the NeuralOperator library Implementations for Fourier Neural Operators , Graph Neural Operators , and Tensorized Neural Operators Media Recognition: Quanta Magazine MIT Tech Review NVIDIA Features Towards Data Science
Quanquan C. Liu is an Assistant Professor in the Department of Computer Science at Yale University, part of the School of Engineering & Applied Science. His research focuses on algorithms for large data, dynamic/distributed/parallel graph algorithms, and differential privacy. He holds a PhD from MIT's Theory Group, advised by Erik Demaine and Julian Shun, with postdoctoral experience at Northwestern University and MIT. Liu has authored over 50 publications in top venues like FOCS, SPAA, and STACS, and received a Best Paper Award at SPAA 2022. He advises a team of 12+ students, including PhD and undergraduate researchers. His service roles include PC membership for PPoPP, ESA, and SPAA, and coaching for the USA Computing Olympiad (USACO) and ICPC teams. Notable research contributions include advancements in parallel algorithms for graph problems and privacy-preserving techniques.
Anna Gottard is an Associate Professor of Statistics at the University of Florence, where she leads the Department of Statistics, Computer Science, and Applications. She directs the Florence Center for Data Science (FDS) and participates in the Technical Scientific Committee of the Tuscan Center for Big Data, Data Science, and AI (CBDAI). Her research focuses on multivariate statistical models, particularly graphical models, and extends to statistical machine learning, fair models, and directional data analysis. She is an Associate Editor for the Journal of the Royal Statistical Society Series A (JRSSA) and Statistical Methods & Applications (SMA). Her recent work includes Bayesian approaches for mixed graphical models, uncertainty-aware classification trees, and methodological advancements in latent uncertainty models. Her contributions span theoretical developments and applied research in interdisciplinary areas like biostatistics and sustainability. Her research interests emphasize bridging statistical theory with practical applications, including fairness in machine learning, interpretable models, and tree-based methodologies. She has actively contributed to open-source software, notably the Mix3Trees R package for mixed-effect tree models. Her work addresses challenges in variable selection, graphical model inference, and ethical AI practices. Current projects explore Bayesian frameworks for complex data structures and methodological improvements in graphical model interpretability. Anna has advised on interdisciplinary collaborations, such as studies on GDPR compliance in biobanking and epidemiological modeling of the SARS-CoV-2 pandemic in Tuscany. She collaborates with institutions like the CBDAI to advance data science applications in regional policy and healthcare. Her research trajectory reflects a commitment to both foundational statistical theory and real-world problem-solving across diverse domains.
Hrvoje Jasak is a Professor of Continuum Physics at the Department of Physics (Cavendish Laboratory), University of Cambridge. He holds a fellowship at Christ’s College. His academic journey includes a BSc in Mechanical Engineering from the University of Zagreb (1992) and a PhD in CFD from Imperial College London (1996). Prior to academia, he held engineering roles at CD-adapco (now Siemens PLM), Nabla Ltd, and Ansys-Fluent Inc., contributing to CFD software development. His research focuses on numerical simulation methods, continuum physics, multiphase flows, naval hydrodynamics, and software development. He co-created OpenFOAM, chairs its Numerics Technical Committee, and leads the Computational Continuum Mechanics (CCM) research group within the Laboratory for Scientific Computing. His work integrates advanced numerical techniques like the partially rotating grid method, finite volume algorithms, and multiphysics coupling frameworks. Jasak is a seasoned developer with 25+ years of C++ expertise, having authored ~1 million lines of code. His group’s projects include the Naval Hydro Pack , fluid-structure interaction solvers, and the Eulerian multi-fluid model for dense sprays. He actively collaborates on international initiatives like the NUMAP-FOAM Summer School and the OpenFOAM community. His teaching spans MPhil programs, PhD supervision, and specialized CFD courses. Current research explores wave-ice interaction, lubricated contact modeling, and open-source software innovation. The CCM group’s work bridges academia and industry, addressing challenges in marine engineering, energy systems, and computational mechanics.
Joan Bruna is a Full Professor of Computer Science, Data Science, and affiliated Mathematics at New York University's Courant Institute and Center for Data Science. He leads the CILVR group and co-founded the MaD group. His research focuses on mathematical foundations of machine learning, deep learning, signal processing, and their applications in computational science, climate modeling, and geophysics. He holds a Ph.D. in Applied Mathematics from École Polytechnique and has held roles at UC Berkeley, the Institute for Advanced Study, and the Flatiron Institute. Education: Ph.D. (2013) and M.Sc. (2005) in Applied Mathematics, École Polytechnique and ENS Cachan; dual B.Sc./M.Sc. in Telecommunications and Mathematics from UPC Barcelona (2002–2004). Awards include the NSF CAREER Award (2019) and Alfred P. Sloan Fellowship (2018). Research interests span theoretical aspects of deep learning, optimization, and statistical methods, with applications to climate science and inverse problems. He has advised numerous PhD students and postdocs, contributing to seminal work on scattering networks, geometric deep learning, and neural ODEs. Professional service includes editorial roles at TMLR, JMLR, and TPAMI, plus program chairs for major conferences. His work bridges mathematics and machine learning, emphasizing rigorous analysis and real-world impact.
Tengyu Ma is an Assistant Professor of Computer Science at Stanford University. His research focuses on machine learning, deep learning, optimization, and theoretical computer science. He is particularly known for work on neural networks, reinforcement learning, and algorithmic guarantees in AI systems. His email is tengyuma@stanford.edu . Ma's research interests span foundational aspects of machine learning, including generalization theory, optimization algorithms, and the theoretical underpinnings of deep learning. He has contributed to areas such as self-play theorem provers, learning rate schedules, and robustness in low-light vision tasks. His work often bridges theoretical insights with practical algorithm design. His recent publications emphasize advancements in large language models (LLMs), theorem proving via self-play, and understanding training dynamics in deep networks. Despite prolific output, no specific scientific awards are explicitly mentioned in the provided texts. Ongoing work includes exploring in-context learning mechanisms, formal verification of AI systems, and efficient pretraining techniques. His research has implications for both theoretical understanding and real-world applications of AI.
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).
Stefano NASINI is an Associate Professor at the University of Lille 3, specializing in Quantitative Methods within the Economics and Mathematics Sciences. He holds a HDR (Habilitation à Diriger des Recherches) from the University of Lille 3 (2021), a Ph.D. in Statistics and Operations Research from the Polytechnic University of Catalonia (2015), and a Master in Statistics (2011). His research focuses on optimization, complex networks, statistical inference, and microeconomic applications. He has held academic positions including a post-doctoral role at IESE Business School (2014–2016) and a visiting researcher role at the University of Lisbon (2014). His work spans scheduling optimization, network analysis, financial contagion modeling, and energy system planning. Key contributions include specialized algorithms for large-scale optimization problems and frameworks for decentralized portfolio management. He is a member of the LEM research group and teaches courses in optimization, econometrics, and social network analysis at the Grande École and MSc levels. Publications highlight interdisciplinary applications, including network-based diffusion models, multi-market financial strategies, and dynamic choice analysis. His research bridges theoretical advancements in operations research with practical challenges in economics, energy, and transportation systems. No scientific awards are explicitly listed in the provided materials. His advising roles and grants are not detailed here, but his extensive publication record reflects active collaboration within academic and applied domains.
Allan Larsen is a Professor and Deputy Head of Division at the Department of Technology, Management and Economics (DTU Management) at the Technical University of Denmark. He heads the Operations and Supply Chain Management Section. His academic background includes an MSc in Applied Mathematics and a PhD in Operations Research, both from DTU. He teaches courses in Operations Management and Simulation at both undergraduate and graduate levels. Research Focus: His work applies operations research methodologies to complex planning problems in supply chain management, logistics, healthcare operations, and public transport. Key areas include urban freight transport, healthcare supply chains, and optimization of public transport resources like crew and fleets. Collaborations with industries, especially in freight transport, have been extensive. He previously co-directed the Transport DTU research center and co-chaired Denmark’s Transport Innovation Network. Education: MSc in Applied Mathematics (1989–1995), PhD in Operations Research (1997–1999), both from DTU. Recognition: Recipient of the Hedorf’s transportpris award in 2022 for contributions to transport research. Research Projects: Supervises multiple PhD students (e.g., on electric freight transport, healthcare resource optimization, and Industry 4.0 applications). Active in projects like 'Pioneering Electric Heavy-Duty Freight Transport' and 'Resource optimization in healthcare.' Labs/Teams: Leads the Operations and Supply Chain Management research group and collaborates in initiatives like the Transport Innovation Network, focusing on sustainable transport solutions.
Amit Kumar is the Jaswinder and Tarwinder Chadha Chair Professor in the Department of Computer Science and Engineering at IIT Delhi. His research focuses on combinatorial optimization, online algorithms, and algorithmic fairness. He has taught courses such as Approximation Algorithms (COL 754), Design and Analysis of Algorithms (COL 351), and Numerical Analysis (COL 726). His work spans theoretical computer science with applications to clustering, scheduling, and fairness in evaluation processes. Research Interests Kumar's research emphasizes developing efficient algorithms for online and dynamic settings, particularly in constrained optimization and biased evaluation systems. He explores theoretical foundations of clustering, load balancing, and resource allocation, with recent contributions to fair food delivery systems and coreset constructions. Publications His recent work includes advancements in online convex paging (STOC 2025), consensus clustering (SODA 2025), and fairness-aware algorithms (AAAI 2024). Over 70 papers across top venues like STOC, SODA, and ICML reflect his expertise in algorithm design and analysis. Awards Best Paper Award at ISAAC 2023 for 'Clustering What Matters in Constrained Settings' Teaching & Mentorship Kumar instructs graduate and undergraduate courses in algorithms, data structures, and numerical methods. He advises students through these courses and collaborates with researchers on NSF-funded projects related to approximation algorithms and streaming systems.
Mohsen Ghaffari is an Associate Professor at MIT's Department of Electrical Engineering and Computer Science (EECS), holding the Steven and Renee Finn Chair. His research focuses on theoretical computer science, particularly distributed and parallel algorithms, graph theory, and network optimization. Formerly, he was a tenured CS faculty member at ETH Zurich until 2022. PhD in Computer Science from MIT (2016) His research interests include distributed algorithms, parallel computing, graph decomposition, and network congestion management. His recent work addresses coreness decomposition, spanner construction, and Euclidean k-center optimization in massive parallel computation frameworks. Notable scientific awards include the ACM Doctoral Dissertation Award (Honorable Mention), ACM-EATCS Doctoral Dissertation Award, and multiple best paper awards at FOCS, PODC, and SODA. He has advised numerous PhD and Master's students, many of whom have transitioned to academic and industry roles. He has taught courses at MIT and ETH Zurich on distributed algorithms, advanced algorithms, and massively parallel computation. His professional activities include serving on program committees for SODA, FOCS, STOC, and organizing workshops like Highlights of Algorithms (HALG) and Workshop on Local Algorithms (WOLA).
