جست‌وجوی استاد و پژوهشگر

Adrian Wellerمشاهده پروفایل

استاد پژوهشی

• Artificial Intelligence
• Machine Learning
• Explainability
• +۹ مورد دیگر

Adrian Weller is a prominent researcher and academic at the University of Cambridge, serving as a Director of Research in Machine Learning within the Department of Engineering. He holds multiple significant leadership roles including Programme Director for Trust and Society at the Leverhulme Centre for the Future of Intelligence (CFI), and previously served as Programme Director for AI at The Alan Turing Institute, the UK national institute for data science and AI. His work bridges theoretical machine learning research with practical applications and societal implications of artificial intelligence. Weller's research interests span a broad spectrum of AI and machine learning topics with a particular focus on ensuring beneficial societal outcomes. His work encompasses explainability, fairness, robustness, scalability, privacy, safety, and ethics in AI systems. He has made significant contributions to trustworthy machine learning, including developing frameworks for AI governance, certification, and human-AI collaboration. His research group actively investigates neuro-symbolic approaches, privacy-preserving techniques, and methods for improving the reliability and interpretability of AI systems. His recent publications demonstrate a strong trend toward addressing the practical challenges of deploying AI systems in real-world contexts, particularly focusing on certification frameworks, governance mechanisms, and human-centered approaches. His work spans theoretical advances in machine learning architectures while maintaining a strong connection to societal impact, with publications appearing in top venues across AI, machine learning, and interdisciplinary applications. Scientific Awards: MBE for services to digital innovation (2022 Queen's Birthday Honours) Turing AI Fellowship for Trustworthy Machine Learning Weller actively supervises a large group of PhD students and postdocs, with current students including Juyeon Heo, Yanzhi Chen, Katie Collins, Isaac Reid, Yichao Liang, Herbie Bradley, and Shoaib Siddiqui. His former students have gone on to positions at leading institutions including Google DeepMind, ETH Zurich, NYU, and MPI-IS Tübingen. He has served on numerous advisory boards including the Centre for Data Ethics and Innovation, UNESCO's expert group on AI ethics, and the World Economic Forum's Global Future Council on AI. His research has been supported through his Turing AI Fellowship and various collaborative projects focused on safe and ethical AI development. Weller leads a vibrant research group focused on trustworthy machine learning, which actively organizes workshops and conferences including ICML 2024 (where he served as Program Chair), multiple workshops on responsible AI, and events through the ELLIS network. His group collaborates extensively across disciplines, working with researchers in computer science, social sciences, law, and policy to address the multifaceted challenges of developing beneficial AI systems.

Martin T. Wellsمشاهده پروفایل

استاد

• Applied Statistics
• Theoretical Statistics
• Bayesian Statistics
• +۷ مورد دیگر

Martin T. Wells is the Charles A. Alexander Professor of Statistical Sciences at Cornell University, with joint appointments in the Department of Statistical Science, Department of Biological Statistics and Computational Biology, Department of Social Statistics, and as Professor of Clinical Epidemiology and Health Services Research at Weill Medical School. He serves as Editor-in-Chief of the ASA-SIAM Book Series and Co-Editor of the Journal of Empirical Legal Studies. Cornell University, Ithaca, NY Weill Cornell Medical College Research Interests span applied and theoretical statistics, Bayesian methods, biostatistics, clinical epidemiology, and computational biology. His work bridges disciplines like finance, legal studies, and health services research. Article Trends highlight advancements in Bayesian modeling, quantum cognition machine learning, tensor analysis, and misclassification correction, with applications in genomics, finance, and public health. Fellow of the American Statistical Association Fellow of the Royal Statistical Society Contributions include developing statistical software (e.g., rTensor), methodological innovations in clinical trials, and empirical legal studies on civil rights and the death penalty.

• Foundations of Probability
• Randomness
• Graph Theory
• +۸ مورد دیگر

Lourens Waldorp is an Associate Professor at the University of Amsterdam within the Faculty of Social and Behavioural Sciences , specifically the Department of Psychological Methods . His research focuses on network theory, causal inference, and statistical modeling in psychology and neuroscience. University of Amsterdam IAS Fellow (2024) His research interests include: Network psychometrics Causal inference in psychological models High-dimensional statistical methods Dynamical systems in psychopathology Graph theory applications Signal processing for biophysical data The trends in his recent publications center on causal modeling, network analysis of psychopathology, and statistical techniques for time-series data. He has developed methods for perturbation graphs, moderated network models, and dynamic intervention frameworks. Notable scientific awards : IAS Fellowship for 6 months (2024) He advises PhD students like Kyra Evers and collaborates with researchers across disciplines, including J. Haslbeck , D. Borsboom , and O. Ryan . His work intersects with network theory and clinical psychology .

