Quanquan C. Liu is an Assistant Professor in the Department of Computer Science at Yale University, part of the School of Engineering & Applied Science. His research focuses on algorithms for large data, dynamic/distributed/parallel graph algorithms, and differential privacy. He holds a PhD from MIT's Theory Group, advised by Erik Demaine and Julian Shun, with postdoctoral experience at Northwestern University and MIT. Liu has authored over 50 publications in top venues like FOCS, SPAA, and STACS, and received a Best Paper Award at SPAA 2022. He advises a team of 12+ students, including PhD and undergraduate researchers. His service roles include PC membership for PPoPP, ESA, and SPAA, and coaching for the USA Computing Olympiad (USACO) and ICPC teams. Notable research contributions include advancements in parallel algorithms for graph problems and privacy-preserving techniques.
Susan Davidson is the Weiss Professor in the Department of Computer and Information Science at the University of Pennsylvania, where she co-directs the Data Science Program. She currently serves as Deputy Dean of the School of Engineering and Applied Science and chairs the Computing Research Association's Board of Directors. Her research focuses on databases, bioinformatics, data management, and provenance-based systems. Co-founder, Greater Philadelphia Bioinformatics Alliance Founding co-director, Center for Bioinformatics Fulbright Scholar and Hitachi Chair, INRIA-GEMO Key research areas include data citation, trust management in collaborative systems, workflow provenance, and privacy in data analysis. Her recent publications explore explainability frameworks, sub-table selection for data exploration, and security in distributed training systems. 2023 Lindback Award for Distinguished Teaching 2021 VLDB Women in Databases Award 2021 AAAS Fellow 2020 Spira Award for Teaching & Mentoring 2017 IEEE TCDE Impact Award She has advised numerous PhD students and postdocs, including Sudeepa Roy (Duke University) and Julia Stoyanovich (NYU). Courses taught recently include CIS550 (Database Systems) and CIS545 (Big Data Analytics).
Andrew M. Stuart is a Professor at the California Institute of Technology's Division of Engineering and Applied Science. His research bridges computational mathematics, machine learning, and physical modeling, focusing on inverse problems, partial differential equations, and multiscale systems. He has pioneered methodologies integrating Gaussian processes, Kalman inversion, and neural operators for scientific computing. His recent publications highlight innovations in competitive protein dimerization networks, nonlinear Bayesian inference, and operator learning. Articles span applications in materials science, geophysics, and biochemical signal processing, emphasizing data-driven discovery of differential equations and scalable algorithms for high-dimensional problems. Stuart's work addresses challenges in structural error modeling, uncertainty quantification, and graph-based learning, with implications for climate modeling and dynamical systems. Despite extensive contributions, the scraped data does not specify students, awards, or contact details.
Dr. Mi Jung Park is an Assistant Professor in the Department of Computer Science at the University of British Columbia (UBC), part of the Faculty of Science. She is also a Canada CIFAR AI Chair at the Amii. Her research focuses on privacy-preserving machine learning, particularly differential privacy, synthetic data generation, and their applications in healthcare. She holds a PhD in Electrical and Computer Engineering from the University of Texas at Austin, supervised by Dr. Jonathan Pillow, and has held postdoctoral positions at the University of Amsterdam and University College London. Education : PhD, Electrical and Computer Engineering, University of Texas at Austin (2016) Master's, Electrical and Computer Engineering, University of Texas at Austin (2012) Bachelor's, Electrical and Computer Engineering, Hanyang University, Seoul, South Korea (2009) Research Interests : Her lab develops methods to balance privacy and accuracy in data analysis, emphasizing differential privacy's role in healthcare. Key areas include: Generating synthetic data with privacy guarantees Integrating fairness, interpretability, and causality into privacy-preserving models Bayesian techniques for model compression and uncertainty estimation Recent Work Trends : Her publications explore differential privacy in generative models (e.g., diffusion models, kernel methods) and neural network pruning. Recent work highlights privacy-preserving techniques for image classification, latent diffusion, and perceptual feature integration. Awards : Canada CIFAR AI Chair (2021). Advising & Grants : Supervises postdocs (e.g., Mingyu Kim), master's students (e.g., Amman Yusuf), and PhD candidates (e.g., Margarita Vinaroz). Her research is supported by the CIFAR AI Chair program and collaborations with institutions like the Max Planck Institute for Intelligent Systems. Labs & Teams : Leads the Privacy-Preserving Machine Learning Lab at UBC, advancing technologies to protect sensitive healthcare data while enabling clinical and research use.
Zongyi Li is a Research Fellow at Massachusetts Institute of Technology , hosted by Kaiming He. They are currently pursuing a Ph.D. in Computing and Mathematical Sciences at Caltech (2019-2025), mentored by Anima Anandkumar and Andrew Stuart. Ph.D. candidate: Computing and Mathematical Sciences, Caltech (2019-2025) B.Sc. in Computer Science and Mathematics with a Jazz minor from Washington University in St. Louis (2015-2019) They focus on Neural Operators for learning solution operators in Partial Differential Equations (PDEs) , particularly in fluid mechanics and earth science . Their work models physical simulations with chaotic behaviors and complex geometries, showing applications in weather forecasting , carbon storage , and aerodynamics simulation . Publications emphasize resolution-invariant models , chaotic systems , and zero-shot super-resolution capabilities. Their research combines Fourier analysis , graph networks , and physics-informed loss functions to achieve state-of-the-art performance in PDE solving with up to 1000x speedup over traditional solvers. Fellowships: Kortschak Scholarship PIMCO Fellowship Amazon AI4Science Fellowship Nvidia Fellowship MIT Novo Nordisk AI Fellowship Code & Open-Source: Co-developer of the NeuralOperator library Implementations for Fourier Neural Operators , Graph Neural Operators , and Tensorized Neural Operators Media Recognition: Quanta Magazine MIT Tech Review NVIDIA Features Towards Data Science
Steve Mussmann serves as an Assistant Professor in the School of Computer Science at the Georgia Institute of Technology, where he joined in Fall 2024. His research centers on data-centric machine learning, with emphasis on active labeling, data selection, and adaptive experimental design methodologies. He maintains active collaborations through Georgia Tech's Foundations of AI (FoAI) and ML@GT research groups. Mussmann earned his PhD in Computer Science from Stanford University in 2021 under Percy Liang's supervision, following a BS in Math, Statistics, and Computer Science from Purdue University in 2015. His professional trajectory includes a machine learning researcher role at Coactive AI and an IFDS postdoctoral fellowship at the University of Washington's Paul Allen School of Computer Science and Engineering. His research program investigates theoretical and practical aspects of data efficiency in machine learning systems, particularly focusing on active learning frameworks, statistical properties of data algorithms under concept drift, and task specification via prompts or demonstrations. Current projects address challenges in label-efficient training of large language models and multimodal dataset development. Analysis of his 15 most recent publications reveals a consistent focus on advancing data-centric methodologies, with increasing emphasis on large-scale applications like multimodal datasets and language model fine-tuning. His work bridges theoretical guarantees in experimental design with practical frameworks like LabelBench for benchmarking label efficiency. Mussmann has received recognition through the IFDS postdoctoral fellowship. His contributions to the field include foundational work on active learning theory and data selection algorithms. IFDS postdoctoral fellow He currently advises five graduate students including PhD candidates Kangping Hu (CS) and Hangyu Zhou (ML), alongside MS students Kabir Kang and Kalp Vyas, and undergraduate Saloni Bedi. Former advisee Wei-Liang (Edison) Liao completed BS research under his supervision. His teaching portfolio includes graduate courses CS 7545 (Machine Learning Theory) and CS 8803-DML (Data-centric Machine Learning). Mussmann operates within Georgia Tech's Foundations of AI initiative and ML@GT collective, which provide infrastructure for large-scale data-centric research. His lab develops open-source tools like LabelBench for reproducible evaluation of data selection techniques, with ongoing projects exploring video data exploration systems and adaptive finetuning frameworks for foundation models.
Shipra Agrawal is an Associate Professor at the Department of Industrial Engineering and Operations Research, Columbia University, with affiliations to the Data Science Institute and the Department of Computer Science. Her research bridges optimization and machine learning, focusing on decision-making in uncertain environments. PhD in Computer Science from Stanford University (2011) Researcher at Microsoft Research India (2011–2015) Her work addresses online optimization , reinforcement learning , and game theory , aiming to develop algorithms that balance exploration and exploitation for long-term goals. Applications include internet advertising , revenue management , and resource allocation . Recent publications examine dynamic pricing models, regret bounds in reinforcement learning, and convex knapsack optimization. Her research has been supported by NSF CAREER , Google Faculty Research , and Amazon Research Awards . NSF CAREER Award CMMI-1846792 (2019) Google Faculty Research Award (2017) Amazon Research Award (2017) She has advised PhD students who now hold positions at institutions like Google DeepMind, Amazon, and Facebook. Agrawal serves as an associate editor for Management Science , INFORMS Journal on Optimization , and Journal of Machine Learning Research , and co-chaired major conferences such as COLT 2024 and AISTATS 2025.
Stefano NASINI is an Associate Professor at the University of Lille 3, specializing in Quantitative Methods within the Economics and Mathematics Sciences. He holds a HDR (Habilitation à Diriger des Recherches) from the University of Lille 3 (2021), a Ph.D. in Statistics and Operations Research from the Polytechnic University of Catalonia (2015), and a Master in Statistics (2011). His research focuses on optimization, complex networks, statistical inference, and microeconomic applications. He has held academic positions including a post-doctoral role at IESE Business School (2014–2016) and a visiting researcher role at the University of Lisbon (2014). His work spans scheduling optimization, network analysis, financial contagion modeling, and energy system planning. Key contributions include specialized algorithms for large-scale optimization problems and frameworks for decentralized portfolio management. He is a member of the LEM research group and teaches courses in optimization, econometrics, and social network analysis at the Grande École and MSc levels. Publications highlight interdisciplinary applications, including network-based diffusion models, multi-market financial strategies, and dynamic choice analysis. His research bridges theoretical advancements in operations research with practical challenges in economics, energy, and transportation systems. No scientific awards are explicitly listed in the provided materials. His advising roles and grants are not detailed here, but his extensive publication record reflects active collaboration within academic and applied domains.
Amit Kumar is the Jaswinder and Tarwinder Chadha Chair Professor in the Department of Computer Science and Engineering at IIT Delhi. His research focuses on combinatorial optimization, online algorithms, and algorithmic fairness. He has taught courses such as Approximation Algorithms (COL 754), Design and Analysis of Algorithms (COL 351), and Numerical Analysis (COL 726). His work spans theoretical computer science with applications to clustering, scheduling, and fairness in evaluation processes. Research Interests Kumar's research emphasizes developing efficient algorithms for online and dynamic settings, particularly in constrained optimization and biased evaluation systems. He explores theoretical foundations of clustering, load balancing, and resource allocation, with recent contributions to fair food delivery systems and coreset constructions. Publications His recent work includes advancements in online convex paging (STOC 2025), consensus clustering (SODA 2025), and fairness-aware algorithms (AAAI 2024). Over 70 papers across top venues like STOC, SODA, and ICML reflect his expertise in algorithm design and analysis. Awards Best Paper Award at ISAAC 2023 for 'Clustering What Matters in Constrained Settings' Teaching & Mentorship Kumar instructs graduate and undergraduate courses in algorithms, data structures, and numerical methods. He advises students through these courses and collaborates with researchers on NSF-funded projects related to approximation algorithms and streaming systems.
Bernhard J. Berger is a Lecturer in the Department of Computer Engineering at the Institute of Embedded Systems, Hamburg University of Technology (TUHH). His research focuses on software security, static code analysis, machine learning, optimization, and research data management. He has held significant roles such as Program Committee member for ICPC 2025 and MSR 2025, and has received awards including the Best Reviewer Award (ICPC 2023) and Best Engineering Paper Award (SCAM 2019). His work spans interdisciplinary applications including maritime systems security, GPU-accelerated AI, and evolutionary algorithms. Recent studies emphasize AI-driven security tools (e.g., ML-SAST) and domain-specific language approaches to optimization (EvoAl). He has contributed to over 30 peer-reviewed publications, with notable work in IEEE Transactions on Software Engineering and Science of Computer Programming. Berger collaborates closely with industry through DAAD review committees and serves on artifact evaluation boards for ISSTA and ARES conferences. Education: Doctoral Thesis (2022), Diploma in Computer Science (2007) Key Projects: ArchSec tool suite, Threat Modeling Frameworks, Bauhaus static analysis methodology Lab Affiliation: Embedded Systems Design Group His advisory roles include Deputy of TUHH's Election Verification Committee and Session Chair at IEEE Congress on Evolutionary Computation 2023. Current research trends integrate machine learning with static analysis for automated vulnerability detection, while also exploring explainable AI techniques for neural network optimization.
Rina Dechter is a Professor of Computer Science at the University of California, Irvine (UCI), affiliated with the Donald Bren School of Information and Computer Sciences (ICS). She specializes in automated reasoning, probabilistic and constraint-based graphical models, and causal inference. Dechter has held leadership roles, including Co-Editor-in-Chief of Artificial Intelligence since 2011 and editorial board memberships in journals such as the Constraint Journal and Journal of Machine Learning Research . Education : Ph.D., Computer Science, University of California, Los Angeles (UCLA) M.S., Applied Mathematics, Weizmann Institute B.S., Mathematics and Statistics, Hebrew University of Jerusalem Research Interests : Dechter’s work focuses on computational aspects of automated reasoning, constraint processing, probabilistic reasoning, and causal inference. She develops efficient algorithms for graphical models, emphasizing tractable reasoning tasks and anytime search strategies. Her recent projects include causal decision-making frameworks funded by a $5M NSF grant. Awards : Presidential Young Investigator Award (1991) AAAI Fellow (1994) ACP Research Excellence Award (2007) ACM Fellow (2013) Elected to the American Academy of Arts & Sciences (2025) Grants & Collaborations : She leads a multi-institutional NSF-funded project on causal foundations of AI decision-making. Her work emphasizes trustworthiness in AI through causal models, with applications in robotics and public health.
Mohsen Ghaffari is an Associate Professor at MIT's Department of Electrical Engineering and Computer Science (EECS), holding the Steven and Renee Finn Chair. His research focuses on theoretical computer science, particularly distributed and parallel algorithms, graph theory, and network optimization. Formerly, he was a tenured CS faculty member at ETH Zurich until 2022. PhD in Computer Science from MIT (2016) His research interests include distributed algorithms, parallel computing, graph decomposition, and network congestion management. His recent work addresses coreness decomposition, spanner construction, and Euclidean k-center optimization in massive parallel computation frameworks. Notable scientific awards include the ACM Doctoral Dissertation Award (Honorable Mention), ACM-EATCS Doctoral Dissertation Award, and multiple best paper awards at FOCS, PODC, and SODA. He has advised numerous PhD and Master's students, many of whom have transitioned to academic and industry roles. He has taught courses at MIT and ETH Zurich on distributed algorithms, advanced algorithms, and massively parallel computation. His professional activities include serving on program committees for SODA, FOCS, STOC, and organizing workshops like Highlights of Algorithms (HALG) and Workshop on Local Algorithms (WOLA).
Jan Dreier is a Research Fellow at the Institute of Logic and Computation at Vienna University of Technology. His research centers on structural graph theory and algorithmic meta-theorems, particularly exploring the boundaries of tractability for model checking problems. Dreier's work bridges theoretical computer science and discrete mathematics, focusing on graph decompositions, parameterized complexity, and logical expressiveness. Key research themes include monadic stability in graph classes, applications of model theory to computer science, and efficient algorithms for logical queries on structured graphs. His publication record shows consistent focus on graph sparsity concepts and algorithmic applications of logic, with recent work expanding into approximation methods for counting queries. Research demonstrates sophisticated applications of combinatorial methods to fundamental problems in computational complexity.
Theo Damoulas is a Professor of Machine Learning at the University of Warwick with a joint appointment in the Department of Computer Science and Statistics. He is a Turing AI Fellow (2021-2026) through UK Research and Innovation, an ELLIS member, and a Visiting Professor at New York University's Center for Urban Science and Progress (CUSP). He founded and leads the Warwick Machine Learning Group and has directed major projects at The Alan Turing Institute including Project Odysseus and the London Air Quality project. Education includes: PhD in Probabilistic Multiple Kernel Learning (University of Glasgow, 2009) MSc in Informatics (Distinction, University of Edinburgh, 2004) MEng in Mechanical Engineering (1st Class, University of Manchester, 2003) His research focuses on probabilistic machine learning and Bayesian statistics, emphasizing the integration of structural priors, spatiotemporal dependencies, physical laws, and causal relationships. Key applications include Digital Twins, urban science, and computational sustainability. His work advances robust and scalable inference methodologies for complex real-world systems. Publications demonstrate strong emphasis on Bayesian methods, spatiotemporal modeling, and uncertainty quantification, with applications spanning battery modeling, urban mobility, federated learning, and causal inference. Recent work shows increased focus on physics-informed models, federated learning frameworks, and causal abstraction techniques. Major scientific awards: Turing AI Acceleration Fellowship (2021-2026) Best Paper Awards (Wilkes 2024, AISTATS 2022, IEEE ICMLA 2010) ACM SIGMOD Most Reproducible Paper (2017) Dissertation Award (Classification Society 2012) Teaching Excellence nominations (Warwick 2015-2017) He actively advises PhD students and secured significant grants including the £multi-million Turing AI Fellowship. Current doctoral researchers investigate federated learning, causal inference, and spatiotemporal modeling. He leads the Warwick Machine Learning Group, a cross-departmental team developing foundational ML methods for scientific and societal challenges.
Alexandra Boldyreva is a Professor at the Georgia Institute of Technology, holding joint appointments in the School of Cybersecurity and Privacy and the School of Computer Science. She serves as Associate Chair for Graduate Studies in the School of Cybersecurity and Privacy and coordinates the Information Security Master’s program in the College of Computing. Her affiliations include the Institute for Information Security & Privacy (IISP), the Algorithms, Combinatorics and Optimization (ACO) program, and the Algorithms and Randomness Center (ARC). She earned her Ph.D. in Computer Science from the University of California, San Diego, and holds bachelor’s and master’s degrees in applied mathematics from St. Petersburg State Technical University, Russia. Her research focuses on cryptography and information security, with notable contributions to encryption methods, authentication protocols, and privacy-preserving systems. Boldyreva’s work emphasizes provable security analysis of protocols like FIDO2 and TLS 1.3, as well as searchable encryption and data privacy techniques. Her recent studies include secure communication channel establishment, leakage quantification in encryption systems, and applications of fuzzy search in encrypted databases. She has received Test of Time Awards for foundational contributions to cryptography. Boldyreva leads initiatives in cybersecurity education and has secured grants for research in secure communication protocols and human-computing approaches to key exchange. Her interdisciplinary collaborations span computer science, mathematics, and privacy engineering.
