Osbert Bastani is an Associate Professor at the Department of Computer and Information Science, University of Pennsylvania, leading the trustml@Penn research group. He is affiliated with the ASSET , PRECISE , and PRiML centers, and the PLClub research group. His research focuses on Trustworthy Neurosymbolic Systems , Synthesizing Neurosymbolic Programs , and Machine Learning for Programmer Productivity , with applications in verification, fairness, and human-AI collaboration. He received the NSF CAREER Award in 2023. His recent publications (2024-2025) emphasize AI Safety , LLM Robustness , and Algorithmic Fairness , including work on adversarial robustness, conformal prediction, and program synthesis. Students he has advised include Sagnik Anupam, Stephen Mell, Jason Ma, Shuo Li, and others. Awards: NSF CAREER Award (2023)
David Mazières is a Professor at Stanford University , affiliated with the School of Engineering and the Department of Computer Science . He serves as a software engineer at the Stellar Development Foundation . His work bridges academic research and industry applications in distributed systems and security. University: Stanford University Academic Rank: Professor Email: dm@scs.stanford.edu Research Interests: David Mazières' research focuses on distributed systems , cryptocurrencies , and computer security . Key areas include consensus protocols (e.g., Stellar ), low-latency scheduling ( Syrup , Shinjuku ), and cryptographic techniques for privacy and security ( SafetyPin , CCFI ). Key Achievements: His notable works include: TCP-ENO (RFC 8547) for secure transport protocols Stellar Consensus Protocol for decentralized finance SOSP 1999 Best Paper for 'Separating key management from file system security' Teaching Contributions: He has taught core and advanced courses at Stanford since 2005, including CS212 (Operating Systems) , CS240h (Functional Systems in Haskell) , and CS251 (Cryptocurrencies and Blockchain Technologies) . Previously taught courses at NYU (2001-2005).
Rachit Agarwal is an Associate Professor in the Department of Computer Science at Cornell University, with research focusing on systems, networking, and theoretical problems arising in practical systems. He leads a research group working on resource disaggregation, host architecture, secure cloud storage, and datacenter design. PhD in Computer Science, Cornell University Undergraduate, IIT Kanpur His research spans three major directions: Resource Disaggregation (with $3M NSF and Google awards), Host Architecture (exploring terabit interconnects), and PANCAKE (secure oblivious cloud storage with $1M NSF award). He also contributed to foundational work in Near-optimal Datacenter Design and Data Plane Monitoring . Awards include the Sloan Fellowship, NSF CAREER, IRTF Applied Networking Prize, and multiple best paper awards. His recent publications focus on host network architecture, congestion control, oblivious data access mechanisms, and secure cloud storage systems. He has advised multiple Ph.D. and postdoctoral researchers who now hold faculty positions at leading institutions. Sloan Research Fellowship NSF CAREER award Kavli Fellowship IRTF Applied Networking Research Prize SIGCOMM Best Student Paper Award Usenix Security Distinguished Paper Award Tau Beta Pi Professor of the Year 2025 Rachit has advised numerous students including current Cornell advisees like Midhul Vuppalapati, Shreyas Kharbanda, and Omar Eqbal. Former advisees include Saksham Agarwal (UIUC), Qizhe Cai (UVA), and Mina Tahmasbi Arashloo (University of Waterloo). His research is supported by large NSF grants and industry awards, with deployments in real-world systems and open-source contributions.
Robert Ghrist is the Andrea Mitchell University Professor at the University of Pennsylvania with dual appointments in the Department of Mathematics and the Department of Electrical and Systems Engineering. He serves as Associate Dean for Undergraduate Education for Penn Engineering. His educational background includes a B.S. in Mechanical Engineering from the University of Toledo (1991), and M.S. and Ph.D. degrees in Applied Mathematics from Cornell University (1994, 1995). Ghrist's research bridges pure and applied mathematics, focusing on applied algebraic topology , dynamical systems , and geometric methods in data science. His work extends to network theory, topological data analysis, and computational geometry, with applications spanning robotics, neuroscience, and social dynamics. Key innovations include developing sheaf-theoretic approaches for networked systems and persistence homology techniques for high-dimensional data. Analysis of his recent publications reveals a strong emphasis on lattice-theoretic frameworks , topological robotics , and network dynamics , with emerging applications in neural data interpretation and geometric computing. His research consistently integrates category theory with real-world engineering challenges. Significant scientific recognition includes: Presidential Early Career Award (PECASE, 2004) Scientific American 'Top 50' Research Leader (2007) Mathematical Association of America's Chauvenet Prize (2013) University of Pennsylvania Lindback Award for Distinguished Teaching (2015) DoD National Security Science and Engineering Faculty Fellowship (NSSEFF, 2015) Ghrist leads multiple federally funded research initiatives supported by AFOSR, DARPA, NSF, and ONR. He directs the development of educational tools including the Calculus BLUE/GREEN Project video series and custom GPTs for mathematical pedagogy. His open online courses have reached over 100,000 learners globally.
Lena Mashayekhy is an Associate Professor at the University of Delaware, affiliated with the Cloud Computing Lab. Her research focuses on advanced computational paradigms including edge and cloud computing, energy efficiency, and cyber-physical systems. She holds a PhD from Wayne State University (2015) and contributes to interdisciplinary domains at the intersection of computer systems and autonomous technologies. Education: PhD | Wayne State University | 2015 Her research interests span: Edge Computing Cloud Computing Energy-Efficient Computing Cyber-Physical Systems Autonomous Vehicles Electric Vehicles Game Theory Contact: Office 434 Smith Hall, Phone: 302-831-1944, Email: mlena@udel.edu
Raman Arora is an Associate Professor in the Department of Computer Science at Johns Hopkins University, with affiliations to the Mathematical Institute for Data Science (MINDS), the Center for Language and Speech Processing (CLSP), and the Institute for Data-Intensive Engineering and Science (IDIES). His research spans theoretical and practical aspects of machine learning, focusing on robustness, privacy, representation learning, and optimization. Research Interests: Machine Learning Theory Representation Learning (e.g., Deep CCA, Multi-view Learning) Privacy-Preserving Machine Learning (Differential Privacy) Robustness in Deep Learning Online and Reinforcement Learning Stochastic Optimization Algorithms His recent publications, primarily in top-tier venues like NeurIPS, ICML, and ICLR, demonstrate a strong focus on the theoretical foundations of adversarial robustness, multi-task learning, offline reinforcement learning, and differentially private optimization. His work often bridges theory and practice, with applications in speech, language, and data-intensive systems. Scientific Awards and Honors: NSF CAREER Award (2020) ICML Test-of-Time Award Finalist (2023) for Deep CCA Member, Institute for Advanced Study (2019–2020) Visiting Scientist, Simons Institute (2019, 2020, 2022) Advising and Grants: Raman Arora has advised numerous PhD and master’s students, many of whom are now researchers at leading tech companies like Google, Meta, and Microsoft. His research is supported by significant grants from the NSF (including CAREER, BIGDATA, TRIPODS, and CRCNS awards), DARPA, and other agencies, focusing on foundational aspects of machine learning such as inductive biases, privacy, robustness, and computational neuroscience. Laboratory and Research Group: He leads a dynamic research group at Johns Hopkins, comprising current PhD students and postdoctoral researchers working on the intersection of theory and applications in machine learning. The group is actively involved in projects related to adversarial robustness, meta-learning, offline reinforcement learning, and private optimization.
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.
California Institute of Technology (Caltech)United States
Jonathan N. Katz is the Kay Sugahara Professor of Social Sciences and Statistics at the California Institute of Technology (Caltech). He holds a S.B. from MIT (1990), M.A. from UC San Diego (1992), and Ph.D. from UC San Diego (1995). His career includes roles as Assistant Professor (1995-98), Associate Professor (1998-2003), and Professor (2003-11) at Caltech, with subsequent appointments as Sugahara Professor (2012–present), Executive Officer for Social Sciences (2007), and Division Chair (2007–14). His research focuses on statistical methods in social sciences, electoral systems, and public policy. Key affiliations include the Caltech/MIT Voting Technology Project and the Linde Institute of Economic and Management Sciences. Katz is Deputy Editor for Social Sciences at Science Advances and a Fellow of the American Academy of Arts and Sciences (2011) and the Society for Political Methodology (2008). Research interests span political methodology, formal theory, and American politics. Recent work addresses partisan fairness in electoral systems, statistical rigor in political modeling, and institutional dynamics in legislative and judicial contexts. Notable contributions include critiques of electoral college bias and audits of political behavior research methodologies. Awards: Career Achievement Award in Political Methodology (2024), Inaugural Fellow, Society for Political Methodology (2008). Grants/Labs: Caltech/MIT Voting Technology Project, Linde Institute Directorship (2013–14).
University of Illinois Urbana-ChampaignUnited States
Bo Li is an Associate Professor at the University of Illinois at Urbana-Champaign, affiliated with the Siebel School of Computing and Data Science. Her research focuses on trustworthy machine learning, emphasizing robustness, privacy, and security in AI systems. She leads the Secure Learning Lab (SL²), exploring adversarial attacks and defenses across digital and physical domains. Key contributions include foundational work on adversarial examples, robust learning frameworks, and privacy-preserving techniques. Her academic roles include advisory board positions at the Center for Artificial Intelligence Innovation (CAII) and membership in the Information Trust Institute (ITI). She collaborates with institutions like the Advanced Digital Science Center (ADSC) and the Quantum Information Science and Technology Center (IQUIST). Notable recognitions include the IJCAI Computers and Thought Award (2022), MIT Technology Review's 35 Innovators Under 35 (2020), and multiple best paper awards. Recent work addresses AI safety through frameworks like ShieldAgent and AutoRedTeamer, aiming to enhance system resilience against adversarial threats. Her research spans theoretical guarantees, practical defenses, and ethical AI deployment. Students advised include Chulin Xie, Linyi Li, and Boxin Wang, who have received prestigious fellowships such as the IBM PhD Fellowship and Rising Stars in ML Awards. Advising: Guides PhD students in adversarial ML, privacy, and security. Labs/Teams: Secure Learning Lab (SL²), collaboration with ALERT program. Grants/Funding: NSF CAREER Award, Amazon/Google Faculty Awards, and industry partnerships.
Nina Balcan is a Professor at Carnegie Mellon University and holds the Cadence Design Systems Professorship in Computer Science. She is affiliated with the School of Computer Science, specifically the Machine Learning Department (MLD) and Computer Science Department (CSD). Her research spans foundational aspects of machine learning, artificial intelligence, theoretical computer science, algorithmic game theory, and interdisciplinary connections in learning theory. Machine Learning Artificial Intelligence Theoretical Computer Science Algorithmic Game Theory Multi-Agent Systems Data-Driven Algorithm Design Her recent work focuses on advancing algorithm design through machine learning, robustness in adversarial environments, and economic modeling. Key contributions include Learning to Branch (JACM 2024), Regret Minimization in Stackelberg Games (NeurIPS 2024), and Learning Accurate Decision Trees (UAI 2024, Outstanding Student Paper Award). She has pioneered novel approaches to data-driven optimization, semi-supervised learning, and privacy-preserving clustering. Nina has received prestigious accolades including ACM Fellow AAAI Fellow Simons Investigator 2019 ACM Grace Murray Hopper Award Her teaching at CMU includes graduate courses on machine learning, advanced machine learning, and specialized topics like algorithmic game theory.
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.
University of Illinois Urbana-ChampaignUnited States
Daniel Cooney is an Assistant Professor in the Department of Mathematics at the University of Illinois Urbana-Champaign. He holds additional affiliations as an Affiliate at the Carl R. Woese Institute for Genomic Biology. His research focuses on applying partial differential equations (PDEs), dynamical systems, and stochastic processes to study evolutionary dynamics, particularly in biological and social systems. Key themes include multilevel selection, evolutionary game theory, and the emergence of cooperative behavior. Cooney earned his PhD in Applied and Computational Mathematics from Princeton University, advised by Simon Levin, and completed a postdoc as a Simons Fellow in Mathematical Biology at the University of Pennsylvania. His work bridges theoretical mathematics with applications in ecology, epidemiology, and social sciences. Recent publications explore topics like altruistic punishment in cultural systems, classroom-turnover dynamics, and protocell evolution. He actively participates in academic outreach, co-organizing conferences such as the AMS Special Session on Mathematics of Infectious Disease and the SIAM Minisymposium on Social-Ecological Systems. His research has been published in high-impact journals including *Proceedings of the National Academy of Sciences* and *Bulletin of Mathematical Biology*.
Noah D. Goodman is Associate Professor of Psychology and Computer Science, and Linguistics (by courtesy) at Stanford University. He directs the Computation & Cognition Lab (CoCoLab) at Stanford, where he leads research on computational models of cognition, integrating logic and probability. His work spans cognitive psychology, linguistics, and computer science. Primary Appointment: Psychology Department By Courtesy: Computer Science Department and Linguistics Department Director: Computation & Cognition Lab (CoCoLab) Goodman's research focuses on computational models of cognition, with particular interest in probabilistic approaches to understanding human thought. His work integrates logic and probability to model concepts, categorization, intuitive theories, causal learning and reasoning, social cognition (including reasoning about others' goals, beliefs, and actions), cognitive development (especially acquisition of abstract knowledge), and natural language semantics and pragmatics. He has made significant contributions to the development of probabilistic programming languages as tools for cognitive modeling. His recent publications demonstrate a strong trend toward integrating probabilistic modeling with linguistic theory and social cognition. The articles span computational cognitive science, natural language processing, and artificial intelligence, with a consistent theme of using probabilistic frameworks to understand complex cognitive phenomena. Many papers explore how humans make inferences under uncertainty across different domains. Goodman teaches several courses at Stanford including Language and Thought (Psych 132), Computation and Cognition: the Probabilistic Approach (Psych 204/CS 428), Foundations of Cognition (Psych 205), and Introduction to Cognitive Science. He has also led seminars on topics ranging from natural and artificial intelligence to the science of meditation.
Andrés Buxó-Lugo serves as an Assistant Professor of Psychology at the University at Buffalo, where he directs the Language Processing and Computation Lab. His research investigates the cognitive mechanisms underlying language production, comprehension, and acquisition with a specialized focus on speech prosody—the rhythm, intonation, and intensity patterns in speech—and their role in human communication. His primary research interests include psycholinguistics, cognitive psychology, speech prosody, language production, language comprehension, language acquisition, and computational linguistics. He examines how listeners integrate diverse linguistic cues during speech processing, how individuals learn unfamiliar constructions like non-native pronunciations or novel prosodic patterns, and the cognitive basis of durational changes in speech. His work also explores how communicative context shapes prosodic production and how higher-level linguistic information aids prosodic structure parsing. Analysis of his 15 most recent publications (2019-2025) reveals consistent interdisciplinary work bridging cognitive science, linguistics, and computational modeling. Key trends include phonological representation studies, speech planning mechanisms, intonation adaptation across talkers, lexical representation structures, and the integration of input expectations in syntactic parsing. His research demonstrates significant methodological diversity, incorporating experimental paradigms, computational modeling, and acoustic analysis to unravel language processing complexities. As director of the Language Processing and Computation Lab at the University at Buffalo, Buxó-Lugo leads research initiatives focused on developing computational models of language processing while investigating the cognitive foundations of speech and prosody through empirical experimentation and theoretical innovation.
