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

Kevin Jamieson is an Associate Professor at the Paul G. Allen School of Computer Science & Engineering and an Adjunct Professor in the Department of Statistics at the University of Washington . His academic journey includes a B.S. (2009) , M.S. (2010) , and Ph.D. (2015) in electrical engineering from the University of Washington, Columbia University, and University of Wisconsin–Madison respectively. He completed a postdoc at UC Berkeley's AMP Lab before joining UW in 2017. Ph.D., Electrical Engineering, University of Wisconsin–Madison (2015) M.S., Electrical Engineering, Columbia University (2010) B.S., Electrical Engineering, University of Washington (2009) Jamieson's research lies at the intersection of interactive machine learning , active learning , and sequential decision making . His work focuses on: Adaptive sampling strategies in multi-armed bandits and reinforcement learning (RL) Developing instance-dependent optimal algorithms that adapt to problem difficulty Applications in robotics , human perception studies , and hyperparameter optimization Representation learning for large models and experimental design frameworks His 15 most recent publications (2025-2022) demonstrate expertise in bandit theory , contextual RL , and game-theoretic learning . Notable trends include sample-efficient optimization , adaptive A/B testing , and sim-to-real transfer in robotics. Jamieson has received: NSF CAREER award for foundational contributions Amazon Faculty Research award for innovation in learning systems He actively recruits graduate students and postdocs , emphasizing collaboration in areas like: Multi-agent RL and strategic actor learning Empirical process suprema and adaptive sampling theory Applications in robotics , large language model finetuning , and biomedical data analysis Jamieson leads the Washington AI Lab (WAIL) and develops open-source learning systems like the NEXT framework for real-world adaptive data collection. He serves as co-PI for the Institute for the Foundations of Data Science (IFDS) and co-organizes the Distinguished Seminar in Optimization & Data .

• Machine Learning
• Active Learning
• Multi-Armed Bandits
• +۴ مورد دیگر

Suhas Diggavi is a Professor in the Department of Electrical and Computer Engineering at the University of California, Los Angeles, within the Henry Samueli School of Engineering and Applied Science. His primary research area is Signals and Systems, with a strong focus on information theory and its interdisciplinary applications. His research interests span Information Theory , Machine Learning , Differential Privacy , Federated Learning , Cyber-Physical Systems , and Bio-informatics . He investigates fundamental limits and practical algorithms for secure, efficient, and robust data processing in distributed and networked environments. The recent publications highlight a strong trend in privacy-preserving machine learning, particularly in the shuffled model of differential privacy , communication-efficient distributed SGD , and robust optimization . His work bridges theoretical information-theoretic foundations with real-world applications in federated learning, wireless networks, and genomic data analysis. Notable scientific awards include: Guggenheim Foundation Fellow (2021) ACM CCS Best Paper Award (2021) IEEE Fellow (2013) IEEE Donald G. Fink Prize Paper Award (2006) Multiple Google, Amazon, and Facebook Research Awards Suhas Diggavi actively advises graduate students and leads a research group focused on learning, information, and optimization. His work is supported by major industry grants and collaborations, particularly in privacy and distributed learning. He has made significant contributions to information-theoretic models in bio-sequencing and wireless security. He leads the LIOS (Learning, Information, Optimization, and Stochastic Systems) research group at UCLA, where his team develops theoretical frameworks and practical algorithms for next-generation data-driven systems.

• Information Theory
• Machine Learning
• Differential Privacy
• +۹ مورد دیگر

Anoosheh Heidarzadeh is an Assistant Professor in the Department of Electrical and Computer Engineering at Santa Clara University's School of Engineering. He holds a Ph.D. in Electrical and Computer Engineering from Carleton University (2012) and previously served as a Visiting Assistant Professor at Texas A&M University (2018-2022) and Associate Research Scientist at the same institution (2015-2017). His postdoctoral research was conducted at the California Institute of Technology (2013-2014). His research focuses on: Information and coding theory : Fundamental limits of data transmission and storage systems Private and secure computing : Protocols for confidential data processing in networked environments Fault-tolerant distributed systems : Resilient computation frameworks for large-scale applications Distributed machine learning : Scalable algorithms for collaborative learning architectures Recent publications (2021-2022) demonstrate strong emphasis on privacy-preserving computation (covering 73% of articles) and distributed coding techniques (67% of articles), with innovations in private information retrieval, matrix operations, and group testing methodologies. Theoretical contributions dominate (87%), while 13% address applied challenges like COVID-19 screening.

