Find Academic Supervisors

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.

• Artificial Intelligence
• Machine Learning
• Probabilistic Reasoning
• +5 more

Vibhav Gogate is a Professor and Associate Head of Research at University of Texas at Dallas, specializing in machine learning and artificial intelligence. His research focuses on probabilistic graphical models, statistical relational learning, and integrating deep learning with graphical models. Professor Gogate has received numerous awards including the NSF CAREER Award (2017), Outstanding Researcher Award (2022, 2017), and Best Paper awards at top AI conferences. His research funding includes projects from NSF and DARPA. Education: PhD, University of California, Irvine MS, University of Maine BS, University of Mumbai Recent Publications: His research spans probabilistic inference, tractable models, and neural network approaches for efficient reasoning, with publications in NeurIPS, AAAI, UAI, and AISTATS. Recent work focuses on scalable inference methods and explainable AI systems for complex domains. Research Funding: Secured over $8M in grants from DARPA and NSF for projects in explainable AI and probabilistic reasoning. Teaching: Regularly teaches graduate and undergraduate courses in Machine Learning, Artificial Intelligence, and Advanced Statistical Methods.

• Machine Learning
• Artificial Intelligence
• Probabilistic Graphical Models
• +2 more

Supratik Chakraborty serves as the Bajaj Group Chair Professor in the Department of Computer Science and Engineering at Indian Institute of Technology Bombay. He maintains dual affiliations with the Centre for Formal Design and Verification of Software and the Centre for Liberal Education at IIT Bombay, demonstrating his cross-disciplinary engagement. Professor Chakraborty's research spans formal methods with focus on formal verification, rigorous analysis of system models, and automated synthesis of systems from specifications. His work bridges theoretical foundations with practical applications, particularly in developing mathematically provable guarantees for increasingly complex hardware, software, and intelligent systems. Current research interests include constrained counting and sampling, scalable formal verification of software and hardware systems, automated synthesis of programs and circuits, and applications of automata, logic and finite model theory to practical verification challenges. His publication trajectory shows a significant evolution from traditional hardware and software verification toward addressing verification challenges in machine learning and AI systems. Recent work increasingly focuses on interpretability of black-box models, verification of neural networks, and synthesis techniques applicable to intelligent systems. The research demonstrates strong interdisciplinary connections between formal methods, programming languages, and artificial intelligence. IIT Bombay Excellence in Thesis (CSE) Award 2011 (for Bhargav Gulavani's thesis) IIT Bombay Excellence in Thesis (CSE) Award 2017 (for Abhisekh Sankaran's thesis) Best Paper in Algorithms and Architecture track at IEEE International Conference on Computer Design: VLSI in Computers and Processors, 1998 Professor Chakraborty has successfully supervised 11 doctoral students, with research spanning formal verification techniques, Boolean functional synthesis, constrained counting, and applications to hardware and software systems. His students have gone on to positions at major institutions including Microsoft Research, TCS Research, Georgia Tech, and BARC, reflecting the strong industry and academic impact of his mentorship. Current research directions show increasing emphasis on verification challenges posed by machine learning systems and AI. His research group at IIT Bombay, while not explicitly named in the materials, appears to focus on formal methods with strong connections to the Centre for Formal Design and Verification of Software. The group maintains active collaborations with international researchers including Moshe Y. Vardi at Rice University, and has made significant contributions to verification tools like VeriAbs that bridge theoretical advances with practical applications.

• Formal Methods
• Formal Verification
• Automated Synthesis
• +7 more

Nicholas Ruozzi is an Assistant Professor of Computer Science at The University of Texas at Dallas (UTD), affiliated with the Erik Jonsson School of Engineering and Computer Science. His research focuses on machine learning, statistical inference, and probabilistic graphical models, with applications in virtual reality (VR) training, computer vision, and explainable AI. He has contributed to areas such as tractable probabilistic modeling, activity recognition in videos, and user tracking in VR systems. His work often bridges theoretical foundations with practical applications, such as developing algorithms for data privacy in VR training sessions and enhancing deep learning models through hybrid approaches with graphical models. Recent research trends include exploring multimodal interaction, distributionally robust models, and novel instance detection techniques in computer vision. Ruozzi's publications span topics like user identifiability in VR, predictive task guidance in AR, and systematic analysis of device interactions in VR systems. While no specific awards or grants are listed, his contributions reflect a strong emphasis on interdisciplinary applications of machine learning and probabilistic methods.

• Machine Learning
• Statistical Inference
• Graphical Models
• +7 more

Zhe Zeng is an incoming Assistant Professor in the Department of Computer Science at the University of Virginia starting July 2025. Currently, she serves as a Faculty Fellow in the Computer Science Department at New York University. She earned her Ph.D. in Computer Science from UCLA in 2024 under Professor Guy Van den Broeck, and her B.S. in Mathematics from Zhejiang University in 2018. Research Focus: Dr. Zeng specializes in neurosymbolic AI and probabilistic machine learning, developing methods that integrate symbolic knowledge (logical constraints, graph structures) with probabilistic uncertainty. Her work spans three core areas: Reasoning: Probabilistic inference, tractable probabilistic models Learning: Constrained deep learning, graph ML, weakly supervised learning Trustworthiness: Explainability, uncertainty quantification, domain-knowledge integration Awards & Honors: Rising Star in EECS (2023) Amazon Doctoral Fellowship (2022) NEC Research Fellowship (2021) ICML Travel Award (2018) Outstanding Graduate, Zhejiang University (2018) Advising & Mentoring: Has supervised six students including PhD candidates and undergraduates at UCLA, Tsinghua, and CAS, with placements at Princeton and UT Austin. Academic Service: Regularly reviews for NeurIPS, ICML, ICLR, UAI; served as UAI 2023 discussant; active in WiML mentorship programs.

• Artificial Intelligence
• Machine Learning
• Neurosymbolic AI
• +8 more

Iain Murray is Professor of Machine Learning and Inference at the School of Informatics, University of Edinburgh. His research focuses on developing flexible probabilistic models applicable across diverse domains including cosmology, neuroscience, perception, speech, sports, and text. Program Chair for ICLR (2018) Publications Chair for ICML (2017, 2018) Area Chair for AISTATS, ICLR, ICML, NeurIPS, and UAI Amazon Scholar (2018-2024), first appointed in Europe Murray's research interests center on probabilistic reasoning using machine learning, with specific expertise in density estimation and Markov chain Monte Carlo methods. His work spans theoretical foundations and practical applications, with significant contributions to neural autoregressive distribution estimation (NADE), real-valued NADE (RNADE), and pseudo-marginal slice sampling techniques. His research has enabled advances in flexible probabilistic modeling across multiple domains. His publications show consistent focus on advancing probabilistic modeling techniques, with recent work emphasizing neural autoregressive models, density estimation methods, and efficient sampling algorithms. The research trajectory demonstrates progression from foundational work on NADE to increasingly sophisticated deep learning approaches for density estimation and inference. Notable Paper Award for NADE work Amazon Scholar (2018-2024) Murray has supervised numerous PhD students who have gone on to prominent positions at Google DeepMind, NYU, stability.ai, and other leading institutions. His teaching responsibilities include the Machine Learning and Pattern Recognition course and project supervision. His research group focuses on developing tractable probabilistic models with applications across multiple scientific domains.

• Machine Learning
• Probabilistic Modeling
• Density Estimation
• +3 more

Chicheng Zhang is an Assistant Professor in the Computer Science Department at the University of Arizona, where he conducts research in the theory and applications of interactive machine learning. He earned his Ph.D. in Computer Science from the University of California, San Diego (UCSD) in 2017 under the supervision of Professor Kamalika Chaudhuri, and was previously an undergraduate student at Peking University working with Professor Liwei Wang. From 2017 to 2019, he was a postdoctoral researcher at the Machine Learning Group at Microsoft Research NYC. His research lies at the intersection of learning theory and practical algorithm design, focusing on interactive machine learning paradigms such as reinforcement learning, contextual bandits, active learning, and imitation learning. He aims to develop algorithms that are data-efficient, computationally tractable, and robust, with applications in healthcare, wireless communication, and fair AI systems. His work emphasizes principled algorithm design with theoretical guarantees and empirical validation. The most recent publications reflect a strong trend in developing efficient, theoretically grounded methods for sequential decision-making and interactive learning. Key themes include sample efficiency, robustness to noise, fairness in algorithmic decisions, and application-driven research in domains like oral cancer detection and mmWave network optimization. His work frequently bridges theoretical analysis with real-world deployment considerations. While no scientific awards are mentioned in the provided text, Dr. Zhang actively mentors prospective PhD students and encourages collaboration. He has contributed to interdisciplinary projects involving fairness-aware bandit algorithms for network coexistence, interpretable classifiers for cancer detection, and LLM-based initialization for reinforcement learning. His lab focuses on developing intelligent agents that actively learn from environments and human experts. He can be reached at chichengz@arizona.edu .

• Interactive Machine Learning
• Reinforcement Learning
• Contextual Bandits
• +15 more

Hassan Z. Ashtiani is an Associate Professor in the Department of Computing and Software within the Faculty of Engineering at McMaster University. His academic profile shows consistent engagement in both teaching and research activities, with evidence of active participation in major machine learning conferences and journals through 2025. Dr. Ashtiani's research focuses on the theoretical foundations of machine learning, with particular expertise in privacy-preserving algorithms, Gaussian mixture models, and adversarial robustness. His work bridges statistical learning theory with practical algorithm design, often addressing fundamental questions about sample complexity and computational efficiency in learning systems. A significant portion of his recent work explores the intersection of differential privacy with statistical learning, developing methods for private density estimation and distribution learning. Analysis of his publication record reveals a strong trend toward increasingly sophisticated theoretical frameworks for private and robust learning. His work consistently appears in top-tier venues including NeurIPS, ICML, COLT, and ALT, with recent contributions extending into agnostic private density estimation and robust learning with tolerance. The research demonstrates progression from foundational work on nearest neighbor search and clustering algorithms toward more complex problems in private learning of high-dimensional distributions. Dr. Ashtiani teaches across multiple levels of computer science education, including undergraduate courses in Automata and Computability (COMPSCI 2AC3) and Principles of Programming (COMPSCI 2S03), as well as graduate-level courses such as Fundamentals of Machine Learning (COMPSCI 4ML3) and Theoretical Foundations of Unsupervised Learning (CAS 775). His teaching portfolio shows consistent involvement in machine learning education since at least 2019, with evidence of teaching multiple sections each academic year. His scholarly impact is reflected in mentions across 3 news outlets, reference in 1 policy source, engagement from 7 X users, and 90 readers on Mendeley, suggesting growing recognition of his contributions to theoretical machine learning.

• Machine Learning Theory
• Privacy-Preserving Algorithms
• Gaussian Mixture Models
• +5 more

Barbara Drossel is a Full Professor at the Institute of Solid State Physics within the Faculty of Physics at the Technical University of Darmstadt, where she has been conducting research since February 2002. Her work bridges theoretical physics, complex systems theory, and theoretical ecology, focusing on interdisciplinary approaches to understanding emergent phenomena in natural systems. She leads the AG Drossel research group that investigates the theoretical foundations of complex networks, ecological communities, and quantum systems. Professor Drossel's research spans multiple domains with emphasis on complex systems theory, where she has made significant contributions to understanding random Boolean networks, food web modeling, and the physics of ecological communities. Her work demonstrates how simple rules can lead to complex emergent behavior across different scales, from quantum systems to ecological networks. She investigates how top-down causation operates in complex systems and explores the relationship between microscopic dynamics and macroscopic patterns in diverse contexts. Analysis of her recent publications reveals a consistent focus on theoretical frameworks that connect physics with ecology. Her work shows increasing integration of quantum mechanics with ecological modeling, particularly in understanding emergence and time evolution in complex systems. She frequently employs network theory to analyze ecological communities and has developed innovative approaches to studying species interactions, mutualistic networks, and spatial dynamics in meta-communities. Minerva Fellowship Heisenberg Fellowship DFG Fellowship for research at MIT Professor Drossel has supervised numerous doctoral students whose work spans theoretical ecology, complex systems, and statistical physics. Her research group has secured funding for projects examining the stability of ecological networks, quantum decoherence, and the mathematical foundations of complex systems. She maintains active collaborations with researchers across Europe and has contributed to major theoretical advances in understanding how complexity emerges from simple interactions in diverse systems. The AG Drossel research group operates at the intersection of physics and theoretical biology, maintaining strong connections with both the physics and biology departments at TU Darmstadt. The group combines mathematical rigor with biological relevance, developing models that capture essential features of complex natural systems while remaining analytically tractable. Their work has influenced both theoretical physics and ecological theory, demonstrating the power of interdisciplinary approaches to complex systems.

• Complex Systems Theory
• Theoretical Ecology
• Random Boolean Networks
• +7 more

Sriraam Natarajan is a Professor and Director of the Center for Machine Learning and StaRLing Lab at The University of Texas at Dallas (UTD), part of the Erik Jonsson School of Engineering & Computer Science. He holds additional roles as a hessian.AI Fellow at TU Darmstadt and an RBCDSAI Distinguished Faculty Fellow at IIT Madras. His expertise spans Artificial Intelligence, Machine Learning, and their applications in healthcare, with a focus on Relational Learning, Reinforcement Learning, and Graphical Models. He has been honored as an AAAI Fellow (2025), elected to the AAAI Executive Council, and recognized with the UTD Outstanding Graduate Teaching Award. Education: Completed his PhD in Computer Science at Oregon State University in 2007 under Prof. Prasad Tadepalli. Postdoctoral work at the University of Wisconsin-Madison with Professors Jude Shavlik and David Page. Previously served as faculty at Indiana University and Wake Forest School of Medicine. Research: Active in developing AI systems for healthcare, including predictive models for gestational diabetes and cardiac arrest in children. His work emphasizes integrating human knowledge into machine learning (e.g., Human-in-the-Loop systems) and advancing statistical relational AI frameworks like Markov Logic Networks and Probabilistic Circuits. Publications: Over 100 peer-reviewed articles, including notable works on causal learning, relational reinforcement learning, and knowledge graph construction. Recent focuses include explainable AI and scalable probabilistic models. Awards: AAAI Fellow, RBCDSAI Distinguished Fellowship, UTD Teaching Excellence Award. Advising and Collaboration: Mentored over 30 students, many now in academia and top institutions like IBM Research, Facebook, and Microsoft. Collaborates globally on projects like GLAD (Glocalized Anomaly Detection) and StaRLing Lab initiatives. Labs/Teams: Leads the StaRLing Lab, focusing on statistical relational AI, and directs UTD's Center for Machine Learning. Engaged in interdisciplinary projects with healthcare, robotics, and data science communities.

• Artificial Intelligence
• Machine Learning
• Healthcare Applications
• +5 more

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.

• Algorithms and Complexity
• Logic
• Database Theory
• +2 more

Dan Olteanu is a Professor of Computer Science at the University of Zurich (since 2020) and holds a part-time role as a Computer Scientist at RelationalAI. Previously, he was a Professor at the University of Oxford (2016–2020) and had visiting roles at UC Berkeley (2013–2014) and LogicBlox (consulting, 2013–2017). His research focuses on database systems, probabilistic data management, and theoretical foundations of data processing. Education: PhD in Computer Science from Ludwig Maximilian University of Munich (2005), Diplom (M.Sc.) from Polytechnic University of Bucharest (2000). Additional roles include Fellow and Director of IT at St Cross College, Oxford. Research Interests: Factorized databases (FDB), probabilistic databases (SPROUT, ENFrame), Datalog engines (RDFox), query optimization (Distributed Query Optimization), and machine learning over relational data. Publications highlight contributions to incremental query processing, probabilistic inference, and scalable algorithms. Notable work includes the SPROUT query engine, FDB system, and theoretical results on query tractability. Awards: Best Paper Award at ICDT 2019. Grants from ERC, EPSRC, Google, and industry partnerships with Amazon, Microsoft, and others. Students advised include Robert Fink, Maximilian Schleich, and Haozhe Zhang. Active in academic service, editing journals, and organizing conferences like BNCOD and SIGMOD workshops.

• Database Systems
• Probabilistic Databases
• Theoretical Computer Science
• +3 more

YooJung Choi is an Assistant Professor at the School of Computing and Augmented Intelligence, Arizona State University. Her research focuses on probabilistic machine learning, trustworthy AI, and tractable probabilistic modeling. She holds a PhD in Computer Science from UCLA and has been recognized with awards like the Cisco Research Award and Simons-Berkeley Research Fellowship. Education: PhD in Computer Science (University of California, Los Angeles). Research interests include probabilistic reasoning, fairness, robustness, and interpretability. Her work bridges theoretical foundations and practical applications, with contributions to probabilistic circuits and optimal transport. Notable achievements include co-organizing TPM 2024 and presenting at venues like NeurIPS and AAAI. She actively promotes fairness in AI through frameworks that address label bias and discrimination patterns. Awards: Cisco Research Award, Simons-Berkeley Fellowship, AAAI 2023 New Faculty Highlights. Teaching: Courses on artificial intelligence, machine learning, and research supervision. Service: Tutorial leadership on probabilistic circuits, workshop organization, and academic talks globally.

• Probabilistic Machine Learning
• Tractable Probabilistic Modeling
• Algorithmic Fairness
• +6 more

Nofar Carmeli is a researcher at Inria , affiliated with the Boreal joint project-team (LIRMM, Inria, University of Montpellier, CNRS) in Montpellier, France. Her work focuses on theoretical aspects of database query optimization, particularly through the lenses of fine-grained complexity and enumeration complexity. PhD from Technion (2015-2020), advised by Prof. Benny Kimelfeld Postdoctoral Researcher at ENS Paris (2021-2022) and Inria's Valda project-team Holds the Schmidt Postdoctoral Award (2021-2022) Her research explores optimal algorithms for database query answering, including direct access to ranked answers, quantile computation, and handling of conjunctive queries with self-joins or negation. She investigates how structural properties of queries and data constraints like functional dependencies affect computational complexity. Key contributions include: Establishing tractability boundaries for direct access to conjunctive queries Developing efficient algorithms for minimal triangulation enumeration Advancing probabilistic database representations for infinite domains Creating explainable opinion graph frameworks for review summarization Scientific awards: Google PhD Fellowship (2019) Schmidt Postdoctoral Award (2021-2022) PODS Best Student Paper (2019) She has served on program committees for STACS (2025), PODS (2023-2025), and ICDT (2022-2024), and contributed to open-access research dissemination through Arxiv and dblp.

• Database Query Optimization
• Fine-Grained Complexity
• Enumeration Complexity
• +2 more

Dr Paul C. Bell is a Research Fellow in Computer Science currently affiliated with Liverpool John Moores University since 2017, maintaining a continuing Visiting Fellow position at Loughborough University where he previously served as a lecturer from 2011 to 2017. His academic foundation includes postdoctoral research at Turku University (Finland), Universite catholique de Louvain (Belgium), and Liverpool University following doctoral studies. His educational background comprises: BSc, University of Liverpool PhD, University of Liverpool Dr Bell specializes in Theoretical Computer Science and Formal Language Theory, investigating the boundaries of tractability and computability for reachability problems across mathematical models including matrix semigroups, hybrid systems, and probabilistic/quantum automata. His interdisciplinary work bridges Computer Science, Physics, and Mathematics through encodings of optimization problems for adiabatic quantum computers, alongside contributions to energy-efficient computing via speed-scaling algorithms for multi-processor systems. With over twenty publications in leading international venues, he actively serves as a reviewer and program committee member for conferences such as Reachability Problems 2017.

• Theoretical Computer Science
• Formal Language Theory
• Reachability Problems
• +8 more