جستجوی استاد راهنمای دانشگاهی

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

استادیار

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

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

Daniel E. Hoمشاهده پروفایل

استاد

• Artificial Intelligence Policy
• Regulatory Governance
• Fairness in AI
• +۳ مورد دیگر

Daniel E. Ho holds multiple prestigious positions at Stanford University: William Benjamin Scott and Luna M. Scott Professor of Law Professor of Political Science Professor of Computer Science (by courtesy) Senior Fellow, Stanford Institute for Economic Policy Research Senior Fellow, Stanford Institute for Human-Centered Artificial Intelligence Faculty Fellow, Center for Advanced Study in the Behavioral Sciences He serves on the National Artificial Intelligence Advisory Commission (NAIAC), as Senior Advisor on Responsible AI at the U.S. Department of Labor, and as a Public Member of the Administrative Conference of the United States (ACUS). Ho earned his J.D. from Yale Law School and Ph.D. from Harvard University, completing a clerkship with Judge Stephen F. Williams on the U.S. Court of Appeals for the District of Columbia Circuit. His research bridges artificial intelligence, law, and public policy with emphasis on: Regulatory governance frameworks for AI systems Fairness and bias mitigation in algorithmic decision-making Environmental enforcement using satellite imagery and computer vision Methods for estimating racial disparities without direct demographic data Legal AI reliability and statutory research systems Analysis of his 2025 publications reveals a consistent focus on practical AI governance tools addressing real-world regulatory challenges. Key themes include developing benchmarks for legal applications, mitigating hallucination in legal AI tools, and creating systems for statutory research. His work demonstrates strong integration of technical AI methods with policy implementation, particularly in environmental enforcement and fairness assessment. As Director of the Regulation, Evaluation, and Governance Lab (RegLab), Ho leads interdisciplinary research partnerships with government agencies. While specific grant details aren't provided, RegLab's operational model indicates substantial research funding for policy-relevant AI projects. No student advisees are mentioned in available materials. Ho's leadership extends to national advisory roles where he shapes federal AI policy through evidence-based recommendations, particularly regarding environmental protection and civil rights enforcement mechanisms.

Eric V. Mazumdarمشاهده پروفایل

استادیار

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

Eric V. Mazumdar is an Assistant Professor at the California Institute of Technology (Caltech), jointly appointed in the departments of Computing and Mathematical Sciences and Economics. He holds a B.S. from MIT (2015) and a Ph.D. from UC Berkeley (2021), co-advised by Michael Jordan and Shankar Sastry. His research bridges machine learning and economics, focusing on deploying algorithms into societal systems through theoretical and practical lenses. Key areas include strategic classification, multi-agent reinforcement learning, and distributionally robust optimization, with applications in healthcare, online markets, and intelligent infrastructure. Education: B.S., Electrical Engineering and Computer Science, Massachusetts Institute of Technology, 2015 Ph.D., Electrical Engineering and Computer Science, University of California, Berkeley, 2021 Research Interests: Mazumdar’s work emphasizes understanding learning algorithms in strategic environments, including min-max optimization, game theory, and multi-agent systems. He explores how algorithms interact with human and algorithmic agents in dynamic systems, with practical applications in healthcare delivery, e-commerce, and autonomous systems testing. Awards: NSF CAREER Award (2023) Simons Institute Research Fellowship in Learning in Games Grants & Funding: Supported by NSF, DARPA, Amazon, and other organizations. His NSF CAREER grant focuses on strategic interactions in societal-scale systems. Teaching: Courses include Networks: Structure & Economics (CMS/CS/EE/IDS 144) and Topics in Learning and Games (CMS/Ec 248). At UC Berkeley, he contributed to courses like Data, Inference, and Decisions (DS 102). Students & Postdocs: Current students: Lauren Conger, Tinashe Handina, Yizhou Zhang Postdocs: Zaiwei Chen, Laixi Shi, Kishan Panaganti (co-advised with Adam Wierman)

Peter Selingerمشاهده پروفایل

استاد

• Quantum Computing
• Category Theory
• Mathematical Logic
• +۴ مورد دیگر

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.

• Artificial Intelligence
• Neurosymbolic AI
• Logic and AI
• +۷ مورد دیگر

