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

Dawn Songمشاهده پروفایل

استاد

• Artificial Intelligence
• Cybersecurity
• Machine Learning
• +۷ مورد دیگر

Dawn Song is a Professor in the Department of Electrical Engineering and Computer Science at the University of California, Berkeley, affiliated with multiple research centers including the Berkeley Artificial Intelligence Research Lab (BAIR) and the Berkeley Center for Responsible, Decentralized Intelligence (RDI). She holds leadership roles in AI safety, cybersecurity, and blockchain research. Her work bridges machine learning, security, and distributed systems, with notable contributions to formal verification, privacy-preserving technologies, and AI governance. Education: Ph.D. (2002) and M.S. (1999) in Computer Science from UC Berkeley and Carnegie Mellon University, respectively. She previously served as an Assistant Professor at Carnegie Mellon University before joining UC Berkeley in 2007. Research Interests: Dawn's work focuses on AI safety, cybersecurity, and the ethical implications of frontier AI. She explores topics such as large language model vulnerabilities, zero-knowledge proofs, blockchain security, and policy frameworks for AI governance. Her research combines theoretical rigor with practical applications, addressing challenges in secure systems, adversarial machine learning, and privacy-preserving computation. Publications: Her recent work includes groundbreaking studies on LLM memorization, smart contract decompilation, and AI agent cybersecurity evaluation. She also leads initiatives like the Singapore Consensus and California Report on AI safety priorities, emphasizing global collaboration in risk mitigation. Notable Awards: MacArthur Fellowship (2010), ACM Fellow (2019), IEEE Fellow (2019) Advising & Grants: She advises projects on AI policy and cybersecurity, securing grants from NSF, DARPA, and industry collaborations. Her lab develops tools like CyberGym for evaluating AI agents and zkPyTorch for secure machine learning. Labs & Teams: Her research groups at UC Berkeley focus on cutting-edge projects in AI safety, blockchain, and cybersecurity, collaborating with industry leaders and policymakers to advance both technical and ethical standards.

Stanislav Smirnovمشاهده پروفایل

استاد

• Mathematical Physics
• Statistical Physics
• Probability Theory
• +۴ مورد دیگر

Stanislav Smirnov is a Professor of Mathematics at the University of Geneva, where he has been a faculty member since 2003. He also holds a part-time position at the Chebyshev Laboratory of St. Petersburg State University. As Director of the National Centre of Competence in Research SwissMAP since 2014, he leads a major research initiative funded by the Swiss National Science Foundation. His education includes a mathematics degree from St. Petersburg State University (1992) and a PhD from the California Institute of Technology (1996). Prior to joining Geneva, he held positions at Yale University, the Institute for Advanced Study in Princeton, the Max Planck Institute in Bonn, and the Royal Institute of Technology in Stockholm. Professor Smirnov's research focuses on the mathematical foundations of statistical physics, with particular emphasis on conformal invariance in two-dimensional lattice models. His work has revolutionized our understanding of critical phenomena through rigorous mathematical approaches, establishing deep connections between probability theory, complex analysis, and statistical mechanics. He develops novel discrete complex analysis techniques to prove continuum limits of lattice models at criticality. His publication record shows consistent advancement in understanding random planar geometry, percolation theory, and the Ising model, with increasing attention to Liouville quantum gravity in recent years. His work bridges deep mathematical analysis with physical insights, often providing rigorous proofs for phenomena previously understood only through physical intuition. Fields Medal (2010) for the proof of conformal invariance of percolation and the planar Ising model in statistical physics As an advisor, Professor Smirnov has mentored doctoral students including Ekin Arikök and Nikolai Bobenko. He leads the ANALYSE, PHYSIQUE MATHÉMATIQUE ET PROBABILITÉS research group at the University of Geneva. His research is supported by major grants including the NCCR SwissMAP, European Research Council's AG COMPASP, and Swiss National Science Foundation grants 200020_143434 and 200020_141329. Professor Smirnov has organized numerous influential conferences, including the "Conformal maps from probability to physics" workshop at Monte Verità (2010) and multiple "Random Planar Geometry" meetings in Les Diablerets, fostering collaboration between mathematicians and physicists working on critical phenomena and random geometry.

