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

Paul Gölzمشاهده پروفایل

استادیار

• Social Choice Theory
• Algorithmic Fairness
• AI Ethics
• +۳ مورد دیگر

Paul Gölz is an Assistant Professor at Cornell University's School of Operations Research and Information Engineering (ORIE), with affiliations in Computer Science. His research focuses on computational social choice, algorithmic fairness, and AI ethics, addressing topics like democratic innovation, fair resource allocation, and AI systems for diverse users. Education: Undergraduate studies at Saarland University (Germany), PhD in Computer Science from Carnegie Mellon University, followed by postdoctoral research at Harvard University, UC Berkeley, and the Simons Laufer Mathematical Sciences Institute. His work has been recognized with awards including the JPMorgan Chase AI Research Fellowship (2021) and honorable mentions for prestigious dissertation awards (Dantzig and ACM SIGecom). Research Highlights : Developed Panelot, a tool for selecting citizens' assemblies using state-of-the-art algorithms. His work on fair refugee resettlement and apportionment methods has been featured in Operations Research and Nature . Recent projects include AI alignment distortion analysis and generative social choice mechanisms. Teaching : Teaches Optimized Democracy (Spring 2025) and Mathematical Programming (Fall 2024). Supervises PhD students in ORIE, focusing on interdisciplinary applications of optimization and social choice. Awards & Grants : Received a $40K Structural Democracy Fellowship (Crankstart) and an OpenAI grant for Democratic Inputs to AI. Active in policy briefs (e.g., mini-public selection strategies). Labs/Tools : Co-developed Panelot.org , a nonprofit platform for fair citizen assembly selection. Active in open-source tool development for social choice applications.

Raman Aroraمشاهده پروفایل

دانشیار

• Machine Learning
• Statistical Signal Processing
• Stochastic Approximation Algorithms
• +۱۶ مورد دیگر

Raman Arora is an Associate Professor in the Department of Computer Science at Johns Hopkins University, with affiliations to the Mathematical Institute for Data Science (MINDS), the Center for Language and Speech Processing (CLSP), and the Institute for Data-Intensive Engineering and Science (IDIES). His research spans theoretical and practical aspects of machine learning, focusing on robustness, privacy, representation learning, and optimization. Research Interests: Machine Learning Theory Representation Learning (e.g., Deep CCA, Multi-view Learning) Privacy-Preserving Machine Learning (Differential Privacy) Robustness in Deep Learning Online and Reinforcement Learning Stochastic Optimization Algorithms His recent publications, primarily in top-tier venues like NeurIPS, ICML, and ICLR, demonstrate a strong focus on the theoretical foundations of adversarial robustness, multi-task learning, offline reinforcement learning, and differentially private optimization. His work often bridges theory and practice, with applications in speech, language, and data-intensive systems. Scientific Awards and Honors: NSF CAREER Award (2020) ICML Test-of-Time Award Finalist (2023) for Deep CCA Member, Institute for Advanced Study (2019–2020) Visiting Scientist, Simons Institute (2019, 2020, 2022) Advising and Grants: Raman Arora has advised numerous PhD and master’s students, many of whom are now researchers at leading tech companies like Google, Meta, and Microsoft. His research is supported by significant grants from the NSF (including CAREER, BIGDATA, TRIPODS, and CRCNS awards), DARPA, and other agencies, focusing on foundational aspects of machine learning such as inductive biases, privacy, robustness, and computational neuroscience. Laboratory and Research Group: He leads a dynamic research group at Johns Hopkins, comprising current PhD students and postdoctoral researchers working on the intersection of theory and applications in machine learning. The group is actively involved in projects related to adversarial robustness, meta-learning, offline reinforcement learning, and private optimization.

Clifford Steinمشاهده پروفایل

استاد

• Algorithms
• Combinatorial Optimization
• Operations Research
• +۴ مورد دیگر

