Abhijit Banerjee is a Professor in the Department of Economics at the Massachusetts Institute of Technology (MIT). His research focuses on development economics, public health policy, and social protection programs, particularly addressing poverty and inequality in low- and middle-income countries. He has conducted large-scale experiments evaluating interventions such as conditional cash transfers, universal basic income, and healthcare policies. Key areas of interest include the design and implementation of anti-poverty programs, behavioral economics, and the long-term health impacts of infectious diseases like COVID-19. His work often integrates experimental methods to assess policy effectiveness, with contributions to global health studies and economic development strategies. Notably, his research on the RECOVERY trial evaluates treatments for hospitalized COVID-19 patients, while other studies explore financial spillover effects of electronic government transfers in Indonesia and savings behavior interventions in Chile. Banerjee has collaborated on projects analyzing post-COVID-19 health outcomes, labor market dynamics in India, and the role of trusted messengers in public health communication during crises. Despite the breadth of his contributions, specific details about his educational background, grants, or lab affiliations are not explicitly provided in the source text.
Yee Whye Teh is a Professor at the Department of Statistics, University of Oxford, and a research scientist at DeepMind. His work focuses on statistical machine learning, including probabilistic learning, Bayesian nonparametrics, deep learning, and Monte Carlo methods. He co-directs the ELLIS programme on Robust Machine Learning and has held roles such as Programme Co-chair for ICML 2017. Teh has delivered keynotes at UAI 2019, an IMS Medallion Lecture at JSM 2019, and the Breiman Lecture in 2017. His research emphasizes scalable inference algorithms, hierarchical models, and applications in genetics and natural language processing. Teh's educational background includes a PhD from the University of Toronto (2003) and a Master's from the same institution (2000). He has contributed to widely used software tools like the Sequence Memoizer and has been recognized for his work through prestigious lectureships. Research interests span Bayesian nonparametric models, MCMC methods, and their applications in genetics and data compression. His lab collaborates on projects like fragmentation-coagulation processes for genetic variation modeling and Mondrian forests for online learning. Teh advises students through Oxford's graduate programs, though he notes high demand for mentorship. His work often bridges theory and practice, addressing challenges in big data learning and small data problems.
Adrian Weller is a prominent researcher and academic at the University of Cambridge, serving as a Director of Research in Machine Learning within the Department of Engineering. He holds multiple significant leadership roles including Programme Director for Trust and Society at the Leverhulme Centre for the Future of Intelligence (CFI), and previously served as Programme Director for AI at The Alan Turing Institute, the UK national institute for data science and AI. His work bridges theoretical machine learning research with practical applications and societal implications of artificial intelligence. Weller's research interests span a broad spectrum of AI and machine learning topics with a particular focus on ensuring beneficial societal outcomes. His work encompasses explainability, fairness, robustness, scalability, privacy, safety, and ethics in AI systems. He has made significant contributions to trustworthy machine learning, including developing frameworks for AI governance, certification, and human-AI collaboration. His research group actively investigates neuro-symbolic approaches, privacy-preserving techniques, and methods for improving the reliability and interpretability of AI systems. His recent publications demonstrate a strong trend toward addressing the practical challenges of deploying AI systems in real-world contexts, particularly focusing on certification frameworks, governance mechanisms, and human-centered approaches. His work spans theoretical advances in machine learning architectures while maintaining a strong connection to societal impact, with publications appearing in top venues across AI, machine learning, and interdisciplinary applications. Scientific Awards: MBE for services to digital innovation (2022 Queen's Birthday Honours) Turing AI Fellowship for Trustworthy Machine Learning Weller actively supervises a large group of PhD students and postdocs, with current students including Juyeon Heo, Yanzhi Chen, Katie Collins, Isaac Reid, Yichao Liang, Herbie Bradley, and Shoaib Siddiqui. His former students have gone on to positions at leading institutions including Google DeepMind, ETH Zurich, NYU, and MPI-IS Tübingen. He has served on numerous advisory boards including the Centre for Data Ethics and Innovation, UNESCO's expert group on AI ethics, and the World Economic Forum's Global Future Council on AI. His research has been supported through his Turing AI Fellowship and various collaborative projects focused on safe and ethical AI development. Weller leads a vibrant research group focused on trustworthy machine learning, which actively organizes workshops and conferences including ICML 2024 (where he served as Program Chair), multiple workshops on responsible AI, and events through the ELLIS network. His group collaborates extensively across disciplines, working with researchers in computer science, social sciences, law, and policy to address the multifaceted challenges of developing beneficial AI systems.
Amitabha Bagchi is a Professor in the Department of Computer Science and Engineering at IIT Delhi. His research spans data algorithmics, probability, networks, and theoretical computer science, with applications in distributed systems, social networks, and AI-driven platforms. He has published extensively in leading venues such as SIGMOD, VLDB, ICDE, AAAI, and KDD, often collaborating with students and researchers on problems involving graph algorithms, fairness, and large-scale data analysis. Research Interests: His primary research interests include Data Algorithmics, Probability and Networks, Theoretical Computer Science, Distributed Algorithms, Graph Algorithms, and Machine Learning Theory. He investigates algorithmic foundations for real-world problems such as food delivery optimization, social network analysis, and efficient data structures for streaming and large graphs. Publication Trends: Recent publications focus on fairness in gig economy platforms, efficient solvers for graph Laplacians, generalization in neural networks, and temporal graph querying. His work combines theoretical rigor with practical impact, often involving GPU acceleration, distributed computing, and data-aware algorithm design. Scientific Service: Editor, Algorithms (2020–present) Editor, Journal of Discrete Algorithms , Elsevier (2006–2018) Guest Editor, special issue on Algorithms for Shortest Paths in Dynamic and Evolving Networks , Algorithms (2021) Volume Editor for proceedings of ESA, ATMOS, COCOON, and others Conference Leadership: He has served on numerous program committees and as chair for conferences including ESA (Engineering Track, 2016), ATMOS (2020), and ICALP (2019). His involvement spans algorithmic engineering, transportation optimization, and theoretical computer science forums. Teaching: He currently teaches COL863: Special Topics in Theoretical Computer Science on concentration inequalities and their applications. He has previously taught advanced courses in algorithms and data structures.
Liza Rebrova is an Assistant Professor in the Department of Operations Research and Financial Engineering (ORFE) at Princeton University's School of Engineering and Applied Science. She is also an associated faculty member of the Program in Applied and Computational Mathematics (PACM) and the Center for Statistics and Machine Learning (CSML). Her research focuses on randomized numerical linear algebra and the mathematics of data science, with connections to high-dimensional probability and stochastic optimization. She develops mathematically justified randomized algorithms for large-scale data, particularly interested in settings where data exhibits mathematical structure such as spectral decay, multi-modality, or non-negativity. Her work addresses challenges in data compression, recovery, and optimization under structured noise conditions. Dr. Rebrova's recent publications show a strong trend toward developing robust algorithms for linear systems, tensor data compression, and nonnegative matrix factorization. Her work bridges theoretical foundations with practical applications in machine learning and data science, with emphasis on memory efficiency and handling corrupted or incomplete data. NSF DMS-2309685 (Single PI, 2024-2026): "Outliers are not what they seem: data-aware, flexible, and robust randomized iterative methods" NSF DMS-2108479 (Collaborative, 2022-2024): "Fast, Low-Memory Embeddings for Tensor Data with Applications" (co-PIs Mark Iwen and Deanna Needell) She currently advises three PhD students (Jackie Lok, Shambhavi Suryanarayanan, and Sofiia Shvaiko) and has previously advised Abraar Chaudhry (PhD 2024) and Nicolo Grometto (Masters thesis 2023). At Princeton, she teaches graduate courses including ORF526 (Graduate Probability), ORF387 (Networks), and ORF523 (Convex and Conic Optimization).
Maya Ramanath is an Associate Professor in the Department of Computer Science and Engineering at Indian Institute of Technology (IIT) Delhi. She joined IIT Delhi in 2011 after a postdoctoral research stint at the Max-Planck Institute for Informatics in Germany. Her research interests focus on database systems, information retrieval, semantic web technologies, and knowledge graph construction and applications. Education: PhD in Computer Science, Indian Institute of Science, Bangalore M.Sc.(Engg.) in Computer Science, Indian Institute of Science, Bangalore B.E. in Computer Science and Engineering, Bangalore University, Bangalore Her recent work emphasizes efficient query processing over large-scale graphs, knowledge graph applications, and natural language interfaces for semantic data. Notable contributions include algorithms for reachability approximation in web-scale graphs, speculative query planning for knowledge graphs, and exploratory querying techniques. She has collaborated extensively on projects like NAGA, ESTHETE, and KlusTree, advancing the state of the art in graph-based data management and semantic search. Publications span conferences such as ICDE, ECIR, EDBT, and VLDB, reflecting a strong focus on database systems, graph algorithms, and semantic web applications. Her work bridges theoretical foundations with practical implementations, addressing scalability and efficiency challenges in modern data management systems. Research and advising activities include supervision of projects on distributed graph processing, query optimization, and knowledge representation. She has contributed to open-source tools like LegoDB and StatiX, and her lab focuses on interdisciplinary approaches to data-centric AI.
Dr. Amin Keramati is an Assistant Professor of Supply Chain Management at Widener University’s School of Business Administration. He holds a PhD in Transportation & Logistics from North Dakota State University and previously served as a graduate research assistant at the Upper Great Plains Transportation Institute. His work includes federally funded projects like the Mountain-Plains Consortium’s MPC-550 project, focusing on highway-rail grade crossing safety. Dr. Keramati teaches courses in enterprise resource planning, decision analytics, database management, transportation/logistics, project management, and data analytics. Education: PhD in Transportation & Logistics, North Dakota State University Graduate Research Assistant at Upper Great Plains Transportation Institute Research Focus: Dr. Keramati develops mathematical, statistical, and machine learning approaches to solve complex problems in transportation, supply chain, and logistics. Key areas include data mining, big data decision support, transportation network analytics, project scheduling, smart manufacturing, and accident analysis. His interdisciplinary work bridges supply chain optimization with emerging technologies like blockchain for healthcare and clinical trials. Awards & Recognition: Student Paper Award, American Association of State Highway and Transportation Officials (2017) Grants & Projects: Lead researcher on the Mountain-Plains Consortium’s MPC-550 project, which expanded his dissertation work on safety systems for highway-rail crossings. Collaborates on federally funded transportation safety initiatives and supply chain optimization for bioethanol and pharmaceutical industries. Labs/Teams: Active in Widener’s School of Business research groups focusing on supply chain innovation and interdisciplinary projects combining logistics with emerging technologies.
Stanislav Smirnov is a Professor at the University of Geneva's Department of Mathematics since 2003 and Head of the Chebyshev Laboratory at St. Petersburg State University since 2010. He holds a Ph.D. from the California Institute of Technology (1996) and a B.Sc./M.Sc. from St. Petersburg State University (1992). His research focuses on mathematical physics, probability, complex analysis, and dynamical systems, with groundbreaking contributions to the understanding of critical phenomena in statistical physics. Key achievements include receiving the Fields Medal (2010), the highest honor in mathematics, for his work on percolation and the Ising model. He has organized major international conferences, such as the 'St. Petersburg School in Probability & Statistical Physics' (2012) and the '2D Statistical Physics Workshop' (2013). His academic career includes positions at Yale University, the Max-Planck Institute, and KTH Royal Institute of Technology. Education: Ph.D., Mathematics, California Institute of Technology (1996) B.Sc./M.Sc., Mathematics (with honors), St. Petersburg State University (1992) Awards: Fields Medal (2010) European Research Council Advanced Grants (2008, 2013) Rollo Davidson Prize (2002) Salem Prize (2001) Smirnov’s research bridges probability theory and complex analysis, with notable results on conformal invariance in two-dimensional models. His work has advanced understanding of critical exponents, percolation thresholds, and the universality of phase transitions. He advises doctoral students and collaborates internationally on projects funded by Swiss and European grants. He co-organized over 20 conferences worldwide, including plenary talks at the International Congress of Mathematicians (2006, 2010) and the World Congress in Probability and Statistics (2012). His lab fosters interdisciplinary research, linking mathematics to physics and computer science.
Paul Gölz is an Assistant Professor at Cornell University's School of Operations Research and Information Engineering (ORIE), with affiliations in Computer Science. His research focuses on computational social choice, algorithmic fairness, and AI ethics, addressing topics like democratic innovation, fair resource allocation, and AI systems for diverse users. Education: Undergraduate studies at Saarland University (Germany), PhD in Computer Science from Carnegie Mellon University, followed by postdoctoral research at Harvard University, UC Berkeley, and the Simons Laufer Mathematical Sciences Institute. His work has been recognized with awards including the JPMorgan Chase AI Research Fellowship (2021) and honorable mentions for prestigious dissertation awards (Dantzig and ACM SIGecom). Research Highlights : Developed Panelot, a tool for selecting citizens' assemblies using state-of-the-art algorithms. His work on fair refugee resettlement and apportionment methods has been featured in Operations Research and Nature . Recent projects include AI alignment distortion analysis and generative social choice mechanisms. Teaching : Teaches Optimized Democracy (Spring 2025) and Mathematical Programming (Fall 2024). Supervises PhD students in ORIE, focusing on interdisciplinary applications of optimization and social choice. Awards & Grants : Received a $40K Structural Democracy Fellowship (Crankstart) and an OpenAI grant for Democratic Inputs to AI. Active in policy briefs (e.g., mini-public selection strategies). Labs/Tools : Co-developed Panelot.org , a nonprofit platform for fair citizen assembly selection. Active in open-source tool development for social choice applications.
Sarah Billington is the UPS Foundation Professor of Civil and Environmental Engineering at Stanford University and a Senior Fellow at the Woods Institute for the Environment. Her research program focuses on sustainable building design, human wellbeing, and ethical supply chain practices. Education: PhD, University of Texas at Austin, Structural Engineering (1997) MSE, University of Texas at Austin, Structural Engineering (1994) BSE, Princeton University, Civil Engineering & Operations Research (1990) Her lab employs interdisciplinary methods to study how built environments impact human physical, psychological, and social wellbeing. Current projects include developing tools to quantify nature exposure in buildings, exploring affordable housing's role in wellbeing, and using AI to assess forced labor risks in material supply chains. While no longer active in this area, her group previously pioneered research on sustainable construction materials like bio-based composites and ductile cement-based composites. Her recent publications address topics such as nature integration in architecture, workplace design optimization, and health impacts of building materials. The Billington Lab at Stanford fosters collaborative team science, welcoming partnerships to advance occupant-centric engineering solutions.
Celestine Mendler-Dünner is a Principal Investigator at the ELLIS Institute in Tübingen, co-affiliated with the Max Planck Institute for Intelligent Systems and the Tübingen AI Center. She leads the Algorithms and Society research group, focusing on machine learning in social contexts and the role of prediction in digital economies. Her work bridges theoretical machine learning with practical societal impact, developing tools for safe, reliable, and equitable AI ecosystems. Her educational background includes a PhD from ETH Zurich in collaboration with IBM Research, followed by an SNSF postdoctoral fellowship at UC Berkeley hosted by Moritz Hardt. She was previously a group leader at the Max Planck Institute for Intelligent Systems before joining the ELLIS Institute. Mendler-Dünner's research spans several interconnected themes including performative prediction (where predictions change the behavior they aim to predict), algorithmic collective action (how participants can steer AI systems toward common goals), and the role of LLMs in social science research. Her work combines theoretical foundations with practical implementations, addressing challenges in interactive machine learning, optimization in dynamic environments, and context-specific evaluation of AI systems. She particularly examines how algorithmic predictions mediate services and platforms at societal scale, exploring concepts of economic power in digital markets. Her publication record shows a clear evolution from system-aware machine learning algorithms (including foundational work on IBM Snap ML) toward increasingly sociotechnical questions at the intersection of machine learning, economics, and policy. Recent work focuses on measuring performative power in digital economies, evaluating LLMs as risk scores, and developing frameworks for algorithmic collective action in recommender systems and labor markets. Among her notable recognitions are the ETH Medal for her dissertation, the IBM Research Division Award, the Fritz Kutter Award, and the IBM Eminence and Excellence Award. She is an ELLIS Scholar, a fellow of the Elisabeth-Schiemann-Kolleg, and affiliated with several prestigious research programs including the International Max Planck Research School for Intelligent Systems and the Max Planck ETH Center for Learning Systems. ETH Medal (dissertation award) IBM Research Division Award Fritz Kutter Award IBM Eminence and Excellence Award SNSF Early Postdoc Mobility Fellowship Mendler-Dünner actively mentors the next generation of researchers, advising PhD student Patrik Wolf and supervising research interns including Joachim Baumann, Haiqing Zhu, and Anna Badalyan, as well as Master's student Dorothee Sigg. She serves as core faculty for the International Max Planck Research School and associated faculty for the Max Planck ETH Center for Learning Systems. Her group has secured significant research funding through fellowships and institutional support, enabling work on projects like Powermeter (measuring search engine influence) and Snap ML (resource-efficient machine learning library with over 1 million PyPI downloads). She leads the Algorithms and Society research group, which examines machine learning as part of broader sociotechnical ecosystems. The group explores human-population interactions with algorithmic systems and incorporates these insights into learning system fundamentals. Current projects include investigating economic incentives in digital platforms, developing tools for systematic LLM evaluation in social science contexts, and creating frameworks for collective action in algorithmic systems. Mendler-Dünner also co-organizes the Algorithmic Collective Action workshop at NeurIPS 2025, demonstrating her leadership in emerging research directions at the AI-society interface.
Andrea Coladangelo is an Assistant Professor at the Allen School of Computer Science & Engineering , University of Washington , co-leading the Quantum group and contributing to the Theory and Crypto groups. He coordinates the NSF-funded Quantum@UW REU program , fostering undergraduate research in quantum information. Previously, he was a postdoctoral researcher at UC Berkeley and the Simons Institute , advised by Umesh Vazirani , following a PhD in Computer Science at Caltech under Thomas Vidick . His academic journey began with a B.A. in Mathematics from Oxford and a Master in Mathematics from Cambridge . He co-founded qBraid , a platform for quantum computing education. Research Interests : Andrea explores the intersection of quantum computation and cryptography , focusing on foundational questions in entanglement , quantum correlations , and quantum learning theory . His work investigates quantum pseudorandomness , device-independent security , quantum algorithms , and quantum copy-protection , often leveraging computational assumptions to bridge quantum information theory with cryptographic applications. Scientific Awards : 2025 Google Research Scholar Program Award in Quantum Computing 2023 CSE Undergraduate Teaching Award for his course on quantum computation 2019 Best Student Paper Award at QIP Teaching & Outreach : Andrea designed and taught CSE 434: Intro to Quantum Computation (Spring 2023, 2024, 2025), CSE 534: Quantum Information and Computation (Autumn 2023), and CSE 599C: Quantum Learning Theory (Winter 2025). He also delivered lectures at the 22nd Bellairs Crypto Workshop (2024) and led a quantum programming tutorial using qBraid . Labs & Teams : As co-leader of the Quantum group at the Allen School, he collaborates with researchers in Theory and Crypto , advancing quantum computing through interdisciplinary projects and educational initiatives.
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.
Florentina Bunea is a Professor in the Department of Statistics and Data Science at Cornell University’s Bowers College of Computing and Information Science, and an active member of the Graduate Fields of Statistics, Applied Mathematics, and Computer Science. She also serves on the Diversity and Inclusion Council of her college, championing workforce diversity in data-science disciplines. Education & Institutional Roles Professor, Department of Statistics and Data Science, Cornell University Member, Graduate Fields of Statistics, Applied Mathematics, Computer Science Member, Diversity and Inclusion Council, Bowers College of Computing and Information Science Research Interests Professor Bunea’s research lies at the intersection of statistical machine-learning theory and high-dimensional inference. She develops rigorous methodology supported by sharp theoretical guarantees to tackle core problems in modern data science. Recent themes include: Soft-max mixtures for understanding large-language-model/AI algorithms Optimal transport for high-dimensional mixture distributions Wasserstein-distance inference for sparse mixing measures in topic models Latent-space clustering and cluster-based inference in high dimensions Network modeling and hidden-structure inference Applications spanning genetics, systems immunology, neuroscience, sociology, and economics Research Funding & Awards Her work is supported by grants from the National Science Foundation (NSF-DMS). She is a Fellow of the Institute of Mathematical Statistics and a recipient of the IMS Medallion Award. Editorial & Service Contributions Associate Editor: Annals of Statistics, Bernoulli, JASA, JRSS-B, EJS, Annals of Applied Statistics Co-Editor: Chapman & Hall/CRC Statistics and Applied Probability Monograph Series Advising & Collaboration Professor Bunea has mentored numerous doctoral and post-doctoral researchers, including Xin Bing, Shuyu Liu, Seth Strimas-Mackey, and Yang Ning, among others. Collaborative projects extend across Cornell and external institutions, producing widely-used software packages and high-impact publications. Contact Office: 1184 Comstock Hall, Cornell University Email: fb238@cornell.edu Phone: (607) 255-8449
Brendan Russo serves as an Associate Professor in the Department of Civil Engineering, Construction Management, and Environmental Engineering at Northern Arizona University, where he conducts influential research in transportation safety and traffic engineering. His work focuses on improving safety outcomes for vulnerable road users through rigorous analysis of crash data, traffic operations, and emerging mobility technologies, with significant contributions to Arizona-specific transportation challenges and national safety practices. Russo's research program centers on bicycle and pedestrian safety, crash severity analysis, and the integration of autonomous systems into transportation networks. He employs advanced methodologies including spatial analysis, statistical modeling (e.g., random parameters bivariate probit models), and observational studies to investigate traffic stress levels, intersection safety, and the impacts of infrastructure treatments. His work consistently bridges theoretical transportation engineering with practical applications for safer community design. Analysis of Russo's recent publications reveals a strong emphasis on emerging transportation technologies and their safety implications, particularly regarding autonomous delivery robots and vehicle-pedestrian interactions, while maintaining core focus on traditional safety concerns like bicycle crash frequency and severity. His research demonstrates increasing integration of spatiotemporal analysis and scenario-based testing methodologies, with a clear geographic concentration on Arizona metropolitan regions that provides valuable localized insights applicable to broader transportation contexts. No scientific awards were mentioned in the provided text. No specific information about advising responsibilities or grant funding was provided in the text, though his extensive publication record and dataset contributions indicate active research leadership. Russo collaborates within a robust research network centered on transportation safety, frequently partnering with colleagues including Gehrke, Smaglik, and Holliday on projects involving field data collection, bicycle infrastructure evaluation, and safety performance metrics. His work leverages both observational studies and simulation approaches to develop data-driven guidance for transportation practitioners, with particular attention to Arizona's unique transportation environment and metropolitan planning challenges.
