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.
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.
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.
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.
John Paisley is an Associate Professor of Electrical Engineering at Columbia University's Fu Foundation School of Engineering and Applied Science, and a member of Columbia's Data Science Institute (DSI). He holds a B.S., M.S., and Ph.D. in Electrical and Computer Engineering from Duke University (2004-2010), followed by postdoctoral research in Computer Science at Princeton University and UC Berkeley. His research focuses on Bayesian models, posterior inference techniques for Big Data, and applications in data analysis, recommendation systems, information retrieval, and compressed sensing. He has pioneered methods like Bayesian Gaussian Process ODEs and Double Normalizing Flows, with recent work emphasizing uncertainty quantification in environmental modeling and neuroimaging analysis. His collaborative workflows (e.g., bneR ) address air pollution exposure and PM2.5 concentration uncertainties, combining Bayesian nonparametric ensembles with geospatial data. He has also developed frameworks for neural network interpretability, image denoising, and compressed sensing MRI. Paisley's work bridges statistical theory and applied machine learning, with applications in healthcare, environmental science, and geophysics. His academic contributions include over 50 publications since 2016, spanning topics like deep metric learning, adversarial learning, and variational inference optimization. He maintains an active research group and serves on editorial boards for machine learning and signal processing journals.
Navid Azizan is the Alfred H. (1929) and Jean M. Hayes Career Development Assistant Professor at Massachusetts Institute of Technology (MIT), holding dual appointments in the Department of Mechanical Engineering (in Control, Instrumentation & Robotics) and the Schwarzman College of Computing's Institute for Data, Systems & Society (IDSS). He is also a Principal Investigator in the Laboratory for Information & Decision Systems (LIDS), and a faculty member of the MIT Statistics and Data Science Center, the Center for Computational Science and Engineering, and the Operations Research Center. Dr. Azizan received his PhD in Computing and Mathematical Sciences from the California Institute of Technology (Caltech) in 2020, his MSc in Electrical Engineering from the University of Southern California in 2015, and his BSc in Electrical Engineering with a minor in Physics from Sharif University of Technology in 2013. Prior to joining MIT, he completed a postdoc at Stanford University's Autonomous Systems Laboratory and was a research scientist intern at Google DeepMind. His research spans the intersection of machine learning, systems and control, mathematical optimization, and network science. Dr. Azizan's work focuses on developing principled learning and optimization algorithms for reliable intelligent systems, with applications to autonomy and sociotechnical systems. His research has significant implications for creating trustworthy AI systems that can operate effectively in complex, uncertain environments. Dr. Azizan's recent publications demonstrate a strong focus on uncertainty quantification, reliable AI systems, constrained optimization, and control-oriented learning. His work bridges theoretical foundations with practical applications, particularly in autonomous systems where safety and reliability are paramount. His research group has made notable contributions to areas including neural network verification, multi-agent reinforcement learning, and adaptive inference techniques for large language models, with several papers featured on MIT News and selected for oral presentations at top conferences. Alfred H. (1929) and Jean M. Hayes Career Development Professorship (2025-present) Frank E. Perkins Award for Excellence in Graduate Advising (2025) List of Outstanding Academic Leaders in Data from the CDO Magazine (2024, 2023) Amazon Science Hub Research Award (2023) Outstanding UROP Faculty Mentor (2023) Esther and Harold E. Edgerton (1927) Career Development Chair (2022-2025) Information Theory and Applications (ITA) Gold Graduation Award (2020) Dr. Azizan has been recognized for his excellence in graduate advising, receiving the Frank E. Perkins Award for Excellence in Graduate Advising in 2025. During the pandemic, he founded and co-organized the 'Control meets Learning' virtual seminar series, connecting researchers across disciplines. His work has attracted significant research funding from industry partners including Google, Amazon, and MathWorks, supporting both fundamental research and practical applications in reliable intelligent systems. The Azizan Lab at MIT brings together researchers from mechanical engineering, computer science, and applied mathematics to tackle challenges at the intersection of learning and control. The lab emphasizes both theoretical foundations and practical implementations, with a particular focus on developing algorithms that provide guarantees of performance and safety. Current research directions include uncertainty quantification in AI systems, constrained optimization for neural networks, and control-oriented learning for autonomous systems, with applications spanning robotics, transportation, and complex sociotechnical systems.
Kuldeep S. Meel is the Stephen Fleming Early-Career Associate Professor at the School of Computer Science, Georgia Institute of Technology, and an Associate Professor at the University of Toronto (on leave). He previously held a NUS Presidential Young Professorship at the National University of Singapore. His research focuses on automated reasoning, aiming to enable computing systems to handle uncertain real-world environments through scalable techniques integrating randomized algorithms, statistical inference, formal methods, distribution testing, and software engineering. Core research areas: Automated Reasoning, Formal Methods, Approximate Model Counting, Probabilistic Inference, Constraint Solving His research group has achieved significant recognition in both individual awards and publications. Key trends in his recent work include advancing model counting algorithms, developing frameworks for probabilistic explanations, and improving scalability in formal verification and constraint satisfaction. His tools have consistently ranked top in international competitions, demonstrating practical impact in automated reasoning. 2019 NRF Fellowship for AI 2022 ACP Early Career Researcher Award 2020 IEEE Intelligent Systems AI's 10 to Watch Top placements in Model Counting, SAT, and CAV competitions He mentors a diverse group of PhD and Master's students and collaborates with institutions worldwide. His group's publications span premier conferences in AI, formal methods, and design automation, reflecting interdisciplinary contributions to theoretical and applied computer science.
David Bindel is an Associate Professor in the Department of Mathematics at Cornell University, affiliated with the College of Arts and Sciences, College of Engineering, and Cornell Ann S. Bowers College of Computing and Information Science. He earned his Ph.D. in Mathematics from the University of California, Berkeley in 2006. His research focuses on applied numerical linear algebra, eigenvalue problems, and their applications in plasma physics, network analysis, and nonlinear systems. He develops methods for analyzing complex systems, including magnetic confinement in stellarators, stability of MHD systems, and community detection in networks. His work bridges theoretical foundations with practical computational tools, such as formal verification of linear algebra algorithms and scalable Gaussian process models. Bindel’s research explores the interplay between structure and computation, leveraging eigenvalue analysis to address challenges in computer vision, opinion dynamics, and engineering design. He has contributed to advancements in numerical methods for large-scale systems, including iterative solvers, spectral approximation techniques, and stochastic optimization. His interdisciplinary approach spans applied mathematics, computer science, and physics, with applications in fusion energy, machine learning, and network science. Recent work highlights include high-order expansions for magnetic confinement, adaptive filtering for dynamical systems, and Bayesian optimization strategies. His publications emphasize rigorous analysis alongside computational scalability, addressing both theoretical and practical aspects of modern scientific computing. Despite no explicitly listed awards, his contributions reflect significant impact in his fields.
Sainyam Galhotra is an Assistant Professor in the Department of Computer Science at Cornell University. His research focuses on developing data science tools for trustworthy analytics, integrating causal inference, data management, and machine learning to enhance robustness, explainability, and fairness in algorithmic systems. PhD: University of Massachusetts Amherst (2020), advised by Barna Saha B.Tech: Indian Institute of Technology Delhi (2014), advised by Amitabha Bagchi Postdoctoral Research: University of Chicago (Computing Innovation Fellow) His work spans artificial intelligence, causal inference, and responsible data science, emphasizing ethical algorithm design and reliable data integration. Recent publications highlight advancements in fair clustering, causal feature selection, and entity resolution frameworks. His research trends from 2023–2024 include contributions to spatio-temporal data correlation, community detection in geometric graphs, and distribution-aware dataset search. Key themes are fairness in machine learning, causal modeling, and scalable data management solutions. Computing Innovation Fellowship (2021) DAAD AInet Fellow (2021) ACM SIGMOD Entity Resolution Programming Contest Finalist (2021) Krithi Ramamritham Computer Science Scholarship (2019) BEST Paper Award in SIGSOFT FSE 2017 He actively seeks PhD or Master’s students interested in data science and trustworthy AI. Contact via email: sg@cs.cornell.edu .
Richard E. Turner is a Professor of Machine Learning at the University of Cambridge's Department of Engineering and Research Lead for AI for Weather Prediction at the Alan Turing Institute. He serves as Cambridge Lead for the EPSRC Probabilistic AI Hub and previously held roles including Visiting Researcher at Microsoft Research, Co-Director of the AI4ER CDT, and Course Director for the Machine Learning and Machine Intelligence MPhil program. Current research focuses on probabilistic machine learning fundamentals, environmental prediction (weather/climate), and spatio-temporal modeling combining deep learning with Bayesian methods Supervised 26 PhD students (13 graduated) and 7 research assistants/associates Secured over £30M in research funding from EPSRC, Microsoft, Toyota, Google, DeepMind, Amazon, and Improbable Featured in BBC Radio 5 Live's The Naked Scientist, BBC World Service's Click, and Wired Magazine His recent publications demonstrate expertise in diffusion models for PDE simulations, Gaussian Processes for environmental applications, and Bayesian methods for spatio-temporal forecasting. Key trends include climate modeling using ML, neural PDE solvers, and scalable probabilistic inference. Awards : Cambridge Students' Union Teaching Award for Lecturing; supervised Qualcomm Innovation Fellowship winner Collaborations : Microsoft Research (AI4Science), Alan Turing Institute, EPSRC Probabilistic AI Hub Turner leads the Turner Group within Cambridge's Machine Learning Group, focusing on uncertainty-aware ML for scientific applications. Current research assistants work on topics like meta-learning, Bayesian inference, and climate science applications.
Daniel M. Kane is a Professor at the University of California, San Diego (UCSD), holding a joint appointment in the Department of Mathematics and the Department of Computer Science and Engineering (CSE). His research spans mathematics and theoretical computer science, with a focus on number theory, combinatorics, complexity theory, and computational statistics. He earned a Ph.D. in Mathematics from Harvard University (2011) and dual BS degrees in Mathematics with Computer Science and Physics from MIT (2007). Prior to UCSD, he was a postdoctoral researcher at Stanford University (2011–2014) on an NSF fellowship. His research interests include robust statistics, machine learning, polynomial threshold functions, and algorithmic methods for high-dimensional data. Notable achievements include co-authoring the book Algorithmic High-Dimensional Robust Statistics (Cambridge University Press, 2023) and receiving the Best Paper Award at the Conference on Computational Complexity (2013), as well as gold medals at the International Mathematical Olympiad (2002 and 2003). Current teaching includes courses such as Math 96 (Putnam Seminar), Math 154 (Graph Theory), CSE 101 (Algorithms), and CSE 203A (Randomized Algorithms). He has consulted for companies like CASPER Labs and AIble, and his work extends to cryptographic protocols, including quantum money schemes based on quaternion algebras. Key contributions include breakthroughs in robust mean estimation, list-decodable learning, and the development of efficient algorithms for statistical problems. His research often bridges foundational theory with practical applications in machine learning and data analysis.
Professor Alexandra M. Schmidt is a leading academic in Biostatistics at McGill University, holding an endowed University Chair. She specializes in spatial and spatio-temporal modeling, particularly in epidemiology and environmental health. Previously, she served as a Full Professor at the Federal University of Rio de Janeiro (2012–2016). Her research focuses on Bayesian methodologies for analyzing complex processes, including disease spread, environmental hazards, and socio-economic disparities. She has authored influential books such as Spatio-Temporal Methods in Environmental Epidemiology with R (2023) and contributed to over 150 peer-reviewed articles. Key awards include the ISBA Fellowship (2024), ASA Fellowship (2020), and the Abdel El-Shaarawi Award (2008). Education: PhD in Statistics (2001, University of Sheffield, UK), MSc and BSc in Statistics (Federal University of Rio de Janeiro, Brazil). Research interests span Bayesian inference, spatial statistics, and environmental epidemiology. She has advised numerous PhD/MSc students and collaborated on projects linking statistical methods to public health challenges, such as modeling dengue outbreaks and air pollution impacts. Active in academic service, she has chaired major conferences (e.g., 2022 ISBA World Meeting) and serves on editorial boards of top journals like Bayesian Analysis and Canadian Journal of Statistics . Teaching includes advanced courses on generalized linear models, spatial epidemiology, and Bayesian analysis. Her work bridges theoretical statistics with practical applications, addressing global health issues through innovative spatio-temporal modeling techniques.
Aram Harrow is a Professor of Physics at the Massachusetts Institute of Technology (MIT) , affiliated with the MIT Center for Theoretical Physics and MIT Center for Quantum Engineering . He focuses on quantum information science and quantum algorithms , with additional interests in representation theory and optimization . His recent work explores quantum computing applications in chemical physics and statistical mechanics . Undergraduate and graduate degrees in Physics at MIT Faculty positions: MIT (2013-present), University of Washington (2010-12), University of Bristol (2005-10) Research Interests: His work bridges quantum information theory and many-body physics , including: Quantum algorithm design for chemistry and optimization Quantum circuit complexity and t-designs Entanglement dynamics in quantum systems Quantum-classical hybrid computing models Key Publications: Recent articles demonstrate quantum speedups for biomolecular free energy calculations , Hamiltonian simulation , and jet clustering algorithms . His research combines quantum complexity theory with practical implementations on near-term quantum devices. Scientific Awards: 2023 Simons Investigator 2018 APS Bennett Award 2017 IEEE Best Paper Award 2016 Kavli Frontiers Fellow Mentorship: He advises current PhD students Shankar Balasubramanian , Angus Lowe , and Norah Tan , with 12 former advisees including Anand Natarajan and Saeed Mehraban . His 2026 recruitment seeks one new graduate student.
Joseph Eremondi is an Assistant Professor in the Department of Computer Science at the University of Regina, Faculty of Science, Canada. He began his tenure in 2024 after serving as a Royal Society Newton International Fellow at the University of Edinburgh, where he conducted postdoctoral research with Ohad Kammar in the Laboratory for Foundations of Computer Science. He earned his PhD from the University of British Columbia (UBC) under the supervision of Ron Garcia at the UBC Software Practices Laboratory. His research is centered on programming languages theory, with a strong focus on type systems that enhance software reliability and usability. He is particularly known for his work in dependent types, gradual typing, and the integration of both paradigms. His research interests include: Dependent pattern matching and its semantic foundations Gradual dependent types and approximate normalization Error message generation and usability in dependently typed languages Static analysis using set constraints and SMT solvers Theoretical properties of reversal-bounded counter automata and shuffle operations His recent publications, appearing in premier venues like POPL, ICFP, and CPP, reflect a consistent trajectory toward making advanced type systems more accessible and practical. Key themes include coverage semantics for dependent pattern matching, formal models of gradual dependent typing, and improving the developer experience through better tooling and error diagnostics. Notable scientific recognitions include the NSERC Discovery Grant (awarded in 2025) and the prestigious Royal Society Newton International Fellowship. These awards underscore the impact and promise of his research program on the usability of dependently typed programming languages. Joseph is actively mentoring and recruiting graduate students, particularly in areas such as dependently typed programming (Lean, Agda, Idris, Coq), gradual typing, live programming environments, and static analysis. He emphasizes close collaboration within a small, focused research group. He has also served on program committees, including for TyDe and POPL Artifact Evaluation, demonstrating active engagement in the programming languages community. His work bridges theoretical rigor with practical implementation, evident in his artifact releases on GitHub and integration with tools like Ott and DrRacket. He maintains a personal website and open-source repositories that support reproducibility and community involvement.
