Shivani Agarwal is an Associate Professor of Computer and Information Science and (by courtesy) Statistics and Data Science at the University of Pennsylvania. Her research focuses on computational, mathematical, and statistical foundations of machine learning, including algorithm design, theory, and applications in life sciences. She holds leadership roles in initiatives like the NSF-funded Penn Institute for Foundations of Data Science (PIFODS) and the Penn Research in Machine Learning (PRiML) forum. Previously, she was a Radcliffe Fellow at Harvard, and held academic positions at MIT, Indian Institute of Science, and the University of Illinois at Urbana-Champaign. Education: PhD in Computer Science from the University of Illinois, Urbana-Champaign. Prior roles include Assistant Professor (Ramanujan Fellow) at IISc, postdoctoral lecturer at MIT, and Radcliffe Fellow at Harvard. Research interests span machine learning theory, ranking systems, bandit algorithms, noisy label learning, and interdisciplinary applications in economics, operations research, and psychology. She has organized numerous conferences and workshops, including COLT 2020 and NIPS workshops on ranking and learning. Key professional activities include leadership in Indo-US research collaborations and editorial roles for the Journal of Machine Learning Research and Harvard Data Science Review.
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
Christian Bargetz is a Professor of Functional Analysis at the University of Innsbruck, Austria, affiliated with the Faculty of Mathematics, Computer Science, and Physics (MIP). His primary research focuses on nonlinear functional analysis, Banach space theory, and distribution theory. He teaches advanced courses such as Optimization, Distribution Theory, and Functional Analysis, demonstrating his expertise in both theoretical and applied aspects of his field. Education: Completed his PhD in 2012 at the University of Innsbruck under the supervision of Norbert Ortner. His diploma thesis (2008) explored differential behaviors with Ulrich Oberst. Bargetz has held continuous academic positions since 2008, including roles as a lecturer and researcher. Research Interests: Specializes in iterative projection methods, generic properties of nonexpansive mappings, Fréchet spaces, and vector-valued distributions. His work bridges functional analysis with geometric measure theory and optimization, with applications in metric geometry and topological tensor products. Publications: Over 30 peer-reviewed articles in prestigious journals such as Canadian Journal of Mathematics , Journal of Mathematical Analysis and Applications , and Proceedings of the American Mathematical Society . Recent work includes studies on extremal nonexpansive mappings and Lipschitz function spaces. Grants & Projects: Principal investigator in FWF-funded projects on nonexpansive mappings and Banach spaces. Collaborates internationally, including with institutions in Israel, Poland, and Serbia. Teaching: Leads advanced courses in functional analysis, optimization, and distribution theory. Supervises bachelor's theses and master's projects on topics like extension operators for Lipschitz functions. Affiliations: Active member of the Functional Analysis working group and regularly participates in international conferences such as the Banach Afternoon, Winter School in Abstract Analysis, and DMV-ÖMG Annual Conferences.
Esteban G. Tabak is a Professor of Mathematics at the Courant Institute of Mathematical Sciences, New York University. He holds a Ph.D. in Mathematics from MIT (1992) and a Hydraulic Engineer degree from the University of Buenos Aires (1988). His research spans fluid dynamics, data science, and optimization, with notable contributions to optimal transport theory, atmospheric and ocean modeling, and machine learning methodologies. He leads the Research and Training Group in Mathematical Modeling and Simulation at NYU. Research Interests include Data Analysis, Optimal Transport, Applied Mathematics, and Physics, particularly in fluid dynamics and geophysical flows. His work bridges theoretical advancements with practical applications, such as sea ice dynamics, internal waves, and turbulence modeling. Publications highlight innovations in density estimation, constrained optimization, and energy spectrum analysis of oceanic internal waves. Collaborations span disciplines, including biomedical applications (e.g., heart transplant diagnostics) and climate science. His methodologies, such as dual ascent algorithms and prototypal analysis, emphasize data-driven solutions to complex systems. Teaching includes courses on partial differential equations, fluid dynamics, and mathematical modeling. His work has been supported by grants addressing stratified flows, internal wave energy spectra, and turbulent mixing.
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.
Euiwoong Lee is an Assistant Professor in the Computer Science and Engineering Division at the University of Michigan. He holds a PhD from Carnegie Mellon University, advised by Venkatesan Guruswami, and has held postdoctoral positions at New York University and the Simons Institute for the Theory of Computing. His research focuses on approximation algorithms, hardness of approximation, and parameterized complexity. **Education:** PhD in Computer Science, Carnegie Mellon University (2017), advised by Venkatesan Guruswami Postdoctoral Fellowships: NYU (2017–2020), Simons Institute (2017–2020) **Research Interests:** Approximation Algorithms & Hardness of Approximation Convex Hierarchies (e.g., Sum-of-Squares) Clustering Algorithms (e.g., Correlation Clustering) Parameterized Complexity Facility Location & Metric Optimization **Awards:** Edmund M. Clarke Doctoral Dissertation Award (2017) Simons Award for Graduate Students in Theoretical Computer Science **Advising & Grants:** PhD Students: Anthony Della Pella, Aditya Anand, Amatya Sharma, Ian DeHaan Co-organizes the Michigan Theory Seminar **Labs/Teams:** Collaborates with researchers in approximation algorithms, optimization, and theoretical computer science at the University of Michigan and beyond.
Nathan (Nati) Linial is a Professor at the School of Computer Science and Engineering at the Hebrew University of Jerusalem, where he has been a faculty member since completing his postdoctoral period at UCLA. He earned his undergraduate degree in mathematics from the Technion and his PhD in graph theory from the Hebrew University. His research spans multiple areas of theoretical computer science and mathematics, with primary focus on combinatorics, theoretical computer science, and bioinformatics. Linial's work has made significant contributions to high-dimensional combinatorics, expander graphs, metric embeddings, and computational molecular biology. His research often bridges geometry, analysis, and combinatorial structures, demonstrating deep connections between seemingly disparate mathematical fields. Linial's recent publications reveal a strong trend toward high-dimensional combinatorial structures, including simplicial complexes, hypertrees, and high-dimensional permutations. His work frequently employs probabilistic methods, linear programming techniques, and geometric approaches to solve fundamental combinatorial problems. The breadth of his research is evident in both pure mathematical contributions and applications to computational biology. Fellow of the American Mathematical Society ISI Highly Cited Researcher Conant Prize (2008) for the influential survey paper "Expander graphs and their applications" Linial has served on the editorial boards of several prestigious journals including the Israel Journal of Mathematics (as Chief Editor 2013-2017), Random Structures and Algorithms, and Combinatorica. His academic leadership extends to organizing conferences and workshops in combinatorics and theoretical computer science. He has mentored numerous students whose work spans theoretical computer science, combinatorics, and computational biology. Linial is associated with research projects including ProtoNet (for protein sequence classification) and EVEREST (for evolutionary conserved protein domains), demonstrating his commitment to interdisciplinary research that bridges computer science with molecular biology.
Yulan Qing is an Assistant Professor in the Department of Mathematics at the University of Tennessee, Knoxville (UTK), part of the College of Arts and Sciences. She holds a Ph.D. in Mathematics from Tufts University. Her research focuses on low-dimensional topology, geometric group theory, asymptotic properties of groups, and big mapping class groups. Notable projects include studies on Gromov boundaries, genericity in groups, and curve graphs. She has published extensively in journals like Geometry & Topology and the Journal of the London Mathematical Society. Dr. Qing has organized conferences such as the 53rd Barrett Memorial Lectures and the GGTea Webinar, fostering collaboration in geometric group theory. She has taught courses like Honors Topology at UTK and supervised graduate students including Sagnik Jana and Alex Squires. Her work bridges theoretical foundations with applications in topology and geometry. Recent invited talks include presentations at the University of Virginia, Caltech, and the 2nd China-Russia Conference on Topology. She actively mentors undergraduate and graduate students, contributing to initiatives like the Math Circle programs at Tufts and MIT's RSI Summer Program.
Chris De Sa is an Associate Professor in the Department of Computer Science at Cornell University, affiliated with the Cornell Machine Learning Group and leading the Relax ML Lab. His research focuses on algorithmic, software, and hardware techniques for high-performance machine learning, particularly relaxed-consistency stochastic algorithms like asynchronous and low-precision stochastic gradient descent (SGD). He earned his Ph.D. from Stanford University under advisors Kunle Olukotun and Chris Ré. His work emphasizes constructing efficient, parallel, and distributed machine learning frameworks for deep learning and data analytics. Education: Ph.D. in Computer Science, Stanford University (2017) Research Interests: Algorithmic techniques for scalable ML, quantization, distributed optimization, hyperbolic geometry in ML, and reliable measurement of ML systems. His group develops frameworks for efficient inference/training and explores the intersection of ML with domains like agriculture and plant science through courses like PLSCI 7202. Recent Highlights: DARPA YFA Grant (2024), NSF CAREER Award, Google Research Scholar Award, and multiple best paper recognitions. Key contributions include QuIP quantization methods, Coneheads attention mechanisms, and theoretical advances in decentralized training. Awards: NSF CAREER Award DARPA YFA Grant (2024) Google Research Scholar Award Mr. & Mrs. Richard F. Tucker Teaching Award Grants & Advising: Advises 8 Ph.D. students (including Ruqi Zhang, Yucheng Lu, A. Feder Cooper) and holds leadership roles in MLSys conferences. Active in grant-funded research (e.g., NSF Robust Intelligence). Labs/Teams: Leads the Relax ML Lab and participates in Cornell’s Institute for Digital Agriculture (CIDA).
Christopher O'Donnell is a Professor of Econometrics at the University of Queensland's School of Economics. He holds a PhD from the University of Sydney and has held academic leadership roles including Director of the Centre for Efficiency and Productivity Analysis. His research focuses on productivity and efficiency analysis, econometric methods, and their applications in agriculture, public policy, and environmental economics. Education: PhD (University of Sydney), MCom (University of New South Wales), BAgEc (Hons) (University of New England). Research interests include economic and statistical methods for measuring productivity changes, stochastic frontier analysis, and metafrontier frameworks. He has authored/co-authored three books and over 80 journal articles, with notable contributions in the American Journal of Agricultural Economics , Journal of Econometrics , and European Journal of Operational Research . Scientific awards include being a Distinguished Fellow of the Australian Agricultural and Resource Economics Society. His work has been applied in sectors like healthcare, fisheries, and public utilities through collaborations with organizations such as the World Bank and Asian Productivity Organization. Key projects include measuring agricultural productivity in China, analyzing hospital efficiency, and evaluating climate impacts on farming. Grants include studies on productivity measurement in Australian universities and Northern Grains Region farms. Labs/Teams: Former Director of the Centre for Efficiency and Productivity Analysis, collaborating with global institutions on productivity benchmarking and policy analysis.
Hamsa Bastani is an Associate Professor of Operations, Information and Decisions at the Wharton School, University of Pennsylvania, with a secondary appointment in Statistics and Data Science. She co-directs the Wharton Healthcare Analytics Lab and serves as an Associate Editor for Operations Research, M&SOM and OR Letters. Her academic journey began with summa cum laude graduation from Harvard in 2012 with an A.M. in physics and A.B. in physics and mathematics. She completed her PhD in Stanford's Electrical Engineering department under Mohsen Bayati, followed by a Herman Goldstine postdoctoral fellowship at IBM Research. Professor Bastani's research focuses on developing novel machine learning algorithms for data-driven decision-making, with applications spanning healthcare operations, social good, and revenue management. Her work demonstrates particular expertise in sequential decision-making (bandits, reinforcement learning), learning from auxiliary data sources (transfer learning, meta-learning), and designing effective human-AI interfaces (interpretability, fairness). She has made significant contributions to understanding how AI systems affect and augment human behavior, with the goal of designing AI tools that help humans thrive. Her publications reveal a strong trend toward high-impact applications of machine learning in critical societal domains. A significant portion of her recent work focuses on healthcare applications, including optimizing health supply chains in low- and middle-income countries, designing clinical trial protocols, and creating targeted public health interventions. Another major theme examines the complex relationship between humans and AI systems, particularly how AI affects learning outcomes and decision-making processes. Her work frequently bridges theoretical advances with practical implementation, as evidenced by country-scale deployments in Greece and Sierra Leone. Wagner Prize for Excellence in Operations Research Practice (2021) Pierskalla Award for Best Paper in Healthcare (2021, 2019, 2016) Behavioral OM Best Paper Award (2021) Public Sector in OR Best Paper Award (2024) INFORMS Data Mining Best Paper Award (2022) Wharton Teaching Excellence Award (2019, 2020, 2021) Professor Bastani has advised numerous PhD students who have gone on to prominent positions, including Pia Ramchandani (Director of Responsible AI at PwC), Arielle Anderer (Assistant Professor at Cornell Johnson), and Kan Xu (Assistant Professor at ASU Carey). Her research has been supported by collaborations with national governments, including the Greek government where she co-designed Eva, the national-scale reinforcement learning system for targeted COVID-19 testing, and the Government of Sierra Leone where she improved patient access to essential medicines by nearly 20% via decision-aware learning. She has also conducted the first large field study deploying generative AI tutors in high school math classes. She leads the Wharton Healthcare Analytics Lab and serves on the Steering Committee for the Penn Center for Health Incentives and Behavioral Economics and on the statistics advisory committee for the AHA Food is Medicine Initiative. Outside academia, she serves on the Workday AI Advisory Board, demonstrating her commitment to translating academic research into practical applications.
André Bardow is a Full Professor at the Department of Mechanical and Process Engineering, ETH Zürich. His research focuses on energy systems optimization, life cycle assessment, computer-aided molecular design, and CO2 capture/utilization. Professor (ETH Zürich, 2020–present) Head of Institute of Technical Thermodynamics (RWTH Aachen University, 2010–2020) Visiting Professor (University of California, Santa Barbara, 2015/16) Part-time Director (Forschungszentrum Jülich, 2017–2022) Associate Professor (TU Delft, 2007–2010) Research Interests: His work spans energy and process systems engineering, with emphasis on sustainable technologies. Key areas include: Computer-aided molecular and process design Machine learning for chemical engineering Carbon capture and utilization (CCU) Life cycle assessment (LCA) of industrial processes Thermo-economic modeling of energy systems Multiphase equilibrium analysis Publication Trends: Recent articles focus on integrating machine learning with process design, optimizing CO2 capture in steel production, and advancing electrochemical cooling technologies. Subfields include sustainable plastics, ORC working fluids, and solvent mixture design. Scientific Awards: Fellow of the Royal Chemical Society Recent Innovative Contribution Award (EFCE, 2019) PSE Model-Based Innovation Prize (2018) Covestro Science Award (first recipient) Arnold-Eucken-Award (VDI-GVC) Highly Cited Researcher (Clarivate, 2024) Advising and Grants: Professor Bardow mentors students in process optimization and leads projects like Systemic expansion of territorial CIRCULAR Ecosystems for end-of-life FOAM (Grant 101036854, EC).
Ben Green is the Waynflete Professor of Pure Mathematics at the University of Oxford and a Fellow of Magdalen College. His work spans additive combinatorics, analytic number theory, harmonic analysis, ergodic theory, discrete geometry, and group theory, with a focus on interdisciplinary approaches. Research Interests: Additive combinatorics and its applications to primes Analytic number theory (prime distribution, L-functions) Harmonic analysis (Fourier methods, spectral theory) Ergodic theory and its combinatorial applications Discrete geometry (ordinary lines, convex structures) Group theory (approximate groups, expansion) Article Trends: His recent work emphasizes multiplicative functions, Ramsey-type problems in number theory, expansion in finite groups, and extremal set theory. Themes include prime gaps, arithmetic progressions, and interactions between analysis and algebra. Scientific Awards: Clay Research Award (2004) Ostrowski Prize (2005) Whitehead Prize (2005) Leverhulme Prize (2007) European Mathematical Society Prize (2008) Royal Society Fellow (2010) Sylvester Medal (2014) Senior Whitehead Prize (2019) Advising: Ben has supervised numerous D.Phil students across additive combinatorics, analytic number theory, and related fields. Past students hold postdoctoral and academic positions globally.
Francis Bach is a Professor and researcher at INRIA, leading the SIERRA project-team since 2011, which is part of the Computer Science Department at Ecole Normale Supérieure (ENS) within PSL Research University. His work bridges CNRS, ENS, and INRIA as a joint research effort. Elected to the French Academy of Sciences in 2020, he currently runs the ERC project SEQUOIA following his previous ERC project SIERRA (2009-2014). His research spans statistical machine learning with focus on optimization, sparse methods, kernel-based learning, neural networks, graphical models, and signal processing. Bach completed his Ph.D. in Computer Science at U.C. Berkeley under Professor Michael Jordan, followed by work at Ecole des Mines de Paris and the WILLOW project-team at INRIA/ENS/CNRS (2007-2010). His recent book "Learning Theory from First Principles" was published by MIT Press in December 2024. Bach's publication record shows consistent high-impact contributions across machine learning theory and applications, with recent work focusing on conformal prediction, diffusion models, optimization theory, and learning theory foundations. His research demonstrates strong connections between theoretical guarantees and practical algorithms, with applications spanning generative modeling, robust optimization, and statistical inference. Elected to French Academy of Sciences (2020) ERC project SIERRA (2009-2014) ERC project SEQUOIA (current) Author of "Learning Theory from First Principles" (MIT Press, 2024) Bach actively mentors numerous PhD students and postdocs, with many alumni now holding faculty positions at institutions like EPFL, Ecole Polytechnique, University of Washington, and University of Montreal. His teaching includes advanced courses on learning theory at ENS's Master's programs. He regularly presents tutorials at major conferences including COLT, NeurIPS, and ICML, demonstrating his leadership in the theoretical machine learning community.
Olga Veksler is a Professor at the University of Waterloo's Department of Computer Science, part of the Faculty of Mathematics. She holds a Ph.D. and M.Sc. from Cornell University (1999) and a B.A. from New York University (1995). Her research focuses on computer vision, machine learning, and discrete optimization, with notable contributions to image segmentation, graph algorithms, and deep learning integration. Her work emphasizes semantic segmentation, salient object detection, and efficient optimization techniques for graphical models. Education: Ph.D. in Computer Science, Cornell University, 1999 M.Sc. in Computer Science, Cornell University, 1999 B.A. in Computer Science, New York University, 1995 Her research explores intersections between machine learning and traditional computer vision challenges, particularly leveraging graph-based optimization and CRF models. Recent trends in her work include weakly supervised learning, sparse non-local CRF applications, and test-time adaptation strategies for salient object detection. She has pioneered methods for shape priors in multi-object segmentation and efficient graph-cut algorithms. Her advising and grant activities are foundational to her research, though specific grant details are not listed here. She maintains a lab focused on advancing computer vision through algorithmic innovation, with contributions to both theoretical frameworks and practical applications in medical imaging and scene understanding.
