Find Academic Supervisors

Hima LakkarajuView profile

Assistant Professor

• Trustworthy AI
• Machine Learning
• Fairness
• +8 more

Hima Lakkaraju is an Assistant Professor at Harvard University with dual appointments in the Harvard Business School and the Department of Computer Science. Her research focuses on trustworthy AI, including machine learning interpretability, fairness, privacy, and safety. She holds a PhD from Stanford University and has received accolades such as the Alfred P. Sloan Fellowship and NSF CAREER Award. Her work bridges algorithmic foundations and societal implications of AI, with applications in healthcare, policy, and business. Education: PhD in Computer Science from Stanford University (2013-2017). Academic background includes roles at IBM Research, Microsoft Research, and Adobe. Research Interests: Algorithmic Foundations of AI Interpretability and Explainable AI Fairness and Bias Mitigation Privacy-Preserving ML Generative Models and LLMs Ethical AI Policy and Regulation Key Achievements: Over 100 publications in top venues like NeurIPS and ICML; co-founder of the Trustworthy ML Initiative; featured in MIT Tech Review, Forbes, and Harvard Business Review. Current projects include the AI4LIFE research group and work on regulatory frameworks for AI. Advising and Grants: Supervises over 30 students across PhD, master's, and postdoc levels. Research supported by NSF, Sloan Foundation, Schmidt Sciences, Google, Amazon, and others. Initiatives include the Regulatable ML workshop and NeurIPS ethics co-chair roles. Labs and Collaborations: Leads Harvard's AI4LIFE group and collaborates with industry partners like Fiddler AI. Active in policy discussions on AI regulation and societal impact.

• High-Performance Computing
• Reconfigurable Computing
• FPGA Acceleration
• +7 more

Carlos Alvarez Martinez is a faculty member at the Universitat Politècnica de Catalunya (UPC), affiliated with the Department of Computer Architecture at the Barcelona School of Informatics (FIB). He is a key member of the Programming Models (PM) research group and collaborates closely with the Barcelona Supercomputing Center (BSC). His research focuses on high-performance computing, FPGA acceleration, task-based programming models like OmpSs, and hardware-software co-design for heterogeneous systems. His research interests center on advancing parallel computing through innovative programming models and hardware acceleration. He investigates efficient task scheduling, resource management in multicore and FPGA-based systems, and runtime support for dataflow models. His work enables high-performance execution of complex applications in domains such as scientific computing and cyber-physical systems. He actively contributes to European initiatives like TEXTAROSSA and AXIOM, aiming to develop next-generation exascale supercomputing technologies. The trend in his recent publications shows a strong focus on leveraging FPGAs for HPC, optimizing SpMV operations, improving task scheduling with hardware support, and developing frameworks for multi-FPGA clusters. His work consistently bridges theoretical models with practical implementations, emphasizing performance, scalability, and energy efficiency in heterogeneous computing environments. Scientific Awards: Premi UPC al Compromís Social 2019 Premi Disseny per al Reciclatge 2013 Alvarez Martinez has advised or collaborated with several doctoral students, including Jaume Bosch, Xubin Tan, and Fahimeh Yazdanpanah. He has been involved in numerous competitive R&D projects, often related to high-performance computing and parallel programming models. His work includes significant contributions to educational innovation, particularly in active learning methodologies and formative assessment using interactive systems. He leads and participates in research labs and teams focused on programming models and computer architecture, notably the PM group at UPC/BSC. These teams develop runtime systems, compilers, and hardware accelerators to push the boundaries of parallel computing efficiency and programmability.

• VLSI Design
• Computer-Aided Design
• Spectral Graph Theory
• +4 more

Zhuo Feng is Professor of Electrical and Computer Engineering at Stevens Institute of Technology, directing the HUDSON Lab and holding a Ph.D. from Texas A&M University. His research develops spectral graph methods for VLSI design, including circuit simulation, power grid verification, and machine learning applications. Funded by NSF CAREER and multiple grants, his work has produced award-winning algorithms like GRASS for graph sparsification. Recent publications focus on spectral methods for circuit stability analysis, physics-informed neural networks, and explainable AI frameworks. He teaches graduate courses in VLSI design and GPU programming while co-founding LeapLinear Solutions. NSF CAREER Award (2014) ACM/IEEE DAC Best Paper Award (2013) Multiple Best Paper Nominations (ICCAD 2008, 2006)

