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

Kevin Jamiesonمشاهده پروفایل

دانشیار

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

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 .

Suhas Diggaviمشاهده پروفایل

استاد

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

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.

• Graph Algorithms
• Optimization
• High-Dimensional Geometry
• +۳ مورد دیگر

Yang P. Liu is an Assistant Professor at Carnegie Mellon University 's Department of Computer Science . He received his PhD from Stanford University under the supervision of Aaron Sidford and previously studied at MIT . Fields of Interest : Graph Algorithms, Optimization, High-Dimensional Geometry, Additive Combinatorics, Theoretical Computer Science. His research focuses on algorithmic design and analysis for graph problems, optimization, and combinatorics, with applications in machine learning and complexity theory. Recent work includes advancements in parallel repetition games , combinatorial lines , and dynamic graph algorithms . In 2024, his research spanned FOCS , STOC , and RANDOM conferences, addressing problems in k-CSPs , min-cost flow , and hypergraph sparsification . Earlier contributions (2023) included deterministic flow algorithms and spectral hypergraph techniques. Scientific Awards : NDSEG Fellowship (2018-2021), Google PhD Fellowship (2022-2023), FOCS Best Paper (2022), STOC Best Student Paper (2022), FOCS Best Student Paper (2021). He teaches CS 15-759 , a graduate course on convex optimization theory and applications, covering gradient descent, interior point methods, and algorithmic sparsification techniques.

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

استاد

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

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

Ashley Montanaroمشاهده پروفایل

استاد

• Quantum Computation
• Quantum Algorithms
• Quantum Information Theory
• +۳ مورد دیگر

Ashley Montanaro is Professor of Quantum Computation in the School of Mathematics at the University of Bristol, and co-founder of the quantum software startup Phasecraft. He is a member of the Quantum Information Theory research group at Bristol. His research focuses on the theory of quantum computing, with particular interest in quantum algorithms, computational complexity, quantum query and communication complexity, and classical algorithms. His work spans both theoretical foundations and practical applications of quantum computing. Montanaro's research output shows significant trends toward quantum algorithms for optimization problems, quantum computational supremacy, and bridging theoretical advances with practical implementation challenges. His publications span foundational quantum information theory to applied quantum algorithms, demonstrating a versatile research program that connects computer science with quantum physics. Among his professional activities, Montanaro served on the QIP steering committee (2016-2018) and was an editor for the Quantum journal until 2019. He has been active in conference organization, serving on program committees for ITCS 2018, AQIS 2017 and 2015, QIP 2015, and TQC 2014 and 2013, reflecting his standing in the quantum computing research community. He has supervised numerous PhD students including Josh Blake, Jorja Kirk, Sheila Perez Garcia, Sami Boulebnane, Jan Lukas Bosse, Lana Mineh, Joao F. Doriguello, Chris Cade, Sam Pallister, and Stephen Piddock. His teaching includes Quantum Computation (MATHM0023) which he has taught since 2014 and Advanced Quantum Information Theory which he taught in 2015 and 2016. As co-founder of Phasecraft, Montanaro is actively translating theoretical quantum computing advances into practical software solutions, positioning him at the intersection of academic research and quantum technology commercialization.

Anoosheh Heidarzadehمشاهده پروفایل

استادیار

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

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.

Alexandre Bouchard-Côtéمشاهده پروفایل

استاد

• Computational Statistics
• Bayesian Inference
• Monte Carlo Methods
• +۴ مورد دیگر

Alexandre Bouchard-Côté is a Professor of Statistics at the University of British Columbia (UBC), affiliated with the Department of Statistics within the Faculty of Science. His research focuses on computational statistics, Bayesian methods, and Monte Carlo techniques, with applications in evolutionary biology, cancer genomics, and computational linguistics. Education : PhD in Computer Science (with Designated Emphasis in Statistics) from UC Berkeley (2010), BSc in Mathematics and Computer Science from McGill University (2005). Affiliations : Director of the Blang probabilistic programming project and leader of the Bouncy Particle Sampler research group. Research Interests : Bouchard-Côté develops scalable Bayesian computational methods, including non-reversible Monte Carlo algorithms like the Bouncy Particle Sampler, and applies these to problems in cancer phylogenetics, evolutionary dynamics, and historical linguistics. His work emphasizes bridging theoretical foundations with practical tools for data science. Publications Trends : Recent work spans distributed sampling frameworks (e.g., Pigeons.jl), variational phylogenetic inference, and cancer clonal evolution modeling. His articles often address algorithmic scalability and interdisciplinary applications in biology and astronomy. Awards : CRM-SSC Prize in Statistics (2024) PIMS-UBC Mathematical Sciences Young Faculty Award (2018) Tweedie New Researcher Award (2016) Advising & Grants : Supervises graduate students (e.g., Son Luu, Nikola Surjanovic) and leads funded projects on distributed MCMC and cancer genomics. Collaborates with institutions like the Simons Foundation and the Canadian Statistical Sciences Institute (CANSSI). Labs/Teams : Core member of the UBC Statistical Machine Learning group, contributing to open-source tools like Blang and the Bouncy Particle Sampler implementation.

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).

