Yang P. Liu is an Assistant Professor at Carnegie Mellon University 's Department of Computer Science . He received his PhD from Stanford University under the supervision of Aaron Sidford and previously studied at MIT . Fields of Interest : Graph Algorithms, Optimization, High-Dimensional Geometry, Additive Combinatorics, Theoretical Computer Science. His research focuses on algorithmic design and analysis for graph problems, optimization, and combinatorics, with applications in machine learning and complexity theory. Recent work includes advancements in parallel repetition games , combinatorial lines , and dynamic graph algorithms . In 2024, his research spanned FOCS , STOC , and RANDOM conferences, addressing problems in k-CSPs , min-cost flow , and hypergraph sparsification . Earlier contributions (2023) included deterministic flow algorithms and spectral hypergraph techniques. Scientific Awards : NDSEG Fellowship (2018-2021), Google PhD Fellowship (2022-2023), FOCS Best Paper (2022), STOC Best Student Paper (2022), FOCS Best Student Paper (2021). He teaches CS 15-759 , a graduate course on convex optimization theory and applications, covering gradient descent, interior point methods, and algorithmic sparsification techniques.
Zaid Harchaoui is an Adjunct Professor in the Department of Statistics at the University of Washington. His research focuses on machine learning, generative AI, and algorithmic optimization, with applications spanning ecology, neuroscience, and artificial intelligence. He explores learning under distributional shifts and develops tools for scalable generative models in language and vision domains. University: University of Washington Department: Statistics Research Focus: Learning from data with computational, inferential, and mathematical rigor; distributional shift adaptation; generative model scaling Email: zaid@uw.edu His recent work emphasizes generative AI applications in ecology and neuroscience, stochastic optimization for robustness, and algorithmic efficiency in large-scale learning. Key contributions include techniques for distributionally robust optimization, interpretable authorship obfuscation, and uncertainty quantification in behavior classification. Scientific awards and honors are not explicitly mentioned in the provided text. Collaborative efforts often intersect with nonlinear control algorithms, spectral analysis, and privacy-preserving machine learning frameworks.
Aditya Guntuboyina is an Associate Professor in the Department of Statistics at the University of California, Berkeley. He has held this position since January 2012, following a postdoctoral stint at the Wharton Statistics Department and a PhD in Statistics from Yale University (2011) under Professor David Pollard. He earned his B.Stat and M.Stat degrees from the Indian Statistical Institute, Kolkata. PhD: Statistics, Yale University (2011) B.Stat/M.Stat: Indian Statistical Institute, Kolkata His research focuses on nonparametric and high-dimensional statistics , particularly shape-constrained estimation and Bayesian/Empirical Bayes methods . Key themes include convex regression, isotonic regression, mixture models, and total variation denoising. Recent publications analyze multivariate scale mixtures, convergence rates, and suboptimality of least squares in constrained settings. Aditya has supervised multiple PhD students in the Berkeley Statistics and EECS programs. He teaches courses such as Time Series Analysis (Stat 153/248), Data, Inference, and Decisions (Data 102), and advanced probability (Stat 201A). His work often intersects with machine learning, optimization, and information theory. Scientific contributions include theoretical advances in shape-restricted regression, adaptation in log-concave density estimation, and risk bounds for convex-constrained models. He has published in top journals like Annals of Statistics , Journal of the Royal Statistical Society: Series B , and IEEE Transactions on Information Theory .
Martin T. Wells is the Charles A. Alexander Professor of Statistical Sciences at Cornell University, with joint appointments in the Department of Statistical Science, Department of Biological Statistics and Computational Biology, Department of Social Statistics, and as Professor of Clinical Epidemiology and Health Services Research at Weill Medical School. He serves as Editor-in-Chief of the ASA-SIAM Book Series and Co-Editor of the Journal of Empirical Legal Studies. Cornell University, Ithaca, NY Weill Cornell Medical College Research Interests span applied and theoretical statistics, Bayesian methods, biostatistics, clinical epidemiology, and computational biology. His work bridges disciplines like finance, legal studies, and health services research. Article Trends highlight advancements in Bayesian modeling, quantum cognition machine learning, tensor analysis, and misclassification correction, with applications in genomics, finance, and public health. Fellow of the American Statistical Association Fellow of the Royal Statistical Society Contributions include developing statistical software (e.g., rTensor), methodological innovations in clinical trials, and empirical legal studies on civil rights and the death penalty.
Fatma Kılınç-Karzan is an Associate Professor of Operations Research at Carnegie Mellon University's Tepper School of Business, with a courtesy appointment as Associate Professor of Computer Science. She is also affiliated with the Algorithms Combinatorics and Optimization (ACO) PhD Program and was a Visiting Scientist at Berkeley's Simons Institute for the Theory of Computing during Fall 2017. Her educational background includes a PhD from Georgia Institute of Technology's H. Milton Stewart School of Industrial & Systems Engineering with a minor in Mathematics, supervised by Prof. Arkadi Nemirovski. She earned her B.S. and M.S. degrees from the Industrial Engineering Department of Middle East Technical University with a minor in Information Systems. Dr. Kılınç-Karzan's research spans mathematical optimization with emphasis on convex and non-convex optimization theory, algorithms, and applications. Her work bridges theoretical foundations with practical implementations in optimization under uncertainty (robust optimization, chance constraints, distributionally robust optimization), machine learning (preference learning from limited data), and business analytics. She develops foundational theory for large-scale optimization problems with applications in decision making under uncertainty and high-dimensional statistical inference. Analysis of her recent publications reveals a strong focus on convex hull characterizations, semidefinite programming relaxations, distributionally robust optimization, and online convex optimization frameworks. Her work demonstrates increasing integration of optimization theory with machine learning applications, particularly in developing data-driven approaches for decision making under uncertainty. NSF CAREER Award (2015) INFORMS Optimization Society Young Researcher Prize (2015) INFORMS Junior Faculty Interest Group (JFIG) Best Paper Award (2014) BP Junior Faculty Chair (2014-2015) Faculty Giving Chair (2012-2013) Wimmer Fellowship (2012-2013) Dr. Kılınç-Karzan has successfully mentored numerous PhD students who have received prestigious awards, including the 2021 INFORMS Optimization Society Best Student Paper (1st prize) and multiple honorable mentions. Her research has been supported by significant grants including an NSF CAREER Award, an ONR grant (with S. Küçükyavuz), and an AFOSR grant. She serves on editorial boards for Mathematical Programming, Operations Research, Mathematics of Operations Research, and other leading journals, and has held leadership positions in professional societies including the Mathematical Optimization Society and INFORMS Computing Society. Through her affiliations with CMU's Tepper School, Computer Science Department, and ACO Program, she collaborates across disciplines to advance optimization theory and its applications. Her professional service includes committee chair roles for major INFORMS competitions and program committee leadership for international optimization conferences.
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).
Daniel M. Kane is a Professor at the University of California, San Diego (UCSD), holding a joint appointment in the Department of Mathematics and the Department of Computer Science and Engineering (CSE). His research spans mathematics and theoretical computer science, with a focus on number theory, combinatorics, complexity theory, and computational statistics. He earned a Ph.D. in Mathematics from Harvard University (2011) and dual BS degrees in Mathematics with Computer Science and Physics from MIT (2007). Prior to UCSD, he was a postdoctoral researcher at Stanford University (2011–2014) on an NSF fellowship. His research interests include robust statistics, machine learning, polynomial threshold functions, and algorithmic methods for high-dimensional data. Notable achievements include co-authoring the book Algorithmic High-Dimensional Robust Statistics (Cambridge University Press, 2023) and receiving the Best Paper Award at the Conference on Computational Complexity (2013), as well as gold medals at the International Mathematical Olympiad (2002 and 2003). Current teaching includes courses such as Math 96 (Putnam Seminar), Math 154 (Graph Theory), CSE 101 (Algorithms), and CSE 203A (Randomized Algorithms). He has consulted for companies like CASPER Labs and AIble, and his work extends to cryptographic protocols, including quantum money schemes based on quaternion algebras. Key contributions include breakthroughs in robust mean estimation, list-decodable learning, and the development of efficient algorithms for statistical problems. His research often bridges foundational theory with practical applications in machine learning and data analysis.
Raphael Hauser is an Associate Professor in Numerical Mathematics at the University of Oxford's Mathematical Institute, Director of Graduate Studies - Teaching, and Tanaka Fellow in Applied Mathematics at Pembroke College. His affiliations include membership in the Data Science, Numerical Analysis, and Mathematical and Computational Finance research groups, as well as a fellowship at the Alan Turing Institute. Education: PhD in Operations Research, Cornell University, Ithaca, USA Dipl. Math. ETH, Swiss Federal Institute of Technology (ETH Zurich), Switzerland Research interests span data science, numerical optimisation, medical imaging, distributed computing, and applied probability/statistics. His work integrates mathematical rigor with practical applications, particularly in optimization algorithms, machine learning theory, and medical imaging technology. Publications focus on optimization theory, stochastic processes, medical imaging systems, and computational finance, with recurring themes in non-convex optimization guarantees, PCA variants, and X-ray tomography innovations. Awards: Oxford University Teaching Award (2007) SIAM Optimization Prize (2005) SIAM Student Paper Prize (2000) Advising includes 15+ DPhil students and 40+ MSc students, with projects in optimization, finance, imaging, and machine learning. Current postdocs and students are affiliated with the Alan Turing Institute and industrial partners like Siemens and Macquarie Group. He leads teams in the Mathematical Institute's research groups and collaborates with the Alan Turing Institute on large-scale data science initiatives.
Damek Davis serves as an Associate Professor of Statistics and Data Science and Co-Academic Director of the Dual Master's Degree in Statistics at the Wharton School, University of Pennsylvania. His academic base is the Department of Statistics and Data Science within the Wharton School, with his office located at the Academic Research Building in Philadelphia, PA. His research expertise centers on optimization theory for data science, with deep specialization in nonsmooth and stochastic optimization problems. Key focus areas include convergence analysis of first-order methods, variance reduction techniques, and theoretical guarantees for algorithms in nonconvex settings. His work bridges mathematical rigor with practical applications in machine learning and statistical inference, particularly in developing efficient computational frameworks for large-scale data analysis. Analysis of his 2022-2024 publications reveals dominant themes in optimization for modern data challenges: nonsmooth stochastic approximation, linear convergence under sharpness conditions, and global optimality in mixture models. His research consistently appears in premier venues across optimization (Mathematical Programming, SIAM Journal), statistics (The Annals of Statistics), and machine learning (IEEE Transactions), demonstrating cross-disciplinary impact in both theoretical foundations and computational methodologies.
Gil Kalai is a Professor of Mathematics at the Hebrew University of Jerusalem since 1992, where he holds the Henry and Manya Noskwith Chair. He also serves as an Adjunct Professor of Mathematics and Computer Science at Yale University since 2004 in a long-term part-time visiting position. His academic career includes visiting positions at prestigious institutions including MIT, Cornell, IAS Princeton, Berkeley, Bell-labs, IBM, and Microsoft. Professor Kalai's research spans multiple areas within mathematics and theoretical computer science. His work in combinatorics encompasses geometric, probabilistic, and topological approaches. He has made significant contributions to the study of convex sets and polytopes, linear programming, and theoretical computer science. His influential 1988 paper with Kahn and Linial on Boolean functions pioneered applications of Fourier analysis in theoretical computer science. Kalai's research has evolved to include the application of Fourier analysis to thresholds, influences, symmetries, noise, percolation, and social choice. He has developed theories in algebraic shifting and studied face-numbers and other combinatorial invariants of polytopes. His work on the diameter of polytopes and randomized simplex algorithms has been influential in optimization theory. In 1993, his collaboration with Kahn produced a groundbreaking counterexample to Borsuk's Conjecture in 1325 dimensions. Professor Kalai's publications reveal a consistent focus on the intersection of combinatorics, geometry, and theoretical computer science. His work shows a progression from foundational combinatorial geometry to increasingly sophisticated applications of harmonic analysis in discrete mathematics. The recurring themes across his 30+ year career include Boolean functions, polytope theory, and probabilistic methods in combinatorics, demonstrating remarkable coherence in his research trajectory. 2016 European congress of Mathematics, plenary speaker 2013 ERC advanced grant 2012 Rothschild Prize 1994 International Congress of Mathematicians invited section talk, Zurich 1994 Fulkerson Prize 1993 Erdos Prize 1992 Polya Prize Though specific details of his advising are not provided in the source material, Kalai has written over 70 scientific papers and maintains an active research blog entitled "Combinatorics and More." His 2013 ERC advanced grant indicates significant research funding for his work. His extensive collaborations with researchers across multiple institutions suggest a robust research program with numerous PhD students and postdoctoral researchers, though specific names are not mentioned in the provided texts. Professor Kalai maintains active research connections across multiple institutions including Hebrew University, Yale, and various research centers worldwide. His work bridges pure mathematics and theoretical computer science, creating a unique interdisciplinary research environment that influences both fields.
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.
Ivan Dokmanic is an Assistant Professor at the Coordinated Science Laboratory (CSL) within the University of Illinois . His research bridges signal processing , machine learning , and applied inverse problems , with a focus on acoustics, biomedical imaging, and distance geometry. Current Role : Assistant Professor, CSL Email : dokmanic@illinois.edu Research Interests : Dokmanic explores machine learning applications in inverse problems , particularly distance geometry for molecular imaging and acoustics . His work includes unlabeled sensing , where distances between points are known but their arrangement is not. This has implications for powder diffraction , indoor localization , and echo modeling . Article Trends : His recent publications emphasize distance geometry in machine learning , acoustic signal processing , and inverse problem theory . Key areas include molecular imaging , audio encryption , and sensor positioning . Collaborative work spans medical imaging , cyberphysical systems , and geometric invariants . 2016 Google Faculty Award NSF Grant (1 year, $157,079) Students and Grants : Dokmanic mentors PhD students like Puoya, Shuai, and Anadi. His research is funded by the National Science Foundation , Google , VISA , and nVidia .
David Jerison is a Professor of Mathematics at the Massachusetts Institute of Technology (MIT), where he conducts research in Fourier analysis and partial differential equations. His work focuses primarily on free boundary problems and, more recently, on internal Diffusion Limited Aggregation (internal DLA), a stochastic growth model. He maintains an active research program with numerous publications in leading mathematical journals. Professor Jerison's research spans several interconnected areas of mathematical analysis. His primary interests include Fourier analysis and partial differential equations, with particular emphasis on free boundary problems. In recent years, he has expanded his research to include internal Diffusion Limited Aggregation, a stochastic growth model that has connections to probability theory and mathematical physics. His work often bridges geometric analysis, spectral theory, and probabilistic methods, demonstrating the deep connections between different branches of mathematics. Analysis of Professor Jerison's recent publications reveals a consistent focus on geometric aspects of partial differential equations, particularly free boundary problems. His research shows progression from classical PDE theory toward more stochastic and probabilistic approaches, as evidenced by his work on internal DLA. The publications demonstrate interdisciplinary connections between mathematical analysis, probability theory, and mathematical physics, with applications ranging from geometric measure theory to quantum mechanics. Professor Jerison is actively involved in teaching and mentoring at MIT. He has taught courses including Differential Equations (18.03), Fourier Analysis and Applications (18.103), and Differential Analysis (18.155). He also directs the Summer Program for Undergraduate Research (SPUR), which is exclusively for MIT undergraduates, and organizes the mathematics section of the Research Science Institute (RSI) for high school students. His teaching materials are available through MIT's Open Courseware platform, indicating his commitment to educational outreach and accessibility.
Surya Ganguli is an Associate Professor in the Department of Applied Physics at Stanford University, with courtesy appointments in Neurobiology and Electrical Engineering. He serves as Senior Fellow at the Stanford Institute for Human-Centered AI and is affiliated with the Stanford Neuroscience Institute , Bio-X , and Wu Tsai Neurosciences Institute . His research spans theoretical neuroscience, machine learning, and statistical mechanics. Ph.D. , UC Berkeley, Theoretical Physics (2004) M.A. , UC Berkeley, Physics (2000) M.A. , UC Berkeley, Mathematics (2004) M.Eng. , MIT, Electrical Engineering and Computer Science (1998) B.S. , MIT, Physics (1998) B.S. , MIT, Mathematics (1998) B.S. , MIT, Electrical Engineering and Computer Science (1998) His lab explores how higher-level cognitive phenomena emerge from neural network dynamics, focusing on perception, memory, attention, and decision-making . Research themes include statistical mechanics of learning , neural representational geometry , and biologically plausible learning rules . Current work examines nonlinear interactions in neural networks through the Schmidt Science Polymath Award (2023). Key article trends reveal expertise in neural coding limits (2022 Nature), synaptic plasticity models (2022 Neural Computation), and deep learning theory (2022 NeurIPS publications). His 2019 Annual Review chapter on statistical mechanics of deep learning established foundational insights into network criticality. Scientific Awards : NSF Career Award (2019) Simons Foundation Investigator (2016) McKnight Scholar Award (2015) James S. McDonnell Foundation Scholar (2014) Sloan Research Fellow (2013) As advisor, he mentors 10+ doctoral students across Applied Physics, Neurosciences, and Computer Science, including Vamshi Balanaga and Mason Kamb. His lab collaborates with experimental teams at Stanford and beyond, supported by grants from NSF , Simons Foundation , and Swartz Foundation . The Neural Dynamics & Computation Lab unites physicists, mathematicians, and neuroscientists to decode cognition through interdisciplinary methods.
Erik Waingarten is an assistant professor at the University of Pennsylvania in the Computer and Information Science department. His research focuses on algorithms for massive datasets, including similarity search, streaming/sketching, property testing, and distribution testing. Former postdoctoral researcher at Stanford's CS Department under Moses Charikar PhD from Columbia University advised by Xi Chen and Rocco Servedio Key research areas: High-dimensional geometry Streaming algorithms Property testing Sketching techniques Clustering and metric optimization Recent article trends show expertise in: 2025 publications on monotonicity testing and metric property analysis 2024 work on Earth Mover's Distance and kernel evaluations 2023 papers on clustering, optimal transport, and MST algorithms 2022-2020 foundations in sublinear algorithms and entropy estimation Scientific recognition: NSF CAREER Award (2023) CCC Best Paper Award (2017) Invited to Journal of the ACM (2017) Academic advising includes PhD students: Ashwin Padaki Tian Zhang Nicolas Menand Krish Singal Junkai Song