Vaishak Belle is a Reader in Logic and Learning at the School of Informatics, University of Edinburgh, and serves as Director of Research and Innovation at the Bayes Centre (40% position). His academic career focuses on the critical intersection of artificial intelligence, formal logic, and machine learning systems. His research spans multiple domains within AI: Neurosymbolic AI integration approaches Logic-based machine learning frameworks Ethics, fairness, and responsibility in AI systems Generative AI and its societal impact Robotics with advanced reasoning capabilities Causal modeling and probabilistic reasoning Belle leads a research laboratory dedicated to advancing neurosymbolic AI, which combines the explainability of symbolic systems with the learning capabilities of neural networks. His recent work has explored abduction in logical frameworks, formal languages for AI safety, and the relevance of logic for general-purpose AI systems. He has made significant contributions to bridging the gap between theoretical AI foundations and practical applications. His publications demonstrate consistent focus on creating AI systems that can reason formally while learning from data, with applications ranging from robotics to ethical decision-making frameworks. His research addresses fundamental challenges in developing trustworthy, explainable AI that can operate safely in complex environments. Beyond technical research, Belle is actively engaged in AI education through executive programs on AI leadership and ethics, and has contributed to public understanding through his children's book "The girl and the robot" which explores human-robot relationships and emotional projection onto artificial agents. He maintains an active presence in the international AI research community, regularly participating in major workshops including Dagstuhl seminars on neurosymbolic AI, and collaborating with researchers across disciplines from computer science to philosophy.

Anders Rantzerمشاهده پروفایل

استاد

• Control Systems Theory
• Scalable Control
• Adaptive Control
• +۷ مورد دیگر

Anders Rantzer is a Professor of Automatic Control at the Department of Control Engineering, Faculty of Engineering, Lund University, Sweden. He has held visiting positions at Caltech (2004–2005) and the University of Minnesota (2015–2016) as the Taylor Family Distinguished Visiting Professor. His academic journey began with a PhD from KTH Stockholm in 1991, followed by a postdoc at the Institute for Mathematics and its Applications (IMA), University of Minnesota. His research interests center on modeling, analysis, and synthesis of control systems , with a strong focus on scalability, adaptation, and applications in energy networks . He is particularly known for foundational work in positive systems and integral quadratic constraints (IQCs) . These theoretical frameworks are critical in analyzing stability and robustness of large-scale interconnected systems. His work bridges mathematical rigor with practical engineering applications, especially in sustainable energy and networked systems. The recent publications and lecture materials reflect a consistent trajectory in scalable and robust control, optimization, and distributed systems. Themes such as large-scale convex optimization , nonlinear and stochastic control , and network dynamics dominate his scholarly output, indicating a sustained commitment to advancing control theory for complex, real-world systems. Scientific honors include: Fellow of IEEE Member of the Royal Swedish Academy of Engineering Sciences (IVA) Chairman of the Swedish Scientific Council for Natural and Engineering Sciences Chairman of the Royal Physiographic Society of Lund Rantzer has supervised numerous students and contributed extensively to academic leadership and education. He has been involved in major national and international research initiatives such as WASP (Wallenberg AI, Autonomous Systems and Software Program) and ELLIIT. His work includes developing educational tools and courses in control, optimization, and machine learning. He leads and contributes to research projects on autonomous systems, cloud control, and smart energy networks. He is affiliated with the Control Lab at LTH and participates in collaborative efforts such as the Nordic University Hub on Industrial Internet of Things (HI2OT). His work integrates theoretical advances with practical implementations in robotics, biomedical systems, and industrial automation.

Vadim Lozinمشاهده پروفایل

استاد

• Graph theory
• Combinatorics
• Discrete Mathematics
• +۴ مورد دیگر

Vadim Lozin is a Professor of Mathematics at the University of Warwick, affiliated with the Department of Mathematics within the School of Mathematics. His research interests span graph theory, combinatorics, and discrete mathematics, focusing on areas such as clique-width, Ramsey numbers, and structural graph theory. He has held visiting positions at institutions including the Université Paris-Dauphine, EPFL, and KAUST. Lozin has received several accolades, including the Best Paper Award for 'Linear Ramsey numbers' in 2018 and a 2024 award at the International Symposium on Algorithms and Computation. His work involves collaborations with global researchers and contributions to conferences like IWOCA and WG. Lozin serves on editorial boards for journals such as Discrete Applied Mathematics and Electronic Notes in Discrete Mathematics . His research explores foundational problems in graph theory, with applications in algorithm design and complexity analysis. Lozin’s publications include studies on union-closed sets, functional graph properties, and algorithmic approaches to graph parameters. He has also contributed to books like Words and Graphs , bridging formal language theory with graph structures. His grants focus on clique-width and stability in graphs, reflecting his commitment to advancing theoretical and applied discrete mathematics.