Clyde KruskalView profile

Associate Professor

• Parallel Computing
• Algorithms
• Computer Architecture
• +3 more

Clyde Kruskal is an Associate Professor in the Department of Computer Science at the University of Maryland, College Park. His research focuses on parallel architectures, models, and algorithms. He earned a Ph.D. from New York University in 1981 and a bachelor’s degree from Brandeis University in 1976. His work includes foundational contributions to parallel computing, such as the read–modify–write concept in distributed systems. Kruskal’s research spans topics like interconnection networks, synchronization mechanisms, and algorithm design for parallel systems. Education: Bachelor’s Degree: Brandeis University, 1976 Master’s Degree: New York University (Courant Institute), 1978 Ph.D.: New York University (Courant Institute), 1981 Research Interests: Parallel computing architectures, parallel algorithms design, multiprocessor synchronization, interconnection networks, and computational geometry problems like graph coloring and visibility analysis. His work emphasizes theoretical foundations and practical implementations in parallel systems. Notable Contributions: Kruskal co-authored the book Problems With A Point: Exploring Math And Computer Science (2019), and his research includes foundational papers on parallel prefix operations, sparse matrix algorithms, and synchronization protocols. His publications span over three decades, reflecting sustained contributions to parallel computing theory and practice. Advising & Outreach: He has mentored students through programs like the Summer Combinatorial Algorithms REU at UMD, fostering undergraduate research in algorithm design and parallel computing.

Bryon AragamView profile

Associate Professor

• Causality
• Statistical Machine Learning
• Probabilistic Modeling
• +6 more

Bryon Aragam is an Associate Professor of Econometrics and Statistics and Robert H. Topel Faculty Scholar at the University of Chicago Booth School of Business. His research focuses on the intersection of causality, statistical machine learning, and probabilistic modeling, with particular emphasis on applications to artificial intelligence systems including large language models like ChatGPT and generative models like DALL-E. Dr. Aragam completed his PhD in Statistics and a Masters in Applied Mathematics at UCLA, where he was an NSF graduate research fellow. Prior to joining the University of Chicago, he was a project scientist and postdoctoral researcher in the Machine Learning Department at Carnegie Mellon University. Research Focus: Causal structure learning in probabilistic generative models Key Areas: Causal machine learning, deep generative models, latent variable models, statistical learning theory Applications: AI interpretability, ethics, and fairness in artificial intelligence systems Teaching: Business Statistics, Econometrics and Statistics Colloquium His recent publications demonstrate a strong theoretical foundation combined with practical applications, particularly in understanding and improving AI systems. His work spans causal discovery, graphical models, deep learning, and latent variable modeling, with particular attention to the theoretical properties of these methods and their applications to real-world AI challenges. The research shows a progression toward increasingly complex problems in causal representation learning and AI interpretability. Scientific Awards: Robert H. Topel Faculty Scholar NSF Graduate Research Fellow Dr. Aragam's work has been published in top statistics and machine learning venues including the Annals of Statistics, Neural Information Processing Systems (NeurIPS), the International Conference on Machine Learning (ICML), and the Journal of Machine Learning Research (JMLR). His research group publishes broadly across both statistical and machine learning communities, demonstrating the interdisciplinary nature of his work at the intersection of statistics, machine learning, and causal inference. As a data science consultant for technology and marketing firms, Dr. Aragam has applied his expertise to problems in survey design, customer retention, logistics, and ranking, bridging the gap between theoretical research and practical applications.

Soroosh ShafieeView profile

Assistant Professor

• Optimization under Uncertainty
• Robust Optimization
• Optimal Transport
• +3 more

