Robert West is an Associate Professor at EPFL (École polytechnique fédérale de Lausanne) in the School of Computer and Communication Sciences , leading the Data Science Lab (dlab) . His research focuses on Natural Language Processing , Machine Learning , and Computational Social Science , analyzing human-generated data from the web, social media, and online platforms. Education : PhD in Computer Science (2016) - Stanford University MSc in Computer Science (2010) - McGill University BSc in Computer Science (2007) - Technische Universität München Research Interests : West develops algorithms for analyzing large-scale web data, with emphasis on multilingual NLP , social network analysis , and AI ethics . His work bridges machine learning with social science to understand digital human behavior. Scientific Awards : ICWSM’22 Adamic–Glance Distinguished Young Researcher Award Google Faculty Research Award Facebook Research Award Multiple Outstanding Paper Awards at ICWSM and WWW Advising & Grants : He advises 12 PhD students and has secured funding from the Swiss National Science Foundation , Swiss Data Science Center , and industry partners. His lab maintains collaborations with Microsoft Research and CROSS . Labs & Collaborations : West leads the Data Science Lab at EPFL, which focuses on web-scale data analysis , privacy-preserving machine learning , and AI for social good . The lab develops tools like Wikispeedia and Quotebank for public data exploration.
Sean Cao serves as Associate Professor (with tenure) at the Robert H. Smith School of Business, University of Maryland, where he is Director and Co-founder of the AI Initiative for Capital Market Research. He also holds an affiliation as professor at Harvard Business School's D 3 Institute. His academic journey began with a Ph.D. from the University of Illinois at Urbana-Champaign. Dr. Cao's research focuses on the intersection of artificial intelligence and capital markets, with particular expertise in how machine learning transforms financial analysis, corporate disclosure practices, and investment decision-making. His work examines the evolving relationship between human analysts and AI systems, blockchain applications in financial reporting, and the strategic adaptation of corporate communications for machine readership. He has pioneered research on the "AI divide" among investor groups and developed frameworks for human-AI collaborative stock analysis. His publication portfolio spans top journals including Journal of Financial Economics, Review of Financial Studies, Journal of Accounting Research, and Management Science. The research demonstrates consistent thematic progression toward increasingly sophisticated AI applications in finance, with recent work exploring distributed ledger technologies for auditing, machine learning for extracting private information from disclosures, and the economics of greenwashing in ESG funds. His studies frequently combine textual analysis with traditional financial metrics to uncover novel market insights. Fama-DFA Prize from Journal of Financial Economics for best paper in capital markets and asset pricing Michael J. Brennan Award from Review of Financial Studies Deloitte Initiative for AI and Learning award for developing trustworthy AI for social equity PanAgora Asset Management's Dr. Richard A. Crowell Memorial Prize Multiple best paper awards from Midwest Finance Association, Global AI Finance Conference, and Asian Finance Association Dr. Cao has delivered over 200 invited research talks at major institutions including the Central Bank of Japan, Central Bank of Thailand, and U.S. Securities and Exchange Commission. He serves as Guest Associate Editor for Management Science and has co-chaired Review of Financial Studies conferences on FinTech and Machine Learning. His educational initiatives include a widely adopted free AI textbook for finance and accounting that has been implemented at universities worldwide including Indiana University, UT Dallas, and University of Minnesota. As Director of the AI Initiative for Capital Market Research, Dr. Cao leads a multidisciplinary team exploring practical AI applications in finance. The initiative has secured significant funding including a $150,000 grant from GRF CPAs & Advisors. His research group maintains strong industry connections through partnerships with regulatory bodies, financial institutions, and technology companies, facilitating the translation of academic research into practical financial applications.
Kamalika Chaudhuri is a Professor in the Department of Computer Science and Engineering at the University of California, San Diego (UCSD), and also serves as a Director and Research Scientist with the FAIR team at Meta AI. Her research focuses on the foundations of trustworthy machine learning, including robust machine learning, learning with privacy, and out-of-distribution generalization. Dr. Chaudhuri has earned her PhD from UC Berkeley in 2007 with a dissertation on "Learning Mixtures of Distributions." Her academic journey has led her to become a leading researcher in machine learning theory with a particular emphasis on privacy and robustness. Her research interests span machine learning foundations with a strong focus on trustworthy AI . She investigates problems at the intersection of differential privacy , adversarial robustness , and out-of-distribution generalization . Her work addresses critical challenges in developing machine learning systems that maintain privacy while preserving utility, resist adversarial attacks, and generalize effectively beyond training data distributions. She has pioneered approaches in privacy-preserving machine learning, robust learning theory, and methods for detecting and mitigating data memorization in models. An analysis of her recent publications (2024-2025) reveals a strong focus on the intersection of privacy, security, and machine learning. Her work spans differential privacy mechanisms, membership inference attacks, memorization detection, and fairness certification. She has been particularly active in developing methods for privacy-preserving foundation models, with several papers on differentially private computer vision and language models. Her research demonstrates a consistent thread of addressing fundamental challenges in trustworthy AI while developing practical solutions that balance privacy, accuracy, and utility. Best Award at the ICLR 2024 Workshop on Privacy Regulation and Protection in Machine Learning Distinguished Paper Award at IEEE Conference on Secure and Trustworthy Machine Learning (SaTML), 2024 Dr. Chaudhuri has advised numerous PhD students who have gone on to prominent positions at Google, DeepMind, Microsoft Research, and other leading AI institutions. Her group maintains an active research blog with guest posts from UCSD researchers. She has served in significant leadership roles including General Chair for ICML 2022 and Program Co-Chair for both ICML 2019 and AISTATS 2019, where she pioneered initiatives to improve reproducibility in machine learning research. Her research group at UCSD focuses on trustworthy machine learning, with current projects spanning privacy-preserving AI, robustness against adversarial attacks, and methods for ensuring reliable out-of-distribution generalization. The group collaborates closely with the FAIR team at Meta AI, where Dr. Chaudhuri serves as a Research Scientist.
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.
Nate Foster is a Professor of Computer Science at Cornell University and currently serves as the Associate Dean for Research in the Ann S. Bowers College of Computing and Information Science. He is also a Visiting Researcher at Jane Street and served as a Visiting Professor at École Polytechnique Fédérale de Lausanne during the 2023-24 academic year. His research uses ideas from programming languages to solve problems in networking, databases, and security. BA in Computer Science, Williams College (2001) MPhil in History and Philosophy of Science, University of Cambridge (2008, all work completed in 2003) PhD in Computer and Information Science, University of Pennsylvania (2009) Foster's research focuses on developing languages and tools that make it easy for programmers to build secure and reliable systems. His current work centers on the design and implementation of languages and tools for programmable networks, particularly using the P4 language. His past work includes bidirectional languages (also known as 'lenses'), database query languages, data provenance, type systems, mechanized proof, and formal semantics. His research group at Cornell has made significant contributions to network verification, software-defined networking, and formal foundations for programmable data planes. Analysis of Foster's recent publications reveals a strong focus on network verification and programming language foundations for networking. His work consistently applies formal methods to practical networking problems, with a particular emphasis on the NetKAT and P4 languages. Over the past five years, his research has evolved toward more complex network verification techniques, including infinite state verification, active learning of network models, and dependently-typed approaches to network programming. His work bridges theoretical computer science with practical networking systems, making formal methods accessible to network engineers. ACM Fellow (2025) ACM SIGPLAN Robin Milner Award (2023) ACM SIGCOMM Rising Star Award (2018) NSF CAREER Award (2013) Alfred P. Sloan Fellowship (2012) Multiple distinguished paper awards across top conferences including POPL, PLDI, and SIGCOMM Foster has advised numerous PhD and Master's students who have gone on to prominent positions in both industry and academia, with many continuing work in programming languages and networking. He has led multiple significant research grants including an NSF CAREER Award and has been involved in the P4 Language Consortium, serving as Chair of the P4 Language Governing Board. His work has been supported by various organizations including NSF, DARPA, and industry partners like Intel and Jane Street. Foster is also active in the programming languages research community, serving on numerous program committees and as Vice Chair of DARPA's Information Science and Technology (ISAT) study group. Foster leads a vibrant research group at Cornell focused on programming languages for networks, with collaborators from academia and industry. His group has developed several influential tools and frameworks including NetKAT, Petr4, and KATch. They maintain strong connections with the P4 community and work closely with industry partners to ensure their research has practical impact on real-world networking systems.
Ashley Montanaro is Professor of Quantum Computation in the School of Mathematics at the University of Bristol, and co-founder of the quantum software startup Phasecraft. He is a member of the Quantum Information Theory research group at Bristol. His research focuses on the theory of quantum computing, with particular interest in quantum algorithms, computational complexity, quantum query and communication complexity, and classical algorithms. His work spans both theoretical foundations and practical applications of quantum computing. Montanaro's research output shows significant trends toward quantum algorithms for optimization problems, quantum computational supremacy, and bridging theoretical advances with practical implementation challenges. His publications span foundational quantum information theory to applied quantum algorithms, demonstrating a versatile research program that connects computer science with quantum physics. Among his professional activities, Montanaro served on the QIP steering committee (2016-2018) and was an editor for the Quantum journal until 2019. He has been active in conference organization, serving on program committees for ITCS 2018, AQIS 2017 and 2015, QIP 2015, and TQC 2014 and 2013, reflecting his standing in the quantum computing research community. He has supervised numerous PhD students including Josh Blake, Jorja Kirk, Sheila Perez Garcia, Sami Boulebnane, Jan Lukas Bosse, Lana Mineh, Joao F. Doriguello, Chris Cade, Sam Pallister, and Stephen Piddock. His teaching includes Quantum Computation (MATHM0023) which he has taught since 2014 and Advanced Quantum Information Theory which he taught in 2015 and 2016. As co-founder of Phasecraft, Montanaro is actively translating theoretical quantum computing advances into practical software solutions, positioning him at the intersection of academic research and quantum technology commercialization.
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.
Tengyu Ma is an Assistant Professor of Computer Science at Stanford University. His research focuses on machine learning, deep learning, optimization, and theoretical computer science. He is particularly known for work on neural networks, reinforcement learning, and algorithmic guarantees in AI systems. His email is tengyuma@stanford.edu . Ma's research interests span foundational aspects of machine learning, including generalization theory, optimization algorithms, and the theoretical underpinnings of deep learning. He has contributed to areas such as self-play theorem provers, learning rate schedules, and robustness in low-light vision tasks. His work often bridges theoretical insights with practical algorithm design. His recent publications emphasize advancements in large language models (LLMs), theorem proving via self-play, and understanding training dynamics in deep networks. Despite prolific output, no specific scientific awards are explicitly mentioned in the provided texts. Ongoing work includes exploring in-context learning mechanisms, formal verification of AI systems, and efficient pretraining techniques. His research has implications for both theoretical understanding and real-world applications of AI.
Peter Selinger is a Professor in the Department of Mathematics and Statistics at Dalhousie University , with a cross-appointment in Computer Science. He specializes in mathematical methods in computer science, particularly quantum computing and combinatorial game theory . His work on quantum programming languages like Quipper and foundational research in category theory has garnered international recognition. Education : Ph.D. in Mathematics (University of Pennsylvania, 1997), undergraduate studies in Mathematics (Technische Universität Darmstadt). Research Interests span quantum computing, category theory, and combinatorial game theory. He has pioneered formalisms for quantum programming languages, developed categorical models for quantum mechanics, and analyzed game-theoretic structures in games like Hex. His recent work includes linear dependent type theory , quantum circuit synthesis , and combinatorial game classification . Publications demonstrate expertise in quantum programming languages, categorical semantics, and game theory. Key trends include Hamiltonian simulation , Clifford+T circuits , and monotone game realization . Scientific Honors include the Killam Professorship (2017–2022), Faculty of Science Award for Excellence in Teaching (2023), and fellowships from the Alfred P. Sloan Foundation and German National Scholarship Foundation . Students he has supervised include PhD graduates Xiaoning Bian , Francisco Rios , and Neil J. Ross , along with MSc students like Fahimeh Bayeh and Seth Greylyn . He has advised 16 postdoctoral researchers.
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.
Joydeep Biswas is an Associate Professor in the Computer Science Department at the University of Texas at Austin, where he serves as the Director of the Autonomous Mobile Robotics Laboratory (AMRL). He is also affiliated with Texas Robotics, the UT Machine Learning Laboratory, and UT Good Systems. Previously, he was an Assistant Professor in the College of Information and Computer Sciences at the University of Massachusetts Amherst. Dr. Biswas earned his PhD in Robotics from Carnegie Mellon University in 2014 and his B.Tech in Engineering Physics from the Indian Institute of Technology Bombay in 2008. His educational background has provided him with a strong foundation in both theoretical and applied aspects of robotics and artificial intelligence. Dr. Biswas's research focuses on enabling long-term autonomy for mobile robots operating in human environments. His work spans robot perception, motion planning, control systems, and AI, with the ultimate goal of creating self-sufficient autonomous mobile robots that can perform tasks accurately and robustly in real-world settings. He is particularly interested in perception, planning, and failure recovery for autonomous mobile robots, which supports his vision of having autonomous service mobile robots deployed at campus-to-city scale, both indoors and outdoors, performing assistive tasks over deployments spanning years. His IJCAI 2019 Early Career Spotlight talk summarizes much of his research to date and ongoing interests. His recent research has shown a strong trend toward social navigation, human-robot interaction, and the application of machine learning techniques to robotics problems. There's a clear progression from fundamental robotics research toward more complex, real-world applications that require robots to understand and navigate human social spaces effectively. His work increasingly integrates large language models and other advanced AI techniques with traditional robotics approaches, as evidenced by his recent publications on topics like preference-conditioned navigation, social navigation benchmarks, and instruction-following navigation systems. Dr. Biswas has received numerous prestigious awards including the NSF CAREER Award (2021), J.P. Morgan Faculty Research Award (2019), Amazon Research Award (2019), and a grant from Northrop Grumman Mission Systems (2018). These awards recognize his innovative contributions to the field of robotics and autonomous systems. As a dedicated educator and mentor, Dr. Biswas actively supervises PhD and master's students, with his PhD student Sadegh Rabiee winning the student poster award at the Northrop Grumman University Symposium 2019. He has secured significant grant funding from the National Science Foundation for projects including 'Introspective Perception and Planning for Long-Term Autonomy' and 'Interactive Synthesis and Repair For Robot Programs,' demonstrating his ability to secure competitive research funding and his commitment to advancing the field. Dr. Biswas leads the Autonomous Mobile Robotics Laboratory (AMRL), which serves as a hub for interdisciplinary research in mobile robotics. The lab has developed notable resources such as the UT Campus Object Dataset (CODA) for 3D perception research and SOCIALGYM, a framework for benchmarking social robot navigation. His team regularly deploys robots on the UT Austin campus and in urban environments to test and refine their approaches in realistic settings, bridging the gap between simulation and real-world application.
Amir Ali Ahmadi is a Professor at Princeton University's Department of Operations Research and Financial Engineering (ORFE), with affiliations across multiple disciplines including PACM, Computer Science, Mechanical & Aerospace Engineering, Electrical Engineering, and the Center for Statistics and Machine Learning. He serves as Director of Princeton's Optimization and Quantitative Decision Science Certificate Program and has taken temporary roles at Citadel GQS (2021-2022) and Google Brain (2020-2021). His research bridges optimization theory , dynamical systems , and control theory , focusing on scalable algorithms for complex problems in robotics, autonomous systems, and machine learning. He has pioneered DSOS/SDSOS relaxations as alternatives to traditional sum-of-squares methods, enabling faster solutions through linear/second-order cone programming. Recent publications explore: Higher-order Newton methods for socially responsible investment Data-efficient learning of dynamical systems Computational complexity of local minima Robust-to-dynamics optimization frameworks Award highlights include: 2024 Egon Balas Prize in Optimization 2024 Princeton Engineering Council Teaching Award 2023 Distinguished Teaching Award (Princeton SEAS) 2019 NSF CAREER Award 2017 DARPA Young Faculty Award 2017 Sloan Fellowship in Computer Science He advises prominent researchers like Georgina Hall (Tucker Prize finalist) and Bachir El Khadir (Goldstine Fellow), and leads the Princeton Optimization Seminar and MURI project on Control-Oriented Learning on the Fly.
Dr. Jean-Christophe Nave is an Associate Professor in the Department of Mathematics and Statistics at McGill University, specializing in applied mathematics, numerical analysis, and computational methods. His research focuses on numerical methods for partial differential equations, fluid mechanics, interface problems, and computer graphics. He holds a PhD from UCSB (2004) and has held academic positions at MIT and McGill since 2005. Currently, he serves on committees such as the Steering Committee of the Institut des Sciences Mathematiques and the CRM Applied Mathematics Lab. His educational background includes a PhD under Professors Xu-Dong Liu and Sanjoy Banerjee. Key research areas include level set methods, fluid-structure interaction, and invariant numerical methods. Notable works include the Correction Function Method for interface problems and the Characteristic Mapping Method for advection problems. Nave’s publications span topics like Poisson equations with discontinuous coefficients, fluid dynamics simulations, and high-order numerical schemes. He has advised numerous graduate and undergraduate students, contributing to their research in applied mathematics and computational science. His work bridges theoretical rigor and practical applications in engineering and physics. He teaches advanced courses such as Numerical Analysis I/II and Computational Methods in Applied Mathematics. His research group collaborates on projects involving fluid dynamics, elasticity, and geometric algorithms, with a focus on developing robust numerical tools for complex systems.
Sanjit A. Seshia is the Cadence Founders Chair Professor in the Department of Electrical Engineering and Computer Sciences at the University of California, Berkeley . He is affiliated with the Group in Logic and the Methodology of Science and participates in centers like the Industrial Cyber-Physical Systems Center , Berkeley AI Research , and the Simons Institute for the Theory of Computing . Research interests include formal methods for automated verification and synthesis of dependable systems, with applications to cyber-physical systems , AI-based autonomy , and computer security . His work spans SMT solving, model counting, syntax-guided synthesis, and algorithmic improvisation, with tools like UCLID5 , VerifAI , and Scenic for verifying autonomous systems and educational platforms like CPSGrader . Students and collaborators include notable researchers such as Dorsa Sadigh (Stanford), Daniel Fremont (UC Santa Cruz), and Hazem Torfah (Chalmers). He has co-founded startups like Decyphir and 20ⁿ Labs based on his research.
Prof. Dr. Barbara Kraus is the Chair of Quantum Algorithms and Applications at the Technical University of Munich (TUM), affiliated with the TUM School of Natural Sciences. She previously held academic positions at the University of Innsbruck, where she founded her research group in 2010. Education : Physics and Mathematics at the University of Innsbruck; Post-doctoral work at MPI for Quantum Optics and University of Geneva. Her research focuses on foundational problems in quantum information theory, particularly entanglement in multipartite systems, quantum simulation, and verification of quantum processors. She develops theoretical tools for quantum many-body systems and explores applications in quantum computing, emphasizing error characterization and experimental validation. Recent publications highlight advancements in Hamiltonian learning, symmetry-resolved entanglement detection, and multipartite state transformations. Her work bridges theoretical quantum physics with practical implementations, including Rydberg platforms and quantum metrology. Key Awards : START Prize (2010), Ignaz L. Lieben Award (2013), Boltzmann Prize (2011), Südtiroler Sparkasse Research Prize (2019). She supervises doctoral students and postdocs in quantum information theory, with a focus on stabilizer states, quantum networks, and entanglement measures. Her courses at TUM include Quantum Information , Quantum Algorithms , and workshops on entanglement manipulation.
