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.
Kamalika Chaudhuri is a Professor in the Department of Computer Science and Engineering at the University of California, San Diego (UCSD), and also serves as a Director and Research Scientist with the FAIR team at Meta AI. Her research focuses on the foundations of trustworthy machine learning, including robust machine learning, learning with privacy, and out-of-distribution generalization. Dr. Chaudhuri has earned her PhD from UC Berkeley in 2007 with a dissertation on "Learning Mixtures of Distributions." Her academic journey has led her to become a leading researcher in machine learning theory with a particular emphasis on privacy and robustness. Her research interests span machine learning foundations with a strong focus on trustworthy AI . She investigates problems at the intersection of differential privacy , adversarial robustness , and out-of-distribution generalization . Her work addresses critical challenges in developing machine learning systems that maintain privacy while preserving utility, resist adversarial attacks, and generalize effectively beyond training data distributions. She has pioneered approaches in privacy-preserving machine learning, robust learning theory, and methods for detecting and mitigating data memorization in models. An analysis of her recent publications (2024-2025) reveals a strong focus on the intersection of privacy, security, and machine learning. Her work spans differential privacy mechanisms, membership inference attacks, memorization detection, and fairness certification. She has been particularly active in developing methods for privacy-preserving foundation models, with several papers on differentially private computer vision and language models. Her research demonstrates a consistent thread of addressing fundamental challenges in trustworthy AI while developing practical solutions that balance privacy, accuracy, and utility. Best Award at the ICLR 2024 Workshop on Privacy Regulation and Protection in Machine Learning Distinguished Paper Award at IEEE Conference on Secure and Trustworthy Machine Learning (SaTML), 2024 Dr. Chaudhuri has advised numerous PhD students who have gone on to prominent positions at Google, DeepMind, Microsoft Research, and other leading AI institutions. Her group maintains an active research blog with guest posts from UCSD researchers. She has served in significant leadership roles including General Chair for ICML 2022 and Program Co-Chair for both ICML 2019 and AISTATS 2019, where she pioneered initiatives to improve reproducibility in machine learning research. Her research group at UCSD focuses on trustworthy machine learning, with current projects spanning privacy-preserving AI, robustness against adversarial attacks, and methods for ensuring reliable out-of-distribution generalization. The group collaborates closely with the FAIR team at Meta AI, where Dr. Chaudhuri serves as a Research Scientist.
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.
Kaiyuan Yang is an Associate Professor in the Department of Electrical and Computer Engineering at Rice University, leading the Secure and Intelligent Micro-Systems (SIMS) Lab. His research focuses on low-power integrated circuits and bioelectronic implants for applications like the Internet of Everything and medical devices. He holds a B.S. from Tsinghua University (2012) and M.S./Ph.D. degrees from the University of Michigan (2017). Research Interests: Low-power digital/analog/mixed-signal systems Bioelectronics and implantable devices Hardware security and PUF design Mixed-signal computing and emerging materials Recent work emphasizes magnetoelectric-powered implants, secure backscatter communication, and in-memory computing architectures. His publications span top venues like IEEE ISSCC, IEDM, and ACM MobiCom. Awards: 2022 NSF CAREER Award 2022 IEEE Top Picks in Hardware Security 2016 IEEE SSCS Predoctoral Achievement Award Dr. Yang serves on editorial boards for IEEE TVLSI and program committees for ISSCC/CICC. His lab develops miniature, secure, and energy-efficient systems for healthcare and IoT applications.
Paul Goldberg is a Professor of Computer Science and Director of the MSc in Mathematics and Foundations of Computer Science (MFoCS) at the University of Oxford. He holds a BA in Mathematics from Oxford University and a PhD in Computer Science from the University of Edinburgh. His research focuses on algorithmic game theory, computational complexity, and machine learning, with notable contributions to equilibrium computation, complexity classes of total search problems, and decentralized systems. Affiliations: Department of Computer Science, Oxford; Editorial Board of ACM Transactions on Economics and Computation. Education: PhD in Computer Science (1993), University of Edinburgh MSc in Computer Systems Engineering (1989), University of Edinburgh and Université Paris-Sud BA in Mathematics (1988), Oxford University Research Interests: Algorithmic game theory, computational complexity (especially total search problems like CLS and PPAD), decentralized computation of equilibria, and applications in machine learning and AI. His work bridges theoretical computer science and economics, with a focus on algorithm design and complexity analysis. Publications and Awards: Over 120 papers, including influential work on Nash equilibrium complexity (2009), gradient descent (2023), and fair division algorithms. Notable awards include the ACM SIGecom Test of Time Award (2022) and a SIAM Outstanding Paper Prize (2011). Grants and Students: Leads EPSRC-funded projects on game theory and machine learning. Supervised 11 PhD graduates and currently advises Giannis Tyrovolas and others. Active in mentoring MSc and undergraduate projects. Labs/Teams: Part of the Algorithms and Complexity Theory group at Oxford, contributing to research on optimization, equilibrium dynamics, and fair division.
Tülay Adali is a Professor in the Department of Computer Science and Electrical Engineering at the University of Maryland, Baltimore County (UMBC). She has held this position since 1992 and was named a Distinguished University Professor in 2015 for her contributions to statistical signal processing and machine learning. Currently serving as Editor-in-Chief of the IEEE Signal Processing Magazine, she has also held leadership roles in IEEE committees and conferences. Her research focuses on statistical signal processing, machine learning, and their applications in medical imaging and data fusion. Dr. Adali earned her Ph.D. in Electrical Engineering from North Carolina State University in 1992. Her work integrates foundational signal processing techniques with biomedical applications, addressing challenges in neuroimaging analysis. She leads the Machine Learning for Signal Processing laboratory, supported by grants from NSF and NIH. Her lab develops algorithms for analyzing complex signals in medical contexts, emphasizing reproducibility and interdisciplinary collaboration. Recognition includes IEEE Fellow, AIMBE Fellow, AAIA Fellow, Humboldt Research Award, and NSF CAREER Award. She has authored numerous papers on fMRI analysis, independent component analysis, and multimodal data fusion. Her editorial leadership and service to technical communities reflect her commitment to advancing signal processing and education. Education: Ph.D. in Electrical Engineering, North Carolina State University (1992) Grants: NSF, NIH-funded projects on medical imaging and signal processing Awards: SPS Meritorious Service Award, SPIE Pioneer Award
Lijie Chen is an Assistant Professor in the Department of Electrical Engineering and Computer Sciences at UC Berkeley, where he is part of the Berkeley Theory Group. Previously, he was a Miller Research Fellow at UC Berkeley, hosted by Avishay Tal and Umesh Vazirani, and earned his Ph.D. from MIT under Ryan Williams. His research focuses on theoretical computer science, particularly computational complexity theory, with applications to quantum physics and AI safety. Education: Ph.D. in Computer Science from MIT (2022), B.Sc. from Yao Class at Tsinghua University. Research Interests: Complexity theory, quantum complexity, derandomization, circuit lower bounds, and foundational aspects of AI safety. Chen has made significant contributions to understanding fundamental questions in complexity theory, including circuit lower bounds and the connections between randomness and computation efficiency. His work often bridges theoretical insights with practical implications in quantum computing and algorithm design. Awards and Honors: Machtey Award for Best Student Paper (2019). Danny Lewin Best Student Paper Award (2019). Invited to SICOMP Special Issues for FOCS and STOC papers. He has organized workshops on complexity theory and derandomization, and his research has been recognized in venues like STOC, FOCS, and the Journal of the ACM.
J. Andrew Bagnell is a Professor at the Robotics Institute of Carnegie Mellon University (CMU). His research bridges planning, control theory, and computational learning, focusing on systems that can self-optimize under partial models. Key projects include the LAIRLab (Learning Applied to Intelligent Robotics) and initiatives in the ARM-S and BIRD MURI programs. Research domains: Machine Learning, Robotics, Control Theory, Optimization, Probabilistic Modeling Key applications: Mobile Robotics, Intelligent Transportation Systems, Multi-Robot Decision Making Recent work emphasizes imitation learning, trajectory optimization, and game-theoretic algorithms for decision-making. His publications highlight collaborations with students and researchers on topics like online learning, planning under uncertainty, and autonomous systems. Notable affiliations include advising Gokul Swamy and past students such as Wen Sun and Anirudh Vemula. Labs: LAIRLab, ARM-S, BIRD MURI team.
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.
Takuya Ooura is an Assistant Professor at the Research Institute for Mathematical Sciences (RIMS) at Kyoto University, specializing in numerical analysis and mathematical software development. His work bridges theoretical mathematics with practical applications in scientific computing and software development. Dr. Ooura earned his educational credentials through a rigorous academic path: he graduated from Hokuriku High School in 1987; completed his undergraduate studies at Nagoya University's School of Science in 1992; earned his Master of Engineering from the Department of Applied Physics at the University of Tokyo in 1994; and completed his PhD (Engineering) from the same department in 1997. His academic journey continued with a Research Fellowship from the Japan Society for the Promotion of Science (1997) followed by a position as Research Associate at RIMS, Kyoto University (2000). Dr. Ooura's research focuses on numerical integration algorithms, particularly his groundbreaking double exponential formula for Fourier-type integrals, which has been incorporated into Mathematica's NIntegrate function. He has also developed a high-speed FFT library that's utilized in Google Chrome browser (visible in chrome://credits). His work on continuous Euler transformation for accelerating convergence of slowly decaying integrals represents significant innovation in numerical analysis. His research spans both theoretical development and practical implementation of mathematical algorithms with real-world applications. His publication record demonstrates consistent contributions to numerical analysis, with particular emphasis on quadrature methods, integral transforms, and high-precision computation. His work shows a clear progression from theoretical foundations to practical implementations, with several algorithms achieving widespread adoption in commercial and open-source software. Paper prize awarded by JSIAM (2000) for 'A continuous Euler transformation and its application to Fourier transforms of slowly decaying functions' Paper prize awarded by JSIAM (2001) for 'Improvement of the PI Calculation Algorithm and Implementation of Fast Multiple-Precision Computation' Paper prize awarded by JSIAM (2005) for 'An Improved Convergence Test for the Double Exponential Formula' Japan Society for Industrial and Applied Mathematics 4th Achievement Award (2014) for 'Pioneering and practical development of the double exponential numerical integration method' Dr. Ooura has developed several widely used mathematical software packages including the double exponential integral formula, Clenshaw-Curtis numerical integration rule, and a general-purpose FFT library. His FFT package is particularly notable for its speed and accuracy, with benchmark tests showing superior performance compared to other implementations. His software has been incorporated into major projects including Google Chrome and SETI@home, demonstrating the practical impact of his theoretical work. His future research directions include further development of numerical computation libraries and applying his methods to various computational problems.
Jenna Wise DiVincenzo is an Assistant Professor at the Elmore Family School of Electrical and Computer Engineering at Purdue University. She specializes in research areas such as software verification, formal methods, and programming languages, with a focus on gradual verification techniques that combine static and dynamic analysis. Her work emphasizes usability and scalability in verification tools, and she has contributed to projects like Gradual C0 and gradual null-pointer analysis. Dr. DiVincenzo earned her PhD in Software Engineering from Carnegie Mellon University (2023) and a BS in Mathematics and Computer Science from Youngstown State University (2017). She has interned at IBM Research, MIT Lincoln Laboratory, and the Software Engineering Research and Empirical Studies Lab at YSU. Her awards include the Google PhD Fellowship, NSF GRFP Fellowship, and 2022 Rising Star in EECS. Her research projects span theoretical advancements in gradual verification, empirical studies on usability, and practical tool development. She advises PhD students (e.g., Craig Liu, Conrad Zimmerman) and collaborates on initiatives like gradual verification for Rust and educational tools to teach verification concepts. Her work also explores leveraging large language models for specification generation and enhancing verification tool soundness through formal proofs.
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
Brenden Lake is an Associate Professor of Computer Science and Psychology at Princeton University, starting Fall 2025. Previously, he was an Associate Professor of Psychology and Data Science at New York University. He is the principal investigator of the lab for Human & Machine Intelligence, which moved from NYU to Princeton in 2025 and is jointly affiliated with the Department of Computer Science and the Department of Psychology. His lab is located in Princeton's Peretsman Scully Hall, rooms 117, 120, and 121. Ph.D., Massachusetts Institute of Technology, 2014 Lake's research focuses on the intersection of human and machine intelligence, specifically examining human cognitive abilities that elude current AI systems. His work centers on few-shot learning of new concepts, learning by generating new goals, learning by asking questions, and learning by producing novel combinations of known components. He employs modern neural network modeling approaches including meta-learning, fine-tuning LLMs, neuro-symbolic modeling, and learning from child headcam videos. His research aims to advance both psychology and computer science by exploring what makes human intelligence unique and using those insights to develop more powerful AI systems. Lake's recent publications demonstrate significant trends in grounded language acquisition through child perspectives, systematic generalization in neural networks, and the intersection of developmental psychology with AI. His work has appeared in top-tier venues including Science (2024) and Nature (2023), with multiple publications exploring how insights from human cognition can improve machine learning systems. His research shows how incorporating human cognitive ingredients can make AI systems more powerful and human-like while addressing longstanding debates about neural network capabilities. Science publication (2024) on Grounded language acquisition through the eyes and ears of a single child Nature publication (2023) on Human-like systematic generalization through a meta-learning neural network Multiple publications covered by major media outlets including New York Times and Washington Post Lake advises Ph.D. students in computer science, psychology, and related fields through his lab. His research is supported by publications in top venues across computer science and cognitive science. He teaches courses including Computational Cognitive Modeling and Advancing AI through Cognitive Science, bridging the theoretical and practical aspects of his research. Lake leads the lab for Human & Machine Intelligence, which studies the ingredients of intelligence in humans and machines. The lab investigates human cognitive abilities that current AI systems cannot replicate, with the dual goal of advancing psychological understanding of human intelligence while developing more capable artificial intelligence systems. Current research focuses on few-shot concept learning, learning through goal generation, and learning by asking questions.
Marlon Dumas is a Professor of Information Systems at the University of Tartu's Faculty of Science and Technology, with a 20-year academic career spanning Estonia and Australia. He holds a PhD in Computer Science from the University of Grenoble 1, France, and has served as Head of Chair and Programme Director in Software Engineering programs. Specializes in Business Process Management (BPM) and Process Mining Current research focuses on prescriptive process monitoring, simulation modeling, and data privacy Recipient of 25+ scientific awards, including multiple Test of Time Awards and the Estonian National Research Award in Technical Sciences Editorial leadership: Area Editor for Information Systems (Elsevier) and ERC Starting Grant Panel Chair His work bridges theoretical advancements in BPM with practical applications in financial services and anti-money laundering. He has developed tools like SIMOD, Kronos, and Kairos for process optimization and analysis. His research integrates AI/ML techniques (reinforcement learning, causal inference) with traditional process modeling. Key trends in his recent publications include: Prescriptive monitoring systems combining causal inference and machine learning Privacy-preserving process mining techniques (differential privacy, anonymization) Resource availability modeling and multi-objective process optimization LLM applications for process analysis and intervention policies Scientific honors include: 2024 BPM Best Paper & Prototype Awards 2023 ICPM Best Prototype Award 2019 ERC Advanced Grantee 2017 Estonian National Research Award in Technical Sciences 2019 MODELS Test of Time Award 2017 BPM Best Prototype Award He has mentored PhD candidates as thesis examiner and contributed to 30+ conference program committees, including General Co-Chair roles at ESEC-FSE 2019 and CAiSE 2018. His work has been supported by European Research Council grants and Estonian Science Foundation projects.
Sarita V Adve is the Richard T. Cheng Professor of Computer Science at the University of Illinois at Urbana-Champaign, where she conducts research spanning hardware, programming languages, operating systems, and applications with a focus on domain-specific systems. Her work bridges theoretical foundations and practical implementations, particularly in extended reality and heterogeneous computing. Her educational background includes a Ph.D. and M.S. in Computer Science from the University of Wisconsin-Madison (1993, 1989) and a B.Tech in Electrical Engineering from the Indian Institute of Technology Bombay (1987). Prior to joining Illinois, she served on the faculty at Rice University from 1993 to 1999. Adve's research centers on generalizable and scalable specialization for domain-specific systems, with current emphasis on extended reality (XR) systems including virtual, augmented, and mixed reality. She chairs the ILLIXR consortium to democratize XR research and developed the first fully open-source XR system (ILLIXR). Her foundational contributions include memory consistency models for C++ and Java programming languages, the Spandex coherence framework for heterogeneous systems, and software-driven approaches for hardware reliability. Her work spans hardware reliability (SWAT and RAMP projects), power management (GRACE system), and instruction-level parallelism. Recent publications reveal a strong focus on energy-efficient XR systems, hardware-software co-design for AI workloads, and resilience analysis. Her team explores rendering offload, visual-inertial odometry optimization, and compositional error injection frameworks, often targeting tradeoffs between energy, latency, and accuracy in mobile and edge environments. Fellow of the American Academy of Arts and Sciences Fellow of the ACM and IEEE ACM/IEEE-CS Ken Kennedy Award Anita Borg Institute Woman of Vision in Innovation Award ACM SIGARCH Maurice Wilkes Award Alfred P. Sloan Research Fellowship UIUC University Scholar University of Illinois Campus Award for Excellence in Graduate Student Mentoring Adve actively mentors students and has received multiple teaching awards. She co-founded the CARES movement to address discrimination in CS research events and chairs CS@Illinois CARES. Her service includes leadership roles in ACM SIGARCH (2015-2019), DARPA/ISAT study group, ACM Council, and Computing Research Association. She has secured significant funding including DARPA initiatives and Google Faculty Research Awards. She leads the ILLIXR consortium and has established collaborative research programs such as the $8.3M DARPA Joint University Microelectronics Program. Her lab focuses on open-source XR development, heterogeneous system architectures, and reliability-aware designs, with strong industry and government partnerships.