Soroosh Shafiee is an Assistant Professor in the School of Operations Research and Information Engineering at Cornell University since July 2023. Before joining Cornell, he held postdoctoral positions at the Tepper School of Business (Carnegie Mellon University) and the Automatic Control Laboratory (ETH Zurich). He earned a B.Sc. and M.Sc. in Electrical Engineering from the University of Tehran and a Ph.D. in Operations Research from École Polytechnique Fédérale de Lausanne (EPFL). His research focuses on optimization under uncertainty, robust optimization, optimal transport, and their applications in machine learning and finance. Specific interests include designing algorithms for data-driven optimization, analyzing statistical and computational complexity, and exploring nonconvex optimization structures. Swiss National Science Foundation Early PostDoc Mobility Fellowship (2020) PhD Thesis Distinction Award, EPFL (2020) His work bridges theoretical foundations with practical applications, contributing to areas such as distributionally robust optimization, Wasserstein-based methods, and scalable algorithm development. His research has been published in top venues like Journal of Machine Learning Research and Operations Research .

Elette BoyleView profile

Associate Professor

• Cryptography
• Computer Security
• Coding Theory
• +7 more

Elette Boyle is an Associate Professor at Reichman University (IDC Herzliya) and a Senior Scientist at NTT Research . She holds a Ph.D. in Mathematics from MIT (advised by Shafi Goldwasser and Yael Tauman Kalai) and an undergraduate degree from Caltech . Education Ph.D. in Mathematics, MIT B.S. in Mathematics, Caltech Her research focuses on cryptographic solutions for secure data processing , particularly in secure multi-party computation , function/homomorphic secret sharing , and distributed point functions . Recent work explores topology-hiding communication , memory checking complexity , and sublinear-communication MPC . Key trends in her publications include: Advancements in Function Secret Sharing for branching programs and sparse vectors. Efficient Secure Multi-Party Computation protocols with preprocessing. Information-theoretic and computational Topology-Hiding Broadcast schemes. Optimized Oblivious Transfer with constant computational overhead. Scientific Awards European Research Council (ERC) Award Israeli Science Foundation (ISF) Grant United States Air Force Office of Scientific Research (AFOSR) Grant Google Research Scholar Award International Association for Cryptologic Research (IACR) Recognition As Director of the Foundations & Applications of Cryptography (FACT) Research Center , she leads collaborative work with institutions like Technion Israel , Cornell University , and NTT Research . Her students include Pierre Meyer (Ph.D.) , Matan Hamilis (Ph.D.) , and D'or Banon (MSc.) .

Pengtao XieView profile

Associate Professor

• Machine Learning
• Natural Language Processing
• Machine Learning for Healthcare
• +4 more

Pengtao Xie is an Associate Professor (tenured) in the Department of Electrical and Computer Engineering at UC San Diego, with cross-appointments in the Division of Biomedical Informatics and affiliations across multiple schools and institutes including the Halıcıoğlu Data Science Institute, School of Biological Sciences, and Skaggs School of Pharmacy. His research bridges human-inspired machine learning and healthcare applications. Education: PhD in Machine Learning, Carnegie Mellon University (2018) MS from Tsinghua University BS from Sichuan University Research Interests: His work focuses on machine learning inspired by human learning strategies , including learning by testing, interleaving, self-explanation, and teaching. These techniques are applied to large language models , foundation models , healthcare , and biomedicine . Recent efforts emphasize generative AI for medical image segmentation and protein function prediction. Scientific Awards: NIH MIRA Award (2025) NSF Career Award (2024) Best Graduate Teacher Award, ECE UCSD (2023) ICLR Notable-Top-5% Paper (2023) Global Top-100 Chinese Young Scholars in AI (2022) Tencent Faculty Award (2021) AMIA Doctoral Dissertation Award Finalist (2020) Siebel Scholarship (2014) Teaching & Mentorship: He has developed and taught courses such as Deep Generative Models , Probabilistic Graphical Models , and Linear Algebra and Applications . He actively mentors PhD, master's, and undergraduate students, with alumni now at CMU, Stanford, Mila, and industry roles. Labs & Teams: He leads a research group within the Center for Machine-Intelligence, Computing and Security and collaborates with the Institute for Genomic Medicine and Institute of Engineering in Medicine at UC San Diego.

