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

Alp Atakanمشاهده پروفایل

استاد

• Microeconomic Theory
• Game Theory
• Information Economics
• +۳ مورد دیگر

Alp Atakan Overview Alp Atakan is a Professor and Head of School in the School of Economics and Finance at Queen Mary University of London. He holds a PhD from Columbia University and previously served as an Assistant Professor at Northwestern University and Associate Professor at Koç University. His research focuses on Microeconomic Theory, Game Theory, Auction Design, and Information Economics. Key contributions include studies on reputation dynamics, search markets, and information aggregation in auctions. Education PhD in Economics (with distinction), Columbia University, 2003 MA in Economics, Columbia University, 2000 MBA, Columbia University, 1997 BS in Economics, University of Pennsylvania, 1993 Research & Grants Recipient of an ERC Consolidator Grant (2016–2021) for 'Market Selection, Frictions, and the Information Content of Prices'. Notable research includes work on bargaining dynamics, price discovery mechanisms, and the role of information asymmetry in auctions. He has published in top journals like Econometrica , Journal of Economic Theory , and American Economic Review . Teaching spans MBA/EMBA courses on managerial economics and microeconomic theory, alongside advanced graduate courses in game theory and dynamic programming. Grants & Projects ERC Consolidator Grant: Market Selection & Price Information (€1,089,000) Tubitak Grants: Sequential Debate (2014–2015) and Auctions & Information (2012–2014) His work bridges theoretical economics with practical market design, emphasizing strategic interactions in decentralized 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.

Andrew Childsمشاهده پروفایل

استاد

• Quantum Algorithms
• Quantum Information Processing
• Quantum Simulation
• +۲ مورد دیگر

Andrew Childs is a Professor at the University of Maryland, affiliated with the Department of Computer Science and the Institute for Advanced Computer Studies (UMIACS). He serves as Director of the NSF Quantum Leap Challenge Institute for Robust Quantum Simulation (RQS) and is a Fellow at the Joint Center for Quantum Information and Computer Science (QuICS). His research focuses on quantum algorithms for simulating physical systems, algebraic problems, and quantum walk protocols, with applications in quantum computing and computational complexity. University of Maryland Institute for Advanced Computer Studies (UMIACS) Joint Center for Quantum Information and Computer Science (QuICS) NSF Quantum Leap Challenge Institute for Robust Quantum Simulation Childs' research spans quantum simulation, quantum Fourier transform, phase estimation, and Hamiltonian dynamics. He has developed techniques to reduce quantum computational resources for simulating quantum systems and explored limitations of quantum computers through hidden subgroup problems and non-unitary dynamics. His publications cover diverse areas including quantum walk optimization, Hamiltonian simulation methods, and applications to cryptography and condensed matter physics. Recent works address spatial search algorithms, product formulas for commutators, and quantum routing protocols. As an educator, Childs has taught courses on quantum algorithms and information processing at both the University of Maryland and University of Waterloo, with lecture notes and materials spanning multiple years. Contact: amchilds@umd.edu | Office: ATL 3359 | Affiliated with University of Maryland's quantum research institutes.

• Machine Learning
• Deep Learning
• Theoretical Foundations of AI
• +۱۱ مورد دیگر

