Peter Bühlmann is a Professor at ETH Zürich within the Seminar für Statistik , focusing on high-dimensional statistics, causal inference, and machine learning. His work bridges theoretical advancements with practical software implementations in R packages like pcalg , mboost , and glmmlasso , impacting fields such as genomics, proteomics, and intensive care analytics. Key Contributions : Causal structure learning, stability selection, anchor regression, and deconfounding. Software : Developed widely used R packages for statistical modeling and causal inference. Teaching : Courses on high-dimensional statistics at ETH Zürich and international institutions. Research Trends : Recent articles emphasize causal robustness, domain adaptation, and applications in medicine. His work addresses challenges in heterogeneous data, missing values, and covariate shifts using methods like spectral deconfounding and residual prediction tests. Scientific Recognition : Co-author of a paper designated as a New Hot Paper (Meinshausen and Bühlmann, 2006) by Essential Science Indicators, indicating significant impact in high-dimensional multiple testing.
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.
Michael A Osborne is Professor of Machine Learning at the University of Oxford and leads the Bayesian Exploration Lab . He serves as Director of the EPSRC Centre for Doctoral Training in Autonomous Intelligent Machines and Systems and co-directs the Oxford Martin AI Governance Initiative. His research focuses on Bayesian optimization, Gaussian processes, and probabilistic numerics with applications in quantum devices, battery modeling, and AI governance. Key Positions: Professor of Machine Learning, University of Oxford Official Fellow, Exeter College Co-founder of Mind Foundry Lead Researcher, Oxford Martin Programme on Technology and Employment Research Themes: Probabilistic modeling for quantum systems Uncertainty quantification in energy storage AI safety and societal impact analysis Automated experimental design Quantum device calibration Probabilistic numerical methods Technical Contributions: Bridging reality gap in quantum devices Efficient Bayesian quadrature techniques Personalized neurostimulation algorithms Automated measurement protocols Quantum-classical hybrid ML
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.
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.
Osman Yağan is a Research Professor in the Department of Electrical and Computer Engineering at Carnegie Mellon University (CMU), with affiliate faculty status in the School of Computer Science. He is also a core member of CyLab Security and Privacy Institute. Prior to joining CMU in 2013, he was a Postdoctoral Research Fellow at CyLab. He holds a Ph.D. in Electrical and Computer Engineering from the University of Maryland (2011) and a B.S. from Middle East Technical University (2007). His research focuses on modeling, analysis, and optimization of computing systems, leveraging applied probability, network science, data science, and machine learning. Key areas include multi-armed bandits, resilient machine learning, contagion processes in networks, and cybersecurity. Research Interests include Machine Learning, Data Science, Network Science, Cybersecurity, and Robustness in Cyber-Physical Systems. He has advised numerous students, including current PhD candidates Yurun Tian, Orkun İrsoy, and Ishank Juneja, as well as notable alumni such as Mansi Sood (now at MIT) and Jun Zhao (Assistant Professor at Nanyang Technological University). Key Awards include the CIT Dean's Early Career Fellowship, IBM Academic Award, and Best Paper Awards at ICC 2021, IPSN 2022, and ASONAM 2023. His work spans theoretical contributions (e.g., contagion models in multi-layer networks) and applied research (e.g., mitigating cascading failures in power systems). He leads or co-leads grants from ONR, NSF, and ARO, focusing on resilient machine learning, network robustness, and pandemic modeling.
Clifford Stein is a Professor of Industrial Engineering and Operations Research (IEOR) and Computer Science at Columbia University, and Associate Director for Research at the Data Science Institute. He holds a Ph.D. (1992), M.S. (1989), and B.S.E. (1987) from MIT and Princeton University, respectively. His research focuses on algorithms, combinatorial optimization, operations research, scheduling, and computational biology. A co-author of the best-selling textbook Introduction to Algorithms , Stein has published widely in top venues and holds prestigious awards like ACM Fellow and NSF Career Award. His work includes foundational contributions to minimum cut algorithms, scheduling theory, and network optimization, supported by NSF and Sloan Foundation grants. Stein has advised over 40 graduate and undergraduate students, many now in academia and industry.
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.
Moe Z. Win is the Robert R. Taylor Professor at the Massachusetts Institute of Technology (MIT), specializing in wireless communications, optical communications, and space communications systems. His research bridges theoretical and applied domains, including quantum sensing, network localization, and signal processing. B.S.E.E., Texas A&M (1987) M.S.E.E. & Ph.D., University of Southern California (1989, 1998) Recent work focuses on quantum-enhanced positioning, machine learning for localization, and next-generation (xG) non-terrestrial networks. He leads research at the Quantum neXus Laboratory (QX Lab), Wireless Information & Network Sciences Lab, and Laboratory for Information and Decision Systems. His career spans the Jet Propulsion Laboratory (1987-1995) and AT&T Research Laboratories (1998-2002). Key methodologies include soft information fusion, variational quantum sensing, and robust beam tracking for terahertz communications.
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.
Daniel Dominic Kaplan Sleator is a Professor of Computer Science at Carnegie Mellon University's School of Computer Science. He maintains an office in the Gates-Hillman Center (7205 Gates-Hillman) and teaches various courses in algorithms and theoretical computer science. Professor Sleator's research spans several areas of theoretical computer science and algorithms. His primary interests include: Algorithms and Data Structures Amortized Analysis and Competitive Analysis Persistent and Self-Adjusting Data Structures Computational Geometry and Combinatorial Optimization Combinatorial Game Theory and Mathematical Games Music Analysis using Computational Methods His extensive publication record shows a consistent focus on efficient data structures and algorithms. Over the years, his work has evolved from foundational data structures like splay trees and skew heaps to applications in diverse areas such as music analysis and combinatorial games. A notable trend in his work is the development of self-adjusting data structures that achieve excellent amortized performance without maintaining explicit structural constraints. His papers on splay trees, skew heaps, and persistent data structures have become classics in the field. Professor Sleator has made significant contributions across multiple domains of computer science. His work on competitive algorithms for paging and list update problems has been particularly influential, establishing fundamental results in online algorithms. His research extends beyond traditional computer science into interdisciplinary areas like computational music theory, demonstrating the broad applicability of algorithmic thinking. He teaches a variety of courses including Algorithms 15-451/651, Competition Programming 15-295, and specialized topics like mathematical games.
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
Dean Eckles is an Associate Professor of Marketing at MIT Sloan School of Management and serves as an Associate Director of the MIT Institute for Data, Systems, and Society (IDSS). He is also affiliated with the MIT Schwarzman College of Computing through the Institute for Data, Systems & Society and its Statistics and Data Science Center. Additionally, he leads the analytics research area at the Initiative on the Digital Economy and organizes the annual Conference on Digital Experimentation (CODE@MIT). His educational background includes a BA in philosophy, BS and MS in cognitive science, MS in statistics, and PhD in communication, all from Stanford University. Prior to joining MIT, Eckles worked as a scientist at Facebook, where he contributed to areas including News Feed, messaging, advertising, tools for randomized experiments, and survey methods. He previously held research positions at Nokia and Yahoo. Eckles's research primarily focuses on social influence mediated by interactive technologies, examining how communication technologies mediate, amplify, and direct social influence. His work spans multiple specific areas including social interactions, contagion, and interventions in networks; experimental design and inference in networks; and methods for causal inference. His research often combines social science with advanced statistical methods. His notable publications include research on long ties in social networks and their relationship to economic prosperity, how network structure affects social contagions, and algorithmic transparency in social media platforms. His work has appeared in prestigious journals including PNAS and Nature Human Behaviour, and he has provided expert testimony before the US Senate on algorithmic ranking. Long ties, disruptive life events and economic prosperity (PNAS) Long ties accelerate noisy threshold-based contagions (Nature Human Behaviour) Algorithmic transparency and assessing effects of algorithmic ranking (Senate testimony) Eckles actively shares his research through social media platforms including Bluesky, Twitter, and Mastodon, as well as through his blog and contributions to the Gelman et al. blog. His work bridges academic research with practical applications in technology and policy.