Greg Durrettمشاهده پروفایل

دانشیار

• Natural Language Processing
• Machine Learning
• Artificial Intelligence
• +۷ مورد دیگر

Greg Durrett is an Associate Professor in the Department of Computer Science at University of Texas at Austin, leading the TAUR Lab (Text Analysis, Understanding, and Reasoning ). His research focuses on advancing Large Language Models (LLMs) for knowledge-intensive tasks in medical information processing scientific discovery legal reasoning . He received his B.S. in Computer Science and Mathematics from MIT (2010) and Ph.D. in Computer Science from UC Berkeley (2016). His work develops techniques to train LLMs with new capabilities augment models for reliability assess model outputs improve reasoning frameworks . His 15 most recent publications (2021-2025) span knowledge propagation in LLMs chain-of-thought reasoning code generation benchmarks multi-modal reasoning fact verification discourse analysis . Scientific honors include NSF CAREER Award (2024) NSF grants (2018, 2024) Bloomberg Data Science Grant (2017) Facebook Fellowship (2014) Best Paper Finalist (EMNLP 2013) . Teaching: CS388: Natural Language Processing (graduate) CS371N: NLP (undergraduate) High school NLP module .

Han Liuمشاهده پروفایل

استاد

• Artificial Intelligence
• Computer Systems
• Statistical Machine Learning
• +۴ مورد دیگر

Han Liu is a Professor in the Department of Computer Science at Northwestern University's McCormick School of Engineering. He directs the MAGICS (Modern Artificial General Intelligible and Computer Systems) Lab and the Center for Foundation Models and Generative AI at Northwestern, with prior roles as director of the Deep Reinforcement Learning Center at Tencent AI Lab and professor at Princeton and Johns Hopkins Universities. PhD in Machine Learning and Statistics from Carnegie Mellon University (2012), advised by John Lafferty and Larry Wasserman Han Liu's research focuses on integrating artificial intelligence with computer systems, particularly through foundation models and probabilistic graphical models. His work aims to revolutionize science, engineering, and business by deploying statistical machine learning methods in edge and cloud computing environments. Recent research trends include transformer-based models, modern Hopfield networks, genomic foundation models, and theoretical analysis of attention mechanisms. His 2025 publications explore topics like species differentiation with DNA embeddings, universal approximation capabilities of transformers, and metaverse spatial reasoning. Alfred P Sloan Fellowship in Mathematics IMS Tweedie New Researcher Award ASA Noether Young Scholar Award NSF CAREER Award Presidential Early Career Awards for Scientists and Engineers Han Liu serves as associate editor for the Journal of American Statistical Association, Electronic Journal of Statistics, Technometrics, and the Journal of Portfolio Management. He has directed research centers at Northwestern and contributed to major conferences as area chair (NeurIPS, ICML, ICLR).

• Functional Analysis
• Artificial Intelligence
• Foundations of Computational Mathematics
• +۱۵ مورد دیگر

Professor Anders C. Hansen is a mathematician at the University of Cambridge and University of Oslo, leading the Applied Functional and Harmonic Analysis group. His work bridges functional analysis, artificial intelligence, and computational mathematics, focusing on the Solvability Complexity Index (SCI) hierarchy and stability issues in deep learning. He has held prestigious fellowships, including a Royal Society University Research Fellowship and Peterhouse Bye-Fellowship. Educated at the University of Cambridge, UC Berkeley, and the Norwegian University of Science and Technology Developed groundbreaking theories in compressed sensing and deep learning, revealing algorithmic instability paradoxes Organized workshops on computational mathematics and AI interpretability His research explores the SCI hierarchy , exposing computational barriers in AI, quantum mechanics, and inverse problems. Key projects include Smale’s 18th problem and analyzing neural network stability. His work has transformed understanding of compressed sensing, particularly in medical imaging. Recent scientific awards include the Whitehead Prize (2019), IMA Prize (2018), and Leverhulme Prize (2017). Collaborations span institutions like Caltech, MIT, and the University of Vienna. As an educator, he teaches NST Part IA Mathematical Methods , Part II Numerical Analysis , and a Part III course on Compressed Sensing . His group has mentored 17 PhD and postdoctoral researchers since 2012.