Mikhail (Misha) Belkin is a Professor at the Halicioglu Data Science Institute (HDSI) at the University of California San Diego , with an affiliated appointment in the Department of Computer Science and Engineering . He is also an Amazon Scholar , reflecting his impactful industry collaboration. Since January 2024, he has served as the Editor-in-Chief of the SIAM Journal on Mathematics of Data Science (SIMODS) . Research Interests: Belkin's research centers on the theoretical foundations of machine learning, particularly the mathematical understanding of modern deep learning. His work investigates interpolation , over-parameterization , and feature learning in neural networks. He is renowned for introducing the double descent risk curve, which reconciles classical bias-variance trade-offs with the success of overfitted models. His recent work identifies the Average Gradient Outer Product (AGOP) as a fundamental mechanism of feature learning, applicable across architectures like CNNs and transformers. Scientific Contributions and Trends: His recent publications, appearing in Science , PNAS , and NeurIPS , demonstrate a strong trend toward unifying theories of generalization and optimization in over-parameterized systems. He explores how interpolating models can be statistically optimal, how gradient descent converges in non-convex landscapes via the PL* condition, and how kernel methods can be enhanced to perform feature learning. ACM Fellow (2023) Editor-in-Chief, SIAM Journal on Mathematics of Data Science (2024–present) Advising and Grants: Belkin actively mentors students and collaborators such as Adityanarayanan Radhakrishnan , Daniel Beaglehole , and Chaoyue Liu , who are frequent co-authors. He is a Principal Investigator (PI) in the Collaboration on the Theoretical Foundations of Deep Learning , funded by the NSF and Simons Foundation. He is also an external collaborator with the Eric and Wendy Schmidt Center at the Broad Institute and part of the NSF-funded TILOS AI Institute . Laboratories and Teams: While not explicitly named, his research group at UCSD is deeply involved in theoretical machine learning, focusing on the intersection of statistics, optimization, and deep learning. His work often involves large-scale collaborations and is closely tied to initiatives like SIMODS and TILOS.

• Artificial Intelligence
• Algorithmic Game Theory
• Multiagent Reinforcement Learning
• +۴ مورد دیگر

Amy R Greenwald is a Professor of Computer Science at Brown University. Her research spans artificial intelligence, algorithmic game theory, and computational economics, with a focus on multiagent reinforcement learning and market equilibrium computation. Education PhD, New York University (1999) MS, Cornell University (1995) MS, Oxford University (1992) BS, University of Pennsylvania (1991) Research Focus Greenwald's work explores strategic interactions in computational systems, including: Game-theoretic modeling of multiagent systems Algorithmic approaches to market equilibrium Simulation-based equilibrium learning Stackelberg game formulations for hierarchical decision making Applications to supply chain negotiations and economic design Her recent publications emphasize tractable equilibrium computation, social influence in economic models, and advanced reinforcement learning techniques for strategic settings. Teaching CSCI 0100 - Data Fluency for All CSCI 0180 - Computer Science: An Integrated Introduction CSCI 1440 - Algorithmic Game Theory CSCI 2440 - Advanced Algorithmic Game Theory CSCI 2951Z - Advanced Algorithmic Game Theory

Murat Erdogduمشاهده پروفایل

استادیار

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

Murat Erdogdu is an Assistant Professor at the University of Toronto, jointly appointed in the Department of Computer Science and Department of Statistical Sciences . He is also a faculty member at the Vector Institute and holds the CIFAR Chair in Artificial Intelligence . PhD in Statistics, Stanford University (advised by Mohsen Bayati and Andrea Montanari) MSc in Computer Science, Stanford University BSc in Electrical Engineering and Mathematics, Bogazici University His research focuses on machine learning theory , high-dimensional statistics , and optimization . He has contributed to understanding gradient-based algorithms, sampling methods, and feature learning in structured data. Recent publications address problems in: Heavy-tailed sampling Mean-field Langevin dynamics Robust feature learning Minimax regression Stochastic optimization under infinite noise Scientific Awards: CIFAR Chair in Artificial Intelligence ICLR 2023 Spotlight NeurIPS 2019 & 2021 Spotlights He teaches graduate courses like STA 414/2104 (Statistical Methods for Machine Learning II) and STA 4273 (Modern Learning Theory) , emphasizing probabilistic modeling and theoretical analysis.

Afonso S. Bandeiraمشاهده پروفایل

استاد

• High Dimensional Probability
• Random Matrices
• Mathematical Statistics
• +۳ مورد دیگر