• Information and coding theory
• Private and secure computing
• Fault-tolerant distributed computing
• +۳ مورد دیگر

Ali Vakilian is a Research Assistant Professor at the Toyota Technological Institute at Chicago (TTIC), with a strong academic background in theoretical computer science and algorithms. He will join the Department of Computer Science at Virginia Tech as an Assistant Professor in Fall 2025. His research bridges algorithmic theory and machine learning, focusing on scalable, fair, and efficient algorithms for massive data. Education: Ph.D. in EECS, Massachusetts Institute of Technology (MIT), advisors: Erik Demaine and Piotr Indyk M.S. in Computer Science, University of Illinois at Urbana-Champaign (UIUC), advisor: Chandra Chekuri B.S. in Computer Engineering, Sharif University of Technology Research Interests: Ali Vakilian's work centers on the algorithmic foundations of machine learning and data science. He develops streaming, sketching, and sublinear-time algorithms for massive datasets, and pioneers learning-augmented algorithms that use machine learning predictions to improve performance while maintaining worst-case guarantees. His research in trustworthy ML includes algorithmic fairness, fair clustering, and learning with strategic agents. He also contributes to combinatorial optimization and approximation algorithms for network design, set cover, and low-rank approximation. His recent publications (2023–2025) show a consistent focus on fair clustering (individual and group fairness), streaming graph algorithms , learning-augmented methods , and frequency estimation . These works appear in top venues such as NeurIPS, ICML, SODA, and ICALP, often with recognitions like oral or spotlight presentations. Scientific Awards: Outstanding Student Paper Highlight Award, AISTATS 2024 Notable-top-25% paper, ICLR 2023 Oral presentation, AISTATS 2024 Spotlight presentation, NeurIPS 2023 Advising and Grants: Ali Vakilian mentors several students and interns, including summer interns at TTIC and Fatima Fellows. His research is supported by the National Science Foundation (TRIPODS program), as noted in the press coverage of his work on LearnedSketch. He actively contributes to the academic community through advising, organizing workshops (e.g., Algorithms with Predictions, Learning-Augmented Algorithms), and serving on program committees (e.g., NeurIPS, ICML, AISTATS). Labs and Teams: He is affiliated with the theory and algorithms group at TTIC and collaborates with researchers at MIT, UIUC, and other institutions. His work on learning-augmented algorithms has led to influential workshops and collaborations with leading figures such as Piotr Indyk and Erik Demaine.

• Algorithmic Foundations of Machine Learning
• Data Science
• Streaming Algorithms
• +۱۸ مورد دیگر

David Nadler is a Professor in the Department of Mathematics at the University of California, Berkeley, appointed in 2012. His research centers on geometric representation theory and symplectic geometry, with significant contributions to the Langlands program, microlocal sheaf theory, and symplectic topology. He maintains an active research group and teaches courses ranging from undergraduate linear algebra to graduate algebraic topology and geometry. Nadler's research explores the interface of algebraic geometry, topology, and representation theory. His work in geometric representation theory focuses on Langlands duality, Springer theory, and Betti geometric Langlands. In symplectic geometry, he investigates microlocal sheaves, Fukaya categories, and Weinstein structures. His recent publications demonstrate a consistent focus on categorical methods in geometric Langlands correspondence and symplectic arborealization. His publications consistently emphasize categorical and geometric approaches to representation theory. Recent works cluster in three areas: (1) extensions of the geometric Langlands program to Betti cohomology settings, (2) microlocal analysis of sheaves on symplectic manifolds, and (3) combinatorial models in symplectic topology. This reflects sustained development of 'Betti geometric Langlands' as a distinct research program bridging topology and automorphic forms. Nadler has advised over a dozen PhD students since 2012, with dissertations spanning geometric representation theory, symplectic geometry, and algebraic topology. Student projects frequently investigate categorical aspects of geometric Langlands, microlocal sheaves, and combinatorial models in symplectic topology.

• Geometric Representation Theory
• Symplectic Geometry
• Langlands Duality
• +۳ مورد دیگر

