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

• Robotics
• 3D Computer Vision
• State Estimation
• +۵ مورد دیگر

Xingxing Zuo is an Assistant Professor (tenure-track) in the Robotics Department at MBZUAI. He holds a PhD from Zhejiang University (2021) and a Bachelor’s from UESTC (2016). Previously, he was a Postdoctoral Scholar at Caltech (2024–2025), a Postdoc at ETH Zurich (2019–2021), and held visiting roles at TU Munich, University of Delaware, and University of Technology Sydney. His research focuses on robotics, 3D computer vision, and embodied AI, with emphasis on robot-human collaboration, state estimation, and sensor fusion. Educations: PhD in Robotics, Zhejiang University (2021, with honors) Bachelor’s in Computer Science, University of Electronic Science and Technology of China (2016, with honors) Research Highlights: Develops novel methods for LiDAR-camera-inertial fusion, neural radiance fields, and radar-cameras systems Pioneered techniques like Flying Co-Stereo (long-range aerial mapping) and FMGS (vision-language embedded 3D splatting) Focuses on real-time SLAM, robust depth estimation, and photorealistic scene reconstruction Awards & Recognition: Best Paper Finalist at ICRA 2021 (CodeVIO) Oral Presentation at ICCV 2021 (MBA-VO) Recipient of Google Visiting Faculty Researcher (2023) Grants & Labs: Organized Thermal Infrared in Robotics workshop at ICRA 2025 Leads research on embodied AI and multi-sensor SLAM systems Develops open-source tools like LIC-Fusion and Coco-LIC frameworks

Sicun Gaoمشاهده پروفایل

دانشیار

• Algorithms and Optimization
• Automated Reasoning
• Cyber-Physical Systems
• +۳ مورد دیگر

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.

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

استاد

• Machine Learning
• Bayesian Optimization
• Gaussian Processes
• +۳ مورد دیگر

Michael A Osborne is Professor of Machine Learning at the University of Oxford and leads the Bayesian Exploration Lab . He serves as Director of the EPSRC Centre for Doctoral Training in Autonomous Intelligent Machines and Systems and co-directs the Oxford Martin AI Governance Initiative. His research focuses on Bayesian optimization, Gaussian processes, and probabilistic numerics with applications in quantum devices, battery modeling, and AI governance. Key Positions: Professor of Machine Learning, University of Oxford Official Fellow, Exeter College Co-founder of Mind Foundry Lead Researcher, Oxford Martin Programme on Technology and Employment Research Themes: Probabilistic modeling for quantum systems Uncertainty quantification in energy storage AI safety and societal impact analysis Automated experimental design Quantum device calibration Probabilistic numerical methods Technical Contributions: Bridging reality gap in quantum devices Efficient Bayesian quadrature techniques Personalized neurostimulation algorithms Automated measurement protocols Quantum-classical hybrid ML

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.

J. Andrew Bagnellمشاهده پروفایل

استاد

• Machine Learning
• Robotics
• Control Theory
• +۷ مورد دیگر

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.

Ajit Rajwadeمشاهده پروفایل

استاد

• Artificial Intelligence
• Machine Learning
• Signal Processing
• +۶ مورد دیگر

Ajit Rajwade is a Professor at the Department of Computer Science and Engineering , Indian Institute of Technology Bombay. His research spans Artificial Intelligence , Compressed Sensing , and Medical Imaging , with affiliations to the Centre for Machine Intelligence and Data Science and the Koita Centre for Digital Health . Education : PhD in Computer and Information Science and Engineering, University of Florida (2010) MSc in Computer Science, McGill University (2004) BTech in Computer Engineering, University of Pune (2002) His research interests focus on intelligent data acquisition, particularly in neural network analysis , graph signal processing , and medical imaging . He develops compressed sensing algorithms for inverse problems like tomography and MRI reconstruction , alongside applying group testing to pandemic response. Scientific awards include the Prof. S. P. Sukhatme Award (2024) and Departmental Teaching Excellence (2019). His publications demonstrate expertise in image restoration , noise modeling , and epidemiological algorithms . He has advised PhD students like Sabyasachi Ghosh and Jerin Geo James , with a focus on computationally efficient methods in medical imaging and machine learning .