Clifford Stein is a Professor of Industrial Engineering and Operations Research (IEOR) and Computer Science at Columbia University, and Associate Director for Research at the Data Science Institute. He holds a Ph.D. (1992), M.S. (1989), and B.S.E. (1987) from MIT and Princeton University, respectively. His research focuses on algorithms, combinatorial optimization, operations research, scheduling, and computational biology. A co-author of the best-selling textbook Introduction to Algorithms , Stein has published widely in top venues and holds prestigious awards like ACM Fellow and NSF Career Award. His work includes foundational contributions to minimum cut algorithms, scheduling theory, and network optimization, supported by NSF and Sloan Foundation grants. Stein has advised over 40 graduate and undergraduate students, many now in academia and industry.

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.

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

استاد

• Algorithmic Game Theory
• Computational Complexity Theory
• Machine Learning
• +۳ مورد دیگر

Paul Goldberg is a Professor of Computer Science and Director of the MSc in Mathematics and Foundations of Computer Science (MFoCS) at the University of Oxford. He holds a BA in Mathematics from Oxford University and a PhD in Computer Science from the University of Edinburgh. His research focuses on algorithmic game theory, computational complexity, and machine learning, with notable contributions to equilibrium computation, complexity classes of total search problems, and decentralized systems. Affiliations: Department of Computer Science, Oxford; Editorial Board of ACM Transactions on Economics and Computation. Education: PhD in Computer Science (1993), University of Edinburgh MSc in Computer Systems Engineering (1989), University of Edinburgh and Université Paris-Sud BA in Mathematics (1988), Oxford University Research Interests: Algorithmic game theory, computational complexity (especially total search problems like CLS and PPAD), decentralized computation of equilibria, and applications in machine learning and AI. His work bridges theoretical computer science and economics, with a focus on algorithm design and complexity analysis. Publications and Awards: Over 120 papers, including influential work on Nash equilibrium complexity (2009), gradient descent (2023), and fair division algorithms. Notable awards include the ACM SIGecom Test of Time Award (2022) and a SIAM Outstanding Paper Prize (2011). Grants and Students: Leads EPSRC-funded projects on game theory and machine learning. Supervised 11 PhD graduates and currently advises Giannis Tyrovolas and others. Active in mentoring MSc and undergraduate projects. Labs/Teams: Part of the Algorithms and Complexity Theory group at Oxford, contributing to research on optimization, equilibrium dynamics, and fair division.

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

استاد

• Psychometrics
• Computational Social Science
• Big Data Analytics
• +۳ مورد دیگر

David Stillwell serves as Professor of Computational Social Science at Cambridge Judge Business School and Academic Director of The Psychometrics Centre, University of Cambridge. His research leverages big data to understand human psychology and behavior, with significant contributions in personality prediction from digital footprints and personalized advertising applications. His educational background includes: BSc in Psychology from the University of Nottingham (2007) MSc in Research Methods from the University of Nottingham (2008) PhD in Decision Making from the University of Nottingham (2012) Dr. Stillwell's research centers on computational social science and psychometrics, pioneering the myPersonality Facebook application that collected data from over 6 million users. His work demonstrates computers can predict personality as accurately as spouses, reveals psychological targeting's advertising effectiveness, and establishes links between personality-matched spending and life satisfaction. He also explores linguistic honesty markers through profanity analysis and personality-based dating patterns. His recent publications (2019-2025) reveal a strong trajectory toward AI evaluation using psychometric frameworks, particularly in medical and general-purpose AI assessment. Key themes include fairness metrics in language models, crisis emotional responses through social media, and computational personality recognition - demonstrating consistent innovation at the psychology-technology intersection. He has received significant recognition: Top 10 most influential papers of 2013 by Altmetric Nieman Journalism Lab highlight of 2013 Named in 'top 30 thinkers under 30' by Pacific Standard Magazine Dr. Stillwell maintains active industry engagement through consultancy with Barclays, Hilton, and Ubisoft on projects spanning computer-adaptive testing systems to interactive experiences like Predictive World for Watch Dogs 2. His policy impact is substantial, with citations by the European Data Protection Supervisor, World Bank, and multiple national governments, leading to speaking engagements at the European Parliament and Bank of England. As Academic Director of The Psychometrics Centre, he leads a global hub for advancing psychological assessment through innovative methods including Concerto open-source software, collaborating with organizations ranging from the European Commission to major corporations on psychometric applications in people analytics and digital behavior.

