Sunita Sarawagi is a Professor at Computer Science and Engineering , IIT Bombay, and a member of AI Labs@CSE . She is also associated with the Center for Machine Intelligence and Data Science (CMInDS), which she founded in 2020. Education: PhD in Computer Science from UC Berkeley (Thesis: Query Processing in Tertiary Memory Databases), BTech in Computer Science from IIT Kharagpur Research Interests span machine learning , data analytics , graphical models , and structured learning , with applications in text segmentation, sequence modeling, domain adaptation, and human-in-the-loop systems. Her publications reveal a strong focus on integrating data mining with database systems , temporal data analysis , and information extraction using probabilistic methods. Professional Activities include serving on the IEEE John Von Neumann Medal committee (2017-), VLDB 2011 Research Track Co-chair , and multiple program committee roles at top conferences like ICML, KDD, and SIGMOD. Labs & Teams : Leads the SS Lab , a research group focused on probabilistic graphical models, sequence modeling, and data integration techniques.
Nicholas Evans is Distinguished Professor of Linguistics and Director of the ARC Centre of Excellence for the Dynamics of Language (CoEDL) at the Australian National University’s School of Culture, History & Language. His work bridges fieldwork-based language documentation with theoretical questions in typology, cultural evolution, and social cognition. Focus on endangered Australian and Papuan languages Director of ARC Laureate Project on 'The Wellsprings of Linguistic Diversity' Co-leader of SCOPIC (Social Cognition Parallax Corpus) study Collaborator in global linguistic diversity initiatives His research explores how micro-level community multilingualism shapes macro-level linguistic diversity, with fieldwork spanning seven years in remote Indigenous communities. Recent projects include PARABANK (paradigm syncretism analysis) and Southern New Guinea language studies, particularly Nen and Yam family languages. Scientific recognition includes the Ken Hale Award (Linguistic Society of America), Anneliese Maier Forschungspreis, and fellowships in the Australian Academy of Humanities, Australian Social Sciences Academy, and the British Academy.
Stefano Ermon is an Associate Professor in the Department of Computer Science at Stanford University, affiliated with the Artificial Intelligence Laboratory and a Senior Fellow at the Woods Institute for the Environment. His research focuses on advancing machine learning and generative AI techniques to address societal and environmental challenges, including computational sustainability, geospatial analysis, and climate science. He holds a Ph.D. from Cornell University (2015). Education: Ph.D. in Computer Science, Cornell University (2015). Research Interests: Ermon’s work bridges foundational machine learning (e.g., diffusion models, generative AI, and optimization) with applications in sustainability, geospatial analysis (via satellite imagery), and earth observation systems. Notable contributions include predicting poverty using satellite data and developing scalable methods for molecule generation. Articles Trends: His recent work emphasizes diffusion models for generative tasks (e.g., text-to-image, molecule design), geospatial AI (e.g., environmental monitoring), and ethical AI (e.g., bias mitigation in LLMs). He also explores applications in robotics and scientific computing. Awards: He has received prestigious awards, including the ICML 2024 Best Paper Award, Sloan Research Fellowship, Microsoft Research Faculty Fellowship, and the IJCAI Computers and Thought Award. Advising and Grants: Ermon teaches courses like Probabilistic Graphical Models (CS228) and has secured grants from NSF, ONR, AFOSR, and private foundations. His lab develops tools for climate science and sustainable development. Labs/Teams: Leads the Stanford AI Lab group focused on computational sustainability and generative AI, collaborating with institutions like the Woods Institute for environmental applications.
Mark Schmidt is a Professor in the Department of Computer Science at the University of British Columbia, Faculty of Science. He holds the Canada Research Chair in Large-Scale Machine Learning and is a Canada CIFAR AI Chair at the Alberta Machine Intelligence Institute. His research spans multiple centers including CAIDA (Centre for Artificial Intelligence Decision-making and Action), the Data Science Institute, and the Machine Intelligence Learning Discovery (MILD) group. Dr. Schmidt's educational background includes a Ph.D. from UBC (2005-2010), an M.Sc. from the University of Alberta (2003-2005), and a B.Sc. from the University of Alberta (2000-2003). His academic career progressed from Postdoc positions at Simon Fraser University, Ecole Normale Superieure, and UBC to Assistant Professor (2014-2019), Associate Professor (2019-2024), and current Professor (2024-present) at UBC. His research focuses on machine learning optimization, with particular emphasis on improving numerical algorithms for large-scale machine learning applications. His work bridges theoretical optimization and practical applications across computer vision, natural language processing, and reinforcement learning. He has developed numerous optimization techniques including variants of stochastic gradient methods, coordinate descent algorithms, and natural gradient approaches. Analysis of his recent publications reveals a strong focus on optimization for over-parameterized models, particularly transformers and large language models. His work addresses critical challenges in step-size selection, convergence guarantees, and efficient implementation of optimization algorithms. His research has significant implications for training deep neural networks more effectively and understanding why certain optimization methods outperform others in practice. Among his notable awards are the Dorothy Killam Fellowship (2025), Arthur B. McDonald Fellowship (2024), Sloan Research Fellowship (2017), and multiple UBC teaching awards. He has also received the Lagrange Prize in Continuous Optimization and Best Paper Award at AISTATS 2021. Dr. Schmidt actively supervises numerous graduate students, with over 40 PhD and Master's students listed as current or alumni members of his research group. His laboratory maintains strong connections with industry partners, with many alumni securing positions at leading AI companies including Google, Amazon, Meta, and Microsoft.
Claire Bowern is Professor of Linguistics at Yale University specializing in historical linguistics, language documentation, and Australian Indigenous languages. Her research employs computational phylogenetics to study language evolution and supports language revitalization through digital archives and fieldwork methodologies. Recent publications address: Phylogenetic signal in lexical evolution across language families Digital infrastructure for endangered language documentation (FLEx software analysis) Decolonizing linguistics pedagogy and research practices Her work consistently integrates linguistic, anthropological, and computational approaches to analyze language diversity and change. She contributes to global databases including Grambank and D-PLACE, examining links between linguistic, cultural, and environmental patterns.
Jimmy Ba is an Assistant Professor in the Department of Computer Science at the University of Toronto and a CIFAR AI Chair. His research develops efficient learning algorithms for deep neural networks, with applications in reinforcement learning and AI. He completed his PhD under Geoffrey Hinton and holds multiple fellowships including the Facebook Graduate Fellowship. Research Focus: Neural network efficiency, reinforcement learning architectures, and optimization methods for deep learning systems. Teaching: Courses on Neural Networks, Deep Learning, and Inference Algorithms at University of Toronto. Awards: Facebook Graduate Fellowship (2016-2018) Massey College Junior Fellowship
Joseph A. November is an Associate Professor in the Department of History at the University of South Carolina, affiliated with the McCausland College of Arts and Sciences. His research focuses on the history of biomedical computing, distributed computing, and the intersection of technology and medicine. He holds a Ph.D. from Princeton University (2006), an M.A. from the University of Chicago (2002), and a B.A. from Hamilton College (1997). His work includes the award-winning book Biomedical Computing: Digitizing Life in the United States (2012), which explores the co-development of biomedicine and computing technologies. Current projects include Revolutions@home , examining distributed computing in protein folding research, and a biography of computing pioneer Robert S. Ledley. He has received grants from the NSF, NIH, and the Charles Babbage Institute. Teaching interests span the history of science and technology, including courses on the history of medicine, digital humanities, and the role of games in historical education. He actively contributes to professional organizations like SHOT and the History of Science Society. Awards include the Computer History Museum Prize (2013) and the National Institutes of Health DeWitt Stetten Fellowship (2007-2008). His research bridges historical analysis with contemporary issues in technology and biomedical ethics.
Boris Hanin is an Associate Professor at Princeton University's Department of Operations Research and Financial Engineering (ORFE) and Associated Faculty at the Program in Applied and Computational Mathematics (PACM). Prior to Princeton, he held academic positions at Texas A&M University (Assistant Professor of Mathematics), MIT (NSF Postdoctoral Fellow), and Northwestern University (PhD in Mathematics under Steve Zelditch). He works part-time at Foundry, an AI/computing startup, leading the Foundry Institute. PhD in Mathematics, Northwestern University NSF Postdoctoral Fellowship, MIT Mathematics Associate Professor, Princeton ORFE Part-Time Leader, Foundry Institute His research spans machine learning, probability theory, and mathematical physics, focusing on neural network theory (approximation power, optimization guarantees), random matrix theory, and spectral asymptotics. He has made foundational contributions to understanding gradient behavior, initialization, and infinite-width limits in deep learning. Boris has supervised numerous PhD students and postdocs, with former members securing prestigious positions at Harvard, MIT, and Huawei. He serves as Associate Editor for journals like Pure and Applied Analysis and Mathematics of Operations Research , and has taught short courses at Oxford, Luxembourg, and Tor Vergata on statistical physics of neural networks and deep learning theory. 2024 Sloan Fellowship in Mathematics NSF CAREER grant DMS-2143754 NSF grant DMS-2133806 His research group collaborates on topics including hyperparameter transfer, architecture-aware scaling, and spectral analysis of random waves and neural networks. He actively contributes to theoretical machine learning through foundational publications in venues like Probability Theory and Related Fields , Journal of Machine Learning Research , and Communications in Mathematical Physics .
Professor Catherine Greenhill is a faculty member at the School of Mathematics and Statistics, UNSW Sydney , where she serves as Professor and head of the Combinatorics group. Her academic career spans institutions including the University of Queensland, University of Oxford, University of Leeds, University of Melbourne, and Australian National University. D.Phil., University of Oxford (1996) M.Sc. (Research) in Combinatorics (1992) B.Sc. (Hons) in Pure Mathematics (1991) Her research focuses on the intersection of discrete mathematics , theoretical computer science , and probability , particularly in asymptotic combinatorics , probabilistic methods , and analysis of algorithms . Her work includes asymptotic enumeration of combinatorial structures and design of randomized algorithms for graph sampling and counting. Her recent publications (2025–2021) center on random graphs and hypergraphs , with key contributions to switch Markov chains , degree sequence analysis , and chromatic number bounds . These works reflect her expertise in probabilistic combinatorics and algorithmic complexity . Scientific Awards: Fellow of the Australian Academy of Science (2022) Christopher Heyde Medal in Pure Mathematics (2015) June Griffith Fellowship (2013) Hall Medal (2010) Advising and Grants: She has supervised numerous PhD/Masters students and secured multiple ARC Discovery Grants (2019–2021, 2014–2016, 2012–2014). Her grants address topics like hypergraph modeling, random discrete structures, and network analysis in illicit drug trafficking.
Carl Vondrick is a Professor in the Department of Computer Science at Columbia University. His research focuses on creating robust and versatile perception systems that leverage video and interaction with the natural world, with applications in 3D reconstruction, visual question answering, and robot manipulation. Former research scientist at Google Visiting researcher at Cruise Education: PhD (2017) from MIT, advised by Antonio Torralba BS (2011) from UC Irvine, advised by Deva Ramanan His research explores multimodal approaches for cross-task and cross-modal transfer, scene dynamics, audiovisual perception, interpretable models, and spatial awareness systems. The lab emphasizes zero-shot generalization and neuro-symbolic methods while addressing safety and robustness in AI systems. Key publication trends include: 2025: Video generation for robotics 2024: Differentiable rendering and cross-modal reasoning 2023: Robust perception and 3D modeling Scientific Awards: 2024 PAMI Young Researcher Award 2021 NSF CAREER Award Teaching Roles: Teaching Computer Vision II (2021-2025), Computer Vision I (2018-2019), and Representation Learning (2020-2022). Advising: Advises 8 current PhD students and has mentored 5 graduated students now at institutions like MBZUAI and UMD. The lab recruits 1-2 PhD students annually through Columbia’s PhD program. Grants and Collaborations: Funded by NSF, DARPA, Toyota Research Institute, Amazon Research, and Google.
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 .
Jason D. Lee is an associate professor of Electrical Engineering and Computer Sciences (EECS) and Statistics at the University of California, Berkeley. Previously, he held academic positions at Princeton University as an associate professor, and was a research scientist at Google DeepMind. He completed his Ph.D. in Computational and Mathematical Engineering at Stanford University under the advisement of Trevor Hastie and Jonathan Taylor. For students and collaborators, his primary contact email is jasonlee@princeton.edu, though prospective students and postdocs are asked to include "filter_student" in the subject line. Ph.D., Computational and Mathematical Engineering, Stanford University (2015) B.Sc., Mathematics, Duke University (2010) Lee's research lies at the intersection of machine learning, statistics, and optimization, focusing on the theoretical foundations of artificial intelligence. His work addresses fundamental questions in deep learning, including optimization landscapes, representation learning, and reinforcement learning theory. He has made significant contributions to understanding how gradient descent operates in neural network training and has developed provably efficient algorithms for various learning scenarios. His ten most recent publications represent a diverse yet coherent body of work across machine learning theory, focusing on topics such as Gaussian multi-index models, transformer learning capabilities, shallow neural networks, and optimization techniques. These publications appear in top venues including COLT, ICML, NeurIPS, and JMLR. Among his notable accolades are: Samsung AI Researcher of the Year Award (2023) NSF Career Award (2022) ONR Young Investigator Award (2021) Sloan Research Fellow in Computer Science (2019) NIPS Best Student Paper Award (2016) Princeton Commendation for Outstanding Teaching (ECE538B) Lee has advised numerous students including Alex Damian, Wenhao Zhan, Eshaan Nichani, Tianle Cai, Zixuan Wang, and Yunwei Ren. Former advisees have gone on to positions at institutions like NYU Courant, Facebook AI Research, UW, MIT, Duke, and Microsoft Research. His research group and collaborators span multiple institutions, working on theoretical and applied aspects of machine learning and artificial intelligence, with a particular focus on the optimization and learning dynamics of neural networks and transformer models.
Yee Whye Teh is a Professor at the Department of Statistics, University of Oxford, and a research scientist at DeepMind. His work focuses on statistical machine learning, including probabilistic learning, Bayesian nonparametrics, deep learning, and Monte Carlo methods. He co-directs the ELLIS programme on Robust Machine Learning and has held roles such as Programme Co-chair for ICML 2017. Teh has delivered keynotes at UAI 2019, an IMS Medallion Lecture at JSM 2019, and the Breiman Lecture in 2017. His research emphasizes scalable inference algorithms, hierarchical models, and applications in genetics and natural language processing. Teh's educational background includes a PhD from the University of Toronto (2003) and a Master's from the same institution (2000). He has contributed to widely used software tools like the Sequence Memoizer and has been recognized for his work through prestigious lectureships. Research interests span Bayesian nonparametric models, MCMC methods, and their applications in genetics and data compression. His lab collaborates on projects like fragmentation-coagulation processes for genetic variation modeling and Mondrian forests for online learning. Teh advises students through Oxford's graduate programs, though he notes high demand for mentorship. His work often bridges theory and practice, addressing challenges in big data learning and small data problems.
Laurel MacKenzie is an Associate Professor in the Department of Linguistics at New York University (NYU), affiliated with the Faculty of Arts and Science. She specializes in variationist sociolinguistics, dialectology, and language change, with a focus on English and French varieties. Her work integrates quantitative analysis of speech data to explore intra-speaker variation and language evolution. She co-directs the NYU Sociolinguistics Lab and leads the NSF-funded NYC Individual Differences Corpus project, alongside the Our Dialects initiative, an online atlas of British English dialects. Education: PhD in Linguistics, University of Pennsylvania (2012) BA in Linguistics and French, University of California, Berkeley (2006) Research Interests: Morphological and syntactic variation Regional dialects of English and French Linguistic pedagogy and public engagement Recent Projects: Recent work includes publications on participle leveling in English, sociolinguistic replication studies, and grammatical variation analysis. She has also collaborated on dialect mapping tools and consulted for media projects on language change and accents. Awards: No awards explicitly listed in provided texts. Labs/Teams: NYU Sociolinguistics Lab (Co-Director) Our Dialects Project (Academic Lead)
Joshua D. Angrist is the Ford Professor of Economics at the Massachusetts Institute of Technology, where he has been a faculty member since 1996. He is also a co-founder and director of MIT's Blueprint Labs and a Research Associate at the National Bureau of Economic Research. Angrist shares the 2021 Nobel Prize in Economic Sciences with David Card and Guido Imbens for their methodological contributions to the analysis of causal relationships. Angrist received his B.A. from Oberlin College in 1982 and completed his Ph.D. in Economics at Princeton University in 1989. Prior to joining MIT, he taught at Harvard University and the Hebrew University of Jerusalem. His academic journey began somewhat unconventionally, as he left high school early after 11th grade, worked for over a year, and only later discovered his passion for economics through an inspiring teacher at Oberlin. Angrist's research focuses on developing and applying innovative econometric methods to answer important economic questions using natural experiments. His work spans labor economics, education economics, and causal inference methodology. He is particularly known for his contributions to instrumental variables methods and the Local Average Treatment Effect (LATE) framework developed with Guido Imbens. His research explores the economics of education and school reform, the impact of social programs on labor markets, and the effects of immigration and regulation. His recent publications reveal a continued focus on causal inference methods applied to education policy questions, labor market issues, and health economics. The trend shows increasing sophistication in research design, with particular attention to addressing selection bias and developing methods for external validity. His work spans theoretical econometric contributions alongside empirical applications in education, labor markets, and health. Sveriges Riksbank Prize in Economic Sciences in Memory of Alfred Nobel (2021) Fama Prize for Graduate Education (2018) Fellow of the American Academy of Arts and Sciences Fellow of the Econometric Society Angrist is deeply committed to teaching and mentoring. He has developed influential econometrics textbooks including 'Mostly Harmless Econometrics' and 'Mastering Metrics' with Jörn-Steffen Pischke. At MIT, he teaches courses including Labor Economics I (14.661), Econometric Data Science (14.32), and Labor Economics and Public Policy (14.64). He emphasizes selecting UROP students who have mastered foundational economics through courses like 14.64 and 14.32. Beyond MIT, Angrist co-founded Avela, a software startup using cutting-edge research to help schools improve enrollment and operations. Angrist co-founded and directs MIT's Blueprint Labs, which brings together researchers from economics, computer science, and education to develop innovative solutions for educational challenges. Through Blueprint Labs and Avela, his work bridges academic research with practical applications in education policy and technology.