• Combinatorial Optimization
• Approximation Algorithms
• Stochastic Optimization
• +۳ مورد دیگر

Viswanath Nagarajan is an Associate Professor of Industrial & Operations Engineering and Computer Science Engineering (courtesy) at the University of Michigan. His research focuses on combinatorial optimization, approximation algorithms, and stochastic models for routing, scheduling, and location problems. He previously served as an Assistant Professor at the University of Michigan (2014–2020) and a Research Staff Member at IBM T.J. Watson Research Center (2009–2014). He holds a Ph.D. in Algorithms, Combinatorics, and Optimization from Carnegie Mellon University (2004–2009) and a B.Tech. in Computer Science from IIT Bombay (1999–2003). His research explores uncertainty management in optimization, including stochastic models and approximation algorithms for decision-making under uncertainty. He has contributed to adaptive algorithms, submodular optimization, and applications in logistics, network design, and scheduling. Education: Ph.D., Algorithms, Combinatorics, and Optimization (Carnegie Mellon University, 2009) B.Tech., Computer Science and Engineering (IIT Bombay, 2003) Prof. Nagarajan has organized major conferences like IPCO 2019 and served on editorial boards for journals including Operations Research , ACM Computing Surveys , and ACM Transactions on Algorithms . His service includes program committees for SODA, APPROX, and IPCO. He advises Ph.D. students focusing on optimization theory and applications, with advisees securing positions at Yahoo! Research, the University of Chicago, Ford Motor Company, and Georgia Tech.

Kai Cieliebakمشاهده پروفایل

استاد

• Symplectic geometry
• Contact geometry
• Hamiltonian dynamics
• +۵ مورد دیگر

Prof. Dr. Kai Cieliebak is a Professor of Mathematics at the University of Augsburg, where he holds the Chair of Analysis and Geometry within the Institute of Mathematics under the Faculty of Mathematics, Natural Sciences, and Materials Engineering. He has been at Augsburg University since 2012, following a professorship at Ludwig-Maximilians-Universität München from 2001-2012. His research group includes several researchers and postdocs working on symplectic geometry and related fields. Dr. Cieliebak earned his Diplom in mathematics summa cum laude from Ruhruniversität Bochum in 1992, with thesis on "Pseudo-holomorphe Kurven und periodische Orbits auf Cotangential Bündeln" under advisor H. Hofer. He completed his PhD in mathematics at ETH Zürich in 1996, with thesis "Symplectic boundaries: closed characteristics and action spectra," also advised by H. Hofer. His academic journey included positions at Harvard University, Stanford University, and research at IBM Zürich before his professorships in Munich and Augsburg. Prof. Cieliebak's research focuses on symplectic and contact geometry , with significant contributions to understanding symplectic manifolds, Lagrangian and Legendrian knots, Stein manifolds, and string topology. His work in Hamiltonian dynamics explores variational methods, periodic orbits, and celestial mechanics problems, particularly the restricted three-body problem. In global analysis , he investigates solution spaces of elliptic PDEs and symplectic field theory. His approach often bridges differential geometry, topology, and dynamical systems, with applications to mathematical physics. Over the past decade, Prof. Cieliebak's publications reveal a consistent focus on symplectic homology, Floer theory, and their applications to geometric problems. His work shows increasing integration of algebraic structures with geometric methods, particularly in cyclic homology and string topology. Recent research demonstrates strong collaboration with Urs Frauenfelder on celestial mechanics problems, applying symplectic techniques to the restricted three-body problem and related orbital dynamics. Prof. Cieliebak has secured significant research funding throughout his career, including multiple DFG grants under project codes CI 45/1 through CI 45/12, NSF grants, and participation in European Science Foundation networking programs. His most notable grants include "Foundations of Symplectic Field Theory" (2009-2015) and the current "Rabinowitz Floer Homology" project (since 2023), both in collaboration with U. Frauenfelder. He has mentored numerous researchers and maintains an active research group at Augsburg University, including postdocs and collaborators working on symplectic geometry problems. His team includes researchers such as Dr. Filip Broćić, Zhen Gao, Dr. Hanna Häußler, Emilia Konrad, Shuaipeng Liu, Dominik Meidert, Dr. Airi Takeuchi, Dr. Evgeny Volkov, Milan Zerbin, and PD Dr. Lei Zhao. Prof. Cieliebak has also organized numerous workshops on symplectic geometry, including the annual "Symplectic Field Theory" workshop series.