Ali Vakilianمشاهده پروفایل

عضو هیئت علمی

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

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.

David Nadlerمشاهده پروفایل

استاد

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

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.

Shirshendu Gangulyمشاهده پروفایل

دانشیار

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

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

• Data Science
• Numerical Optimisation
• Medical Imaging
• +۳ مورد دیگر

Raphael Hauser is an Associate Professor in Numerical Mathematics at the University of Oxford's Mathematical Institute, Director of Graduate Studies - Teaching, and Tanaka Fellow in Applied Mathematics at Pembroke College. His affiliations include membership in the Data Science, Numerical Analysis, and Mathematical and Computational Finance research groups, as well as a fellowship at the Alan Turing Institute. Education: PhD in Operations Research, Cornell University, Ithaca, USA Dipl. Math. ETH, Swiss Federal Institute of Technology (ETH Zurich), Switzerland Research interests span data science, numerical optimisation, medical imaging, distributed computing, and applied probability/statistics. His work integrates mathematical rigor with practical applications, particularly in optimization algorithms, machine learning theory, and medical imaging technology. Publications focus on optimization theory, stochastic processes, medical imaging systems, and computational finance, with recurring themes in non-convex optimization guarantees, PCA variants, and X-ray tomography innovations. Awards: Oxford University Teaching Award (2007) SIAM Optimization Prize (2005) SIAM Student Paper Prize (2000) Advising includes 15+ DPhil students and 40+ MSc students, with projects in optimization, finance, imaging, and machine learning. Current postdocs and students are affiliated with the Alan Turing Institute and industrial partners like Siemens and Macquarie Group. He leads teams in the Mathematical Institute's research groups and collaborates with the Alan Turing Institute on large-scale data science initiatives.

• Set Theory
• Mathematical Logic
• Forcing
• +۷ مورد دیگر

Vera Fischer is an Associate Professor and Privatdozent in the Department of Mathematics at the Faculty of Mathematics, University of Vienna. She has been an active researcher since 2008, with a strong publication record in mathematical logic and set theory. Her research centers on set-theoretic combinatorics , focusing on cardinal characteristics of the continuum, forcing, definability, and structures such as maximal almost disjoint families, cofinitary groups, and independent families. She investigates foundational questions in independence, spectra of combinatorial objects, and the interplay between definability and generic extensions. Her work often involves constructing models to separate cardinal invariants or to realize specific spectra under forcing. The recent publications show a consistent trend in combinatorial set theory , with a focus on tower spectra, tight families, mad families, and their behavior under various forcing notions like Cohen and Sacks forcing. Her research frequently explores the definability and destructibility of combinatorial families, often in collaboration with leading researchers such as Corey B. Switzer, Stefan Geschke, and Saharon Shelah. FWF START Prize, 2017 Förderungspreis der ÖMG, 2018 Förderungspreis, 2018 She leads and participates in research projects such as Comparing the Real Line to Combinatorics of the Uncountable and A Sacks-like model with large continuum , indicating active grant funding and supervision of research activities. She also organizes academic events like Colloquium Logicum and engages in public outreach on topics like infinity. Her research is conducted within the Set Theory Group at the University of Vienna, where she collaborates with other logicians and contributes to the academic community through publications, conferences, and mentorship.

Jonathan A. Kelnerمشاهده پروفایل

استاد

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

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.

Kurt Johanssonمشاهده پروفایل

استاد

• Probability Theory
• Mathematical Physics
• Random Matrix Theory

Kurt Johansson is a Full Professor of Mathematics at KTH Royal Institute of Technology, Sweden. His academic journey includes roles as Associate Professor at KTH (1993-2001) and Uppsala University (1988-1993), alongside research funded by the Swedish Natural Science Research Council (1998-2003). His primary affiliations are within the Department of Probability, Mathematical Physics & Statistics at KTH, where he also coordinates courses on Differential Equations and Fourier Analysis. Education: BSc in Physics (1982) and PhD in Mathematics (1988), both from Uppsala University. Research interests focus on Probability Theory , Mathematical Physics , and Random Matrix Theory , with contributions to stochastic models, determinantal processes, and universality in statistical mechanics. Key Awards: Wallenberg Prize (1995), Rollo Davidson Prize (2000), Göran Gustafsson Prize (2002), Fellow of the American Mathematical Society (2012), and multiple Wallenberg Scholar grants (2011-2023). Grants: Major funding from the Swedish Research Council (VR), K&A Wallenberg Foundation, and others. His research group explores Random Matrices, Stochastic Models, and Analysis , with notable work on the Arctic Circle Theorem and KPZ universality class. Recent publications analyze Brownian directed percolation and domino tilings of the Aztec diamond, reflecting his focus on interdisciplinary applications of probability and mathematical physics.