Andrea Coladangeloمشاهده پروفایل

استادیار

• Quantum Computation
• Quantum Cryptography
• Quantum Learning Theory
• +۳ مورد دیگر

Andrea Coladangelo is an Assistant Professor at the Allen School of Computer Science & Engineering , University of Washington , co-leading the Quantum group and contributing to the Theory and Crypto groups. He coordinates the NSF-funded Quantum@UW REU program , fostering undergraduate research in quantum information. Previously, he was a postdoctoral researcher at UC Berkeley and the Simons Institute , advised by Umesh Vazirani , following a PhD in Computer Science at Caltech under Thomas Vidick . His academic journey began with a B.A. in Mathematics from Oxford and a Master in Mathematics from Cambridge . He co-founded qBraid , a platform for quantum computing education. Research Interests : Andrea explores the intersection of quantum computation and cryptography , focusing on foundational questions in entanglement , quantum correlations , and quantum learning theory . His work investigates quantum pseudorandomness , device-independent security , quantum algorithms , and quantum copy-protection , often leveraging computational assumptions to bridge quantum information theory with cryptographic applications. Scientific Awards : 2025 Google Research Scholar Program Award in Quantum Computing 2023 CSE Undergraduate Teaching Award for his course on quantum computation 2019 Best Student Paper Award at QIP Teaching & Outreach : Andrea designed and taught CSE 434: Intro to Quantum Computation (Spring 2023, 2024, 2025), CSE 534: Quantum Information and Computation (Autumn 2023), and CSE 599C: Quantum Learning Theory (Winter 2025). He also delivered lectures at the 22nd Bellairs Crypto Workshop (2024) and led a quantum programming tutorial using qBraid . Labs & Teams : As co-leader of the Quantum group at the Allen School, he collaborates with researchers in Theory and Crypto , advancing quantum computing through interdisciplinary projects and educational initiatives.

• Graph Algorithms
• Optimization
• High-Dimensional Geometry
• +۳ مورد دیگر

Yang P. Liu is an Assistant Professor at Carnegie Mellon University 's Department of Computer Science . He received his PhD from Stanford University under the supervision of Aaron Sidford and previously studied at MIT . Fields of Interest : Graph Algorithms, Optimization, High-Dimensional Geometry, Additive Combinatorics, Theoretical Computer Science. His research focuses on algorithmic design and analysis for graph problems, optimization, and combinatorics, with applications in machine learning and complexity theory. Recent work includes advancements in parallel repetition games , combinatorial lines , and dynamic graph algorithms . In 2024, his research spanned FOCS , STOC , and RANDOM conferences, addressing problems in k-CSPs , min-cost flow , and hypergraph sparsification . Earlier contributions (2023) included deterministic flow algorithms and spectral hypergraph techniques. Scientific Awards : NDSEG Fellowship (2018-2021), Google PhD Fellowship (2022-2023), FOCS Best Paper (2022), STOC Best Student Paper (2022), FOCS Best Student Paper (2021). He teaches CS 15-759 , a graduate course on convex optimization theory and applications, covering gradient descent, interior point methods, and algorithmic sparsification techniques.

Lijie Chenمشاهده پروفایل

استادیار

• Theoretical Computer Science
• Computational Complexity Theory
• Quantum Complexity Theory
• +۴ مورد دیگر