Arkadi Nemirovskiمشاهده پروفایل

استاد

• Optimization Theory and Algorithms
• Convex Optimization
• Robust Optimization
• +۴ مورد دیگر

Arkadi Nemirovski is the John P. Hunter, Jr. Chair and Professor at the H. Milton Stewart School of Industrial and Systems Engineering, Georgia Tech. He holds a Ph.D. in Mathematics (1974) from Moscow State University, a Doctor of Sciences in Mathematics (1990) from the USSR Supreme Attestation Board, and an honorary Doctor of Mathematics from the University of Waterloo (2009). Ph.D. in Mathematics, Moscow State University (1974) Doctor of Sciences in Mathematics, USSR Supreme Attestation Board (1990) Doctor of Mathematics (Honoris Causa), University of Waterloo (2009) His research focuses on Optimization Theory and Algorithms , with emphasis on complexity analysis, efficient methods for nonlinear convex programs, robust optimization, optimization under uncertainty, and applications in engineering and nonparametric statistics. He has pioneered advancements in interior-point methods, semidefinite programming, and stochastic approximation, shaping modern convex optimization. His article trends highlight a trajectory from foundational interior-point algorithms (1990s) to robust optimization (2000s) and recent works on first-order methods, polyhedral estimates, and applications in machine learning, signal processing, and tomography. Key subfields include matrix norms , large-scale optimization , and stochastic uncertainty handling . Scientific awards include: 1982 Fulkerson Prize (joint with L. Khachiyan and D. Yudin) 1991 Dantzig Prize (joint with M. Grotschel) 2003 John von Neumann Theory Prize (joint with M. Todd) 2017 Member, National Academy of Engineering 2018 Fellow, American Academy of Arts and Sciences 2020 Norbert Wiener Prize (joint with M. Berger) He has supervised students like Dmitry Gabelev (polynomial-time cutting plane algorithms), Daureen Steinberg (matrix norms in robust optimization), and Eitan Rubinstein (SVMs via advanced optimization), with their works later formalized in academic journals.

• Functional Analysis
• Complex Analysis
• Operator Theory
• +۷ مورد دیگر

Olivia Constantin is an Associate Professor in the Department of Mathematics at the Faculty of Mathematics. She has been actively publishing since 2008, with research contributions in functional analysis, complex analysis, and mathematical fluid dynamics. PhD in Mathematics (implied by academic position and research output) Her research primarily focuses on operator theory on function spaces, especially Fock and Bergman spaces, and the application of complex analysis to fluid flows. Key areas include Hankel operators, integral operators, embedding theorems, and the analysis of water waves and oceanic gyres. Her work combines deep analytical techniques with applications in fluid mechanics. Recent publications show a strong trend toward using complex-analytic methods to study irrotational flows, traveling water waves, and gyre dynamics, indicating an interdisciplinary approach bridging pure and applied mathematics. Her 2025 paper on velocity extrema in ocean gyre flows highlights ongoing contributions to geophysical fluid dynamics. She has led two research projects: Operatorenklassen (2012–2016) and Analysis of Operators on Spaces of Holomorphic Functions (2017–2019), demonstrating sustained research leadership. Active speaker at academic conferences, with 18 recorded scientific activities including talks from 2008 to 2023 Olivia Constantin collaborates with prominent mathematicians such as A. Aleman, J. A. Peláez, A.-M. Persson, and D. Kalaj. She has not received any explicitly mentioned scientific awards. There is no information about her advising students or managing labs or research teams.

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

Andrew Li is an Associate Professor of Operations Research at Carnegie Mellon University's Tepper School of Business since 2024, previously serving as Assistant Professor since 2018. His research bridges statistics, optimization, and machine learning with applications to healthcare operations and retail management. Current teaching: Optimization, Business Analytics Capstone, and Topics in Optimization and Statistics PhD from MIT's Operations Research Center (2018), BS in Operations Research/Applied Mathematics from Columbia University (2012) Research Focus: Dr. Li develops data-driven decision frameworks for complex systems. Key areas include: Experience-based learning models with fairness constraints (organ allocation) Anomaly detection in low-rank matrices (retail inventory accuracy) Nanoparticle-based diagnostic systems for CAD and Alzheimer's Nonstationary demand forecasting in supply chains Publication Trends: Recent work combines bandit algorithms with healthcare applications (split liver transplants, CAD detection) and retail operations (inventory accuracy). Theoretical contributions include regret-optimal policies and entrywise anomaly detection guarantees. Scientific Honors: INFORMS Nicholson Award (2018) INFORMS Pierskalla Award (2021) NSF CAREER Award (2023) Professional Leadership: Active in INFORMS and CMU committees including MBA Analytics Curriculum, Thompson Award, and ENAiBLE AI-driven retail collaborative co-founder since 2021.

