Dr. Christopher M. Wolverton is a Professor of Materials Science and Engineering at Northwestern University , where he leads the Wolverton Research Group . His work focuses on computational materials science with applications in energy sustainability , particularly in batteries , hydrogen storage , and thermoelectrics . PhD in Physics from University of California, Berkeley BS in Physics (summa cum laude) from University of Texas, Austin His research leverages first-principles quantum mechanical simulations and machine learning to enable virtual materials synthesis before laboratory testing. The group specializes in hybrid computational methods integrating Density Functional Theory (DFT) , Monte Carlo simulations , and phase-field microstructural models . The article portfolio shows leadership in energy storage materials , with recent work on data-driven nanoparticle facet control , mixed-anion semiconductors , and machine learning-accelerated discovery . Publications span top journals including Nature Energy , Nature Materials , and Science . 2006 Ford Motor Company Technical Achievement Award 2005 Ford Patent & Publication Awards 2003 Ford Environmental/Physical Sciences Recognition As advisor to PhD candidates Zhenpeng Yao , Shiqiang Hao , and Shane Patel , he fosters interdisciplinary research connecting materials informatics with experimental validation . The group maintains active collaborations with Argonne National Lab and MIT/Harvard teams.
Vladimir Spokoiny is a Professor at the Departments of Mathematics and Economics of the Humboldt University of Berlin and Head of the Research Group "Stochastic Algorithms and Nonparametric Statistics" at the Weierstrass Institute for Applied Analysis and Stochastics (WIAS) in Berlin, Germany. His research spans multiple areas of statistics, machine learning, and financial mathematics, with significant contributions to nonparametric statistics, high-dimensional data analysis, and statistical methods in finance. Spokoiny received his M.Sc. in applied mathematics from the Moscow Institute of Railway Engineering in 1981 and his Ph.D. in mathematics from Lomonosov Moscow State University in 1988. He completed his Habilitation at Humboldt University in 1996. His academic career includes positions at the All-Union Institute of Railway Transport in Moscow, the Institute for Information Transmission Problems in Moscow, and the Institute for Applied Analysis and Statistics in Berlin before joining the Weierstrass Institute and Humboldt University where he has been a professor since 2002. Spokoiny's research focuses on adaptive nonparametric smoothing and hypothesis testing, high dimensional data analysis, statistical methods in finance, image analysis with applications to medicine, classification, and nonlinear time series. His work often addresses the challenges of nonstationarity in time series data and develops innovative methods for volatility estimation and risk management. He has made significant contributions to the development of adaptive weights smoothing procedures, which have applications in image processing, community detection, and manifold learning. His recent work has expanded into high-dimensional statistics, Bayesian inference, and optimization methods for machine learning, with publications demonstrating novel approaches to Gaussian approximation, Laplace methods, and statistical inference in non-Euclidean spaces. Spokoiny has supervised numerous PhD students including Oliver Reiss, Danilo Mercurio, Ying Chen, Elmar Diederichs, and Mstislav Elagin, whose research has focused on mathematical finance, time series analysis, and statistical methods. He serves as an Associate Editor for The Annals of Statistics (since 2004) and Statistics and Decisions (since 2002), and has previously served on the editorial board of the Journal of Statistical Planning and Inference. His professional activities include reviewing for major statistical journals including Annals of Statistics, Bernoulli, Econometrica, and Journal of American Statistical Association, as well as reviewing grant proposals for the National Science Foundation (USA), German Research Foundation, and Netherlands Organisation for Scientific Research. Spokoiny is a member of several professional societies including the International Statistical Institute, American Statistical Association, Institute of Mathematical Statistics, and Bernoulli Society. He is fluent in Russian (mother tongue), English, and German, and has good knowledge of French. His research group at WIAS focuses on developing novel statistical methodologies with applications across various scientific domains, particularly emphasizing adaptivity and robustness in complex data environments. The group's work has significant implications for financial risk management, medical imaging, and machine learning applications, with recent publications addressing fundamental questions in high-dimensional statistics and nonparametric inference.
Sergei Gukov is the John D. MacArthur Professor of Theoretical Physics and Mathematics at the California Institute of Technology (Caltech), where he has been a faculty member since 2005. He serves in the Division of Physics, Mathematics and Astronomy, with primary affiliation in the Department of Mathematics. His research bridges the fields of mathematics and theoretical physics, focusing on deep connections between geometry, topology, and quantum field theory. Gukov received his B.S. from Moscow Institute of Physics and Technology in 1997, followed by an M.S. and Ph.D. from Princeton University in 2001. He joined Caltech as an Associate Professor in 2005, was promoted to Professor in 2007, and was named the John D. MacArthur Professor in 2021. His research spans several interconnected areas at the frontier of mathematics and physics. A central theme is the exploration of quantum topology and its connections to mathematical physics. He has made significant contributions to the geometric Langlands program, gauge theory, and the categorification of knot and 3-manifold invariants. His recent work increasingly incorporates machine learning approaches to mathematical problems, reflecting his interest in the intersection of traditional mathematical research and modern computational techniques. Gukov's work often reveals deep connections between seemingly disparate areas of mathematics and physics, such as the relationship between Rozansky-Witten geometry and Coulomb branches in supersymmetric gauge theories. Gukov's publications demonstrate a consistent focus on the mathematical structures underlying quantum field theories and their topological implications. His recent work shows an increasing emphasis on computational approaches to mathematical problems, particularly through his interest in mathematics and machine learning. The recurring themes across his research include the application of physical insights to solve mathematical problems and the discovery of new mathematical structures through physical reasoning. He serves on the editorial boards of several prestigious journals including the Journal of Knot Theory and Its Ramifications, Communications in Mathematical Physics, and Letters in Mathematical Physics. Gukov is also active in the academic community, having delivered plenary talks at major conferences such as the First International Congress of Basic Science and presenting at String Math 2023 on the potential impact of AI on mathematical research. Gukov teaches Ma 146 ab, Introduction to Knot Theory and Quantum Topology, a course that reflects his research interests. He also runs a seminar on Mathematics and Machine Learning, held Tuesdays from 2-3pm in East Bridge Conference room 114, demonstrating his commitment to fostering interdisciplinary research at the intersection of mathematics and computational methods.
Michael Muehlebach leads the independent Learning and Dynamical Systems research group at the Max Planck Institute for Intelligent Systems in Tuebingen, Germany. His interdisciplinary work bridges machine learning, dynamical systems theory, and control engineering to develop algorithms for cyber-physical systems with theoretical guarantees and practical implementations. Dr. Muehlebach received his B.Sc. and M.Sc. in Mechanical Engineering from ETH Zurich in 2010 and 2013, specializing in robotics and control systems. He completed his Ph.D. at ETH's Institute for Dynamic Systems and Control under Prof. R. D'Andrea in 2018, followed by postdoctoral research with Prof. Michael I. Jordan at UC Berkeley. His research focuses on constrained optimization, reinforcement learning, and control theory with applications in robotics. He pioneered approaches that express constraints in terms of velocities rather than positions, enabling more efficient optimization algorithms. His work spans theoretical foundations to physical implementations, including the One-Wheel Cubli balancing robot and electromagnetic navigation systems. Recent publications reveal a strong trend toward physics-informed machine learning, particularly for robotics applications requiring real-time performance and safety guarantees. Dr. Muehlebach has received numerous prestigious awards: Outstanding D-MAVT Bachelor Award Willi-Studer prize for best Master's degree ETH Medal and HILTI prize for doctoral thesis Branco Weiss Fellowship (2018) Emmy Noether Fellowship (2020) Amazon Fellowship (2024) He actively mentors doctoral researchers including Hao Ma, Melis Ilayda Bal, and Onno Eberhard, with research supported by multiple grants. His group maintains strong collaborations with Bernhard Schölkopf's Empirical Inference group at the Max Planck Institute. The Learning and Dynamical Systems group develops innovative hardware and software platforms, including Floaty (a wind-harnessing flying robot), advanced electromagnetic navigation systems, and data-efficient learning methods for robotic table tennis. Their approach combines rigorous theoretical analysis with practical validation on physical systems, emphasizing the integration of known physical structure into machine learning algorithms to improve sample efficiency and ensure generalization.
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.
Cezary Kaliszyk is a Professor in Theoretical Computer Science at the University of Melbourne, previously affiliated with the University of Innsbruck. He is actively involved in research and leadership in formal methods, automated reasoning, and machine learning for theorem proving. Research Interests: Automated Reasoning and Interactive Theorem Proving Formalized Mathematics and Proof Automation Machine Learning for Logic and Theorem Proving Integration of AI with Proof Assistants (Coq, Isabelle) Dependent Type Theory and Higher-Order Logic His recent publications (2023–2025) span topics in dependently-typed logic, learning for proof guidance, formalization of surreal numbers, and blockchain-based formal methods. The works consistently bridge formal logic with machine learning, emphasizing automation, explainability, and cross-system integration. Scientific Leadership and Projects: Principal Investigator, ERC project FormalWeb3 Lead Developer, CoqHammer , Tactician , ProofWeb WG5 Leader, COST Action EuroProofNet (until 2024) Contributor to HOL(y)Hammer , Isabelle Enigma He supervises multiple PhD students and has mentored several graduates in formal methods and AI. He teaches courses in theoretical computer science, logic, and machine learning. There are no listed awards in the provided data, but his extensive publication record and project leadership indicate significant recognition in the field. Labs and Research Groups: He leads a research group focused on formal methods and learning-based reasoning, collaborating internationally on projects involving proof automation, formal libraries, and semantic technologies.
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.
Michael Mühlebach is a Research Group Leader at the Max Planck Institute for Intelligent Systems in Tübingen, Germany, leading the independent Learning and Dynamical Systems group. His academic journey began at ETH Zurich where he earned his B.Sc. (2010) and M.Sc. (2013) in mechanical engineering, specializing in robotics, systems, and control. He completed his Ph.D. at ETH Zurich in 2018 under Prof. R. D'Andrea, followed by postdoctoral research at UC Berkeley with Prof. Michael I. Jordan. Dr. Mühlebach's research spans machine learning, dynamical systems, control theory, and optimization . His work bridges theoretical foundations with practical applications in robotics, developing methods that incorporate physical constraints and system dynamics into learning frameworks. His group focuses on online learning, physics-informed machine learning, and large-scale optimization for cyber-physical systems, with applications in electromagnetic navigation, robotic table tennis, and energy-efficient flight systems like the shape-changing robot Floaty . His publication record shows a strong focus on constrained optimization, with recent work exploring decision-dependent stochastic optimization, nonlinear feedback, and the theoretical foundations of reinforcement learning. His research integrates perspectives from control theory, dynamical systems, and optimization to develop algorithms with strong theoretical guarantees and practical performance. Outstanding D-MAVT Bachelor Award Willi-Studer prize for best Master's degree ETH Medal and HILTI prize for doctoral thesis Branco Weiss Fellow (2018) Emmy Noether Fellowship (2020) Amazon Fellowship (2024) Dr. Mühlebach actively mentors doctoral researchers and is seeking talented students for PhD and Master's projects. His research group has received funding from multiple prestigious fellowships and maintains collaborations across institutions including ETH Zurich, UC Berkeley, and various Max Planck research units. The group's work spans theoretical developments to practical implementations on robotic systems, demonstrating strong connections between mathematical theory and physical realization.
Arkadi Nemirovski is the John P. Hunter, Jr. Chair and Professor at the H. Milton Stewart School of Industrial and Systems Engineering, Georgia Tech. He holds a Ph.D. in Mathematics (1974) from Moscow State University, a Doctor of Sciences in Mathematics (1990) from the USSR Supreme Attestation Board, and an honorary Doctor of Mathematics from the University of Waterloo (2009). Ph.D. in Mathematics, Moscow State University (1974) Doctor of Sciences in Mathematics, USSR Supreme Attestation Board (1990) Doctor of Mathematics (Honoris Causa), University of Waterloo (2009) His research focuses on Optimization Theory and Algorithms , with emphasis on complexity analysis, efficient methods for nonlinear convex programs, robust optimization, optimization under uncertainty, and applications in engineering and nonparametric statistics. He has pioneered advancements in interior-point methods, semidefinite programming, and stochastic approximation, shaping modern convex optimization. His article trends highlight a trajectory from foundational interior-point algorithms (1990s) to robust optimization (2000s) and recent works on first-order methods, polyhedral estimates, and applications in machine learning, signal processing, and tomography. Key subfields include matrix norms , large-scale optimization , and stochastic uncertainty handling . Scientific awards include: 1982 Fulkerson Prize (joint with L. Khachiyan and D. Yudin) 1991 Dantzig Prize (joint with M. Grotschel) 2003 John von Neumann Theory Prize (joint with M. Todd) 2017 Member, National Academy of Engineering 2018 Fellow, American Academy of Arts and Sciences 2020 Norbert Wiener Prize (joint with M. Berger) He has supervised students like Dmitry Gabelev (polynomial-time cutting plane algorithms), Daureen Steinberg (matrix norms in robust optimization), and Eitan Rubinstein (SVMs via advanced optimization), with their works later formalized in academic journals.
Kord Eickmeyer is a Lecturer at Technische Universität Darmstadt in the Department of Mathematics, specializing in the mathematical logic group. He holds a PhD in mathematics from Humboldt University Berlin and has held postdoctoral positions at TU Darmstadt (2011–2017) and the National Institute of Informatics in Tokyo (2011–2013). His research focuses on finite model theory, graph structure theory, and computational complexity, particularly in descriptive and parameterized complexity, as well as randomization and derandomization techniques. Research interests include exploring the boundaries of computational complexity through logical frameworks, analyzing graph structures for efficient algorithm design, and investigating the role of randomness in computation. His work bridges theoretical computer science and mathematical logic, with applications in algorithm design and formal methods. Publications span topics from model-checking on ordered structures to gap-planar graphs and randomized logics. Collaborations include prominent institutions like the National Institute of Informatics and Humboldt University Berlin. No scientific awards are explicitly listed, but his extensive academic contributions reflect a strong research trajectory. Advising and grants are not detailed in the provided text, though his academic career includes supervision roles during his PhD and postdoctoral phases. His involvement with the mathematical logic group at TU Darmstadt highlights collaborative research efforts in foundational areas of computer science and mathematics.
David Patterson is an Associate Professor in the Department of Physics at the University of California Santa Barbara (UCSB). His research focuses on extending atomic, molecular, and optical (AMO) physics tools to prepare polyatomic molecules in single quantum states for the first time. Key areas of interest include quantum information systems, high precision spectroscopy, parity violation in molecular spectra, and single-molecule chemical/chiral analysis. Developed single molecule inelastic recoil spectroscopy for ultraprecise analysis Created non-destructive single molecule infrared spectroscopy (2022 breakthrough) Engineered a "ping-pong" double-well ion trap for Sr+ atoms and molecular ions Collaborates with the Schlemmer group (Cologne) on Doppler-limited spectroscopy The group's work aims to achieve unprecedented resolution (2-3 orders of magnitude improvement) in polyatomic molecule spectroscopy, addressing fundamental questions in nanoanalytics.
Randy Freeman is a Professor of Electrical and Computer Engineering at Northwestern University's McCormick School of Engineering. He joined the university in 1996 after earning his Ph.D. from the University of California, Santa Barbara. His research focuses on nonlinear control theory, robust control, multi-agent systems, and distributed control systems. Freeman has been recognized with the NSF CAREER Award (1997) and has held editorial roles in prominent journals like the IEEE Transactions on Automatic Control. Education: Ph.D., Electrical Engineering, University of California, Santa Barbara (1996) M.S., Electrical Engineering, University of Illinois at Urbana-Champaign B.S., Electrical Engineering, Cornell University His research explores advanced control strategies for complex systems, including nonlinear feedback systems, distributed averaging, and multi-agent coordination. Key contributions include work on self-healing swarm control, distributed environmental monitoring, and privacy-preserving consensus algorithms. His publications span journals like IEEE Transactions on Robotics and IEEE Control Systems Letters . Scientific Awards: NSF CAREER Award (1997) Advising and Grants: Freeman has contributed to collaborative robotics projects and sensor network research, supported by grants from NSF and other agencies. His work bridges theoretical control systems with practical applications like robotics and environmental monitoring. Labs and Teams: Affiliated with the Master of Science in Robotics Program and collaborates on multi-agent systems and distributed control initiatives.
El Mahdi Chayti is a doctoral researcher at the École Polytechnique Fédérale de Lausanne (EPFL), affiliated with the School of Computer and Communication Sciences and the Department of Computer Science. He works under the Machine Learning and Optimization (MLO) lab, focusing on advanced optimization techniques and machine learning theory. Contact: el-mahdi.chayti@epfl.ch . Current Roles: Doctoral Assistant and PhD Student in Computer and Communication Sciences Research Interests: Machine Learning, Optimization Algorithms, Meta-learning, Second-order Optimization, Energy Forecasting His publications highlight expertise in stochastic and cubic Newton methods, hybrid deep learning models, and personalized collaborative learning. Recent works include Improving Stochastic Cubic Newton with Momentum (2025) and Hybridization of Deep Learning with Physical Knowledge for Energy Forecasting (2019) . Key trends in his research span optimization efficiency , meta-learning frameworks , and integration of domain knowledge into AI models. He emphasizes theoretical guarantees and practical scalability in algorithm design.
Professor Katrin Tent is a distinguished mathematician specializing in mathematical logic at the University of Münster, where she holds a professorship in the Faculty of Mathematics and Computer Science within the Institute for Mathematical Logic and Foundations Research. She is an active researcher in Mathematics Münster, an investigator in CRC 1442 Geometry: Deformations and Rigidity, and contributes to multiple research projects including Topics in Mathematics Münster T3: Models and universes, T4: Groups and actions, and T8: Random discrete structures and their limits. PhD in Linguistics, Christian-Albrechts-Universität zu Kiel (1988) Diplom in Mathematics, Christian-Albrechts-Universität zu Kiel (1989) PhD in Mathematics, University of Notre Dame (1994) Habilitation, "Model theory of groups and BN-pairs" (2000) Professor Tent's research bridges model theory, group theory, and geometry, with particular focus on finite Morley rank structures, BN-pairs, and sharply multiply transitive groups. Her work often combines methods from these areas to prove unexpected results, either constructing groups or incidence geometries with surprising model theoretic properties or using model theory to construct new and interesting geometries or groups. Her recent publications reveal a consistent trajectory connecting model theory with group-theoretic structures. She has made significant contributions to understanding sharply 2- and 3-transitive groups, finite Morley rank geometries, and the model theory of generalized polygons. Her work demonstrates how model-theoretic techniques can solve deep problems in group theory and geometry, particularly through the study of BN-pairs and incidence structures. DFG Research Fellowship (1996-1998) Bayerischer Habilitationsförderpreis (1998-2001) Heisenberg-Stipendium (2001-2004) ERC Consolidator Grants expert panel (2016, 2018) Elected to DFG Senate (2019) Professor Tent leads an active research group with current members including Marco Amelio, Dr. Benjamin Brück, Anna Cascioli, Lukas Jonuska, Silke Meissner, Zahra Mohammadi Khangheshlaghi, and Dr. Sam Shepherd. Her former research group members include Dr. Simon Andre, Dr. Isabel Müller, and Dr. Tim Clausen, among others. Her supervisory work spans both theoretical foundations and specific applications in geometric group theory and model theory. Her research group operates within the Institute for Mathematical Logic and Foundations Research at the University of Münster, collaborating closely with other researchers in the Mathematics Münster cluster. The group participates in various projects including CRC 1442 - C04: Group theoretic aspects of negative curvature, contributing to the vibrant mathematical research environment at one of Germany's leading mathematics institutions.
Hector Geffner is an Alexander von Humboldt Professor at RWTH Aachen University, leading the Chair of Machine Learning and Reasoning. He specializes in automated planning, machine learning, and reasoning, with a focus on representation learning for acting and planning. His work bridges symbolic and model-based AI, emphasizing general policies and subgoal decomposition. Education & Background : PhD from UCLA (1989), prior roles at IBM Watson Research Center and Universidad Simón Bolívar. Former ICREA researcher and professor at Universitat Pompeu Fabra (2001–2022). Research Interests : Classical and probabilistic planning, reinforcement learning, knowledge representation, and applications in robotics. His ERC-funded RLeap project explores learning generalized policies and symbolic representations for effective decision-making. Teaching : Courses include 'Actions and Planning in AI' and 'Social and Technological Change', emphasizing interdisciplinary AI applications. Awards & Recognition : Alexander von Humboldt Professorship (2023), AAAI/EurAI Fellowships, and editor of influential works on Judea Pearl’s contributions to AI. Grants & Projects : Advanced ERC grant (2020–2025), Humboldt Foundation support, and RWTH funding for research on planning and reasoning. Labs & Teams : Heads the Chair of Machine Learning and Reasoning at RWTH, focusing on interdisciplinary research in AI, robotics, and planning algorithms.