• Data Science
• Machine Learning
• Computational Harmonic Analysis
• +۶ مورد دیگر

Pierre Vandergheynst is a Full Professor at the Swiss Federal Institute of Technology Lausanne (EPFL) in the Department of Electrical Engineering, with a courtesy appointment in Computer and Communication Sciences. He serves as EPFL’s Vice-Provost for Education since 2015 and leads the Signal Processing Laboratory 2 (LTS2). His research spans harmonic analysis, sparse approximations, mathematical data processing, and applications in signal/image processing, computer vision, machine learning, and graph-based data analysis. PhD in Mathematical Physics (1998), Université catholique de Louvain Postdoctoral Researcher at EPFL (1998-2001) Assistant Professor at EPFL (2002-2007) His research explores geometry/symmetry in high-dimensional data, redundant dictionaries for dimensionality reduction, and computational harmonic analysis on manifolds. Recent work focuses on protein structure modeling, geometric deep learning, and graph-based signal processing. Key article trends include graph neural networks for protein analysis, geometric deep learning in neuroscience, and structured knowledge priors in neural models. His 2023-2025 publications emphasize interpretable AI, long-range dependencies in graphs, and molecular representation learning. Scientific Awards: IEEE Signal Processing Magazine Best Paper Award (2023) Signal Processing Society Best Paper Award (2022) Apple ARTS Award (2007) De Boelpaepe Prize, Royal Academy of Sciences of Belgium (2009-2010) He has supervised over 30 PhD theses and contributed to foundational work in graph signal processing, compressive sensing, and geometric deep learning. His lab develops tools for data science on non-Euclidean structures, with applications in medicine, astronomy, and wireless systems.

Fatma Kılınç-Karzanمشاهده پروفایل

دانشیار

• Mathematical Optimization
• Convex Optimization
• Non-convex Optimization
• +۷ مورد دیگر

Fatma Kılınç-Karzan is an Associate Professor of Operations Research at Carnegie Mellon University's Tepper School of Business, with a courtesy appointment as Associate Professor of Computer Science. She is also affiliated with the Algorithms Combinatorics and Optimization (ACO) PhD Program and was a Visiting Scientist at Berkeley's Simons Institute for the Theory of Computing during Fall 2017. Her educational background includes a PhD from Georgia Institute of Technology's H. Milton Stewart School of Industrial & Systems Engineering with a minor in Mathematics, supervised by Prof. Arkadi Nemirovski. She earned her B.S. and M.S. degrees from the Industrial Engineering Department of Middle East Technical University with a minor in Information Systems. Dr. Kılınç-Karzan's research spans mathematical optimization with emphasis on convex and non-convex optimization theory, algorithms, and applications. Her work bridges theoretical foundations with practical implementations in optimization under uncertainty (robust optimization, chance constraints, distributionally robust optimization), machine learning (preference learning from limited data), and business analytics. She develops foundational theory for large-scale optimization problems with applications in decision making under uncertainty and high-dimensional statistical inference. Analysis of her recent publications reveals a strong focus on convex hull characterizations, semidefinite programming relaxations, distributionally robust optimization, and online convex optimization frameworks. Her work demonstrates increasing integration of optimization theory with machine learning applications, particularly in developing data-driven approaches for decision making under uncertainty. NSF CAREER Award (2015) INFORMS Optimization Society Young Researcher Prize (2015) INFORMS Junior Faculty Interest Group (JFIG) Best Paper Award (2014) BP Junior Faculty Chair (2014-2015) Faculty Giving Chair (2012-2013) Wimmer Fellowship (2012-2013) Dr. Kılınç-Karzan has successfully mentored numerous PhD students who have received prestigious awards, including the 2021 INFORMS Optimization Society Best Student Paper (1st prize) and multiple honorable mentions. Her research has been supported by significant grants including an NSF CAREER Award, an ONR grant (with S. Küçükyavuz), and an AFOSR grant. She serves on editorial boards for Mathematical Programming, Operations Research, Mathematics of Operations Research, and other leading journals, and has held leadership positions in professional societies including the Mathematical Optimization Society and INFORMS Computing Society. Through her affiliations with CMU's Tepper School, Computer Science Department, and ACO Program, she collaborates across disciplines to advance optimization theory and its applications. Her professional service includes committee chair roles for major INFORMS competitions and program committee leadership for international optimization conferences.