Erik B. Sudderthمشاهده پروفایل

استاد

• Machine Learning
• Computer Vision
• Statistical Inference
• +۳ مورد دیگر

Erik B. Sudderth is a Professor of Computer Science and Statistics and Chancellor's Fellow at the University of California, Irvine (UCI). He leads the Learning, Inference, & Vision Group and directs multiple research centers, including the UCI Center for Machine Learning and Intelligent Systems and the HPI Research Center in Machine Learning and Data Science. He previously served as an Associate Professor at Brown University. Education: B.S. (summa cum laude) in Electrical Engineering from UC San Diego (1999), M.S. and Ph.D. in EECS from MIT (2002, 2006). His research focuses on statistical methods for scalable machine learning, Bayesian nonparametrics, probabilistic graphical models, and applications in computer vision, AI, and environmental science. Key areas include nonparametric clustering, deep generative models, and particle-based inference algorithms. Research interests span diverse topics: advancing Bayesian nonparametric models for medical time series, scalable variational inference, and AI ethics. Notable contributions include the NET-VISA seismic monitoring system (ISBA Mitchell Prize, 2014), the BNPy toolbox (NSF CAREER Award), and work on diverse particle max-product algorithms for continuous inference. Scientific awards include the NSF CAREER Award, ISBA Mitchell Prize, and recognition as one of "AI's 10 to Watch" (IEEE). He has served as editor for top journals (JMLR, IEEE PAMI) and conference chairs (NeurIPS, CVPR). His work bridges theory and practice, with applications in robotics, climate science, and healthcare. Labs/Teams: UCI Learning, Inference, & Vision Group; UCI Center for Machine Learning; CREATE Technology Center. Grants include NSF funding for visually impaired collaboration tools and soil biogeochemical modeling.

David Bindelمشاهده پروفایل

دانشیار

• Applied Numerical Linear Algebra
• Eigenvalue Problems
• Network Analysis
• +۵ مورد دیگر

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.

Brett Kolesnikمشاهده پروفایل

پژوهشگر ارشد

• Probability Theory
• Random Structures
• Bootstrap Percolation
• +۴ مورد دیگر

Brett Kolesnik is a Research Fellow in the Department of Statistics at the University of Warwick. His research focuses on probability theory, random structures, bootstrap percolation, and interactions with combinatorics. He has held postdoctoral fellowships at UC Berkeley, San Diego, and the University of Oxford, and was a Senior Demy at Magdalen College. His work includes organizing workshops on bootstrap percolation and collaborating with leading researchers in probability and combinatorics. Education: PhD in Mathematics from the University of British Columbia (advised by Omer Angel). Notable awards include the NSERC Postdoctoral Fellowship and the Florence Nightingale Bicentennial Fellowship in Statistics. Research interests span bootstrap percolation models, random graph dynamics, and stochastic processes. Recent work includes studies on Brownian map geometry, tournament score sequences, and Coxeter group structures. Selected articles explore topics such as critical beta-splitting processes, Catalan percolation, and random walks on algebraic structures. His publications appear in top journals like Electronic Journal of Probability and Annals of Applied Probability . Awards include the Florence Nightingale Fellowship and NSERC Postdoctoral Fellowship. Professional involvement includes organizing the 2024 BIRS workshop on Bootstrap Percolation and contributing to interdisciplinary collaborations in probability and combinatorics.

Andre Wibisonoمشاهده پروفایل

استادیار

• Machine Learning
• Optimization
• Sampling
• +۴ مورد دیگر