Lijie Chen is an Assistant Professor in the Department of Electrical Engineering and Computer Sciences at UC Berkeley, where he is part of the Berkeley Theory Group. Previously, he was a Miller Research Fellow at UC Berkeley, hosted by Avishay Tal and Umesh Vazirani, and earned his Ph.D. from MIT under Ryan Williams. His research focuses on theoretical computer science, particularly computational complexity theory, with applications to quantum physics and AI safety. Education: Ph.D. in Computer Science from MIT (2022), B.Sc. from Yao Class at Tsinghua University. Research Interests: Complexity theory, quantum complexity, derandomization, circuit lower bounds, and foundational aspects of AI safety. Chen has made significant contributions to understanding fundamental questions in complexity theory, including circuit lower bounds and the connections between randomness and computation efficiency. His work often bridges theoretical insights with practical implications in quantum computing and algorithm design. Awards and Honors: Machtey Award for Best Student Paper (2019). Danny Lewin Best Student Paper Award (2019). Invited to SICOMP Special Issues for FOCS and STOC papers. He has organized workshops on complexity theory and derandomization, and his research has been recognized in venues like STOC, FOCS, and the Journal of the ACM.

• Software Verification
• Formal Methods
• Programming Languages
• +۵ مورد دیگر

Jenna Wise DiVincenzo is an Assistant Professor at the Elmore Family School of Electrical and Computer Engineering at Purdue University. She specializes in research areas such as software verification, formal methods, and programming languages, with a focus on gradual verification techniques that combine static and dynamic analysis. Her work emphasizes usability and scalability in verification tools, and she has contributed to projects like Gradual C0 and gradual null-pointer analysis. Dr. DiVincenzo earned her PhD in Software Engineering from Carnegie Mellon University (2023) and a BS in Mathematics and Computer Science from Youngstown State University (2017). She has interned at IBM Research, MIT Lincoln Laboratory, and the Software Engineering Research and Empirical Studies Lab at YSU. Her awards include the Google PhD Fellowship, NSF GRFP Fellowship, and 2022 Rising Star in EECS. Her research projects span theoretical advancements in gradual verification, empirical studies on usability, and practical tool development. She advises PhD students (e.g., Craig Liu, Conrad Zimmerman) and collaborates on initiatives like gradual verification for Rust and educational tools to teach verification concepts. Her work also explores leveraging large language models for specification generation and enhancing verification tool soundness through formal proofs.

Andrew Headمشاهده پروفایل

استادیار

• Human-Computer Interaction
• Programming
• Reading
• +۱۳ مورد دیگر

Andrew Head is an Assistant Professor at the University of Pennsylvania in the Computer and Information Science department. His research focuses on human-computer interaction, programming, and reading, particularly in developing technology for interactive reading and reasoning. He advises PhD students Alyssa Hwang, Hita Kambhamettu, Litao Yan, Jeffrey Tao, and Jessica Shi, and co-leads the Penn Human-Computer Interaction (Penn HCI) group with Danaé Metaxa. His work is published in top venues like ACM CHI, UIST, and ICSE. Research Interests: Andrew's work bridges interactive systems with programming environments, aiming to enhance how scientists and programmers interact with their tools. Key areas include AI-assisted code understanding, math notation accessibility, and medical note interpretation through interactivity. He employs user studies to identify needs and builds interactive systems to address them. Recent Article Trends: His publications emphasize systems-centric HCI approaches, integrating AI into code and document interfaces. Topics span code explanation (e.g., Ivie), property-based testing (e.g., Tyche), math notation augmentation (e.g., FreeForm), and medical informatics (e.g., Explainable Notes). Recent work also explores notebook environments (e.g., Bolt-on, Tyche) and literate programming (e.g., Colaroid). Scientific Awards: Distinguished Paper Award, ICSE 2024 Best Paper Awards at CHI (2024, 2023, 2022, 2019), UIST (2023, 2018), and others. Nominated for Best Paper at CHI 2023 and VL/HCC 2015. Advising & Grants: Andrew advises multiple PhD students and has secured significant grants, including a $1M NSF award for 'Property-based Testing for the People' (2024). His group collaborates with Penn’s MindCORE center and teams like PLClub and PennNLP. Labs & Teams: He co-leads the Penn HCI group, which works closely with other Penn research teams and labs. The group focuses on creating interactive tools that enhance scientific and programming workflows, supported by grants and cross-institutional partnerships.