Noah D. Goodmanمشاهده پروفایل

دانشیار

• Computational models of cognition
• Probabilistic programming languages
• Natural language semantics and pragmatics
• +۶ مورد دیگر

Noah D. Goodman is Associate Professor of Psychology and Computer Science, and Linguistics (by courtesy) at Stanford University. He directs the Computation & Cognition Lab (CoCoLab) at Stanford, where he leads research on computational models of cognition, integrating logic and probability. His work spans cognitive psychology, linguistics, and computer science. Primary Appointment: Psychology Department By Courtesy: Computer Science Department and Linguistics Department Director: Computation & Cognition Lab (CoCoLab) Goodman's research focuses on computational models of cognition, with particular interest in probabilistic approaches to understanding human thought. His work integrates logic and probability to model concepts, categorization, intuitive theories, causal learning and reasoning, social cognition (including reasoning about others' goals, beliefs, and actions), cognitive development (especially acquisition of abstract knowledge), and natural language semantics and pragmatics. He has made significant contributions to the development of probabilistic programming languages as tools for cognitive modeling. His recent publications demonstrate a strong trend toward integrating probabilistic modeling with linguistic theory and social cognition. The articles span computational cognitive science, natural language processing, and artificial intelligence, with a consistent theme of using probabilistic frameworks to understand complex cognitive phenomena. Many papers explore how humans make inferences under uncertainty across different domains. Goodman teaches several courses at Stanford including Language and Thought (Psych 132), Computation and Cognition: the Probabilistic Approach (Psych 204/CS 428), Foundations of Cognition (Psych 205), and Introduction to Cognitive Science. He has also led seminars on topics ranging from natural and artificial intelligence to the science of meditation.

Nina Balcanمشاهده پروفایل

استاد

• Machine Learning
• Artificial Intelligence
• Theoretical Computer Science
• +۱۲ مورد دیگر

Nina Balcan is a Professor at Carnegie Mellon University and holds the Cadence Design Systems Professorship in Computer Science. She is affiliated with the School of Computer Science, specifically the Machine Learning Department (MLD) and Computer Science Department (CSD). Her research spans foundational aspects of machine learning, artificial intelligence, theoretical computer science, algorithmic game theory, and interdisciplinary connections in learning theory. Machine Learning Artificial Intelligence Theoretical Computer Science Algorithmic Game Theory Multi-Agent Systems Data-Driven Algorithm Design Her recent work focuses on advancing algorithm design through machine learning, robustness in adversarial environments, and economic modeling. Key contributions include Learning to Branch (JACM 2024), Regret Minimization in Stackelberg Games (NeurIPS 2024), and Learning Accurate Decision Trees (UAI 2024, Outstanding Student Paper Award). She has pioneered novel approaches to data-driven optimization, semi-supervised learning, and privacy-preserving clustering. Nina has received prestigious accolades including ACM Fellow AAAI Fellow Simons Investigator 2019 ACM Grace Murray Hopper Award Her teaching at CMU includes graduate courses on machine learning, advanced machine learning, and specialized topics like algorithmic game theory.

Henrik Sandbergمشاهده پروفایل

استاد

• Cyber-Physical Systems Security
• Power Systems
• Model Reduction
• +۶ مورد دیگر