Andre Wibisono serves as Assistant Professor in Yale University's Department of Computer Science with a secondary appointment in Statistics & Data Science, joining the faculty in 2021 after postdoctoral research at University of Wisconsin-Madison and Georgia Institute of Technology. His educational background includes: Ph.D. in Computer Science, UC Berkeley M.A. in Statistics, UC Berkeley M.Eng. in Computer Science, MIT S.B. in Mathematics and Computer Science, MIT Wibisono's research focuses on algorithm design for machine learning through optimization, sampling, and game theory , leveraging dynamical systems and information theory to develop accelerated discrete-time algorithms from continuous dynamics. His work provides theoretical foundations for efficient machine learning systems with applications in generative modeling and constrained optimization. Recent publications (2023-2025) demonstrate consistent innovation in Hamiltonian-based optimization , constrained-space sampling , and min-max game convergence , characterized by rigorous mathematical analysis connecting continuous dynamics to discrete algorithms. Key trends include randomized integration for acceleration, phi-divergence convergence guarantees, and symplectic geometry applications to mirror descent. Scientific recognition includes: NSF CAREER Award for developing algorithmic frameworks bridging continuous and discrete dynamics He actively mentors current students (Siddharth Mitra, Kaylee Yang, Jane Lee, Qiang Fu, Peter Wang) and has guided two postdocs to faculty positions. Research is funded through the NSF CAREER award and collaborative CIF grants focused on Hamiltonian dynamics for sampling and optimization. His Yale research group develops theoretical foundations for next-generation machine learning algorithms, emphasizing mathematical rigor in optimization and sampling with applications to generative modeling and constrained inference problems.

Leslie Ann Goldbergمشاهده پروفایل

استاد

• Algorithms
• Complexity Theory
• Randomised Algorithms
• +۵ مورد دیگر

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.

Charles A. Boumanمشاهده پروفایل

استاد

• Computational Imaging
• Statistical Image Models
• Tomographic Image Reconstruction
• +۱۳ مورد دیگر

Charles A. Bouman is the Showalter Professor of Electrical and Computer Engineering and Biomedical Engineering at Purdue University, with a courtesy appointment in Mathematics. He is a leading researcher in computational imaging, integrating statistical signal processing, physics, and computation for applications in healthcare, scientific, and industrial imaging. Education: B.S.E.E., University of Pennsylvania, 1981 M.S., University of California at Berkeley, 1982 Ph.D. in Electrical Engineering, Princeton University, 1989 His research focuses on computational imaging , including statistical image models, multiscale techniques, tomographic reconstruction, and fast algorithms. Key areas include Model-Based Iterative Reconstruction (MBIR), Plug-and-Play priors, document processing, and multiscale segmentation. His work has led to foundational contributions in total variation regularization and sparse-view reconstruction. The recent publications highlight a strong trend in integrating machine learning with physical models for image reconstruction, particularly through Plug-and-Play methods. His work spans optical tomography, halftoning, image scaling, and document compression, demonstrating consistent innovation in both theory and practical software implementation. Scientific Awards and Honors: Member, National Academy of Inventors Life Fellow, IEEE Fellow, IS&T; Honorary Member (2022); Service Award (2023) Fellow, SPIE and AIMBE IEEE Signal Processing Society Claude Shannon-Harry Nyquist Award (2021) Electronic Imaging Scientist of the Year (2014) SIAM Imaging Science Best Paper Prize (2020) Founder, IS&T Computational Imaging Conference (2003) Co-Founder, IEEE Transactions on Computational Imaging Vice President, IS&T; Former VP of Publications (2000–2004) Bouman has advised numerous graduate students and leads a vibrant research group developing open-source tools like MBIRJAX , SVMBIR , and OpenMBIR . His research has been supported by the National Science Foundation, General Electric, Intel, Xerox, Hewlett-Packard, and the State of Indiana 21st Century Fund. He maintains an active presence through tutorials, conference leadership, and educational resources including video lectures and a textbook on Foundations of Computational Imaging. Labs and Research Teams: His group develops cutting-edge software for tomographic reconstruction, clustering, segmentation, and dynamic sampling. Projects include Gaussian Mixture modeling (GMCluster), Plug-and-Play implementations, Sparse Matrix Transforms, and UAV sensing datasets. The research is highly interdisciplinary, bridging engineering, mathematics, and biomedical applications.

Aaron Smithمشاهده پروفایل

دانشیار

• Applied Probability
• Computational Statistics
• Monte Carlo Methods
• +۳ مورد دیگر

