Gilles Delmaire is an Associate Professor specializing in signal processing, hyperspectral imaging, and environmental science. His research spans topics like super-resolution hyperspectral multisensor fusion , tensor decomposition , and butterfly species classification using advanced computational methods. Key research areas: Signal Processing, Remote Sensing, Environmental Science, and Machine Learning. Recent work focuses on hyperspectral data restoration , insect tracking algorithms , and air quality analysis in Mediterranean regions. Collaborations include institutions in France, Greece, Portugal, and Cyprus, with publications in IEEE, Pattern Analysis and Applications, and Science of the Total Environment.
Yuchen Zhou is an Assistant Professor in the Department of Statistics at the University of Illinois. His research focuses on high-dimensional statistics, tensor methods, and optimization, with applications in data analysis and machine learning. He has contributed to advancements in areas such as heteroskedastic PCA, low-rank tensor inference, and sparse group lasso regularization. His work emphasizes statistical theory and methodology, addressing challenges in high-dimensional data structures and computational efficiency. Collaborations and research outputs highlight interests in matrix and tensor decomposition, regularization techniques, and non-asymptotic analysis. Zhou's publications span reputable journals like the Annals of Statistics and IEEE Transactions on Information Theory, reflecting his expertise in both theoretical and applied statistical problems. He has no listed academic awards or current advisees.
Joshua Agterberg is an Assistant Professor in the Department of Statistics at the University of Illinois, College of Liberal Arts & Sciences. His research focuses on high-dimensional statistics, matrix and tensor analysis, nonconvex optimization, and statistical network analysis. He holds a B.S. in Actuarial Science and Mathematics from the University of Wisconsin-Madison, followed by M.S. and Ph.D. degrees in Statistics from Johns Hopkins University. After a postdoctoral fellowship at the University of Pennsylvania, he returned to the Midwest to join UIUC. Education: Bachelor of Science in Actuarial Science and Mathematics, University of Wisconsin-Madison Master of Science in Statistics, Johns Hopkins University Doctor of Philosophy in Statistics, Johns Hopkins University Research Interests: His work bridges theoretical foundations and practical applications, addressing problems in nonconvex matrix sensing, multilayer network analysis, and statistical-computational gaps. He aims to develop methodologies for analyzing complex data structures, particularly in neuroscience, sociology, and engineering. Recent projects include advancing spectral methods, nonconvex optimization, and hypothesis testing frameworks for networks. Teaching Philosophy: Agterberg emphasizes statistical intuition over formulaic approaches, encouraging students to tackle problems from first principles. He teaches courses on theoretical statistics and hopes to develop a high-dimensional statistics curriculum for PhD students. Future Goals: He seeks to create a principled pipeline for network data analysis and to enhance understanding of machine learning algorithms' theoretical underpinnings. Collaborations include work on dynamic networks and statistical methodologies for connectomics.
Anna Ma is an Assistant Professor in the Department of Mathematics at the University of California, Irvine (UCI). Her research focuses on optimization, computational mathematics, and algorithm design with applications to inverse problems, signal processing, and high-dimensional data analysis. Key research interests include iterative algorithms (e.g., randomized Kaczmarz methods), tensor recovery, stochastic gradient descent, and robust recovery techniques for noisy data. Her work emphasizes algorithmic efficiency, convergence guarantees, and applications in machine learning and data science. Recent publications highlight advancements in quantile-based iterative methods, tensor linear systems, and robust low-rank recovery. These studies address challenges in handling missing data, noisy observations, and scalable solutions for large-scale systems. No scientific awards are explicitly mentioned in the provided text. Her research has been supported by grants focused on algorithm development and data-driven methodologies. Anna collaborates on projects involving multidisciplinary teams and contributes to advancing numerical methods for modern data analysis challenges.
Joel A. Tropp is the Steele Family Professor of Applied & Computational Mathematics at the California Institute of Technology (Caltech), within the Division of Engineering and Applied Science. His academic career includes roles as Assistant Professor (2007–2012), Professor (2012–2017), and Steele Family Professor (2017–present). He holds a Ph.D. in Computational Applied Mathematics from the University of Texas at Austin (2004). Tropp's research focuses on applied mathematics, machine learning, data science, numerical algorithms, and random matrix theory, with notable contributions to matching pursuit algorithms, randomized SVD methods, and matrix concentration inequalities. Education: Ph.D. in Computational & Applied Mathematics, University of Texas at Austin (2004) M.S. in Computational & Applied Mathematics, University of Texas at Austin (2001) B.S. in Mathematics and B.A. in Plan II Liberal Arts, University of Texas at Austin (1999) Research Interests: Tropp’s work bridges applied mathematics, computer science, and engineering, emphasizing rigorous, practical algorithms for linear algebra, numerical analysis, and optimization. He develops user-friendly tools for high-dimensional probability and matrix analysis, with applications in machine learning, signal processing, and data science. His recent focus includes randomized algorithms for large-scale matrix computations, kernel methods, and quantum computing. Articles Trends: His recent publications address scalable randomized algorithms for kernel matrices, eigenvalue problems, and matrix approximation. Themes include computational efficiency, theoretical guarantees, and applications in machine learning, quantum computing, and dynamical systems. Awards: 2025 Richard P. Feynman Prize for Excellence in Teaching 2024 IMS Fellow 2020 IEEE Fellow 2019 SIAM Fellow 2008 PECASE Award Advising & Grants: Tropp has advised numerous Ph.D. students and postdoctoral researchers in areas like randomized algorithms, optimization, and quantum computing. He leads grants from ONR, NSF, and Caltech’s Carver Mead Fund, focusing on large-scale kernel computations and matrix solvers. His mentorship extends to interdisciplinary collaborations in turbulence modeling and signal processing. Labs & Teams: He contributes to Caltech’s Center for Mathematics of Information (CMI) and Computational Mathematics + X (CMX) initiatives, fostering research in data science, optimization, and computational methods.
Laura Grigori is a Full Professor and Chair of High Performance Numerical Algorithms and Simulations at EPFL's School of Basic Sciences (SB) Department of Mathematics (MATH). Her research focuses on numerical linear algebra, high performance computing, and tensor computations, with applications in astrophysics and molecular simulations. She leads the HPNalgs lab and teaches courses in numerical analysis and HPC. Her awards include the SIAM Supercomputing Career Prize (2024) and SIAM Fellow distinction (2020). She advises four PhD students and has authored numerous papers on communication-avoiding algorithms, randomized methods, and parallel linear algebra techniques. Her work addresses scalability challenges in scientific computing and large-scale data analysis. Labs/Teams: HPNalgs Lab (https://www.epfl.ch/labs/hpnalgs/) Grants: ERC Synergy Grant (2019) for Extreme-scale Computational Chemistry
Lexing Ying is a Professor of Mathematics at Stanford University. His research focuses on applied mathematics, computational science, and interdisciplinary areas such as quantum computing, machine learning, and numerical analysis. He has made significant contributions to high-dimensional problems, inverse problems, and the development of efficient algorithms for complex systems. His work spans theoretical advancements and practical applications, including quantum signal processing, tensor-based numerical methods, and probabilistic modeling. Key themes in his research include the analysis of diffusion models, stochastic systems, and optimization algorithms. Recent publications highlight innovations in solving high-dimensional PDEs, improving sampling techniques, and advancing quantum algorithms. Notably, Ying has developed methods for operator learning, functional hierarchical tensors, and robust phase estimation. His research often bridges mathematical theory and computational practice, addressing challenges in areas like statistical inference and numerical simulation.
Dr. Robert Vandermeulen is a Postdoctoral Researcher at the Berlin Institute for the Foundations of Learning and Data (BIFOLD), Technical University of Berlin. His research focuses on anomaly detection, nonparametric statistics, and aligning neural networks with human cognitive processes. He holds a PhD and two Master's degrees from the University of Michigan in Electrical Engineering and Mathematics. Education: PhD in Electrical Engineering, University of Michigan (2016) MS in Mathematics, University of Michigan (2015) MS in Electrical Engineering, University of Michigan (2012) Research Interests: Deep anomaly detection in high-dimensional data Nonparametric density estimation and tensor methods Human vs. neural network alignment for interpretable AI Applications in medical imaging and explainable AI Key Research Trends: His recent work addresses challenges in anomaly detection across domains like healthcare imaging and text analysis. He explores nonparametric methods to overcome the curse of dimensionality and integrates human cognitive insights to improve neural network robustness. Contributions include novel frameworks like input Hessian regularization and VICE (Variational Inference for Concept Embeddings). Affiliations & Prior Work: Previously a postdoctoral researcher at Technische Universität Kaiserslautern, he collaborates with BIFOLD on foundational machine learning research. His work bridges theoretical statistics and applied deep learning, with a focus on interpretable and reliable AI systems. Labs & Teams: Affiliated with BIFOLD, a cross-disciplinary institute advancing learning theory and data science fundamentals at TU Berlin.
Lixin Shen is a Professor in the Department of Mathematics at Syracuse University, part of the College of Arts and Sciences. His research focuses on applied and computational harmonic analysis, optimization, imaging science, and information processing. Shen holds a Ph.D. in Mathematics from Sun Yat-Sen University (1996), an M.Sc. from Peking University (1990), and a B.Sc. from Peking University (1987). Education: Ph.D., Mathematics, Sun Yat-Sen University, 1996 M.Sc., Mathematics, Peking University, 1990 B.Sc., Mathematics, Peking University, 1987 Research Interests: Shen’s work emphasizes sparse optimization, image and signal processing, computational mathematics, and their applications. Notable areas include wavelet analysis, tensor decomposition, and robust algorithms for noise removal and high-resolution imaging. Grants & Awards: NSF Grant: Collaborative Research: Sparse Machine Learning and Sparse Optimization (2022–2025) Excellence in Graduate Education Faculty Recognition Award, Syracuse University (2024) Air Force Summer Faculty Fellowship (2024, 2023, 2021, 2020) Service & Leadership: Chair of Graduate Committee, Mathematics Department (2024–2025) Editor, Frontiers in Applied Mathematics and Statistics Organizer, SIAM Conferences on Optimization and Imaging (2023–2020) Teaching: Recent courses include Numerical Linear Algebra, Numerical Methods with Programming, Sparse Optimization, and Partial Differential Equations.
K. Selcuk Candan is a Professor of Computer Science and Engineering at Arizona State University (ASU) and Director of the Center for Assured and Scalable Data Engineering (CASCADE). He holds affiliations with multiple institutes, including the Global Futures Scientists and Scholars and the Center for Cybersecurity and Trusted Foundations. Candan has been at ASU since 1997, following his PhD from the University of Maryland. His research focuses on managing and analyzing non-traditional data types like multimedia, web, and scientific data. Key interests include scalable data processing, sensor data integration, and accessibility technologies for visually impaired individuals. He has led numerous grants from NSF, DoD, and others, resulting in over 250 peer-reviewed publications and 9 patents. Notable contributions include the DataStorm framework for coupled simulations and the OASIS system for accessible digital content. Candan has served as program chair for top conferences like SIGMOD and MM, and is an ACM Distinguished Scientist. His awards include the SIGMOD Contributions Award and Dan Jankowski Legacy Award. He has advised numerous students and led interdisciplinary projects in areas like pandemic modeling (APPEX Center) and building automation security. His work bridges theory and application, emphasizing real-world impact in healthcare, urban systems, and educational accessibility.
Nick Vannieuwenhoven is an Assistant Professor at KU Leuven, affiliated with the Department of Computer Science and the NUMA Division. He serves as the Exchange Coordinator for the Master in Mathematical Engineering and is an Associate Editor for The Electronic Journal of Linear Algebra and SIAM Journal on Applied Algebra and Geometry . His research focuses on tensor decompositions, numerical analysis, Riemannian optimization, and applications in data science. He obtained his PhD in 2015 under Professors Karl Meerbergen and Raf Vandebril, funded by the FWO (Research Foundation Flanders). His postdoctoral research (2015–2021) was also supported by FWO fellowships. His research group investigates tensor decompositions, multilinear algebra, and numerical techniques for data science, with a focus on condition number analysis and Riemannian optimization. Collaborators include experts like Carlos Beltrán, Paul Breiding, and Simon Telen. Current students include Jana Jovcheva, Bram Leys, and David Thorsteinsson, working on manifold-valued function approximation, group-invariant networks, and data-based engineering. Key awards include FWO fellowships for his PhD and postdoctoral studies. Grants include support for postdoctoral researchers via MSCA and FWO schemes. Notable projects involve Tucker compression libraries (ATC) and geometric analysis of tensor networks. His work bridges algebraic geometry, numerical analysis, and machine learning, emphasizing stability and computational efficiency.
Zheng Zhang is a Professor in the Department of Electrical and Computer Engineering at the University of California, Santa Barbara. His research focuses on neural networks, quantum computing, uncertainty quantification, and optimization, with particular emphasis on tensor networks, low-rank compression methods, and hardware-efficient machine learning systems. He leads efforts in developing memory-efficient training algorithms for large language models (LLMs), tensorized optical networks, and physics-informed neural PDE solvers. Key contributions include FLAT-LLM for LLM compression, FETTA hardware accelerators, and DeepOHeat for thermal simulation in 3D-IC design. His work spans cross-disciplinary areas such as quantum-inspired algorithms, stochastic control, and yield-aware optimization of photonic ICs. He holds a faculty position in the College of Engineering and is affiliated with the ECE department. Research trends in his 2025 publications emphasize scalable training techniques for transformers, zeroth-order optimization methods, and optical computing integration. His work consistently addresses computational efficiency, memory constraints, and hardware acceleration across domains like AI, quantum computing, and electronic design automation. Notable grants and lab affiliations include projects on FPGA-based neural training, quantum circuit simulation, and tensor-compressed PDE solvers. He advises on edge computing, neuromorphic systems, and uncertainty-aware design tools for integrated circuits.
Meng Wang is a Professor in the Department of Electrical, Computer, and Systems Engineering at Rensselaer Polytechnic Institute (RPI), where she was promoted to Full Professor in June 2025. She received her B.S. and M.S. degrees (both with honors) in Electrical Engineering from Tsinghua University, China, in 2005 and 2007, respectively, and her Ph.D. in Electrical and Computer Engineering from Cornell University in 2012. After a postdoctoral position at Duke University, she joined RPI in December 2012 as an Assistant Professor, was promoted to Associate Professor with Tenure in 2019, and then to Full Professor in 2025. Her research spans machine learning and artificial intelligence, high-dimensional data analytics, power system monitoring, signal processing, and optimization methods. She has made fundamental contributions in sparse signal recovery and monitoring and control of smart grid using high frequency data from phase measurement unit (PMU). More recently, she has collaborated with IBM to produce theoretical guarantees of modern AI architectures such as graph neural networks and transformers used in large language models (LLMs). Wang's recent publications (2023-2025) reveal a strong focus on theoretical foundations of deep learning, particularly transformer architectures and graph neural networks. Her work bridges theoretical guarantees with practical applications in power systems, demonstrating how fundamental insights in machine learning can solve real-world energy challenges. She has increasingly focused on the intersection of AI and energy systems, developing methods for building-level load forecasting, energy disaggregation, and smart grid monitoring with behind-the-meter solar integration. AFOSR Young Investigator Program (YIP) Award (2019) Army Research Office (ARO) YIP Award (2017) James M. Tien '66 Early Career Award and Grant for Faculty (2022) School of Engineering Research Excellence Award (2018) IEEE Signal Processing Society Best Reviewer Award (2018) Professor Wang has mentored numerous Ph.D. students who have gone on to successful careers in academia and industry, including HongKang Li (now postdoc at University of Pennsylvania), Yi Ming (postdoc at University of Michigan), and Shuai Zhang (Assistant Professor at New Jersey Institute of Technology). Her research has been supported by multiple grants from the National Science Foundation, Air Force Office of Scientific Research, Army Research Office, and industry partners including IBM. She is actively involved with research centers including the Center for Future Energy Systems (CFES) and the Center for Materials, Devices, and Integrated Systems (CMDIS), where her group develops cutting-edge methods for power system monitoring and control. Her recent work has increasingly focused on the theoretical foundations of large language models and their applications to energy systems, positioning her at the forefront of AI for critical infrastructure.
Yizhe Zhu is an Assistant Professor of Mathematics at the University of Southern California , specializing in theoretical and applied aspects of high-dimensional data analysis. His research bridges mathematics, computer science, and statistics, with a focus on random matrix theory, sparse data structures, and algorithmic analysis for machine learning and privacy-preserving data methods. Research Interests Yizhe Zhu’s work addresses fundamental questions in: Random Matrix Theory : Spectra of sparse and structured matrices, including outlier detection and universality. Graph and Hypergraph Analysis : Community detection, spectral properties, and non-backtracking algorithms for complex networks. Privacy and Data Synthesis : Theoretical frameworks for differentially private synthetic data generation. Tensor Completion : Efficient algorithms for recovering low-rank tensors from sparse observations. Publications Trends His recent research (2024–2025) emphasizes spectral analysis of random structures, optimization in non-convex settings, and privacy-preserving machine learning. Key themes include the interplay between sparsity, spectral theory, and algorithmic robustness in high-dimensional regimes.
Dr. Akwum Onwunta is a researcher affiliated with the Max Planck Institute for Dynamics of Complex Technical Systems and holds a Ph.D. in Applied Mathematics from Otto von Guericke University, Magdeburg, Germany . His work bridges computational mathematics and quantitative finance. Research Focus: Uncertainty Quantification, Stochastic PDEs, Optimal Control, Numerical Linear Algebra, Tensor-based Algorithms, and Credit Risk Modeling. Onwunta's publications emphasize low-rank methods for solving high-dimensional problems in fluid dynamics and financial risk assessment. His expertise includes stochastic Galerkin systems and preconditioning techniques for unsteady PDEs with random inputs. Notable collaborations include work with Peter Benner and Martin Stoll on computational frameworks for uncertainty propagation in fluid mechanics. His academic output spans both theoretical and applied domains.