Mathias DrtonView profile

Professor

• Graphical models
• Algebraic statistics
• Causal inference
• +3 more

Prof. Mathias Drton holds the Chair of Mathematical Statistics at the Technical University of Munich (TUM), within the Department of Mathematics and School of Computation, Information and Technology. His research focuses on graphical models, algebraic statistics, causal inference, and multivariate data analysis. He has authored numerous publications in top-tier journals and conferences, including work on conditional independence, sparse factor analysis, and causal discovery in linear models. Drton has supervised a large number of theses, mentoring students in areas like high-dimensional statistics, graphical models, and causal inference. He is actively involved in teaching advanced courses such as 'Graphical Models in Statistics' and 'Fundamentals of Mathematical Statistics.' His academic contributions span theoretical developments in statistical methodology and computational tools, including R packages like SEMID and symRC . Drton collaborates internationally, contributing to projects like the TUM-ICL Mathematical Sciences Hub and Exzellenzcluster MCQST. His work bridges algebraic methods with statistical challenges, addressing identifiability in latent variable models and robust graphical modeling under non-Gaussian assumptions. Recent research emphasizes causal structure learning under partial homoscedasticity, distribution-free independence tests, and multi-domain causal representation learning. Drton’s lab actively explores applications in genomics, epidemiology, and machine learning, leveraging both theoretical rigor and practical computational methods.

Piotr IndykView profile

Professor

• High-dimensional computational geometry
• Data stream algorithms
• Sparse recovery
• +3 more

Piotr Indyk is the Thomas D. and Virginia W. Cabot Professor in the Department of Electrical Engineering and Computer Science (EECS) at MIT. He is co-director of the Foundations of Data Science Institute (FODSI) and a member of MIT's Theory of Computation Group, Computer Science and Artificial Intelligence Lab (CSAIL), and multiple research initiatives like Wireless@MIT and Big Data@CSAIL. Education: Magister (MA) in Computer Science, University of Warsaw (1995) Ph.D. in Computer Science, Stanford University (2000), advised by Rajeev Motwani Research Interests: Focuses on high-dimensional computational geometry, data stream algorithms, sparse recovery, compressive sensing, and machine learning. His work includes foundational contributions like locality-sensitive hashing (LSH), the Sparse Fourier Transform, and efficient similarity search algorithms. Key Contributions: Known for developing FALCONN (Fast Approximate Nearest Neighbor Search library), and for pioneering work in sub-linear algorithms, streaming algorithms, and geometric computing. Awards: ACM Paris Kanellakis Award (2012) ACM Fellow (2015) Simons Investigator (2013) Member, National Academy of Sciences (2024) Member, American Academy of Arts and Sciences (2023) Teaching & Mentorship: Advised numerous PhD/MSc students and postdocs, and taught courses on geometric computation, streaming algorithms, and algorithmic aspects of embeddings. Labs & Teams: Leads research in areas like FODSI, geometric algorithms, and data science at MIT's CSAIL.

Minyi HuangView profile

Professor

• Mean Field Stochastic Control
• Stochastic Algorithms in Multi-Agent Systems
• Wireless Networks
• +4 more

Minyi Huang is a Professor in the School of Mathematics and Statistics at Carleton University. His research focuses on Mean Field Stochastic Control, Stochastic Algorithms in Multi-Agent Systems, and Wireless Networks. He holds a Ph.D. from McGill University (2003) and has held postdoctoral positions at the University of Melbourne and the Australian National University. Dr. Huang is a Fellow of IEEE and a Member of SIAM. Education: Ph.D. in Electrical and Computer Engineering, McGill University (2003) M.Sc. in Systems and Control, Chinese Academy of Sciences (Beijing) B.Sc. in Mathematics, Shandong University (Jinan, China) Research Interests: Huang's work centers on stochastic control, mean field games, and multi-agent systems. His contributions include theoretical advancements in mean field social optimization, graphon-based control frameworks, and applications in wireless networks and economic models. He has organized workshops on Mathematical Cybernetics and Stochastic Processes, fostering interdisciplinary collaboration. Scientific Awards: Fellow of the IEEE Advising & Grants: Huang has advised numerous graduate students on topics in stochastic control and mean field theory. His grants include funding for international PhD students through Carleton's initiatives. He collaborates on projects involving mean field models for production output and social dynamics. Labs/Teams: Associated with the Ottawa-Carleton Institute for Mathematics and Statistics (OCIMS), contributing to collaborative research in control theory and applied mathematics.