Afonso S. Bandeira is a Professor in the Department of Mathematics (D-MATH) at ETH Zurich, where he conducts research at the intersection of mathematics, statistics, and computer science. He maintains strong affiliations with several interdisciplinary research centers including the Institute For Operations Research (IFOR), the Max Planck ETH Center for Learning Systems, the ETH Foundations of Data Science, and the ETH AI Center, with a courtesy appointment at D-ITET. Bandeira actively teaches courses including Mathematics of Signals, Networks, and Learning, and Mathematics of Data Science. His research focuses on High Dimensional Probability, Random Matrices, Mathematical Statistics, Theoretical Computer Science, Combinatorics, and Mathematical Optimization. Bandeira's work often explores the theoretical foundations of data science, examining phase transitions in statistical problems, computational barriers, and the geometry of high-dimensional spaces. He maintains a research group blog called Randomstrasse101 that emphasizes open problems in his field. Analysis of his recent publications reveals a strong focus on matrix and tensor concentration inequalities, synchronization problems, nonconvex optimization landscapes, and computational-statistical tradeoffs in high-dimensional inference. His work bridges theoretical mathematics with practical applications in machine learning and data analysis, particularly examining where computational limitations arise in statistical problems. Bandeira actively mentors students and researchers, currently supervising several doctoral candidates including Daniil Dmitriev, Konstantin Donhauser, Anastasia Kireeva, Kevin Lucca, Chiara Meroni, Gil Kur, Petar Nizic-Nikolac, and Almut Roedder. He emphasizes that students working with him should participate in the DACO seminar and group meetings, and encourages prospective students to have completed his Mathematics of Signals, Networks, and Learning or Mathematics of Data Science courses. He leads a research group focused on the mathematics of data science, with regular group meetings and seminars. Bandeira has developed comprehensive lecture notes including 'A Tour Through the Mathematics of Signals, Learning, and Networks' (2025) and 'Mathematics of Machine Learning' (2021), and previously authored 'Ten Lectures and Forty-Two Open Problems in the Mathematics of Data Science' (2015).

Shipra Agrawalمشاهده پروفایل

دانشیار

• Optimization
• Machine Learning
• Multi-Armed Bandits
• +۱۲ مورد دیگر

Shipra Agrawal is an Associate Professor at the Department of Industrial Engineering and Operations Research, Columbia University, with affiliations to the Data Science Institute and the Department of Computer Science. Her research bridges optimization and machine learning, focusing on decision-making in uncertain environments. PhD in Computer Science from Stanford University (2011) Researcher at Microsoft Research India (2011–2015) Her work addresses online optimization , reinforcement learning , and game theory , aiming to develop algorithms that balance exploration and exploitation for long-term goals. Applications include internet advertising , revenue management , and resource allocation . Recent publications examine dynamic pricing models, regret bounds in reinforcement learning, and convex knapsack optimization. Her research has been supported by NSF CAREER , Google Faculty Research , and Amazon Research Awards . NSF CAREER Award CMMI-1846792 (2019) Google Faculty Research Award (2017) Amazon Research Award (2017) She has advised PhD students who now hold positions at institutions like Google DeepMind, Amazon, and Facebook. Agrawal serves as an associate editor for Management Science , INFORMS Journal on Optimization , and Journal of Machine Learning Research , and co-chaired major conferences such as COLT 2024 and AISTATS 2025.

• Optimization
• Complex Networks
• Statistical Inference
• +۳ مورد دیگر

Stefano NASINI is an Associate Professor at the University of Lille 3, specializing in Quantitative Methods within the Economics and Mathematics Sciences. He holds a HDR (Habilitation à Diriger des Recherches) from the University of Lille 3 (2021), a Ph.D. in Statistics and Operations Research from the Polytechnic University of Catalonia (2015), and a Master in Statistics (2011). His research focuses on optimization, complex networks, statistical inference, and microeconomic applications. He has held academic positions including a post-doctoral role at IESE Business School (2014–2016) and a visiting researcher role at the University of Lisbon (2014). His work spans scheduling optimization, network analysis, financial contagion modeling, and energy system planning. Key contributions include specialized algorithms for large-scale optimization problems and frameworks for decentralized portfolio management. He is a member of the LEM research group and teaches courses in optimization, econometrics, and social network analysis at the Grande École and MSc levels. Publications highlight interdisciplinary applications, including network-based diffusion models, multi-market financial strategies, and dynamic choice analysis. His research bridges theoretical advancements in operations research with practical challenges in economics, energy, and transportation systems. No scientific awards are explicitly listed in the provided materials. His advising roles and grants are not detailed here, but his extensive publication record reflects active collaboration within academic and applied domains.