Henrik Sandberg is a Professor at the Division of Decision and Control Systems , KTH Royal Institute of Technology , Stockholm, Sweden. He holds the title of Deputy Head of Division and is affiliated with the School of Electrical Engineering and Computer Science . Education: MSc in Engineering Physics (1999) PhD in Automatic Control (2004) from Lund University Postdoctoral position at Caltech (pre-2007) Research Interests: Focus on cyber-physical systems security , power systems , model reduction , and fundamental limitations of control systems . Key sub-areas include attack detection , networked control , privacy-preserving estimation , and resilient control architectures . Publications: Over 150 papers across IEEE Transactions and Automatica , covering topics like stealthy attacks , distributed control , LQG optimization , and thermodynamic costs in filtering . Recent work includes LWE-based encrypted control and Bayesian deception mechanisms . Scientific Awards: Best Student Paper Award Finalist at IEEE CASE 2014; Best Student-Paper Award at IEEE CDC 2004. Grants & Projects: Leads the DYNACON project (WASP Cybersec cluster) and collaborates on CERCES (critical infrastructure resilience). Serves as examiner for multiple advanced courses in cybersecurity and control systems. Contact: Email: hsan@kth.se Phone: +46 (0)8 790 7294 Room: A:607, Malvinas Väg 10, Stockholm

• Machine Learning
• Artificial Intelligence
• Algorithms
• +۳ مورد دیگر

Zaid Harchaoui is an Adjunct Professor in the Department of Statistics at the University of Washington. His research focuses on machine learning, generative AI, and algorithmic optimization, with applications spanning ecology, neuroscience, and artificial intelligence. He explores learning under distributional shifts and develops tools for scalable generative models in language and vision domains. University: University of Washington Department: Statistics Research Focus: Learning from data with computational, inferential, and mathematical rigor; distributional shift adaptation; generative model scaling Email: zaid@uw.edu His recent work emphasizes generative AI applications in ecology and neuroscience, stochastic optimization for robustness, and algorithmic efficiency in large-scale learning. Key contributions include techniques for distributionally robust optimization, interpretable authorship obfuscation, and uncertainty quantification in behavior classification. Scientific awards and honors are not explicitly mentioned in the provided text. Collaborative efforts often intersect with nonlinear control algorithms, spectral analysis, and privacy-preserving machine learning frameworks.

Daniel Cooneyمشاهده پروفایل

استادیار

• Mathematical Biology
• Applied Dynamical Systems
• Differential Equations
• +۴ مورد دیگر

Daniel Cooney is an Assistant Professor in the Department of Mathematics at the University of Illinois Urbana-Champaign. He holds additional affiliations as an Affiliate at the Carl R. Woese Institute for Genomic Biology. His research focuses on applying partial differential equations (PDEs), dynamical systems, and stochastic processes to study evolutionary dynamics, particularly in biological and social systems. Key themes include multilevel selection, evolutionary game theory, and the emergence of cooperative behavior. Cooney earned his PhD in Applied and Computational Mathematics from Princeton University, advised by Simon Levin, and completed a postdoc as a Simons Fellow in Mathematical Biology at the University of Pennsylvania. His work bridges theoretical mathematics with applications in ecology, epidemiology, and social sciences. Recent publications explore topics like altruistic punishment in cultural systems, classroom-turnover dynamics, and protocell evolution. He actively participates in academic outreach, co-organizing conferences such as the AMS Special Session on Mathematics of Infectious Disease and the SIAM Minisymposium on Social-Ecological Systems. His research has been published in high-impact journals including *Proceedings of the National Academy of Sciences* and *Bulletin of Mathematical Biology*.

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

استاد

• Security
• Privacy
• Privacy-Enhancing Technologies (PETs)
• +۵ مورد دیگر

Ian Goldberg is a Professor at the Cheriton School of Computer Science , University of Waterloo, Canada. He holds the Canada Research Chair in Privacy Enhancing Technologies and leads the Cryptography, Security, and Privacy (CrySP) group . He is affiliated with the Cybersecurity and Privacy Institute and the Institute for Quantum Computing . Research Focus: Security, privacy, and privacy-enhancing technologies (PETs) for the Internet, including Off-the-Record (OTR) Messaging , censorship resistance , private information retrieval , and zero-knowledge proofs . Recent Publications: His work addresses metadata protection , deniable authentication , and secure multi-party computation , with applications to anonymous communication and censorship resistance. Scientific Awards: Canada Research Chair in Privacy Enhancing Technologies Students: He advises current and former PhD/Master’s students in projects like Lox , PRSONA , Walkie-Talkie , and SkypeMorph . Notable advisees include Sajin Sasy (Privacy-Preserving Communications), Justin Tracey (PETs Development), and Tao Wang (Website Fingerprinting Defenses). Labs & Teams: Goldberg is a core member of the CrySP group and contributes to the Tor Project and Off-the-Record Messaging open-source initiatives. His research bridges theoretical and applied cryptography, with deployments in real-world systems like Tor and PIR protocols.