Dan KowalView profile

Associate Professor

• Bayesian Statistics
• Functional Data Analysis
• Mixed Data Modeling
• +6 more

Dan Kowal is an Associate Professor in the Department of Statistics and Data Science at Cornell University, joining in 2024. His research focuses on Bayesian models for large/dependent data, mixed data modeling, and interpretable uncertainty quantification. Key areas include public health, environmental justice, epidemiology, and economics. He holds a PhD from Cornell University (2017) and previously served as an Assistant Professor at Rice University. Awards include the Blackwell-Rosenbluth Award (2021), Army Research Office Young Investigator Award (2020), and Lindley Prize Honorable Mention (2024). Notable grants include NSF funding for adaptive dependent data models (2022–2025) and Army Research Office support for Bayesian prediction methods (2020–2022). His work addresses racial inequities in statistical modeling and has been published in top journals like JASA and Bayesian Analysis. He advises multiple PhD students and develops R packages (e.g., SeBR, countSTAR) for Bayesian regression and data synthesis. Teaching roles include Bayesian Statistics at both undergraduate and graduate levels.

Abhijit SarkarView profile

Professor

• Dynamics
• Probabilistic Mechanics
• Uncertainty Quantification
• +5 more

Abhijit Sarkar is a Professor in the Department of Civil and Environmental Engineering at Carleton University, Ottawa. His work centers on computational dynamics and probabilistic modeling, with office MC 3076 in the Minto Centre for Advanced Studies in Engineering and contact details including phone (613) 520-2600 x6320 and email abhijit_sarkar@carleton.ca . Education: D.Phil. from University of Oxford M.Sc. from Indian Institute of Science (IISc) B.E. from Calcutta University Professional Engineer (P.Eng.) designation His research drives innovation in uncertainty quantification for complex engineering systems. Core interests include dynamics of nonlinear structures, probabilistic mechanics for stochastic finite element methods, and Bayesian inference frameworks for parameter estimation. He pioneers scalable high-performance computing solvers for large-scale systems and sparse learning algorithms to address overfitting in statistical modeling. Recent publications (2022-2024) reveal three dominant trends: (1) Bayesian model calibration for stochastic compartmental systems applied to epidemiology and aerospace, (2) domain decomposition techniques for scalable uncertainty quantification in stochastic PDEs, and (3) sparse learning methods for nonlinear aerodynamic encoding. Key applications span wind turbine vibration analysis, flutter margin prediction, MEMS resonator optimization, and geospatial pandemic modeling. Scientific awards: No awards, fellowships, or medals listed in the source material Graduate supervision includes 6 current students (Ajay Kumar, John Clarabut, Nastaran Dabiran, Sakhi Mittal, Michael Pantano, Brandon Robinson) and 18 graduated students across 17 years (2006-2023). His research leverages high-performance computing for projects in structural dynamics, aeroelasticity, and computational epidemiology, frequently co-supervised with Dominique Poirel and Chris Pettit. Notable grants focus on wind tunnel validation for nonlinear systems and pandemic spread modeling. Based in the Minto Centre for Advanced Studies in Engineering, his computational mechanics group develops algorithms for stochastic dynamics using Carleton University's high-performance computing infrastructure. Collaborations span aerospace engineering (flutter analysis), civil infrastructure (seismic wave propagation), and public health (Covid-19 modeling).

Daniel B. SzyldView profile

Professor