Siva Balakrishnanمشاهده پروفایل

دانشیار

• Statistical Machine Learning
• Causal Inference
• Public Policy & Social Sciences
• +۵ مورد دیگر

Siva Balakrishnan is an Associate Professor at Carnegie Mellon University with a joint appointment in the Department of Statistics and Data Science and the Machine Learning Department . He holds an affiliation with the Dietrich College of Humanities and Social Sciences. Previously, he was a postdoctoral researcher at UC Berkeley's Department of Statistics, advised by Martin Wainwright and Bin Yu, and earned his Ph.D. in Computer Science from CMU's Language Technologies Institute under Jaime Carbonell. His research focuses on statistical machine learning, causal inference, and high-dimensional statistics, with notable contributions to domain adaptation, optimal transport, and robust statistics. Education: Ph.D. in Computer Science, Carnegie Mellon University (Language Technologies Institute) Postdoctoral Researcher, University of California, Berkeley (Department of Statistics) Research Interests: His work bridges theoretical foundations and algorithmic development, emphasizing robust statistical methods and their applications in causal inference, public policy, and machine learning. Key areas include nonparametric methods, optimization, and high-dimensional data analysis. He has pioneered techniques in domain adaptation, such as the RLSbench framework for relaxed label shift scenarios. Awards & Grants: Amazon Research Award (2021) Google Research Scholar Award (2021) NVIDIA Pioneer Award (2018) IMS Lawrence D. Brown Student Award (2020, 2022) National Science Foundation Grants (CCF-1763734, DMS-1713003, etc.) Professional Activities: He serves as an Associate Editor for JASA and on the editorial boards of Foundations and Trends in Statistics . His work has been featured in top venues like NeurIPS, ICML, and the Annals of Statistics. He currently holds a sabbatical at UC Berkeley's Department of Statistics (Spring 2025). Labs & Collaborations: He actively participates in the Statistics and Machine Learning Reading Group and the Causal Inference Working Group , fostering interdisciplinary research in CMU's vibrant academic community.

Ann B Leeمشاهده پروفایل

استاد

• Scientific Machine Learning
• Trust-Worthy UQ
• Likelihood-Free Inference
• +۱ مورد دیگر

Ann B. Lee is a Professor and Co-Director of the PhD Program in Statistics at Carnegie Mellon University , with a joint appointment in the Department of Statistics & Data Science and the Machine Learning Department. Prior to joining CMU, she held positions as a J.W. Gibbs Assistant Professor at Yale University and a visiting research associate at Brown University. PhD in Physics, Brown University MSc/BSc in Engineering Physics, Chalmers University of Technology, Sweden Her research focuses on statistical methodology for complex data in the physical sciences , emphasizing trustworthy inference, uncertainty quantification, and integration of classical statistics with machine learning. Recent work includes likelihood-free inference, calibrated forecasting, and diagnostics for generative models. The STAMPS research group , which she co-founded in 2018, hosts weekly meetings and public webinars. In Fall 2024, STAMPS will transition into a CMU Research Center. Recent publications span likelihood-free inference , climate modeling , and astronomy . Notable collaborations include applications to hurricane intensity guidance , galaxy redshift estimation , and cosmological parameter biases . She mentors PhD students and has advised multiple award-winning researchers, including ASA Best Student Paper Award winners. Her teaching includes advanced courses on probability, regression, and AI for climate sciences.