Navid Azizanمشاهده پروفایل

استادیار

• Artificial Intelligence
• Machine Learning
• Control Systems
• +۵ مورد دیگر

Navid Azizan is the Alfred H. (1929) and Jean M. Hayes Career Development Assistant Professor at Massachusetts Institute of Technology (MIT), holding dual appointments in the Department of Mechanical Engineering (in Control, Instrumentation & Robotics) and the Schwarzman College of Computing's Institute for Data, Systems & Society (IDSS). He is also a Principal Investigator in the Laboratory for Information & Decision Systems (LIDS), and a faculty member of the MIT Statistics and Data Science Center, the Center for Computational Science and Engineering, and the Operations Research Center. Dr. Azizan received his PhD in Computing and Mathematical Sciences from the California Institute of Technology (Caltech) in 2020, his MSc in Electrical Engineering from the University of Southern California in 2015, and his BSc in Electrical Engineering with a minor in Physics from Sharif University of Technology in 2013. Prior to joining MIT, he completed a postdoc at Stanford University's Autonomous Systems Laboratory and was a research scientist intern at Google DeepMind. His research spans the intersection of machine learning, systems and control, mathematical optimization, and network science. Dr. Azizan's work focuses on developing principled learning and optimization algorithms for reliable intelligent systems, with applications to autonomy and sociotechnical systems. His research has significant implications for creating trustworthy AI systems that can operate effectively in complex, uncertain environments. Dr. Azizan's recent publications demonstrate a strong focus on uncertainty quantification, reliable AI systems, constrained optimization, and control-oriented learning. His work bridges theoretical foundations with practical applications, particularly in autonomous systems where safety and reliability are paramount. His research group has made notable contributions to areas including neural network verification, multi-agent reinforcement learning, and adaptive inference techniques for large language models, with several papers featured on MIT News and selected for oral presentations at top conferences. Alfred H. (1929) and Jean M. Hayes Career Development Professorship (2025-present) Frank E. Perkins Award for Excellence in Graduate Advising (2025) List of Outstanding Academic Leaders in Data from the CDO Magazine (2024, 2023) Amazon Science Hub Research Award (2023) Outstanding UROP Faculty Mentor (2023) Esther and Harold E. Edgerton (1927) Career Development Chair (2022-2025) Information Theory and Applications (ITA) Gold Graduation Award (2020) Dr. Azizan has been recognized for his excellence in graduate advising, receiving the Frank E. Perkins Award for Excellence in Graduate Advising in 2025. During the pandemic, he founded and co-organized the 'Control meets Learning' virtual seminar series, connecting researchers across disciplines. His work has attracted significant research funding from industry partners including Google, Amazon, and MathWorks, supporting both fundamental research and practical applications in reliable intelligent systems. The Azizan Lab at MIT brings together researchers from mechanical engineering, computer science, and applied mathematics to tackle challenges at the intersection of learning and control. The lab emphasizes both theoretical foundations and practical implementations, with a particular focus on developing algorithms that provide guarantees of performance and safety. Current research directions include uncertainty quantification in AI systems, constrained optimization for neural networks, and control-oriented learning for autonomous systems, with applications spanning robotics, transportation, and complex sociotechnical systems.

Yang Zhouمشاهده پروفایل

دانشیار

• Big Data Algorithms
• Data Mining
• Machine Learning
• +۵ مورد دیگر