Shirshendu Ganguly is an Associate Professor in the Department of Statistics at the University of California, Berkeley. His research focuses on probability theory, statistical physics, and their applications, including percolation models, phase transitions, Markov chains, and random graphs. He holds a PhD in Mathematics from the University of Washington and has held postdoctoral positions at UC Berkeley. Ganguly has been recognized with the 2019 Sloan Research Fellowship. Education: PhD in Mathematics, University of Washington, 2011–2016 Miller Postdoctoral Fellow, UC Berkeley, 2016–2018 Research Interests: Probability Theory, Statistical Mechanics, Markov Chains, Random Graphs, Percolation Theory, Sparse Combinatorial Structures His work explores geometric and probabilistic phenomena in disordered systems, including polymer models, self-organized criticality, and random matrix theory. He has advised multiple PhD students and contributes to teaching advanced probability courses at Berkeley. Awards: 2019 Sloan Research Fellowship

• Probability Theory
• Statistical Mechanics
• Markov Chains
• +۳ مورد دیگر

Ivan Dokmanic is an Assistant Professor at the Coordinated Science Laboratory (CSL) within the University of Illinois . His research bridges signal processing , machine learning , and applied inverse problems , with a focus on acoustics, biomedical imaging, and distance geometry. Current Role : Assistant Professor, CSL Email : dokmanic@illinois.edu Research Interests : Dokmanic explores machine learning applications in inverse problems , particularly distance geometry for molecular imaging and acoustics . His work includes unlabeled sensing , where distances between points are known but their arrangement is not. This has implications for powder diffraction , indoor localization , and echo modeling . Article Trends : His recent publications emphasize distance geometry in machine learning , acoustic signal processing , and inverse problem theory . Key areas include molecular imaging , audio encryption , and sensor positioning . Collaborative work spans medical imaging , cyberphysical systems , and geometric invariants . 2016 Google Faculty Award NSF Grant (1 year, $157,079) Students and Grants : Dokmanic mentors PhD students like Puoya, Shuai, and Anadi. His research is funded by the National Science Foundation , Google , VISA , and nVidia .

• Machine Learning
• Signal Processing
• Inverse Problems
• +۱۱ مورد دیگر

Jonathan A. Kelner is a Professor of Applied Mathematics in the Department of Mathematics at the Massachusetts Institute of Technology (MIT) and a member of the MIT Computer Science and Artificial Intelligence Laboratory (CSAIL). His research focuses on applying techniques from pure mathematics to solve fundamental problems in algorithms and complexity theory, with the goal of developing practical algorithms for real-world questions. Dr. Kelner received his undergraduate degree from Harvard University and his Ph.D. in Computer Science from MIT in 2006. Before joining the MIT faculty, he spent a year as a member of the Institute for Advanced Study. His educational background has provided a strong foundation for his interdisciplinary research spanning mathematics and computer science. His research interests include combinatorial optimization, mathematical programming, spectral graph theory, distributed computing, machine learning, computational geometry and topology, computational biology, signal processing, and random matrix theory. Kelner's work demonstrates how deep theoretical insights can lead to practical algorithmic improvements, particularly in graph algorithms and optimization problems. His approach often involves connecting seemingly disparate areas of mathematics to create novel algorithmic techniques. Analysis of his recent publications reveals a strong focus on spectral graph theory, optimization algorithms, and the Sum-of-Squares method. His work frequently addresses fundamental questions in theoretical computer science with practical implications for algorithm design. A notable trend in his research is the development of nearly-linear-time algorithms for various graph problems, which represents significant improvements over previous approaches. NSF CAREER Award Alfred P. Sloan Research Fellowship NEC Award for Research in Computers and Communication Sprowls Doctoral Dissertation Award Best Student Paper Award at STOC 2004 Best Paper Award at STOC 2011 Kokusai Denshin Denwa Junior Faculty Chair 2008 Harold E. Edgerton Faculty Achievement Award 2011 School of Science Award for Excellence in Undergraduate Education 2012 Professor Kelner has been actively involved in mentoring students and has received recognition for his teaching excellence, including the School of Science Award for Excellence in Undergraduate Education in 2012. His research has been supported by prestigious grants including the NSF CAREER Award. He has collaborated extensively with researchers across multiple institutions, often working with other leading figures in theoretical computer science to produce groundbreaking results in algorithm design. At MIT, Kelner is part of both the Mathematics Department and CSAIL, positioning him at the intersection of theoretical mathematics and practical computer science. This dual affiliation reflects the interdisciplinary nature of his work, which bridges pure mathematical theory with concrete algorithmic applications.