• Machine Learning
• Statistical Learning Theory
• Optimization
• +۳ مورد دیگر

Professor Yiming Ying is a faculty member in the Faculty of Science at the University of Sydney, where he joined in December 2023. Previously, he held tenured positions at SUNY Albany (Departments of Mathematics & Statistics and Computer Science) and was a Lecturer at the University of Exeter. He completed his PhD in Mathematics at Zhejiang University (2002) and postdoctoral training at CityU Hong Kong, UCL, and University of Bristol. Research Focus His research spans statistical learning theory, optimization algorithms, trustworthy AI, and data science mathematics. Key applications include cancer informatics for early detection. His work aligns with Faculty research strengths in Data and Decisions and Decision-Making for a Sustainable Future. Recent Research Trends Analysis of recent publications shows strong focus on theoretical foundations of machine learning: differential privacy, fairness algorithms, optimization methods for AUC maximization, generalization guarantees, and robust learning techniques for adversarial settings and biological data. Awards and Honors SUNY Chancellor’s Award for Excellence (2023) University at Albany Presidential Research Award (2022) University of Exeter Merit Award (2012) Grants and Advising Significant funding includes current ARC DP250101359 (2025-2028) and multiple past NSF grants. He founded the UALBANY Machine Learning Group and currently advises PhD student Peilin LIU on operator learning.

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.

Igors Gorbovickisمشاهده پروفایل

دانشیار

• Dynamical Systems
• Complex Analysis
• Discrete Geometry
• +۳ مورد دیگر

Prof. Igors Gorbovickis is an Associate Professor of Mathematics at the Department of Mathematics, School of Computer Science and Engineering, Constructor University (formerly Jacobs University Bremen). His research focuses on complex dynamical systems, including topics such as renormalization theory, bifurcation analysis, Julia sets, and applications to mathematical physics. He also contributes to discrete geometry, particularly exploring conjectures like the Kneser-Poulsen problem. His work bridges pure mathematics with interdisciplinary applications, emphasizing rigorous analysis of nonlinear systems and geometric configurations. Key areas of investigation include critical point accumulations, Hausdorff dimension estimates, and equidistribution phenomena in parameter spaces. Recent publications highlight advancements in understanding chaotic systems, circle maps, and the interplay between algebraic structures and dynamical behavior. Prof. Gorbovickis collaborates internationally, with co-authored papers appearing in journals like Advances in Mathematics , Ergodic Theory and Dynamical Systems , and Nonlinearity . His office is located at Research I, Room 128 on the Constructor University campus in Bremen, Germany.

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.

• Information Theory
• Cryptography
• Lattice Theory
• +۵ مورد دیگر

Cong Ling is a Professor of Information Theory and Cryptography at Imperial College London's Department of Electrical and Electronic Engineering, within the Faculty of Engineering. His research focuses on lattice theory and its applications in coding, cryptography, quantum information, and number theory. Key affiliations include the Academic Centre of Excellence in Cyber Security Research and the Engineering Secure Software Systems group. Education details are not explicitly provided in the text, but his professional experience indicates advanced qualifications in electrical engineering and mathematics. Research interests span lattice-based cryptography, post-quantum security, algebraic coding theory, and quantum-resistant algorithms. His work bridges information theory and number theory, with contributions to MIMO systems, secure communication protocols, and cryptographic protocol design. Recent publications emphasize lattice reduction techniques, quantum algorithms for the shortest vector problem, and advancements in polar codes. Notable trends include exploration of non-commutative algebras for cryptography, Gaussian sampling optimizations, and hybrid quantum-classical approaches to hard integer problems. Over 50+ articles published since 2018 reflect his leadership in lattice-based research and quantum-safe technologies. Awards: None explicitly listed in the text. Grants/Advising: No specific grants or student advisees mentioned; focus remains on collaborative research outputs. Labs/Teams: Associated with Imperial's Cyber Security Research groups and quantum engineering initiatives.