• Stochastic programming
• Two-phase and multi-phase models
• Scenario generation and reduction
• +۹ مورد دیگر

Trine Krogh Boomsma is a Professor in the Department of Insurance and Economics at the University of Copenhagen's Department of Mathematical Sciences. Her research focuses on optimization under uncertainty with significant applications in energy systems, particularly electricity markets, renewable energy investments, and power system planning. PhD in Mathematics-Economics, Aarhus University (2003-2007) Visiting PhD at University of Duisburg-Essen (2004) Academic career includes positions at Risø National Laboratory for Renewable Energy and Imperial College London Her work spans stochastic programming, real options analysis, and dynamic programming to address energy sector challenges. Key areas include support schemes for renewables, market risk modeling, and operational optimization of hybrid conventional-renewable systems. Recent research explores policy impacts on investment decisions and advanced scenario generation techniques. Major publications (2012-2020) cover renewable energy policy frameworks, power plant valuation models, and sequential market bidding strategies. These works emphasize electricity market dynamics, investment risk quantification, and robust planning under uncertainty. She teaches linear programming, integer programming, and stochastic programming applications in operational analysis, contributing to energy economics education at the department.

Antonio Rangelمشاهده پروفایل

استاد

• Neuroeconomics
• Decision Neuroscience
• Behavioral Economics
• +۴ مورد دیگر

Antonio Rangel is the Bing Professor of Neuroscience, Behavioral Biology, and Economics at the California Institute of Technology (Caltech), where he also serves as Head Faculty in Residence. He is a faculty member in the Division of Humanities and Social Sciences (HSS) with research focusing on the computational and neurobiological basis of value-based decision-making. Dr. Rangel received his educational training at prestigious institutions: B.Sc. from Caltech in 1993 M.S. from Harvard University in 1996 Ph.D. in 1998 Professor Rangel's research lies at the intersection of neuroscience, economics, and psychology, with a focus on understanding how the brain makes decisions. His work investigates the neural mechanisms underlying value computation, choice processes, self-control, and social decision-making. Using a multidisciplinary approach that combines functional magnetic resonance imaging (fMRI), eye-tracking, computational modeling, and behavioral experiments, his lab has made significant contributions to the field of neuroeconomics. His research has revealed how value signals are represented in the brain, how attention influences choice, and the neural basis of self-control failures. Professor Rangel has pioneered methods for studying decision processes with high temporal resolution using eye-tracking data, demonstrating how fixation patterns relate to value computations and choice outcomes. His work spans from theoretical frameworks of value-based decision-making to practical applications in behavioral public economics. Professor Rangel's work has been recognized with prestigious awards: 2019 NOMIS Distinguished Scientist Award 2018 Fellow of the Association for Psychological Science As an academic leader, Professor Rangel has mentored numerous students and researchers who have gone on to make their own contributions to neuroscience and economics. His lab, the Rangel Neuroeconomics Laboratory at Caltech, serves as a hub for interdisciplinary research, bringing together students and scholars from neuroscience, economics, psychology, and computer science. The lab has received significant funding to support its research on the neural basis of decision-making, including support from the NOMIS Foundation. The Rangel Neuroeconomics Laboratory is equipped with state-of-the-art facilities including fMRI analysis capabilities, eye-tracking systems, and computational resources for modeling decision processes. The lab fosters a collaborative environment where researchers apply methods from experimental economics and cognitive neuroscience to unravel the complexities of human decision-making.