• Quantum-safe cryptography
• Lattice-Based Cryptography
• Post-Quantum Cryptography
• +۴ مورد دیگر

Ron Steinfeld is an Associate Professor in the Department of Software Systems & Cybersecurity at Monash University, Australia. He holds editorial roles in Designs Codes and Cryptography (since 2017) and has served on technical committees for top-tier conferences like ASIACRYPT, CRYPTO, and EUROCRYPT. His research focuses on quantum-safe cryptography, lattice-based cryptography, and blockchain security, with over 80 refereed publications and AUD$4M+ in research funding. Education: BSc Mathematics and Physics (Monash University, 1998) BE (Hons., First Class) Electrical and Computer Systems (Monash University, 2000) PhD Computer Science (Monash University, 2003) Research Interests: Design and analysis of cryptographic algorithms, quantum-safe protocols, lattice-based security foundations, and blockchain applications. His work underpins NIST standard algorithms like Kyber and Dilithium through structured lattice problem research. Recent Articles Trends: Focus on privacy-preserving blockchain protocols, post-quantum signature schemes, encrypted data search, and cryptographic applications in adversarial AI. Recent work includes fair Bitcoin watchtower schemes and genomic database privacy solutions. Awards: ASIACRYPT 2015 Best Paper Award Advising & Grants: Supervises PhD projects on quantum-safe cryptography and blockchain security. Leads initiatives like the AUD$4M ARC-funded Quantum Information Technology project. Collaborates with industry partners including CSIRO/Data61. Labs/Teams: Key contributor to Monash’s cybersecurity and cryptography research groups, involving interdisciplinary projects on materials discovery ( Æinstein initiative) and post-quantum blockchain security.

Andrew Childsمشاهده پروفایل

استاد

• Quantum Algorithms
• Quantum Information Processing
• Quantum Simulation
• +۲ مورد دیگر

Andrew Childs is a Professor at the University of Maryland, affiliated with the Department of Computer Science and the Institute for Advanced Computer Studies (UMIACS). He serves as Director of the NSF Quantum Leap Challenge Institute for Robust Quantum Simulation (RQS) and is a Fellow at the Joint Center for Quantum Information and Computer Science (QuICS). His research focuses on quantum algorithms for simulating physical systems, algebraic problems, and quantum walk protocols, with applications in quantum computing and computational complexity. University of Maryland Institute for Advanced Computer Studies (UMIACS) Joint Center for Quantum Information and Computer Science (QuICS) NSF Quantum Leap Challenge Institute for Robust Quantum Simulation Childs' research spans quantum simulation, quantum Fourier transform, phase estimation, and Hamiltonian dynamics. He has developed techniques to reduce quantum computational resources for simulating quantum systems and explored limitations of quantum computers through hidden subgroup problems and non-unitary dynamics. His publications cover diverse areas including quantum walk optimization, Hamiltonian simulation methods, and applications to cryptography and condensed matter physics. Recent works address spatial search algorithms, product formulas for commutators, and quantum routing protocols. As an educator, Childs has taught courses on quantum algorithms and information processing at both the University of Maryland and University of Waterloo, with lecture notes and materials spanning multiple years. Contact: amchilds@umd.edu | Office: ATL 3359 | Affiliated with University of Maryland's quantum research institutes.

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

دانشیار

• Machine Learning
• Generative Models
• Bayesian Inference
• +۵ مورد دیگر

