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

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

استاد

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

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).

• Algebraic Geometry
• Syzygies of Algebraic Varieties
• Secant Varieties
• +۶ مورد دیگر

Jinhyung Park is an Associate Professor in the Department of Mathematical Sciences at KAIST, Daejeon, Korea. He obtained his Ph.D. from KAIST in 2014 under Prof. Sijong Kwak and was mentored as a CMC Fellow at KIAS (2014–2019). His research focuses on Algebraic Geometry , particularly syzygies of algebraic varieties , secant varieties , and positivity of line bundles . Education: Ph.D., KAIST (2014); MS/BS, KAIST and University of Chicago (2002/2001). Research Interests: His work explores geometric properties of projective manifolds, singularities in algebraic geometry, and applications of Okounkov bodies to divisors and syzygies. Recent trends include Castelnuovo-Mumford regularity bounds (e.g., for threefolds with rational singularities) and subadditivity of Okounkov bodies in fiber spaces. Teaching: Courses include Matrix Groups, Algebraic Geometry, and Calculus. He previously taught at Sogang University and Purdue University. Professional Affiliations: Member of the Korean Mathematical Society, American Mathematical Society, and other international societies. Organized the 8th East Asia Number Theory Conference at KAIST (2019).

Ram Vasudevanمشاهده پروفایل

دانشیار

• Optimization and control of nonlinear systems
• Legged robot locomotion
• Autonomous systems safety
• +۴ مورد دیگر

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.

• 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.

Jeffrey F. Brockمشاهده پروفایل

استاد

• Low-dimensional geometry
• Hyperbolic geometry
• Topology
• +۳ مورد دیگر

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.

• Quantum Information Theory
• Quantum Many-Body Systems
• Quantum Dissipative Evolutions
• +۲ مورد دیگر

Angela Capel Cuevas is an Assistant Professor of Quantum Information Theory/Theoretical Quantum Computation at the University of Cambridge's Department of Applied Mathematics and Theoretical Physics (DAMTP). Previously, she held a Junior Professorship at Eberhard Karls Universität Tübingen (2021-2024) and was an MCQST Distinguished PostDoc at TU München (2020-2021). Her research focuses on the intersection of quantum information theory and quantum many-body systems, particularly studying thermalization dynamics via quantum functional inequalities. She is a recipient of the Simons Emmy Noether Fellowship and Forbes 30 Under 30 (Spain 2023). Education: PhD in Mathematics, Universidad Autónoma de Madrid/ICMAT (2015-2019) Master in Computational Engineering and Mathematics, URV/UOC (2016-2018) Bachelor in Mathematics, Universidad de Granada (2009-2014) Research: Angela's work applies analytic and geometric tools to quantum systems, emphasizing decay of correlations in Gibbs states and quantum dissipative evolutions. Key topics include entropy inequalities, modified logarithmic Sobolev inequalities, and thermalization rates in spin chains. Her recent work bridges quantum functional analysis with practical implications for quantum computing and thermalization phenomena. Grants & Roles: PI of CRC TRR 352 'Mathematics of Many-Body Quantum Systems' (7M€) Co-PI of QuantERA project TouQan (1.25M€) Organized workshops at BIRS and Tübingen (2023-2024) Awards: Simons Emmy Noether Fellowship (2023) Forbes 30 Under 30 (2023) Vicent Caselles RSME-FBBVA Award (2022) Labs/Teams: Leads a group studying quantum dissipative systems and thermalization at DAMTP. Collaborates with institutions globally on quantum functional inequalities and Gibbs state properties.

Amit Kumarمشاهده پروفایل

استاد

• Combinatorial Optimization
• Online Algorithms
• Clustering Algorithms
• +۵ مورد دیگر

Amit Kumar is the Jaswinder and Tarwinder Chadha Chair Professor in the Department of Computer Science and Engineering at IIT Delhi. His research focuses on combinatorial optimization, online algorithms, and algorithmic fairness. He has taught courses such as Approximation Algorithms (COL 754), Design and Analysis of Algorithms (COL 351), and Numerical Analysis (COL 726). His work spans theoretical computer science with applications to clustering, scheduling, and fairness in evaluation processes. Research Interests Kumar's research emphasizes developing efficient algorithms for online and dynamic settings, particularly in constrained optimization and biased evaluation systems. He explores theoretical foundations of clustering, load balancing, and resource allocation, with recent contributions to fair food delivery systems and coreset constructions. Publications His recent work includes advancements in online convex paging (STOC 2025), consensus clustering (SODA 2025), and fairness-aware algorithms (AAAI 2024). Over 70 papers across top venues like STOC, SODA, and ICML reflect his expertise in algorithm design and analysis. Awards Best Paper Award at ISAAC 2023 for 'Clustering What Matters in Constrained Settings' Teaching & Mentorship Kumar instructs graduate and undergraduate courses in algorithms, data structures, and numerical methods. He advises students through these courses and collaborates with researchers on NSF-funded projects related to approximation algorithms and streaming systems.