• Algorithms
• Spectral Graph Theory
• Combinatorial Optimization
• +۷ مورد دیگر

Huazheng Wang is an Assistant Professor in the School of Electrical Engineering and Computer Science at Oregon State University. His research focuses on reinforcement learning, information retrieval, and trustworthy AI. He received his Ph.D. from the University of Virginia (2021) and B.E. from the University of Science and Technology of China (2015). He holds awards including the 2025 EECS Fabulous Teacher Recognition and SIGIR 2019 Best Paper Award. His work addresses challenges in robust reinforcement learning, adversarial attacks on bandit systems, and applications in scientific discovery. Education: Ph.D., Computer Science, University of Virginia (2021) B.E., Computer Science and Technology, University of Science and Technology of China (2015) Research interests emphasize developing efficient algorithms for reinforcement learning, multi-armed bandits, and their applications in recommendation systems, protein optimization, and security. Notable contributions include provably efficient risk-aware reinforcement learning frameworks and adversarial attack analysis on bandit systems. Recent work includes NSF-funded research on neural bandits (IIS-2403401) and publications in top venues like ICML, NeurIPS, and AAAI. His lab explores embodied LLM agents for team cooperation and federated collaborative online monitoring frameworks.

• Reinforcement Learning
• Information Retrieval
• Machine Learning
• +۴ مورد دیگر

Euiwoong Lee is an Assistant Professor in the Computer Science and Engineering Division at the University of Michigan. He holds a PhD from Carnegie Mellon University, advised by Venkatesan Guruswami, and has held postdoctoral positions at New York University and the Simons Institute for the Theory of Computing. His research focuses on approximation algorithms, hardness of approximation, and parameterized complexity. **Education:** PhD in Computer Science, Carnegie Mellon University (2017), advised by Venkatesan Guruswami Postdoctoral Fellowships: NYU (2017–2020), Simons Institute (2017–2020) **Research Interests:** Approximation Algorithms & Hardness of Approximation Convex Hierarchies (e.g., Sum-of-Squares) Clustering Algorithms (e.g., Correlation Clustering) Parameterized Complexity Facility Location & Metric Optimization **Awards:** Edmund M. Clarke Doctoral Dissertation Award (2017) Simons Award for Graduate Students in Theoretical Computer Science **Advising & Grants:** PhD Students: Anthony Della Pella, Aditya Anand, Amatya Sharma, Ian DeHaan Co-organizes the Michigan Theory Seminar **Labs/Teams:** Collaborates with researchers in approximation algorithms, optimization, and theoretical computer science at the University of Michigan and beyond.

• Approximation Algorithms
• Hardness of Approximation
• Discrete Optimization
• +۳ مورد دیگر

William Gasarch is a Professor of Computer Science at the University of Maryland, College Park, with an affiliation in Mathematics. He holds a Ph.D. from Harvard University (1985) and a B.S. from SUNY Stony Brook (1980). His research focuses on complexity theory, combinatorics, and Ramsey Theory, with applications to computer science theory. Education: Ph.D., Harvard University, 1985 (Computer Science) B.S., SUNY Stony Brook, 1980 (Math and Applied Math) Research Interests: Gasarch specializes in theoretical computer science, particularly applying Ramsey Theory to computational problems. His work bridges combinatorics, logic, and algorithm design, emphasizing foundational questions in complexity theory. He is known for exploring how Ramsey Theory informs program termination proofs and lower bounds in computational models. Labs/Teams: Affiliated with the Computer Science department’s theory group, he contributes to collaborative projects on Ramsey applications and combinatorial algorithms. His REU (Research Experiences for Undergraduates) program highlights mentorship in combinatorial algorithms. Advising & Grants: Mentored numerous high school and undergraduate students, including Breakthrough Prize winner Jacob Lurie and Intel Science Talent finalist Louis Wasserman. Active in NSF-funded initiatives through UMD’s theory group (details unspecified).

• Complexity Theory
• Concrete Complexity Theory
• Combinatorics
• +۳ مورد دیگر

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.

