Andrea Vedaldi is a Professor of Computer Vision and Machine Learning at the University of Oxford's Department of Engineering Science, affiliated with the Visual Geometry Group (VGG). He specializes in unsupervised methods for understanding images and videos, focusing on 3D geometry and semantics. His research bridges foundational AI and practical applications, with contributions to generative models, neural fields, and self-supervised learning. Education: PhD in Computer Science (2008), University of California, Los Angeles MSc in Computer Science (2005), UCLA BSc in Information Engineering (2003), University of Padua Research Interests: Unsupervised learning, 3D perception, generative AI, neural rendering, and scalable vision systems. His work emphasizes ethical, responsible AI aligned with ERC-funded projects like UNION (ERC Consolidator Grant). Key Contributions: Co-developer of VLFeat and MatConvNet libraries Leader in 3D reconstruction and diffusion models (e.g., CatFree3D) Recipient of the PAMI Thomas S. Huang Prize and multiple best paper awards Grants & Service: Principal Investigator on £2.3M ERC Consolidator Grant (UNION) Co-organizer of major conferences (ECCV 2020 Program Chair, CVPR 2023 Area Chair) Reviewer for top journals/conferences (PAMI, CVPR, NeurIPS) Labs & Teams: VGG Group at Oxford, collaborating on projects like Meta 3D Gen and Common Objects in 3D (CO3D).
Ricky Ini Liu is an Associate Professor in the Department of Mathematics at the University of Washington. Previously, he held positions at North Carolina State University, the University of Michigan, and the University of Minnesota. He earned his Ph.D. in Mathematics from MIT in 2010 under Alexander Postnikov. His research focuses on algebraic combinatorics, particularly its intersections with algebraic geometry, combinatorial geometry, and representation theory. Key interests include Schubert polynomials, polytopes, Hopf algebras, and Kronecker coefficients. He has contributed to foundational work on birational rowmotion, Gelfand-Tsetlin polytopes, and Fomin-Kirillov algebras. Liu has taught a wide range of courses at UW, including special topics in dynamical algebraic combinatorics, combinatorial theory, and problem-solving. He has also been a key instructor at the Mathematical Olympiad Summer Program since 2007 and mentored undergraduates in research programs at the University of Minnesota, Duluth. His publications span high-impact journals like Selecta Mathematica and Journal of Combinatorial Theory , with recent work addressing topics such as determinantal formulas for Schubert polynomials and applications of flow polytopes to diagonal harmonics. Though no specific awards are listed, his extensive publication record and academic roles reflect significant contributions to combinatorial mathematics.
Luca Carlone is the Boeing Career Development Associate Professor in the Department of Aeronautics and Astronautics at MIT and a Principal Investigator at the Laboratory for Information & Decision Systems (LIDS) . He leads the SPARK Lab , focusing on developing certifiable perception algorithms for autonomous systems. PhD in Mechatronics (Polytechnic University of Turin, 2012) Research spans robotics, computer vision, and optimization Research Interests : Certifiable Perception algorithms for high-integrity systems High-level Perception (geometric, semantic, physical understanding) Efficient Perception methods for resource-constrained robots Scientific Contributions include: 2024 Outstanding Systems Paper Award (RSS) 2023 IEEE Transactions on Robotics King-Sun Fu Award 2021 NSF CAREER Award 2020 AIAA Advising Award 2019 Amazon Research Award Advising : Teaches graduate courses like Visual Navigation for Autonomous Vehicles and Robotics: Science and Systems . Collaborates with institutions including JPL, Caltech, and KAIST through the DARPA SubT Challenge.
Aarti Singh is a Professor in the Machine Learning Department at Carnegie Mellon University and Director of the NSF AI Institute for Societal Decision Making. She leads research at the intersection of machine learning, statistics, and decision making, with applications to scientific and societal domains. Her work focuses on designing principled interactive algorithms for learning and decision making under uncertainty. Education: Ph.D. in Electrical Engineering, University of Wisconsin-Madison (2008) M.S. in Electrical Engineering, University of Wisconsin-Madison (2003) B.E. in Electronics and Communication Engineering, University of Delhi (2001) Research Interests: Professor Singh's research centers on developing interactive machine learning algorithms that go beyond finding input-output associations to make higher-level decisions about the most informative data and actions. Her work spans autonomous decision making, including active sampling, stochastic optimization, bandits, and reinforcement learning that are statistically optimal, computationally tractable, and robust. She also investigates human factors in decision making, designing algorithms that model and leverage human feedback while accounting for bias, memory effects, and calibration. Her research has applications in material science, cosmology, and peer review systems. Research Trends: Professor Singh's recent publications demonstrate a strong focus on reinforcement learning, particularly in developing more efficient and robust algorithms for decision making under uncertainty. Her work bridges theoretical foundations with practical applications, spanning from fundamental algorithm development to real-world implementation in scientific domains. There's a clear trajectory toward integrating human factors into decision-making algorithms, with significant contributions to peer review systems and preference learning. Scientific Awards: NSF Career Award United States Air Force Young Investigator Award A. Nico Habermann Faculty Chair Award Harold A. Peterson Best Dissertation Award Multiple paper awards Advising and Grants: Professor Singh has advised numerous PhD and master's students, many of whom have gone on to faculty positions or research roles at leading institutions. Her research is supported by prestigious grants from ONR, Simons Foundation, AFRL, ARL, and NSF. She serves as General Chair (2025) and Program Chair (2020) for the International Conference on Machine Learning (ICML) and has held leadership roles in multiple professional organizations. Research Team: Professor Singh leads a vibrant research group within the Machine Learning Department at CMU, with current PhD students working on topics including reinforcement learning, human-AI collaboration, and decision making under uncertainty. She also directs the NSF AI Institute for Societal Decision Making, which brings together researchers from multiple disciplines to develop AI systems that support human decision making in societal contexts.
Liza Rebrova is an Assistant Professor in the Department of Operations Research and Financial Engineering (ORFE) at Princeton University's School of Engineering and Applied Science. She is also an associated faculty member of the Program in Applied and Computational Mathematics (PACM) and the Center for Statistics and Machine Learning (CSML). Her research focuses on randomized numerical linear algebra and the mathematics of data science, with connections to high-dimensional probability and stochastic optimization. She develops mathematically justified randomized algorithms for large-scale data, particularly interested in settings where data exhibits mathematical structure such as spectral decay, multi-modality, or non-negativity. Her work addresses challenges in data compression, recovery, and optimization under structured noise conditions. Dr. Rebrova's recent publications show a strong trend toward developing robust algorithms for linear systems, tensor data compression, and nonnegative matrix factorization. Her work bridges theoretical foundations with practical applications in machine learning and data science, with emphasis on memory efficiency and handling corrupted or incomplete data. NSF DMS-2309685 (Single PI, 2024-2026): "Outliers are not what they seem: data-aware, flexible, and robust randomized iterative methods" NSF DMS-2108479 (Collaborative, 2022-2024): "Fast, Low-Memory Embeddings for Tensor Data with Applications" (co-PIs Mark Iwen and Deanna Needell) She currently advises three PhD students (Jackie Lok, Shambhavi Suryanarayanan, and Sofiia Shvaiko) and has previously advised Abraar Chaudhry (PhD 2024) and Nicolo Grometto (Masters thesis 2023). At Princeton, she teaches graduate courses including ORF526 (Graduate Probability), ORF387 (Networks), and ORF523 (Convex and Conic Optimization).
Sicun Gao is an Associate Professor in the Computer Science and Engineering department at the University of California, San Diego. His research focuses on practical algorithms for NP-hard search and optimization problems in computational systems, emphasizing combinatorial perspectives in numerical and statistical contexts to achieve reliable autonomy. Research Interests: Automated reasoning, Hamilton-Jacobi reachability, safe reinforcement learning, control barrier functions, and optimization in cyber-physical systems. Teaching: Courses on AI search, optimization, and graduate research seminars. The 15 most recent publications highlight advancements in safe AI control, motion planning, and policy optimization, often integrating neural networks with formal verification. Awards include the IEEE Power & Energy Society Technical Committee Prize Paper Award and the IROS RoboCup Best Paper Award. He advises PhD students working on AI-driven control and robotics, with alumni placed at institutions like Seoul National University, Amazon, and Apple. Grants include NSF Career, Air Force Young Investigator, and DARPA Assured Autonomy funding. His lab develops tools like dReal for automated reasoning in nonlinear theories over the reals.
Minseok Ryu is an Assistant Professor at the School of Computing and Augmented Intelligence, Arizona State University (ASU). He holds a Ph.D. in Industrial & Operations Engineering from the University of Michigan (2020). Prior to ASU, he was a postdoctoral appointee at Argonne National Laboratory’s Mathematics and Computer Science Division. His research focuses on optimization methodologies for decentralized and stochastic decision-making distributed algorithms for machine learning and operations research applications in healthcare systems and energy grids Teaching responsibilities include courses on applied deterministic operations research (IEE 574), optimization (IEE 622), and research practicums (IEE 792). His work emphasizes computational challenges in decision-making under uncertainty, with recent projects addressing nurse staffing optimization, federated learning frameworks (e.g., APPFL/APPFLX), and resilient power grid systems. He has no recorded academic awards but actively contributes to open-source software and cross-disciplinary research collaborations. Research interests bridge theory and practice, targeting social goods through optimization techniques like distributionally robust optimization, federated learning, and heuristic algorithms for energy and healthcare systems.
Ram Vasudevan is an Associate Professor and Associate Chair of Graduate Studies in the Department of Robotics at the University of Michigan. His research focuses on developing tools for safe and robust deployment of robotic systems, emphasizing optimization, nonlinear control, and real-world applications. Key areas include legged robot locomotion, shared control systems, and safety-critical autonomous systems. Research Interests: Optimization and control of nonlinear systems, locomotion of legged robots, shared control active safety systems, and automation of diagnostic/rehabilitative tasks. His ROAHM Lab prioritizes mathematical guarantees for robotic performance, with applications in medical robotics, autonomous vehicles, and soft robotics. Recent work emphasizes trajectory optimization, sensor fusion, and safety-aware control strategies. He has contributed to benchmarks for autonomous vehicle perception and novel methods in thermal image restoration using neural radiance fields. Awards: None explicitly listed in provided text. Labs/Teams: Directs the ROAHM Lab, collaborating on projects like robotic tail mechanics, real-time motion planning, and sensor data analysis. Active in academic conferences including RSS and ICRA.
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 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.
J. Andrew Bagnell is a Professor at the Robotics Institute of Carnegie Mellon University (CMU). His research bridges planning, control theory, and computational learning, focusing on systems that can self-optimize under partial models. Key projects include the LAIRLab (Learning Applied to Intelligent Robotics) and initiatives in the ARM-S and BIRD MURI programs. Research domains: Machine Learning, Robotics, Control Theory, Optimization, Probabilistic Modeling Key applications: Mobile Robotics, Intelligent Transportation Systems, Multi-Robot Decision Making Recent work emphasizes imitation learning, trajectory optimization, and game-theoretic algorithms for decision-making. His publications highlight collaborations with students and researchers on topics like online learning, planning under uncertainty, and autonomous systems. Notable affiliations include advising Gokul Swamy and past students such as Wen Sun and Anirudh Vemula. Labs: LAIRLab, ARM-S, BIRD MURI team.
Daniel M. Roy is a Full Professor at the University of Toronto, with cross-appointments in the Department of Computer Science, Department of Statistical Sciences, and Department of Electrical and Computer Engineering. He serves as Research Director at the Vector Institute and holds the CIFAR Canada AI Chair. Research Focus: Foundational principles of prediction, inference, and decision-making under uncertainty across machine learning, statistics, mathematical logic, applied probability, and computer science. Scientific Contributions: Key work in learning theory, statistical network analysis, probabilistic programming, and information-theoretic frameworks for generalization. Awards: ICML 2024 Best Paper Award for "Information Complexity of Stochastic Convex Optimization" and promotion to Full Professor in 2024. Student Advising: Actively mentors Ph.D. candidates and postdoctoral researchers with strong quantitative backgrounds, particularly at the intersection of machine learning, statistics, and computer science. Email: daniel.roy@utoronto.ca
Aditya Guntuboyina is an Associate Professor in the Department of Statistics at the University of California, Berkeley. He has held this position since January 2012, following a postdoctoral stint at the Wharton Statistics Department and a PhD in Statistics from Yale University (2011) under Professor David Pollard. He earned his B.Stat and M.Stat degrees from the Indian Statistical Institute, Kolkata. PhD: Statistics, Yale University (2011) B.Stat/M.Stat: Indian Statistical Institute, Kolkata His research focuses on nonparametric and high-dimensional statistics , particularly shape-constrained estimation and Bayesian/Empirical Bayes methods . Key themes include convex regression, isotonic regression, mixture models, and total variation denoising. Recent publications analyze multivariate scale mixtures, convergence rates, and suboptimality of least squares in constrained settings. Aditya has supervised multiple PhD students in the Berkeley Statistics and EECS programs. He teaches courses such as Time Series Analysis (Stat 153/248), Data, Inference, and Decisions (Data 102), and advanced probability (Stat 201A). His work often intersects with machine learning, optimization, and information theory. Scientific contributions include theoretical advances in shape-restricted regression, adaptation in log-concave density estimation, and risk bounds for convex-constrained models. He has published in top journals like Annals of Statistics , Journal of the Royal Statistical Society: Series B , and IEEE Transactions on Information Theory .
Jeffrey F. Brock is the Dean of the School of Engineering & Applied Science and the William S. Massey Professor of Mathematics at Yale University. He holds the Zhao and Ji Chair in Mathematics. His research focuses on low-dimensional geometry and topology, particularly hyperbolic geometry and its applications to data analysis. He completed his undergraduate studies at Yale and earned his Ph.D. from UC Berkeley. He held positions at Stanford, the University of Chicago, and Brown University, where he chaired the Mathematics Department from 2013 to 2017 and founded Brown’s Data Science Initiative in 2016. He joined Yale in 2018, serving as inaugural Dean of Science in the Faculty of Arts and Sciences until assuming his current role in 2022. He is a Guggenheim Fellow and Fellow of the American Mathematical Society. His research spans hyperbolic 3-manifolds, Teichmüller dynamics, and geometric methods in data science. Notable contributions include work on Thurston’s geometrization program, classification of hyperbolic manifolds, and applications of geometric topology to complex datasets. He co-authored foundational papers on ending laminations, Weil-Petersson geometry, and renormalized volume. His recent work bridges pure mathematics with applied challenges, such as algorithmic detection of medical imaging patterns. Awarded the Guggenheim Fellowship (2008) and AMS Fellow (2017), Brock has also led interdisciplinary initiatives at Brown and Yale. His administrative roles include overseeing engineering, natural sciences, and data science programs. Beyond academia, he co-founded the Vijay Iyer Trio, showcasing his passion for music performance and creativity.
Professor Richard Samworth is a leading academic at the University of Cambridge , affiliated with the Department of Pure Mathematics and Mathematical Statistics and serving as Director of the Statistical Laboratory . His research focuses on Nonparametric and High-dimensional Statistics , addressing challenges in data analysis, statistical learning, and computational methods. Research Interests : Richard Samworth's work emphasizes Nonparametric Statistics , High-dimensional Data , and Statistical Learning . His research spans topics such as Missing Data , Changepoint Detection , Log-concave Density Estimation , and Subgroup Analysis , with applications in Machine Learning and Data Science . Key methodologies include Score Matching , Random Projections , and Minimax Estimation . Recent publications highlight advancements in Semi-Supervised Learning , Robust Statistical Testing , and High-dimensional PCA with heterogeneous missingness. His work bridges theoretical rigor with practical applications, particularly in Statistical Algorithms and Optimization .