Aaron Smith is an Associate Professor in the Department of Mathematics and Statistics at the University of Ottawa, affiliated with the Faculty of Science. He holds a PhD from Stanford University. His research focuses on applied probability, computational statistics, Monte Carlo methods, and Markov chains, with an emphasis on advancing theoretical understanding and practical applications of these methodologies. Dr. Smith's work includes contributions to community detection algorithms, Markov chain mixing times, and synthetic health data generation. His recent publications explore topics such as nonstandard Dirichlet form representations, perturbation analysis of MCMC algorithms, and sparse Bayesian multidimensional scaling. He advises students in applied probability and has supervised postdoctoral researchers in related fields. His research interests span a wide range of topics, including stochastic processes, statistical inference, and algorithm design. He is particularly known for his analysis of convergence rates in Markov chains and the development of efficient sampling techniques for complex models. His interdisciplinary work bridges theoretical mathematics and practical computational challenges in data science and healthcare. Dr. Smith collaborates on projects involving synthetic data frameworks for privacy-preserving applications and has contributed to foundational work on mixing times and perturbation effects in stochastic systems.

Bryon Aragamمشاهده پروفایل

دانشیار

• Causality
• Statistical Machine Learning
• Probabilistic Modeling
• +۶ مورد دیگر

Bryon Aragam is an Associate Professor of Econometrics and Statistics and Robert H. Topel Faculty Scholar at the University of Chicago Booth School of Business. His research focuses on the intersection of causality, statistical machine learning, and probabilistic modeling, with particular emphasis on applications to artificial intelligence systems including large language models like ChatGPT and generative models like DALL-E. Dr. Aragam completed his PhD in Statistics and a Masters in Applied Mathematics at UCLA, where he was an NSF graduate research fellow. Prior to joining the University of Chicago, he was a project scientist and postdoctoral researcher in the Machine Learning Department at Carnegie Mellon University. Research Focus: Causal structure learning in probabilistic generative models Key Areas: Causal machine learning, deep generative models, latent variable models, statistical learning theory Applications: AI interpretability, ethics, and fairness in artificial intelligence systems Teaching: Business Statistics, Econometrics and Statistics Colloquium His recent publications demonstrate a strong theoretical foundation combined with practical applications, particularly in understanding and improving AI systems. His work spans causal discovery, graphical models, deep learning, and latent variable modeling, with particular attention to the theoretical properties of these methods and their applications to real-world AI challenges. The research shows a progression toward increasingly complex problems in causal representation learning and AI interpretability. Scientific Awards: Robert H. Topel Faculty Scholar NSF Graduate Research Fellow Dr. Aragam's work has been published in top statistics and machine learning venues including the Annals of Statistics, Neural Information Processing Systems (NeurIPS), the International Conference on Machine Learning (ICML), and the Journal of Machine Learning Research (JMLR). His research group publishes broadly across both statistical and machine learning communities, demonstrating the interdisciplinary nature of his work at the intersection of statistics, machine learning, and causal inference. As a data science consultant for technology and marketing firms, Dr. Aragam has applied his expertise to problems in survey design, customer retention, logistics, and ranking, bridging the gap between theoretical research and practical applications.

Mohammadtaghi Hajiaghayiمشاهده پروفایل

استاد

• Design and Analysis of Algorithms
• Approximation Algorithms
• Fixed-Parameter Algorithms
• +۸ مورد دیگر

Mohammadtaghi Hajiaghayi is the Jack and Rita G. Minker Professor of Computer Science at the University of Maryland, College Park. He is affiliated with the Robert H. Smith School of Business and holds Research Affiliate positions at MIT CSAIL and the Center for Discrete Mathematics and Theoretical Computer Science (DIMACS). His research focuses on algorithms, game theory, and network design, supported by NSF, ONR, and industry grants. He has received prestigious awards including ACM Fellow (2018) and EATCS Nerode Prize (2015) for his work on bidimensionality theory. Education: PhD from MIT (2005), postdocs at CMU and MIT, MSc from University of Waterloo, and BSc from Sharif University. He teaches courses like Data Science and Algorithms at UMD. Industry experience includes roles at Amazon, Google, and AT&T Labs. Over 20 students have graduated under his advisement, many in academia and industry. His work spans approximation algorithms, game theory, and big data. Projects include BigDND with Erik Demaine. He serves on editorial boards of Algorithmica, SODA, and others. Awards also include IEEE Fellow (2020) and Blavatnik Honoree (2020).

Lars Linsenمشاهده پروفایل

استاد

• Interactive Visual Analysis
• Medical Visualization
• Scientific Visualization
• +۴ مورد دیگر

