Leslie Ann Goldberg is a Senior Research Fellow at St Edmund Hall and Professor of Computer Science at the University of Oxford. She currently serves as Head of the Department of Computer Science (on sabbatical 2025-26) and focuses on foundational problems in Algorithms and Complexity Theory , particularly randomised algorithms for network communication, machine learning, and statistical physics models. Her research includes solving Aldous' 1987 conjecture on backoff protocol instability (with John Lapinskas), developing rigorous mathematical analysis frameworks for algorithmic efficiency, and advancing approximate counting techniques via Markov Chain Monte Carlo methods (with Andreas Galanis and collaborators). Key projects involve graph homomorphisms , Moran process dynamics , and #BIS complexity class analysis. Recent publications (2023-2024) span topics like Sybil defense mechanisms, low-temperature sampling on random graphs, and parameterised subgraph counting modulo 2. Her work demonstrates cross-disciplinary impact in computational biology, statistical physics, and database theory. Scientific Awards include Best Paper Prizes at ICALP 2016, ICALP 2010, and IPEC 2017. She supervises PhD student Paulina Smolarova and collaborates extensively with researchers in Oxford and beyond.
Jonathan A. Kelner is a Professor of Applied Mathematics in the Department of Mathematics at the Massachusetts Institute of Technology (MIT) and a member of the MIT Computer Science and Artificial Intelligence Laboratory (CSAIL). His research focuses on applying techniques from pure mathematics to solve fundamental problems in algorithms and complexity theory, with the goal of developing practical algorithms for real-world questions. Dr. Kelner received his undergraduate degree from Harvard University and his Ph.D. in Computer Science from MIT in 2006. Before joining the MIT faculty, he spent a year as a member of the Institute for Advanced Study. His educational background has provided a strong foundation for his interdisciplinary research spanning mathematics and computer science. His research interests include combinatorial optimization, mathematical programming, spectral graph theory, distributed computing, machine learning, computational geometry and topology, computational biology, signal processing, and random matrix theory. Kelner's work demonstrates how deep theoretical insights can lead to practical algorithmic improvements, particularly in graph algorithms and optimization problems. His approach often involves connecting seemingly disparate areas of mathematics to create novel algorithmic techniques. Analysis of his recent publications reveals a strong focus on spectral graph theory, optimization algorithms, and the Sum-of-Squares method. His work frequently addresses fundamental questions in theoretical computer science with practical implications for algorithm design. A notable trend in his research is the development of nearly-linear-time algorithms for various graph problems, which represents significant improvements over previous approaches. NSF CAREER Award Alfred P. Sloan Research Fellowship NEC Award for Research in Computers and Communication Sprowls Doctoral Dissertation Award Best Student Paper Award at STOC 2004 Best Paper Award at STOC 2011 Kokusai Denshin Denwa Junior Faculty Chair 2008 Harold E. Edgerton Faculty Achievement Award 2011 School of Science Award for Excellence in Undergraduate Education 2012 Professor Kelner has been actively involved in mentoring students and has received recognition for his teaching excellence, including the School of Science Award for Excellence in Undergraduate Education in 2012. His research has been supported by prestigious grants including the NSF CAREER Award. He has collaborated extensively with researchers across multiple institutions, often working with other leading figures in theoretical computer science to produce groundbreaking results in algorithm design. At MIT, Kelner is part of both the Mathematics Department and CSAIL, positioning him at the intersection of theoretical mathematics and practical computer science. This dual affiliation reflects the interdisciplinary nature of his work, which bridges pure mathematical theory with concrete algorithmic applications.
Dr. Baijian "Justin" Yang serves as the Associate Dean for Research at Purdue Polytechnic Institute and is a Professor in the Department of Computer and Information Technology at Purdue University. He earned his Ph.D. in Computer Science from Michigan State University, with Master's and Bachelor's degrees in Automation (EECS) from Tsinghua University. Dr. Yang has established himself as a leader in multiple interdisciplinary research domains. Dr. Yang's educational background includes: PhD in Computer Science, Michigan State University (2002) MS in Automation (EECS), Tsinghua University (1998) BS in Automation (EECS), Tsinghua University (1995) His research interests span multiple cutting-edge domains with practical applications: Cybersecurity : Developing novel approaches for threat intelligence, security education, and network defense Big Data : Creating innovative algorithms for dimension reduction, regression with categorical variables, and tensor decomposition Applied Machine Learning : Implementing AI solutions in healthcare, manufacturing, and forestry applications Digital Forestry : Using UAV imagery and remote sensing for forest management and tree species classification Dr. Yang's publication record demonstrates significant impact across multiple disciplines, with recent work focusing on spatial transcriptomics analysis (SiGra), delirium detection using limited-lead EEG, and visual localization technologies. His research bridges theoretical advances with practical applications in healthcare, manufacturing quality control, and environmental monitoring. The interdisciplinary nature of his work is evident in collaborations spanning computer science, healthcare, forestry, and manufacturing domains. His scientific achievements have been recognized with numerous awards: 2023 HRSA Building Bridges to Better Health Competition Winner (Phase 1) and 2nd place ($100,000 prize) in Phase 3 2023 Outstanding Faculty Award in Engagement, Department of Computer and Information Technology, Purdue University 2021 Leadership in Manufacturing Award, Manufacturing Times Digital (MxD) 2021 Good to Great Award, Purdue Polytechnic 2020 Outstanding Faculty Award in Discovery, Department of Computer and Information Technology 2019 University Faculty Scholars, Purdue University As an educator and mentor, Dr. Yang has advised numerous graduate students through their PhD and Master's research. His leadership extends to significant service roles including serving as Faculty Champion for the Holistic Safety and Security research impact area at Purdue Polytechnic from 2018 to 2021, board membership with ATMAE (2014-2016), and participation in the IEEE Cybersecurity Initiative Steering Committee (2015-2017). He holds valuable industry certifications including CISSP, MCSE, and Six Sigma Black Belt, demonstrating his commitment to bridging academic research with industry practice. Dr. Yang leads multiple research projects including "Digital Forestry" for developing tools to quantify forest function, "CHEESE" (Cyber Human Ecosystem of Engaged Security Education), and "CICI" (Supporting Controlled Unclassified Information with a Campus Awareness and Risk Management Framework). His work on "Applied Machine Learning" focuses on solving real-world problems, while his "Dimension Reduction and Memory Amnestic Big Data Regression" project innovates computational algorithms for large-scale data analysis.
Professor Carl Edward Rasmussen is affiliated with the University of Cambridge , where he focuses on Machine Learning , Probabilistic Inference , Decision Making , and Reasoning Under Uncertainty . His work bridges theoretical advancements with practical applications in robotics, control systems, and computational biology. Academic Affiliation: University of Cambridge Academic Role: Professor His research emphasizes scalable Gaussian process methods, Bayesian system identification, and reinforcement learning. Recent projects include transfer learning for antibacterial discovery , graph neural processes for molecular functions , and efficient variational inference techniques . Key themes in his publications highlight uncertainty quantification , model generalization , and nonparametric approaches . Notable Scientific Contributions Advancements in sparse Gaussian process hyperparameter estimation Framework for Bayesian system identification in dynamic systems Hybrid models combining transformers and Gaussian processes
Claire Donnat is an Assistant Professor in the Department of Statistics at the University of Chicago, specializing in statistical and machine learning methods for graph-structured and high-dimensional data. Her work bridges theoretical innovation with applications in biomedical research, environmental science, and public health. Education: B.S. and M.S. in Applied Mathematics from Ecole Polytechnique; Ph.D. in Statistics from Stanford University (2020). Her research focuses on three methodological directions: (1) statistical foundations for graph neural networks (GNNs), (2) structured estimation with graph constraints, and (3) multimodal data integration with uncertainty quantification. Key applications include thermotolerance in photosynthetic microbes, family network analysis for child welfare, and spatial transcriptomics. The 15 most recent publications highlight her work in GNNs, CCA, tensor modeling, and epidemic analysis, with keywords spanning statistics, machine learning, and network science. Her methodological contributions address challenges in sparsity, graph topology, and heterogeneous data fusion. Scientific Awards: Facebook Research Award (2021), C3.AI COVID Grand Challenge winner (2020), Lumiata hackathon winner (2020), Stanford Centennial Award (2019), and others. Claire's research group actively recruits postdocs and students for projects involving graph-based modeling, data integration, and biomedical applications. She also provides research consulting in statistical methodology and graph modeling for life sciences.
Wenpeng Yin is an Assistant Professor in Computer Science and Engineering, specializing in Natural Language Processing and Machine Learning. His research focuses on advancing Large Language Models (LLMs) and their applications in scientific, societal, and interdisciplinary domains. Research Interests : LLMs, medical QA, financial AI, model consistency, and instruction-following frameworks. Recent Work : Investigates low-resource NLP tasks, bias evaluation (Gptbias), and adaptive trading systems using LLMs. Current trends in his publications highlight innovations in multimodal learning, symbolic reasoning, and ethical AI, with a strong emphasis on practical implementations across diverse fields.
Vijay Kumar is the Nemirovsky Family Dean of Penn Engineering at the University of Pennsylvania, with faculty appointments in the Departments of Mechanical Engineering, Computer and Information Science, and Electrical and Systems Engineering. He is a leading figure in robotics and computer architecture research. Research Interests include robotics, particularly multi-robot systems and micro aerial vehicles (MAVs), as well as computer architecture innovations for machine learning, GPU acceleration, and datacenter efficiency. His work spans theoretical foundations and practical applications in autonomous systems and hardware optimization. Scientific Awards include: 1991 NSF Presidential Young Investigator Award 1996 Lindback Award for Distinguished Teaching 2012 ASME Mechanisms and Robotics Award 2014 Engelberger Robotics Award 2017 IEEE George Saridis Leadership Award Multiple best paper awards at DARS, ICRA, and RSS conferences Editorial Leadership includes serving as Editor of the ASME Journal of Mechanisms and Robotics and Advisory Board Member of AAAS Science Robotics Journal . His GRASP Lab team developed foundational frameworks for micro UAV testbeds and swarm robotics.
Dr. Yuzhang Lin is an Assistant Professor in the Department of Electrical and Computer Engineering at NYU Tandon School of Engineering. Previously, he held an Assistant Professor position at the University of Massachusetts Lowell (2018–2023). He earned his Ph.D. from Northeastern University and B.Eng./M.S. from Tsinghua University. His research focuses on smart grids, renewable energy systems, cyber-physical resilience, and machine learning applications. He leads editorial roles for IEEE Transactions on Power Systems and chairs IEEE PES Task Forces on standard test cases and distribution system operations. Dr. Lin’s research has been funded by NSF, DOE, ONR, and others. He is a recipient of the NSF CAREER Award and Northeastern’s Graduate Student Outstanding Research Award. His work emphasizes data-driven solutions for grid resilience, including state estimation, cyber-physical defense, and distributed energy integration. The Lin Group actively seeks PhD candidates interested in advancing smart grid technologies. Education: Ph.D. (Northeastern University), B.Eng./M.S. (Tsinghua University) Grants: NSF, DOE OE/EECE/CESER, ONR, NYSERDA, MassCEC Service Roles: IEEE PES Task Force Co-chair (Standard Test Cases), Secretary (Distribution System Operations Subcommittee) Publications span top journals/conferences, focusing on state estimation, inverter-based resource control, and machine learning for grid systems. His lab develops cutting-edge tools for power system resilience and renewable energy integration.
Jason Li is an Assistant Professor in the Department of Computer Science at Carnegie Mellon University's School of Computer Science. He teaches advanced algorithms courses including 15-754 Spectral Graph Theory (Spring 2025), 15-451 Design and Analysis of Algorithms (Fall 2024), and 15-850 Advanced Algorithms (Spring 2024). His research focuses on fast graph algorithms , particularly solving longstanding open problems through modern algorithmic techniques. Key research themes include preconditioning and locality , which serve as reductions from worst-case to well-behaved and local instances respectively. His work has produced breakthroughs in deterministic global minimum cut algorithms, all-pairs minimum cut (Gomory-Hu trees), and near-optimal parallel shortest path algorithms. Analysis of his recent publications reveals a consistent trend toward almost-linear time algorithms for fundamental graph problems, with significant contributions to dynamic graph algorithms, minimum cut variants, and parallel computation. His work frequently appears in top venues including STOC, FOCS, and SODA, often with multiple best paper recognitions. EATCS Distinguished Dissertation Award (2021) Best Paper Award at SODA 2024 Invited to HALG 2024 Invited to TALG and JACM for SODA 2024 paper Machtey Best Student Paper at FOCS 2019 Professor Li actively advises graduate students including Henry Fleischmann and George Li. His research is supported by collaborations with leading institutions and frequent invitations to present at major conferences. He maintains an open-door policy for CMU students and collaborators, though notes the high volume of research inquiries he receives weekly.
Alexandros G. Dimakis is a Professor at the University of California, Berkeley's Department of Electrical Engineering and Computer Sciences (EECS), College of Engineering. He is also Co-Director of the National AI Institute for Foundations of Machine Learning and Co-Founder of BespokeLabs.ai. PhD (2008) and Diploma (2003) in Electrical Engineering His research focuses on Generative AI , Information Theory , and Machine Learning . Recent work includes advancements in diffusion models, compressed sensing, and causal inference. His publications (150+) emphasize inverse problems, neural network verification, and generative model optimization. Recent publications highlight trends in Diffusion Models for inverse problems, Language Model Scaling , and 3D-Aware Generative Systems . Collaborative projects span biomedical applications, large-scale dataset curation (Datacomp-LM), and parameter-efficient model fine-tuning. Scientific Awards : IEEE Fellow (2022) James Massey Award (2018) NSF CAREER Award (2011) Google Research Faculty Award Best Paper awards at UAI workshops Eli Jury Dissertation Award (UC Berkeley) He advises PhD students in generative modeling, compressed sensing, and information theory. His research group collaborates with institutions like MIT, NYU, and IBM Research. Former students hold positions at Google, Amazon, and academic institutions like Purdue University.
Robert Dick is a Professor in the Department of Electrical Engineering and Computer Science at the University of Michigan, part of the College of Engineering. He previously held roles as Associate Professor at Northwestern University and Visiting Professor at Tsinghua University. He earned his Ph.D. from Princeton University and a Bachelor's degree from Clarkson University. His research focuses on Embedded Systems, Learning Dynamics, Efficient Machine Learning, Privacy, and Censorship Resistance. Key themes include defining problems with correct costs/constraints, broadening access to information technology, mitigating negative tech impacts, and solving inference problems with limited resources. He leads the Embedded Systems Graduate Program and is a member of the Michigan Integrated Circuits Laboratory (MICL). His work spans thermal management, energy-efficient computing, and low-power wireless networks. Notable contributions include innovations in embedded system design, machine vision frameworks, and sensor networks. Courses taught include EECS 507 (Embedded Systems Research), EECS 373 (Embedded System Design), and ENGR 100 (Autonomous Systems). His recent publications emphasize AI model analysis, energy-efficient networks, and environmental sensing. Projects include MemX (attention-aware wearable tech) and LoRa-based LPWAN protocols. Dick co-founded Stryd, a company commercializing embedded systems innovations.
Claudio Canizares is a University Professor and Hydro One Endowed Chair in the Department of Electrical and Computer Engineering at the University of Waterloo. He also serves as Executive Director of the Waterloo Institute for Sustainable Energy (WISE). With a career spanning over 30 years, his research focuses on power systems stability, smart grids, microgrids, and renewable energy integration. He has secured nearly $118 million in grants and supervised 180+ researchers/students. Education: PhD (1991) and MSc (1988) in Electrical Engineering from University of Wisconsin-Madison; Electrical Engineering Diploma (1984) from Escuela Politécnica Nacional, Ecuador. Research Interests : Nonlinear systems theory, FACTS/HVDC applications, energy storage systems, microgrid stability/control, renewable integration in remote communities, and smart grid analytics. His work emphasizes bridging academic research with industrial applications through collaborations with utilities and tech firms. Key Achievements : IEEE Transactions on Smart Grid Editor-In-Chief; multiple IEEE Fellowships (IEEE, Royal Society of Canada, Canadian Academy of Engineering); 2017 IEEE PES Outstanding Educator Award; 2016 IEEE Canada Electric Power Medal. His publications (370+) include landmark papers on microgrid stability definitions and control frameworks, cited over 29,000 times. Teaching: Recently taught ECE 140 (Linear Circuits), ECE 467 (Power Systems Analysis), and graduate courses ECE 6601PD/ECE 6613PD on power systems modeling and analysis.
Stephen A. Vavasis is a Professor in the Department of Combinatorics and Optimization at the University of Waterloo, part of the Faculty of Mathematics. He holds a PhD in Computer Science from Stanford University (1989) and has held academic positions at Cornell University (1989–2006) before joining Waterloo. His research focuses on continuous optimization, data science, first-order methods, scientific computing, and computational mechanics. Current teaching includes courses on convex optimization and portfolio optimization methods. He has served as Associate Dean of Computing (2017–2020) and Interim Director of Data Science graduate programs. His work is supported by NSERC grants. Notable awards include the Hertz Fellowship, Churchill Scholarship, and Guggenheim Fellowship. Vavasis's research emphasizes applications of optimization to clustering, machine learning, and fracture mechanics. His publications span convex optimization frameworks, algorithmic analysis of gradient methods, and numerical methods in mechanics. Recent work explores unifying analyses of first-order optimization algorithms and robust optimization techniques for high-dimensional data problems.
Ismael Castillo is a Professor of Statistics at Sorbonne Université , affiliated with the Laboratoire de Probabilités, Statistique et Modélisation (LPSM) and its Statistics, Data, Algorithms team. He serves as Associate Editor for Annals of Statistics , Bernoulli , and co-Editor for Bayesian Analysis . Research Interests : Mathematical statistics with emphasis on Bayesian nonparametrics , inference in high-dimensional structures , uncertainty quantification , and applications in signal processing and life sciences . Recent Work spans deep neural networks with heavy-tailed weights , posterior and variational inference , fractional posteriors in semiparametric models , and deep Gaussian processes . His publications demonstrate expertise in multiple testing procedures , Spike and Slab priors , and nonparametric Bayesian methods . Awards : IMS Fellow , Honorary Fellow of Institut Universitaire de France , and Best Paper Prize (2021) for research on Pólya tree posterior distributions. Students : Supervised PhD candidates Paul Egels , Thibault Randrianarisoa , and co-supervised Bo Ning (FSMP postdoc) and Kweku Abraham (Hadamard postdoc). Grants : ANR BACKUP (2023-2027, coordinator) and ANR GAP (2021-2025, member).
Benjamin Landon is an Assistant Professor in the Department of Mathematics at the University of Toronto, where he has been faculty since 2021. His office is located in the Bahen Centre for Information Technology, Room 6264. Prior to joining the University of Toronto, he was a CLE Moore Instructor at the Massachusetts Institute of Technology from 2018-2021. Education: PhD in Mathematics, Harvard University (2018). Advisor: Horng-Tzer Yau M.Sc. in Mathematics, McGill University (2013). Advisors: Vojkan Jaksic and Robert Seiringer B.Sc., McGill University (2012) Dr. Landon's research focuses on Probability and Mathematical Physics, with particular expertise in Random Matrix Theory. His work spans various aspects of spectral statistics, eigenvalue distributions, and universality phenomena in random matrix ensembles. He has made significant contributions to understanding the behavior of extremal eigenvalues, linear spectral statistics, and connections to other areas of mathematical physics such as spin glasses and the KPZ universality class. His research often involves developing novel analytical techniques to establish precise asymptotic behavior in complex random systems. Analysis of Dr. Landon's publication record reveals a strong focus on the intersection of probability theory and mathematical physics. His work consistently explores universality phenomena across different random matrix ensembles and related stochastic systems. A notable trend is his investigation of connections between random matrix theory and other areas of mathematical physics, particularly spin glass models and the KPZ equation. His research demonstrates both technical depth in establishing rigorous asymptotic results and breadth in connecting seemingly disparate areas of mathematical physics.