Yang Zhou is an Associate Professor in the Department of Computer Science and Software Engineering at Auburn University, part of the Samuel Ginn College of Engineering. His research focuses on big data algorithms, machine learning, data mining, and distributed computing. He has contributed to advancements in federated learning frameworks, graph mining tools, and spatial machine learning for environmental applications like flood mapping. Education includes a Ph.D. in Computer Science from Georgia Tech (2021), M.E. in Computer Application Technology from Chongqing University (2016), and B.E. in Engineering from Jiangnan University (2014). His work emphasizes scalable algorithms for large-scale systems, with tools like DirDense for dense subgraph mining and FedASMU for federated learning optimization. Recent publications explore adversarial robustness, blockchain strategies in IoT, and curriculum-based learning for large language models. He advises on interdisciplinary projects at the intersection of AI and environmental science.

Metin Uyanikمشاهده پروفایل

مدرس ارشد

• Economic Theory
• Game Theory
• Microeconomic Theory
• +۳ مورد دیگر

Dr. Metin Uyanik is a Senior Lecturer at the School of Economics, The University of Queensland. He holds a PhD from Johns Hopkins University (2016) and previously worked as a Postdoctoral Research Fellow at the University of Rochester's Wallis Institute of Political Economy. His research focuses on Economic Theory, Game Theory, Political Economy, Computational Economics, and Mathematical Economics. His work has been published in top-tier journals such as Economic Theory , Games and Economic Behavior , and Journal of Mathematical Economics . Education: Bachelor of Economics, Bogazici University Masters (Research) of Economics, Koc University Doctor of Philosophy, The Johns Hopkins University Research Interests: Dr. Uyanik's research bridges theoretical and applied economics, emphasizing foundational mathematical approaches. His work explores general equilibrium theory, discontinuous games, topological methods in economics, and welfare economics. Key themes include the analysis of non-convex economies, fixed-point theorems, and the integration of axiomatic frameworks with behavioral assumptions. Teaching: He teaches Advanced Microeconomics, Economics for Commerce, and Introduction to Strategic Thinking at UQ. His pedagogical focus includes mathematical rigor and practical applications of economic theory. Collaborations & Future Work: Collaborations with scholars like M. Ali Khan and Richard P. McLean highlight his engagement with complex theoretical frameworks. Ongoing projects include studies on large production economies, myersonian common knowledge, and computational methods in equilibrium analysis.

Hayden Kwok Hay SOمشاهده پروفایل

دانشیار

• Reconfigurable Computing
• FPGA-Based Systems
• Computer Architecture
• +۷ مورد دیگر

Prof. Hayden Kwok Hay SO is an Associate Professor at the University of Hong Kong (HKU), affiliated with the Department of Electrical and Electronic Engineering. He currently serves as Acting Director of the School of Innovation and previously co-directed the Computer Engineering Program. His research focuses on reconfigurable computing systems, FPGA-based architectures, and their applications in AIoT, medical imaging, and high-performance computing. He holds a B.S., M.S., and Ph.D. in Electrical Engineering and Computer Sciences from UC Berkeley (1998–2007). Prof. So has been recognized with awards such as the IEEE-HKN Teaching Award (2021), Croucher Innovation Award (2013), and multiple teaching excellence awards. He leads the Computer Architecture & System Research Lab (CASR) and co-founded the Joint Lab on Future Cities (JLFC). His work spans FPGA overlay architectures, graph processing systems, and hardware-software co-design for efficient computing. Key research contributions include advancements in FPGA-based reconfigurable systems, sparse dataflow architectures, and medical imaging accelerators. He has secured grants for projects like 'Advanced machine vision guided aquatic surface vehicles' and 'Efficient and Productive Parallel Data Processing in Hybrid FPGA-CPU Clusters.' Prof. So has advised numerous students and researchers, contributing to over 150 peer-reviewed publications. His current projects explore AI hardware acceleration, neuromorphic computing, and FPGA-driven solutions for big data challenges.

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.

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)