• Parallel Computing
• Algorithms
• Computer Architecture
• +۳ مورد دیگر

Ahmed El Alaoui is an Assistant Professor in the Department of Statistics and Data Science at Cornell University, with a secondary affiliation in the Department of Computer Science. He joined Cornell in 2021 after completing a postdoctoral fellowship at Stanford University under Andrea Montanari. His research focuses on high-dimensional statistics, probability theory, algorithms on random structures, and statistical physics, with particular emphasis on spin glasses and algorithmic thresholds. El Alaoui holds a PhD in Electrical Engineering and Computer Sciences from UC Berkeley (2018), advised by Michael I. Jordan, and a Master's from Ecole Normale Supérieure/Ecole des Ponts Paristech. His work bridges theoretical and applied domains, addressing challenges in high-dimensional inference, computational trade-offs, and probabilistic models. He has contributed to foundational results in random matrix theory, detection limits in spiked models, and algorithmic approaches to complex systems. His teaching includes courses on high-dimensional statistics, probability models, and theoretical computer science. He has been recognized for his innovative approaches to sampling and optimization in disordered systems, with publications in top journals like Annals of Probability and venues such as NeurIPS and FOCS. El Alaoui's research explores the interplay between statistical physics principles and algorithm design, aiming to uncover computational barriers in high-dimensional problems. His lab develops methodologies for analyzing complex systems and improving the efficiency of statistical estimation in challenging scenarios.

• High-Dimensional Statistics
• Probability Theory
• Algorithms on Random Structures
• +۴ مورد دیگر

Alan Hammond is a Professor in the Department of Statistics at the University of California, Berkeley. His research focuses on rigorous mathematical probability techniques applied to problems in statistical mechanics, including percolation theory, polymer models, and random growth processes. He has contributed to understanding critical phenomena, phase transitions, and universality classes in stochastic systems. Hammond's work spans topics such as KPZ universality, Brownian motion, and the geometry of random media. He has investigated models like last passage percolation, self-avoiding walks, and tug-of-war games, often uncovering deep connections between stochastic processes and nonlinear PDEs. His teaching includes courses on stochastic processes and statistical theory at both graduate and undergraduate levels. Notable research highlights include studies on fractal properties of Airy processes, stability in dynamical last passage percolation, and the behavior of geodesics in random environments. His contributions bridge probability theory with applications in physics and combinatorics.

• Statistical Mechanics
• Mathematical Probability
• Probability Theory
• +۵ مورد دیگر

Nathan (Nati) Linial is a Professor at the School of Computer Science and Engineering at the Hebrew University of Jerusalem, where he has been a faculty member since completing his postdoctoral period at UCLA. He earned his undergraduate degree in mathematics from the Technion and his PhD in graph theory from the Hebrew University. His research spans multiple areas of theoretical computer science and mathematics, with primary focus on combinatorics, theoretical computer science, and bioinformatics. Linial's work has made significant contributions to high-dimensional combinatorics, expander graphs, metric embeddings, and computational molecular biology. His research often bridges geometry, analysis, and combinatorial structures, demonstrating deep connections between seemingly disparate mathematical fields. Linial's recent publications reveal a strong trend toward high-dimensional combinatorial structures, including simplicial complexes, hypertrees, and high-dimensional permutations. His work frequently employs probabilistic methods, linear programming techniques, and geometric approaches to solve fundamental combinatorial problems. The breadth of his research is evident in both pure mathematical contributions and applications to computational biology. Fellow of the American Mathematical Society ISI Highly Cited Researcher Conant Prize (2008) for the influential survey paper "Expander graphs and their applications" Linial has served on the editorial boards of several prestigious journals including the Israel Journal of Mathematics (as Chief Editor 2013-2017), Random Structures and Algorithms, and Combinatorica. His academic leadership extends to organizing conferences and workshops in combinatorics and theoretical computer science. He has mentored numerous students whose work spans theoretical computer science, combinatorics, and computational biology. Linial is associated with research projects including ProtoNet (for protein sequence classification) and EVEREST (for evolutionary conserved protein domains), demonstrating his commitment to interdisciplinary research that bridges computer science with molecular biology.

• Combinatorics
• Theoretical Computer Science
• Bioinformatics
• +۶ مورد دیگر