David Duvenaud is an Associate Professor at the University of Toronto , holding a Canada Research Chair in Generative Models and a Schwartz Reisman Chair in Technology and Society . He is cross-appointed to the Department of Computer Science and Department of Statistical Sciences . A Sloan Research Fellow and founding member of the Vector Institute , his work bridges deep probabilistic models , AI safety , and scientific computing . PhD in Machine Learning (University of Cambridge, 2014) Postdoc in Hyperparameter Optimization (Harvard University, 2016) Co-founded Invenia (energy forecasting company) His research spans foundational Neural Ordinary Differential Equations (NeurIPS 2018 Best Paper) and Automatic Chemical Design (ACS Central Science 2018) to recent work on AGI governance (2025) and AI safety (2024). Key contributions include stochastic variational inference , implicit differentiation frameworks , and antisymmetrization layers for quantum Monte Carlo. Recent publications (2024-2025) focus on systemic existential risks from AI , many-shot jailbreaking attacks , and epistemic uncertainty quantification . His group trains energy-based models with scalable MCMC samplers and develops invertible neural architectures (e.g., Residual Flows NeurIPS 2019). He also explores human-AI alignment through LLM Processes (NeurIPS 2024) and Sycophancy in Language Models (ICLR 2024). Canada Research Chair (2025) NSERC Grant (2025) Sloan Research Fellow (2021) Schwartz Reisman Chair (2021) Best Paper Award (NeurIPS 2018) Distinguished Paper Award (ICFP 2021) His students include James Requeima , Jesse Bettencourt , and Raymond Douglas . He teaches courses on Statistical Methods for Machine Learning and Differentiable Inference . Current work (2025) investigates systemic human disempowerment through incremental AI capabilities and sabotage risk mitigation via hyperparameter-aware evaluations.

Michael Potterمشاهده پروفایل

استاد

• History of Analytic Philosophy
• Philosophy of Mathematics
• Philosophical Logic
• +۵ مورد دیگر

Michael Potter is Professor of Logic at the Faculty of Philosophy , University of Cambridge, and a Life Fellow at Fitzwilliam College. Previously at Balliol College, Oxford (D.Phil. in pure mathematics), he has held research fellowships at St Andrews, Harvard, and Stirling University (AHRC-funded). His work bridges historical and systematic philosophy, focusing on History of analytic philosophy (Frege, Russell, Wittgenstein, Ramsey) Philosophy of mathematics and logic Philosophy of religion Potter's research has produced major works like Set Theory and its Philosophy (OUP 2004) and The Rise of Analytic Philosophy (Routledge 2019), with significant contributions to understanding the Metaphysical underpinn't> of the Tractatus Neo-Fregean logicism Paradoxes in mathematical foundations He has supervised research on topics spanning dialetheism, predicative mathematics, and modal ontological arguments. Scientific awards include the AHRC Senior Research Fellowship (2004-2005). His recent publications analyze Transcendental arguments in Wittgenstein Sortition-based democratic theory Philosophical implications of Ramsey's infinite proofs via peer-reviewed chapters and journal articles.

Anush Tserunyanمشاهده پروفایل

استاد

• Mathematics
• Ergodic Theory
• Combinatorics
• +۳ مورد دیگر

Anush Tserunyan is a Professor of Mathematics at McGill University, Canada, and a Visiting Professor at the Unit of Pure and Applied Mathematics (UMPA) at École normale supérieure de Lyon from December 1, 2024, to January 31, 2025. She holds a bachelor's and master's in computer science and applied mathematics from Yerevan State University (2005–2007) and a Ph.D. in Mathematics from UCLA (2013), focusing on finite generators for group actions, equivalence relations, and recursive program complexity. Research Interests: Anush Tserunyan specializes in Ergodic Theory , Combinatorics , and Group Actions , with notable contributions to graph theory, hypergraphs, and Ramsey theory. Her work bridges combinatorial structures with analytic methods, particularly in dynamical systems and descriptive set theory. Collaborations: During her visit to UMPA, she collaborates with teams in Geometry, Groups and Dynamics , and Number Theory , alongside researchers like Benjamin Schraen and Sophie Morel. Her stay includes seminars on GGD, Number Theory, and the 'Actions!' working group. Publications: Her research spans topics like ergodic theorems, disjoint matchings in graphs, and algebraic hypergraphs, reflecting a focus on foundational mathematical structures and their applications.