Daniel Horsley is an Associate Professor and ARC Future Fellow at the School of Mathematical Sciences, Monash University. His research focuses on combinatorial designs and edge decomposition of graphs, with notable contributions to extremal graph theory, Zarankiewicz problems, and graph decomposition theorems. Current Role: ARC Future Fellow, Associate Professor Affiliation: School of Mathematical Sciences, Monash University Active Projects: 'The Zarankiewicz problem through linear hypergraphs and designs' (2022–2025), 'Edge decomposition of dense graphs' (2017–2022), and more Research interests span combinatorial designs, graph decomposition, and extremal combinatorics. His work emphasizes theoretical advancements in design theory, with applications in discrete mathematics and optimization. Recent articles address semi-inducibility, Zarankiewicz numbers, and embedding partial designs, reflecting his expertise in structural and extremal combinatorics. Key awards include the ARC Future Fellowship. His research outputs include over 57 publications in journals like Journal of Graph Theory , SIAM Journal on Discrete Mathematics , and European Journal of Combinatorics . Grant projects include collaborations with ARC, University of Queensland, and University of Melbourne, focusing on Steiner systems, compressed sensing, and combinatorial structure analysis. Advising PhD students and mentoring researchers in discrete mathematics and combinatorial design theory.
Sebastijan Dumancic is an Assistant Professor at Delft University of Technology, focusing on neuro-symbolic AI through program synthesis and probabilistic programming. He leads the RAIL lab and collaborates with institutions like Harvard, MIT, and CNRS. His research bridges symbolic AI and machine learning, applying program synthesis to scientific discovery, transportation, and robotics. He holds an FWO-funded PhD from KU Leuven and has participated in initiatives like ELLIS and the Symbolic Computation and Machine Learning Initiative. Program synthesis Probabilistic programming Neuro-symbolic AI Constraint-based learning His recent articles highlight advancements in program synthesis, neuro-symbolic integration, and constraint satisfaction. Projects like Find2Fix and Intelligent Greenhouse Horticulture (funded by NWO) demonstrate practical applications. ELLIS Membership University Teaching Qualification He supervises numerous MSc and PhD students in projects involving logic programming, program synthesis, and probabilistic modeling. Active in workshops and symposia, he contributes to neuro-symbolic AI and scientific discovery.
Daniel M. Roy is a Professor at the University of Toronto with cross-appointments in the Departments of Computer Science and Electrical and Computer Engineering. He serves as Associate Chair, Statistics, and is a Research Director at the Vector Institute and a CIFAR Canada AI Chair. His research focuses on foundational principles of prediction, inference, and decision-making under uncertainty, spanning machine learning, statistics, mathematical logic, applied probability, and computer science. He has contributed to learning theory, statistical network analysis, probabilistic programming, and Bayesian nonparametric statistics. Education: Ph.D. in Computer Science from MIT (2011), advised by Leslie Kaelbling. Postdoctoral fellowships at the University of Cambridge (Newton International Fellow and Research Fellow). His research explores information theories of learning , online learning , and nonstandard foundations for decision theory . Recent work includes best paper awards at ICML 2024 and advancements in probabilistic programming systems like Church. His publications address problems in generalization bounds, causal bandits, neural network theory, and exchangeable random structures. Scientific Awards include the MIT/EECS George M. Sprowls Doctoral Dissertation Award and the ICML 2024 Best Paper Award. He advises students and postdocs across statistics, computer science, and machine learning, with alumni now holding positions at institutions like Princeton, Imperial College London, and the University of Chicago.
Martin Grohe is a Professor at the School of Logic and Theory of Discrete Systems , part of the Department of Computer Science at RWTH Aachen University . His research spans Algorithms and Complexity , Logic , Database Theory , Graph Theory , and Machine Learning , with a focus on integrating logical frameworks into computational models. His recent work explores graph neural networks , Weisfeiler-Leman algorithms , and parameterized complexity , as seen in publications on isomorphism testing , database repairing , and probabilistic query evaluation . While no specific scientific awards are mentioned, his contributions to graph theory and machine learning are widely recognized through numerous peer-reviewed publications.
Associate Professor Sonny Pham leads research in artificial intelligence at Curtin University's School of EECMS. His work balances theoretical foundations with practical applications in computer vision, data mining, and deep learning. As head of the IAMAI research group, he collaborates with industry partners on security systems, healthcare AI, and sustainable technologies. His research explores: Computationally efficient deep learning architectures Compressed sensing for high-dimensional data Robust statistical methods for real-world problems Applications in computer vision and industrial automation Recent publications demonstrate a focus on medical imaging interpretation and efficient neural networks, with applications spanning radiology report generation, semantic segmentation for autonomous systems, and cybersecurity. His team's work consistently bridges theoretical AI advancements with industrial applications. Honors include: Multiple WANMA Awards (2021-2024) for industry-impactful research INCITE Award for social impact technology (2024) IEEE Young Author Best Paper Award (2010) Over $5M in competitive research funding including MRFF and DFAT grants He leads the IAMAI research group with 12+ graduate students and coordinates Curtin's Master of Artificial Intelligence program. Industry collaborations include Alcoa Australia, iCetana, and HyprFire.
Arya Mazumdar is a tenured Professor of Data Science and Computer Science at the Halıcıoğlu Data Science Institute (HDSI) , part of the School of Computing, Information and Data Sciences at the University of California San Diego (UCSD). He also holds affiliations with the Computer Science and Engineering and Electrical and Computer Engineering departments at UCSD. Previously, he was an Assistant and Associate Professor at the University of Massachusetts Amherst (2015–2021), and held a postdoctoral position at MIT (2011–2012). He is an IEEE Distinguished Lecturer (2023–2024) and recipient of the NSF CAREER Award (2015–2020). Education : PhD in 2011 from the University of Maryland, College Park (advisor: Alexander Barg) Postdoctoral scholar at MIT (2011–2012, advisor: Greg Wornell) Internships at IBM Almaden (2010) and HP Labs (2008) Research Interests : Focus on algorithmic and statistical aspects of machine learning, error-correcting codes, optimization, signal processing, and distributed systems. Key areas include clustering algorithms, compressed sensing, federated learning, and information-theoretic foundations of data science. He has contributed to theoretical guarantees for learning mixtures, distributed optimization, and robust coding schemes. Recent Articles Trends : Recent work emphasizes distributed optimization (e.g., vqSGD, Byzantine-resilient algorithms), sparse recovery in high-dimensional models, and theoretical foundations of learning (e.g., support recovery, parameter estimation). His research bridges information theory and machine learning, with applications in storage systems and large-scale data processing. Awards & Roles : 2020 EURASIP JASP Best Paper Award Co-PI and co-leader of the NSF AI Institute for Learning-Enabled Optimization at Scale Editorships: IEEE Transactions on Information Theory and Foundations and Trends in Communications Grants & Labs : Leads the EnCORE Institute as UCSD Site Lead, focusing on theoretical perspectives of large language models and computational-statistical gaps. Active in organizing workshops on topics like LLMs, clustering, and distributed optimization. His research is funded by NSF and industry collaborations. Teaching : Courses include Algorithms for Data Science , Probability and Statistics for Data Science , and Coding Theory , emphasizing foundational theory and scalable methods.
Wenzhong Li is a Professor at the School of Computer Science, Nanjing University, where he leads research at the State Key Laboratory for Novel Software and Technology. His academic career spans over 15 years with significant contributions to AI-empowered distributed systems, big data mining, and networking applications. He teaches Computer Networks and guides graduate students in Distributed Computing Research. Professor Li's research focuses on cutting-edge areas including AI-Empowered Distributed Systems and Applications (MultiModal Large Models, Embodied Intelligence, Edge Computing), Big Data Mining (Time Series Analysis, Graph Computing, Social Networks Analysis), and AI-Based Distributed Resource Scheduling. His work bridges theoretical foundations with practical implementations in real-world systems. His recent publications demonstrate a strong trend toward integrating deep learning with graph theory and time series analysis, with applications in human activity recognition, network optimization, and multimodal systems. The research spans multiple disciplines including artificial intelligence, computer vision, networking, and data mining, with a particular emphasis on practical implementations for real-world problems. Best Paper Runner Up at KSEM 2023 for 'Learning-based Dichotomy Graph Sketch for Summarizing Graph Streams with High Accuracy' Best Paper Award at APNet 2018 for 'Toward Effective and Fair RDMA Resource Sharing' Professor Li has advised numerous PhD and Master's students who have gone on to prominent positions at institutions like Nanjing University, Huawei, Alibaba, Microsoft, and various international universities. His research is supported by substantial grants from the National Natural Science Foundation of China, Natural Science Foundation of Jiangsu Province, National Power Grid, and other major funding bodies, totaling multiple multi-year projects with significant budgets. He leads the AINet Group and is affiliated with the Sino-German Institute of Social Computing and MobileCloud research initiatives. His DISLAB provides the organizational framework for his research team, which includes dozens of graduate students and collaborators working on cutting-edge problems in AI, networking, and distributed systems.
Philip Bille is a Professor and Head of the Algorithms, Logic and Graphs section at the Department of Applied Mathematics and Computer Science, Technical University of Denmark (DTU), College of Engineering. His research centers on the design and analysis of efficient algorithms, particularly for string processing, compressed data, and data structures. His research interests lie at the intersection of theoretical computer science and practical applications. He focuses on algorithms , data structures , string indexing , pattern matching , and compressed computation . His work enables efficient querying and processing of large-scale, repetitive data, with applications in bioinformatics, intrusion detection, and green computing. The recent publications reflect a strong trend in developing space-efficient and fast algorithms for modern computational challenges. Key themes include compressed data structures , sliding window indexing , finite automata compression , and energy-aware matrix operations . These works demonstrate expertise in balancing theoretical rigor with practical performance. Philip Bille actively supervises multiple PhD students and leads several research projects. He contributes to advancing sustainable computing aligned with UN SDGs. His work integrates algorithmic theory with real-world efficiency. Supervises PhD projects on hierarchical compression, adaptive computation, and vector processor algorithms. Involved in research on green computing, compressed formats, and efficient data models. He is affiliated with the Algorithms, Logic and Graphs group at DTU, a hub for theoretical and applied algorithmic research. The team explores fundamental problems in data representation and processing, pushing the boundaries of what is computationally feasible in terms of time and space.
Cynthia D. Rudin is the Gilbert, Louis, and Edward Lehrman Distinguished Professor of Computer Science at Duke University, with joint appointments in the Departments of Electrical and Computer Engineering, Statistical Science, Mathematics, and Biostatistics & Bioinformatics. She directs the Interpretable Machine Learning Lab and has held previous positions at MIT, Columbia, and NYU. Her educational background includes: Undergraduate degree from the University at Buffalo PhD from Princeton University (2004) Research Interests: Dr. Rudin's research focuses on interpretable machine learning and its applications across multiple domains. Her work emphasizes creating machine learning models whose reasoning processes people can understand, which includes algorithms for extremely sparse models, interpretable neural networks, interpretable matching methods for causal inference, and dimension reduction for data visualization. She applies these techniques to critical societal problems in healthcare, criminal justice, materials science, and other domains. Her lab has developed practical code for sparse models such as decision lists, decision trees, and additive models that provably optimize accuracy and sparsity. Dr. Rudin's recent publications (2024-2025) demonstrate a strong focus on interpretable AI applications across diverse fields including healthcare (mortality risk scores, breast cancer prediction), materials science (metamaterials design), and environmental justice (location-based health analysis). Her work consistently emphasizes practical implementations with real-world impact, particularly in high-stakes decision-making domains where model transparency is critical. Scientific Awards: Squirrel AI Award for Artificial Intelligence for the Benefit of Humanity (2022) - often described as the "Nobel Prize of AI" INFORMS Society on Data Mining Prize (2024) Guggenheim Fellowship (2022) Three-time winner of the INFORMS Innovative Applications in Analytics Award (2013, 2016, 2019) Winner of the 2023 John M. Chambers Statistical Software Award for PaCMAP Winner of the 2024 Award for Innovation in Statistical Programming and Analytics Dr. Rudin has advised numerous PhD students and postdocs who have co-authored significant publications with her. Her lab has received substantial funding for projects applying interpretable machine learning to healthcare (seizure prediction in ICU patients), criminal justice (crime series analysis), and energy infrastructure (underground electrical distribution networks). Her work on the Series Finder algorithm has been adapted by the NYPD and has been running live in NYC since 2016. She directs the Interpretable Machine Learning Lab at Duke, which includes the Almost-Matching-Exactly Lab focused on interpretable causal inference. Her team develops practical code implementations for all their research, emphasizing usability and real-world application in critical domains.
Juho Lee is an Associate Professor at the Kim Jaechul Graduate School of AI, Korea Advanced Institute of Science and Technology (KAIST). Previously, he worked as a research scientist at AITRICS and completed his PhD in Computer Science & Engineering at Pohang University of Science and Technology (POSTECH) under Professor Seungjin Choi, followed by postdoctoral research at University of Oxford with Professor François Caron. His research focuses on: Bayesian deep learning Bayesian inference Meta learning Generative models Uncertainty quantification Graph representation learning Professor Lee's work bridges theoretical Bayesian methods with practical deep learning applications. His recent publications demonstrate significant contributions to neural processes, Bayesian optimization, and scalable inference methods. He has developed novel architectures like Set Transformer for permutation-invariant modeling and advanced techniques for uncertainty quantification in deep networks. His research shows a clear trajectory toward making Bayesian principles applicable to large-scale, real-world machine learning problems. Notable contributions include: Set Transformer: A framework for attention-based permutation-invariant neural networks (ICML 2019) Bootstrapping neural processes (NeurIPS 2020) Deep amortized clustering (NeurIPS 2019 workshop) Learning to pool in graph neural networks for extrapolation Professor Lee actively mentors graduate students and has advised numerous PhD candidates who co-author papers with him across NeurIPS, ICML, and ICLR. His research group SIML@KAIST develops scalable and interpretable machine learning methods with strong theoretical foundations.
Florent Krzakala is a Full Professor at École polytechnique fédérale de Lausanne (EPFL) in Switzerland, holding positions across multiple departments including the School of Basic Sciences (SB), School of Engineering (STI), and specifically within the Department of Physics (IPHYS) and Department of Electrical Engineering (IEM). He leads the Information, Learning and Physics Laboratory (IdePHICS) and maintains an office at ELD 239, Station 11, 1015 Lausanne. His research bridges statistical physics and computational disciplines, with significant contributions to understanding the theoretical foundations of machine learning and optimization problems. Dr. Krzakala received his MSc in Physics from Orsay, France in 1999, followed by a PhD in Statistical Physics from Orsay, Paris XI, France in 2002, and completed a postdoctoral position at Roma La Sapienza in 2004. This strong foundation in physics has informed his interdisciplinary approach to computational problems. His research interests span Statistical Physics, Machine Learning, Probability and Statistics, Computer Science, Information Theory, Inference on Graphs, Random Constraint Optimization, and Computational Optics. Krzakala's work focuses on applying methods from statistical physics to problems in theoretical computer science, probability, and machine learning. He investigates how concepts from disordered systems and phase transitions can illuminate computational barriers in optimization and inference tasks. His research has particular relevance for understanding the behavior of neural networks, compressed sensing, and high-dimensional statistical models. Analysis of his recent publications reveals a strong trend toward understanding the fundamental limits of learning in high-dimensional settings, with particular emphasis on phase transitions, statistical-to-computational gaps, and the theoretical properties of deep learning architectures. His work frequently bridges rigorous mathematical analysis with practical machine learning applications, demonstrating how insights from statistical physics can inform algorithm design and theoretical understanding in AI. Krzakala actively mentors the next generation of researchers, supervising numerous PhD students whose work continues to advance these interdisciplinary fields. His laboratory serves as a hub for researchers exploring the intersection of physics and computation, fostering collaborations across traditional disciplinary boundaries. He teaches advanced courses including Fundamentals of Inference and Learning, Statistical Physics, and Statistical Physics for Optimization & Learning, which examine the connections between physical principles and computational methods. His educational materials, including lecture notes on statistical physics methods in optimization and machine learning, have become valuable resources for students and researchers worldwide. As founder and scientific advisor of the startup Lighton, Krzakala has also demonstrated a commitment to translating theoretical insights into practical applications, particularly in the realm of optical computing for machine learning tasks.
Dr. Tim Oates is a Professor in the Department of Computer Science and Electrical Engineering at the University of Maryland, Baltimore County . His research spans machine learning, artificial intelligence, and brain-machine interfaces, with a focus on weakly supervised methods, human-in-the-loop reinforcement learning, and grounded policy development for robotics. Ph.D., Computer Science, University of Massachusetts, Amherst, 2000 M.S., Computer Science, University of Massachusetts, Amherst, 1997 B.S., Computer Science and Electrical Engineering, 1989 Current research threads include: Developing non-invasive brain injury severity assessment via medical time series Modeling human brain development through computational frameworks Designing algorithms for autonomous robotic learning Recent publications highlight AI security mechanisms (backdoor detection via tensor decomposition, matrix factorization) Medical applications (3D artery reconstruction, skin lesion diagnosis, EEG denoising) Neuro-symbolic integration (holographic representations, language-guided reinforcement learning) Mathematical reasoning (schema-based problem solving, subitizing algorithms) Contact: oates@cs.umbc.edu | Office: 336 Information Technology and Engineering (ITE) Building
Stavros Sintos is an Assistant Professor in the Department of Computer Science at the University of Illinois at Chicago (UIC). He joined UIC after a postdoctoral fellowship at the University of Chicago, where he was part of the ChiData group under Sanjay Krishnan. He earned his Ph.D. in Computer Science from Duke University in 2020, advised by Pankaj K. Agarwal. His research focuses on designing efficient algorithms for databases, data mining, and computational geometry . Key themes include: Theoretical guarantees for practical problems Compact indexing structures for query efficiency Geometric optimization combined with database systems Fairness in algorithmic design (e.g., Fair Set Cover, FairHash) Temporal data analysis and dynamic query processing Notable scientific contributions include a Best Paper Award at ICDT 2024 for work on range entropy queries. His publications span top venues like SIGMOD, PODS, VLDB, and SODA, covering areas such as clustering algorithms, synthetic query witnesses, and temporal join optimizations.
Dr. James Saunderson is a Senior Lecturer and Director of Education in the Department of Electrical and Computer Systems Engineering at Monash University. He holds a PhD in Electrical Engineering and Computer Science from MIT and has held postdoctoral roles at Caltech and the University of Washington. His expertise spans convex optimization, semidefinite programming, and quantum information theory. Education : PhD in EECS, MIT (2015) MS in EECS, MIT (2011) Bachelor of Engineering (Honours) and Bachelor of Science (Honours), University of Melbourne (2008) Research Interests : Convex optimization, quantum information theory, signal processing, and algorithm design. Focuses on algebraic and geometric aspects of optimization, with applications in engineering and quantum systems. Recent Projects : Exploiting duality in quantum relative entropy optimization Hyperbolic programming and conic optimization Applications in nanotechnology and bioinformatics Teaching : Courses include Control System Design, Signals and Systems, and Optimization for Engineers. Awards : SIAM Optimization Best Paper Prize (2020) Grants and Collaborations : Australian Research Council Discovery Early-Career Research Fellow (2020–2024) Leading projects in quantum optimization and bioengineering applications.
Daehyeok Kim is an Assistant Professor in the Department of Computer Science at The University of Texas at Austin, where he co-leads the UT Networked Systems Research Group and participates in the Wireless Networking and Communications Group and 6G@UT. He serves as co-PI for the LDOS NSF Expeditions in Computing project, a major initiative rethinking operating systems through AI. His educational background includes a Ph.D. in Computer Science from Carnegie Mellon University under advisors Vyas Sekar and Srinivasan Seshan, where his dissertation introduced abstractions for elastic in-network computing. He also earned B.S. and M.S. degrees in Computer Science and Engineering from POSTECH, South Korea, followed by research scientist work at KAIST prior to his Ph.D. Kim's research centers on hardware-software co-design for cloud and edge data centers, targeting speed, efficiency, and resilience. Key projects include resource management for programmable infrastructure, robust cellular network design, end-to-end network transport frameworks, and learning-directed operating systems. His work bridges computer networks, operating systems, distributed systems, and 5G/6G technologies, with emphasis on virtualized radio access networks (vRAN) and edge computing challenges. Analysis of his recent publications reveals a dominant focus on enhancing 5G/6G infrastructure reliability—particularly in virtualized RANs—through innovations in failover mechanisms, integrity protection, and latency-sensitive resource allocation. His research consistently addresses critical industry pain points like sub-second availability requirements, fronthaul security vulnerabilities, and end-to-end service-level objective (SLO) guarantees for mobile-edge applications. Notable scientific awards include: NSF CAREER Award (2025) for advancing cloud hardware efficiency Microsoft Research PhD Fellowship (2019) Bronze Award at Samsung HumanTech Paper Awards (2018) Qualcomm Innovation Awards (2016) His grant portfolio features leadership in the $10M+ LDOS NSF Expeditions project and the NSF CAREER award, both driving transformative work in AI-integrated operating systems and resilient network infrastructure. These projects demonstrate strong industry-academia collaboration with Microsoft Research, wireless vendors, and cloud providers. Kim co-leads the UT Networked Systems Research Group, which operates within the Wireless Networking and Communications Group and 6G@UT consortium. These labs maintain a 5G/6G testbed for Open RAN validation and focus on solving real-world problems in cellular infrastructure, edge computing, and network security through close partnerships with industry leaders.