Amir Ali Ahmadiمشاهده پروفایل

استاد

• Optimization Theory
• Control Theory
• Dynamical Systems
• +۷ مورد دیگر

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.

• Theoretical Computer Science
• Algorithm Design and Analysis
• Graph Algorithms
• +۵ مورد دیگر

Debmalya Panigrahi is a Professor and Associate Chair in the Department of Computer Science at Duke University. He holds a PhD in Theoretical Computer Science from MIT and has prior affiliations with Microsoft Research, Bell Labs, and the Simons Institute for Theory of Computing. His research focuses on algorithms, particularly graph algorithms, algorithms under uncertainty, and learning-augmented methods. He has received NSF CAREER and other awards, and his work spans peer-reviewed publications in top venues like STOC, FOCS, and SODA. He advises PhD students and mentors postdocs, emphasizing theoretical contributions with practical applications. His teaching includes courses on approximation algorithms, graph algorithms, and discrete mathematics. Education: PhD (MIT, advised by David Karger), MSc (Indian Institute of Science, advised by Ramesh Hariharan), BSc (Jadavpur University). Research highlights include fastest algorithms for graph connectivity, learning-augmented approximation methods, and online algorithms. Funded by NSF, ARO, Google, and others. Current projects explore network reliability, hypergraph algorithms, and algorithmic fairness. His lab collaborates across theory, AI/ML, and databases at Duke. Recent Grants: NSF CCF-2006512, CCF-1618286, CCF-1350537 Labs/Teams: Duke Algorithms Lab, Theory Group, Collaborations with CS-Econ and AI/ML groups Publications span 150+ papers, with 5+ journal articles in SIAM Journal of Computing and ACM Transactions. Recent focus on integrating machine learning into classical algorithms to improve worst-case performance bounds. Advised 10+ PhD students, many now in academia (e.g., UI Chicago, UT Dallas) and industry (Google, Microsoft).

• Data Science
• Numerical Optimisation
• Medical Imaging
• +۳ مورد دیگر

Raphael Hauser is an Associate Professor in Numerical Mathematics at the University of Oxford's Mathematical Institute, Director of Graduate Studies - Teaching, and Tanaka Fellow in Applied Mathematics at Pembroke College. His affiliations include membership in the Data Science, Numerical Analysis, and Mathematical and Computational Finance research groups, as well as a fellowship at the Alan Turing Institute. Education: PhD in Operations Research, Cornell University, Ithaca, USA Dipl. Math. ETH, Swiss Federal Institute of Technology (ETH Zurich), Switzerland Research interests span data science, numerical optimisation, medical imaging, distributed computing, and applied probability/statistics. His work integrates mathematical rigor with practical applications, particularly in optimization algorithms, machine learning theory, and medical imaging technology. Publications focus on optimization theory, stochastic processes, medical imaging systems, and computational finance, with recurring themes in non-convex optimization guarantees, PCA variants, and X-ray tomography innovations. Awards: Oxford University Teaching Award (2007) SIAM Optimization Prize (2005) SIAM Student Paper Prize (2000) Advising includes 15+ DPhil students and 40+ MSc students, with projects in optimization, finance, imaging, and machine learning. Current postdocs and students are affiliated with the Alan Turing Institute and industrial partners like Siemens and Macquarie Group. He leads teams in the Mathematical Institute's research groups and collaborates with the Alan Turing Institute on large-scale data science initiatives.

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

استادیار

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

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

• Several Complex Variables
• Partial Differential Equations
• Complex Analysis
• +۴ مورد دیگر

Emil J. Straube is a Professor of Mathematics at Texas A&M University, where he has held the rank of Professor since 1996 and served as Department Head from 2011 to 2019. He earned his Ph.D. in Mathematics from the Swiss Federal Institute of Technology (ETH Zurich) in 1983 under Prof. K. Osterwalder. His research focuses on Several Complex Variables, with emphasis on the ∂-Neumann problem, Bergman kernel, and boundary regularity of solutions to Cauchy-Riemann equations. Education: Ph.D. in Mathematics, ETH Zurich, 1983 Diploma in Mathematics (dipl. math. ETH), ETH Zurich, 1977 Research Interests: His work bridges complex analysis, partial differential equations, and operator theory. Key topics include global regularity of the ∂-Neumann operator, compactness estimates, D’Angelo forms, and the Diederich-Fornaess index. He has contributed foundational results on Sobolev regularity and geometric conditions for subellipticity. Publications & Awards: With over 50 peer-reviewed articles, Straube has authored influential monographs such as Lectures on the L2-Sobolev Theory of the ∂-Neumann Problem . Notable accolades include the Stefan Bergman Prize (1995, jointly with H.P. Boas), AMS Fellow (2013), and Texas A&M’s Distinguished Achievement Award (1998). His work has been supported by NSF grants totaling over $3 million and international collaborations at institutions like the Erwin Schrödinger Institute (Vienna). Service & Leadership: Organized major conferences, including the 2015 Qatar Complex Analysis Conference Edited journals such as Journal of Mathematical Analysis and Applications and Complex Analysis and Its Synergies Guided 7 Ph.D. students and co-mentored numerous postdocs Current Activities: Active in teaching advanced graduate courses (e.g., Complex Variables I/II) and continues research in global regularity theory and CR geometry.