Prof. Dr.-Ing. Lars Linsen is a full Professor of Computer Science at the Westfälische Wilhelms-Universität (WWU) Münster, leading the VISualization & graphIX (VISIX) group. His primary affiliation is the Institute of Computer Science within the Faculty of Mathematics and Computer Science. He holds adjunct professorships at Jacobs University, Bremen, and has held previous academic roles including Full Professor at Jacobs University (2012–2017) and Associate/Assistant Professor roles in Germany and the U.S. His research focuses on interactive visual analysis, medical visualization, and scientific visualization, with applications in life sciences and engineering. Education: PhD (Dr.-Ing.) in Computer Science from Universität Karlsruhe (2001), M.Sc. (Diplom) in Computer Science (1997), B.Sc. (Vordiplom) in Computer Science (1994). Awards: IEEE Visualization Design Contest Winner (2008, 2022, 2018), Preis des Fördervereins des Forschungszentrum Informatik (2002). Research Highlights: Develops visualization tools for medical imaging (e.g., mass spectrometry imaging, MRI data analysis) and physical simulations (e.g., wildfire spread analysis, asteroid impact modeling). Active in EU-funded projects like Pig-Pro-QuO (surface coatings) and cells-in-motion initiatives. Supervised over 20 PhD/MS advisees, including notable graduates in medical visualization and simulation ensemble analysis. Publications: Over 100 peer-reviewed articles in top venues like IEEE Transactions on Visualization and Computer Graphics, Computers & Graphics, and EuroVis. Key works include SciVis contest-winning wildfire analysis frameworks and medical visualization tools for stenosis detection. Teaching: Offers courses on visualization, computer graphics, and computational science. Actively involved in thesis supervision and curriculum development at both WWU Münster and Jacobs University. Grants & Collaborations: Principal investigator on DFG-funded projects (e.g., hemodynamics simulations, ensemble visualization) and industry collaborations (e.g., Tascon GmbH for coating quality analysis). Member of the Cells-in-Motion Interfaculty Centre and CDH board at WWU.

Wojciech Jaroszمشاهده پروفایل

دانشیار

• Computer Graphics
• Rendering
• Light Transport Simulation
• +۳ مورد دیگر

Wojciech Jarosz is an Associate Professor of Computer Science at Dartmouth College, affiliated with the College of Engineering and Computer Science. His research focuses on computer graphics, particularly light transport simulation, rendering algorithms, and digital fabrication. He co-founded the Visual Computing Lab and previously led the rendering group at Disney Research Zürich. Jarosz holds a Ph.D. and M.S. from UC San Diego and a B.S. from the University of Illinois Urbana-Champaign. His educational background includes studies in computer science and engineering, with a strong emphasis on graphics and rendering. Research interests span light transport simulation, Monte Carlo methods, appearance capture, and fabrication. Notable achievements include the Eurographics Young Researcher Award (2013) and the NSF CAREER Award (2019). Jarosz's work integrates theoretical rigor with practical applications, such as real-time rendering techniques and volumetric light transport. His lab develops tools for artistic authoring, including intuitive metaphors for volumetric lighting in animated films. Recent projects explore wave-optics BSDF models, optical heterodyne rendering, and unifying radiative transfer models. Key awards include the SIGGRAPH 2024 Best Paper Award and Neukom Institute prizes. His teaching includes courses on rendering algorithms, computer graphics, and computational photography. Jarosz collaborates with industry (e.g., Disney, NVIDIA) and advocates for diversity in computer graphics research.

George Cantwellمشاهده پروفایل

استادیار

• Network Science
• Complex Systems
• Statistical Inference
• +۴ مورد دیگر

Dr. George Cantwell is an Assistant Professor in the Department of Engineering at the University of Cambridge, affiliated with Cambridge Infectious Diseases. He specializes in computational methods for inference problems, particularly in disease spreading across networks. Education: PhD in Physics from the University of Michigan; postdoctoral fellowship at the Santa Fe Institute His research focuses on network science , complex systems , and statistical inference , with an emphasis on computational approaches. His work spans theoretical and applied domains, including: Message passing algorithms for heterogeneous networks Bias correction in social network analysis (friendship paradox) Statistical inference of network structure from noisy data Modeling judicial voting behavior through network interactions Computational cognitive neuroscience of category learning Recent publications highlight interdisciplinary applications in epidemiology, physics, and cognitive science. He actively mentors students in networks, complex systems, and statistical inference.