• Applied Analysis
• Inverse Problems
• Scientific Machine Learning
• +۷ مورد دیگر

Rima Alaifari is currently an Assistant Professor for Applied Mathematics at ETH Zürich , where she works on applied analysis, inverse problems, and scientific machine learning. Her research emphasizes stability analysis and regularization of inverse problems, applied harmonic analysis, phase retrieval, and operator learning. She is an associated member of the ETH AI Center and will transition to a full professorship at RWTH Aachen University in 2025 as Chair of Analysis and its Applications. Education : PhD in Mathematics (2010–2014, Vrije Universiteit Brussel); MSc in Applied and Industrial Mathematics (2005–2010, Johannes Kepler University) Research Focus : Stability estimates for inverse problems, phase retrieval in wavelet/Gabor transforms, operator learning with neural networks, and deep learning robustness. Article Trends : Her recent work bridges harmonic analysis with machine learning, focusing on phase retrieval stability, adversarial perturbations in imaging, and mathematically grounded neural operator frameworks like ReNO and CNO. Advising : She has supervised PhD students like Tandri Gauksson and Matthias Wellershoff. Former postdoctoral researchers include Francesca Bartolucci (now at TU Delft) and Jesse Railo (Finnish Inverse Prize winner).

Ben Bloem-Reddyمشاهده پروفایل

استادیار

• Machine Learning
• Causal Inference
• Bayesian Methods
• +۳ مورد دیگر

Ben Bloem-Reddy is an Assistant Professor in the Department of Statistics at the University of British Columbia (UBC), Vancouver Campus. His research focuses on statistical theory and applications in machine learning, particularly in causal inference, Bayesian methods, neural networks, and probabilistic models. He advises current students Quanhan (Johnny) Xi, Kenny Chiu, and Gian Carlo Diluvi. His work bridges foundational statistical theory with practical machine learning challenges, including causal discovery, model identifiability, and uncertainty quantification. Recent research explores topics such as latent variable models, generative processes, and symmetry in data and algorithms. His contributions span interdisciplinary areas like particle physics applications and information theory-based compression techniques. Ben’s research trends emphasize advancing theoretical guarantees for modern machine learning systems while addressing real-world problems. His publications frequently intersect with algebraic topology (e.g., cocycles in causal inference) and nonparametric methods. He maintains an active lab within the Department of Statistics, fostering collaborations across UBC’s academic ecosystem. No scientific awards are explicitly listed in the provided information. His advising and grant activities focus on statistical methodology development, as evidenced by his student supervision and published work. His office is located in ESB 3168, and he can be reached at benbr@stat.ubc.ca.

Kavan Modiمشاهده پروفایل

استاد

• Quantum Information Theory
• Quantum Mechanics
• Quantum Physics
• +۶ مورد دیگر

Kavan Modi is a Professor at the School of Physics and Astronomy, Monash University. His research focuses on quantum information theory applied to dynamics, metrology, computation, thermodynamics, and relativity. He leads the Monash Quantum Information Science (MonQIS) group and serves as Director of the Centre for Quantum Technology at Transport for NSW (2022–2024). Education: B.Sc. Engineering Physics (Embry-Riddle Aeronautical University, 2001), M.A. Physics (University of Texas at Austin, 2004), Ph.D. Physics (University of Texas at Austin, 2008). Postdoctoral positions included the Centre for Quantum Technologies (Singapore, 2008–2011) and Clarendon Lab, Oxford (2011–2013). Joined Monash in 2014. Research interests center on quantum dynamics, non-Markovian processes, and their applications in quantum computing and information science. Projects include developing error correction codes, quantum algorithms for network analysis, and mitigating correlated noise in quantum systems. He has authored over 111 publications, with recent work emphasizing non-Markovian characterization, quantum process tomography, and topology-based quantum algorithms. Awards and grants include leadership in multiple Australian Research Council projects. Advising/Grants: Primary Chief Investigator in projects like 'Quantum Software Platform' (2023–2026) and 'Mitigating Correlated Noise in Quantum Machines' (2020–2021). Supervises graduate students and collaborates globally on quantum information science. Labs/Teams: MonQIS group focuses on foundational and applied quantum research, integrating theory and experimental collaborations.