• Fractal Geometry
• Geometric Measure Theory
• Multifractal Measures
• +۶ مورد دیگر

Kenneth J. Falconer is the Regius Professor of Mathematics at the University of St Andrews, where he is a member of the School of Mathematics and Statistics and the Analysis Research Group. He has held prestigious positions at the University of Bristol and Corpus Christi College, Cambridge, and has been a visiting professor at institutions including Oregon State University and the Australian National University. Regius Professor of Mathematics, University of St Andrews (2017–present) Professor of Mathematics, University of St Andrews (1993–2017) Reader, University of Bristol Lecturer, University of Bristol Research Fellow, Corpus Christi College, Cambridge His research centers on fractal and multifractal geometry, geometric measure theory, and related fields. He has made seminal contributions to the understanding of fractal projections, dimensional analysis of self-affine sets, and fractal processes. His work includes the concept of the digital sundial and the introduction of the affinity dimension and Falconer’s distance problem. His research spans dimensional analysis, random fractals, PDEs on fractal domains, and combinatorial geometry. The most recent publications show a sustained focus on intermediate dimensions, projections of fractal sets and measures, and the dimensional properties of stochastic processes. His work frequently involves collaboration with leading mathematicians and appears in top journals such as Transactions of the American Mathematical Society , Ergodic Theory and Dynamical Systems , and Journal of Fractal Geometry . Fellow of the Royal Society of Edinburgh (1998) Shephard Prize, London Mathematical Society (2020) CBE, King’s New Year’s Honours (2024) Kenneth Falconer has supervised numerous students and collaborated with many researchers including Jonathan Fraser, Pertti Mattila, and Xiong Jin. He has served on editorial boards for Fractals , Journal of Fractal Geometry , and Mathematical Proceedings of the Cambridge Philosophical Society . He has been active in professional service, including as Chair of the British Mathematical Colloquium 2018 and Publications Secretary of the London Mathematical Society (2006–2009). He organized major programs at the Isaac Newton Institute and Mittag-Leffler Institute. He is also known for his involvement in the Long Distance Walkers Association, where he served as Chairman and Editor of Strider , and for his mathematical poetry featured in publications like the London Mathematical Society Newsletter .

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

استاد

• Nonlinear Optimization
• Optimal Control
• Numerical Analysis
• +۳ مورد دیگر

Prof. Dr. Michael Ulbrich is a full professor and Chair of Mathematical Optimization at the Technical University of Munich (TUM), within the School of Computation, Information and Technology. He has held this position since 2006 and previously served as Dean of Studies (2007–2010) and Vice Dean of the Faculty of Mathematics (2012–2015). His research focuses on nonlinear optimization, optimal control, and numerical analysis, with applications in fluid dynamics, shape optimization, and PDE-constrained systems. He leads projects in the DFG SPP 1962 and IGDK 1754, and has received prestigious awards including the Howard Rosenbrock Prize (2015) and the Doctoral Award from the TUM Association of Friends (1996). Ulbrich is Editor-in-Chief of Optimization and Engineering and contributes to multiple journals. His work bridges theoretical foundations and practical applications, including CO2 sequestration, fluid-structure interaction, and distributed optimization algorithms. Education: PhD (1996), Habilitation (2002) in Mathematics at TUM. Research stays at Rice University (USA) under DFG funding. Research Areas: Semismooth Newton methods, PDE-constrained optimization, optimal control of Navier-Stokes equations, and distributed parameter systems. Awards: Rosenbrock Prize, Teaching Excellence Awards, and recognition for doctoral work. Leadership Roles: Department Head of Mathematics (2022–), Member of TUM Senate (2019–2022), and Co-Chair of GAMM 2018. Ulbrich has authored influential textbooks like Semismooth Newton Methods for Variational Inequalities and Nichtlineare Optimierung . His recent projects include OptiGeoS (2024–2026) and collaborations on nonsmooth optimization and stochastic algorithms. His academic contributions span over 100 publications, emphasizing both algorithmic innovation and rigorous mathematical analysis.