• Numerical Analysis
• Scientific Computing
• Numerical Linear Algebra
• +12 more

Daniel B. Szyld is a Professor in the Department of Mathematics at Temple University's College of Science and Technology. He is co-Director of the High-Performance Computing for Scientific Applications Professional Science Master’s program and a member of the Center for Computational Mathematics and Modeling. He holds leadership roles as President of the International Linear Algebra Society (ILAS, 2020–2026) and as a Board of Trustees member at ICERM (2024–2028), and previously served as Vice-President of SIAM (2014–2015). His research interests include Numerical Analysis , Scientific Computing , Numerical Linear Algebra , Iterative Methods , Preconditioning , Domain Decomposition , and High-Performance Computing . His work often focuses on Krylov subspace methods like GMRES, block solvers, and asynchronous algorithms, with applications in large-scale scientific simulations. The 15 most recent publications reflect a strong focus on enhancing the stability, convergence, and performance of iterative solvers, especially GMRES variants and domain decomposition methods. Topics include random sketching, deflation, weighted norms, multisketching in QR factorization, and asynchronous Schwarz methods. These works appear in top journals such as SIAM Journal on Matrix Analysis and Applications , Numerische Mathematik , and Electronic Transactions on Numerical Analysis , often in collaboration with leading researchers in the field. Scientific Awards and Recognitions: Commemorative medal, Charles University of Prague, 1997 Featured in Hall of Fame by Henk van der Vorst, SARA, 2010 Dean's Distinguished Award for Excellence in Research, Temple University, 2011 Fellow, American Mathematical Society, 2017 Fellow, Society for Industrial and Applied Mathematics, 2017 Achievement in Mathematics Award, Temple University, 2018 Faculty Senate Outstanding Service Award, Temple University, 2021 Daniel B. Szyld has served on the editorial boards of numerous prestigious journals, including Mathematics of Computation , Linear Algebra and its Applications , Numerical Linear Algebra with Applications , and was Co-Editor-in-Chief of Electronic Transactions on Numerical Analysis (2005–2013) and Editor-in-Chief of SIAM Journal on Matrix Analysis and Applications (2015–2020). His research has been supported by the National Science Foundation and the Department of Energy. He has advised students and postdocs, though specific names are not listed in the provided text. He is also involved in professional service through societies such as SIAM, AMS, ILAS, and NAM, and advocates for equity and ethical engagement in mathematics. Labs and Research Groups: He is a member of the Center for Computational Mathematics and Modeling at Temple University and co-Director of the High-Performance Computing for Scientific Applications Professional Science Master’s program, indicating active leadership in computational research and training.

Cameron MuscoView profile

Assistant Professor

• Theoretical Computer Science
• Machine Learning
• Numerical Linear Algebra
• +3 more

Cameron Musco is an Assistant Professor in the Manning College of Information and Computer Sciences at the University of Massachusetts Amherst. He is affiliated with the Theory Group and conducts research at the intersection of theoretical computer science, numerical linear algebra, and machine learning. His work focuses on randomized algorithms, streaming, and distributed computation, with applications in data science. Education: PhD in Computer Science, MIT (2019) BS in Computer Science and Applied Mathematics, Yale University Research Interests: Musco's research emphasizes algorithm design for large-scale data analysis, including fast randomized methods for linear algebraic problems. He explores topics such as low-memory computation, matrix approximations, and graph algorithms, driven by applications in machine learning and distributed systems. Publications: His recent work spans advancements in hierarchical matrix approximation, graph-based nearest neighbor search, and fair resource allocation, reflecting expertise in both theoretical foundations and practical algorithmic innovation. Awards: He has received an NSF Career Award, Google Research Scholar Award, and recognition for anti-racism leadership. He actively reviews for top conferences in theoretical computer science and machine learning. Advising & Grants: Musco advises multiple PhD students and has grants from NSF and Google. His lab collaborates on projects like low-rank matrix approximation and causal discovery. Labs/Teams: He is part of the Theoretical Computer Science Group and the Center for Data Science at UMass.