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.
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.
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.
Liza Rebrova is an Assistant Professor in the Department of Operations Research and Financial Engineering (ORFE) at Princeton University's School of Engineering and Applied Science. She is also an associated faculty member of the Program in Applied and Computational Mathematics (PACM) and the Center for Statistics and Machine Learning (CSML). Her research focuses on randomized numerical linear algebra and the mathematics of data science, with connections to high-dimensional probability and stochastic optimization. She develops mathematically justified randomized algorithms for large-scale data, particularly interested in settings where data exhibits mathematical structure such as spectral decay, multi-modality, or non-negativity. Her work addresses challenges in data compression, recovery, and optimization under structured noise conditions. Dr. Rebrova's recent publications show a strong trend toward developing robust algorithms for linear systems, tensor data compression, and nonnegative matrix factorization. Her work bridges theoretical foundations with practical applications in machine learning and data science, with emphasis on memory efficiency and handling corrupted or incomplete data. NSF DMS-2309685 (Single PI, 2024-2026): "Outliers are not what they seem: data-aware, flexible, and robust randomized iterative methods" NSF DMS-2108479 (Collaborative, 2022-2024): "Fast, Low-Memory Embeddings for Tensor Data with Applications" (co-PIs Mark Iwen and Deanna Needell) She currently advises three PhD students (Jackie Lok, Shambhavi Suryanarayanan, and Sofiia Shvaiko) and has previously advised Abraar Chaudhry (PhD 2024) and Nicolo Grometto (Masters thesis 2023). At Princeton, she teaches graduate courses including ORF526 (Graduate Probability), ORF387 (Networks), and ORF523 (Convex and Conic Optimization).
Robert Ghrist is the Andrea Mitchell University Professor at the University of Pennsylvania with dual appointments in the Department of Mathematics and the Department of Electrical and Systems Engineering. He serves as Associate Dean for Undergraduate Education for Penn Engineering. His educational background includes a B.S. in Mechanical Engineering from the University of Toledo (1991), and M.S. and Ph.D. degrees in Applied Mathematics from Cornell University (1994, 1995). Ghrist's research bridges pure and applied mathematics, focusing on applied algebraic topology , dynamical systems , and geometric methods in data science. His work extends to network theory, topological data analysis, and computational geometry, with applications spanning robotics, neuroscience, and social dynamics. Key innovations include developing sheaf-theoretic approaches for networked systems and persistence homology techniques for high-dimensional data. Analysis of his recent publications reveals a strong emphasis on lattice-theoretic frameworks , topological robotics , and network dynamics , with emerging applications in neural data interpretation and geometric computing. His research consistently integrates category theory with real-world engineering challenges. Significant scientific recognition includes: Presidential Early Career Award (PECASE, 2004) Scientific American 'Top 50' Research Leader (2007) Mathematical Association of America's Chauvenet Prize (2013) University of Pennsylvania Lindback Award for Distinguished Teaching (2015) DoD National Security Science and Engineering Faculty Fellowship (NSSEFF, 2015) Ghrist leads multiple federally funded research initiatives supported by AFOSR, DARPA, NSF, and ONR. He directs the development of educational tools including the Calculus BLUE/GREEN Project video series and custom GPTs for mathematical pedagogy. His open online courses have reached over 100,000 learners globally.
Wendy Ju is an Associate Professor of Information Science at Cornell Tech, with appointments in the Cornell Ann S. Bowers College of Computing and Information Science, the Jacobs Technion-Cornell Institute, and the Technion-Israel Institute of Technology. Previously, she served as executive director of interaction design research at Stanford University's Center for Design Research and as an associate professor of interaction design at the California College of the Arts. Her work bridges human-computer interaction, design, and robotics with a focus on how interactive devices can communicate with people without interrupting them. PhD in Mechanical Engineering from Stanford University Master's degree in Media Arts and Sciences from MIT Professor Ju's research centers on implicit interactions, human-robot collaboration, and automotive interfaces. She investigates how people interact with automated systems in natural contexts, develops methods for early-stage prototyping of autonomous technologies, and examines the social implications of robotics in urban environments. Her work spans from theoretical frameworks to practical applications, with particular emphasis on designing systems that integrate seamlessly into human activities without demanding constant attention. Her recent publications reveal a strong trajectory toward understanding human-robot interaction in public urban spaces, with increasing focus on robot navigation in city streets, the social implications of autonomous vehicles, and the integration of generative AI in design processes. Her work consistently bridges theoretical HCI frameworks with practical applications in transportation, urban design, and everyday robotics. Inducted into the ACM SIGCHI Academy (2025) Multiple Honorable Mention Awards at ACM CHI and DIS conferences Best Paper Award at Multimodal Technologies and Interaction (2023) Best Student Paper Award at IEEE Intelligent Vehicles Symposium (2017) Best Demonstration Award at HRI (2017) Professor Ju actively mentors numerous PhD and master's students, many of whom have become leading researchers in HCI and robotics. Her research has been supported by significant grants from NSF and industry partners, enabling extensive field studies of human-robot interaction in real-world settings. She has pioneered methodologies for studying autonomous vehicle interactions through both simulated and naturalistic driving environments. Her work with the Jacobs Technion-Cornell Institute supports interdisciplinary research at the intersection of computing, design, and urban technology. She has established research partnerships with transportation authorities, automotive companies, and urban planning organizations to study how emerging technologies can enhance urban mobility while respecting human needs and social contexts.
Andreas Bode is a Research Fellow at the University of Wuppertal, where he is part of the group led by Sascha Orlik in the Department of Mathematics. His research focuses on D-modules on rigid analytic spaces, integrating geometric representation theory and nonarchimedean geometry. His research interests span several areas of algebraic geometry and number theory, including the study of p-adic differential operators, nonarchimedean geometry, and representation theory. He explores the interplay between D-modules and rigid analytic spaces, contributing to the understanding of holonomicity, Auslander regularity, and the application of almost mathematics in p-adic contexts. His work bridges geometric and analytic approaches to problems in nonarchimedean settings. Bode's recent publications include advancements in the theory of Auslander regularity for p-adic structures, contributions to the holonomicity of D-cap-modules on rigid analytic spaces, and explorations into locally analytic representations of p-adic groups. His work often intersects with homological algebra and functional analysis, reflecting a deep engagement with both theoretical and methodological challenges in nonarchimedean geometry. He has not been mentioned as having received any scientific awards in the provided texts. Bode's current role as a postdoctoral researcher does not involve formal academic advising of students. No grants are specifically mentioned in the provided information. He is affiliated with the Algebra and Number Theory group at the University of Wuppertal, collaborating with colleagues such as Sascha Orlik and contributing to the broader research community in nonarchimedean geometry.
Snježana Babić serves as Associate Professor and Head of the Graduate Study Program Informatics - Teaching Major at the Faculty of Informatics in Pula , University of Pula. With a PhD obtained in 2016 and university affiliation since 2017, she teaches across undergraduate and graduate programs focusing on ICT fundamentals, web design, digital competencies, and informatics education methodology. Her educational background includes graduation in 1993 followed by doctoral studies culminating in 2016. Though specific institutions aren't detailed in the text, her career trajectory shows progression from foundational ICT teaching to specialized informatics education leadership. Babić's research centers on educational technology adoption with particular emphasis on programming pedagogy for young learners through the MEMA method. Her work investigates digital competencies across multiple educational contexts, from primary schools to higher education. Recent publications demonstrate rapid adaptation to emerging technologies, with 2025 studies examining ChatGPT integration in Croatian educational settings and cross-cultural applications of programming methods. Analysis of her 15 most recent publications reveals consistent focus on technology acceptance models applied to Croatian educators and students. The research trajectory shows evolution from foundational e-learning systems (2016-2020) to cutting-edge AI and robotics applications (2022-2025), maintaining strong methodological focus on teacher motivation , implementation barriers , and culturally-specific adoption factors . Her teaching portfolio demonstrates deep integration with research interests: Undergraduate: ICT Fundamentals, Web Design and Application Graduate: Digital Competencies in Education, Informatics Education Methodology, Practicum for IT Educators Cross-disciplinary: ICT in Nursing, Healthcare Informatics Babić actively contributes to institutional leadership as program head while maintaining robust research productivity. Her work bridges theoretical technology adoption frameworks with practical implementation challenges in Croatian educational contexts, particularly examining how emerging technologies like humanoid robots and AI assistants can be effectively integrated into teaching practices.
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.
Karl Gustafsson is a Professor at Stockholm University within the Department of Economic History and International Relations. His work bridges security studies , collective memory , and digital research methods in international relations. Current Role: Professor of International Relations, Stockholm University Previous Positions: Post-Doc at Lund University, Researcher at Swedish Institute of International Affairs Visiting Appointments: University of Tokyo, Osaka University, Keio University, Academia Sinica, Nordic Institute of Asian Studies Research Focus: Karl specializes in memory politics , ontological security , and anxiety-driven international dynamics , particularly in Sino-Japanese relations and digital platforms . His studies explore how historical narratives and online memory construction influence state identity and policy. Awards & Grants: Recipient of the Wang Gungwu Prize (2014) and Stockholm University Association’s award (2011). Holds Swedish Research Council and Marianne & Marcus Wallenberg Foundation grants for projects on apologies in international politics and digital memory in East Asia . Publications: His work appears in journals such as International Studies Quarterly , European Journal of International Relations , and Memory Studies , addressing topics like narrative power in East Asia, anxiety’s role in policy change , and digital humanities applications in IR.
Daniel M. Roy is a Full Professor at the University of Toronto, with cross-appointments in the Department of Computer Science, Department of Statistical Sciences, and Department of Electrical and Computer Engineering. He serves as Research Director at the Vector Institute and holds the CIFAR Canada AI Chair. Research Focus: Foundational principles of prediction, inference, and decision-making under uncertainty across machine learning, statistics, mathematical logic, applied probability, and computer science. Scientific Contributions: Key work in learning theory, statistical network analysis, probabilistic programming, and information-theoretic frameworks for generalization. Awards: ICML 2024 Best Paper Award for "Information Complexity of Stochastic Convex Optimization" and promotion to Full Professor in 2024. Student Advising: Actively mentors Ph.D. candidates and postdoctoral researchers with strong quantitative backgrounds, particularly at the intersection of machine learning, statistics, and computer science. Email: daniel.roy@utoronto.ca
Christopher Potts is Professor and Chair of Linguistics at Stanford University, with a courtesy appointment as Professor of Computer Science. He serves as Director Emeritus of the Stanford Center for the Study of Language and Information (CSLI) and leads the Pragmatic Enrichment & Contextual Interface Lab. His work bridges theoretical linguistics and computational approaches to language understanding. Education: B.A. in Linguistics from New York University (1999) Ph.D. in Linguistics from University of California, Santa Cruz (2003) Potts' research focuses on how computational methods can illuminate linguistic phenomena, particularly in the areas of semantics, pragmatics, and sentiment analysis. His work explores how emotion is expressed in language and how linguistic production and interpretation are influenced by context. He has made significant contributions to understanding conventional implicatures, sentiment analysis frameworks, and the application of neural networks to linguistic problems. His recent work has increasingly focused on the interpretability of large language models and the development of frameworks like DSPy for building reliable AI systems. An analysis of Potts' recent publications reveals a strong trend toward the intersection of linguistic theory and practical AI applications. His work spans theoretical linguistics (e.g., compositionality, preposing constructions), neural network interpretability, and practical NLP systems (e.g., ColBERT, DSPy). The research demonstrates consistent focus on making language models more transparent, controllable, and linguistically informed, with particular attention to how context shapes meaning. Scientific Awards: Best Paper Award at 2024 ACL for 'Mission: Impossible Language Models' Outstanding Paper Award at 2024 ACL for 'CausalGym' ACL Test of Time Award 2023 Dean's Award for Distinguished Teaching (2015-2016) Best New Data Set or Resource Award at 2015 EMNLP Potts has secured numerous research grants as PI or Co-PI from major organizations including Google, Amazon, NSF, Office of Naval Research, and Stanford's HAI institute. His current projects focus on evaluation of retrieval-augmented generation systems, LLM-mediated communication in organizations, interpretability techniques for language models, and frameworks like DSPy for building next-generation AI systems. He has mentored numerous researchers who have gone on to make significant contributions in NLP and computational linguistics. As Director of CSLI (2013-2020) and current Chair of Linguistics at Stanford, Potts has played a key leadership role in shaping interdisciplinary research at the intersection of language, computation, and cognition. His Pragmatic Enrichment & Contextual Interface Lab continues to be a hub for innovative research combining formal linguistic theory with cutting-edge computational methods.
Aditya Guntuboyina is an Associate Professor in the Department of Statistics at the University of California, Berkeley. He has held this position since January 2012, following a postdoctoral stint at the Wharton Statistics Department and a PhD in Statistics from Yale University (2011) under Professor David Pollard. He earned his B.Stat and M.Stat degrees from the Indian Statistical Institute, Kolkata. PhD: Statistics, Yale University (2011) B.Stat/M.Stat: Indian Statistical Institute, Kolkata His research focuses on nonparametric and high-dimensional statistics , particularly shape-constrained estimation and Bayesian/Empirical Bayes methods . Key themes include convex regression, isotonic regression, mixture models, and total variation denoising. Recent publications analyze multivariate scale mixtures, convergence rates, and suboptimality of least squares in constrained settings. Aditya has supervised multiple PhD students in the Berkeley Statistics and EECS programs. He teaches courses such as Time Series Analysis (Stat 153/248), Data, Inference, and Decisions (Data 102), and advanced probability (Stat 201A). His work often intersects with machine learning, optimization, and information theory. Scientific contributions include theoretical advances in shape-restricted regression, adaptation in log-concave density estimation, and risk bounds for convex-constrained models. He has published in top journals like Annals of Statistics , Journal of the Royal Statistical Society: Series B , and IEEE Transactions on Information Theory .
Jacob Fox is a Professor at Stanford University, specializing in Combinatorics and Probability. His research focuses on extremal combinatorics, Ramsey theory, graph theory, and additive combinatorics. He advises students like Maya Sankar. His work explores structural and enumerative aspects of graphs, hypergraphs, and combinatorial configurations. Recent studies include advancements in Ramsey numbers, sumset theory, and probabilistic methods in discrete mathematics. Key research areas include Ramsey numbers for sparse structures, hypergraph properties, and applications of combinatorial geometry. His publications often bridge theoretical insights with algorithmic applications. No scientific awards are listed in the provided text. His advising includes Maya Sankar, with research aligned to combinatorial problems. Collaborative projects involve extremal graph theory and probabilistic combinatorics. No labs or dedicated research groups are explicitly mentioned.
Arthur Gretton is a Professor at University College London (UCL), leading the Gatsby Computational Neuroscience Unit and serving as director of the Centre for Computational Statistics and Machine Learning. He also works as a Research Scientist at Google DeepMind. His research focuses on causal inference, representation learning, and nonparametric hypothesis testing with applications in machine learning and computational neuroscience. Academic Affiliations Gatsby Computational Neuroscience Unit, UCL Centre for Computational Statistics and Machine Learning, UCL Google DeepMind Arthur's research spans several key areas in modern machine learning, including: Kernel methods for causal effect estimation and two-sample testing Deep learning architectures for proxy causal learning with complex confounding Adaptive gradient flows for generative modeling Nonparametric statistical tests with theoretical guarantees Applications in distributional reinforcement learning and Bayesian inference His work addresses both methodological advancements and practical implementations, particularly for high-dimensional data settings. Recent publications demonstrate his focus on causal inference with hidden confounders (AISTATS 2025), deep learning adaptivity in instrumental variable regression (ICLR 2025), and novel approaches to two-sample testing with adaptive kernel selection (NeurIPS 2024). He has also contributed extensively to distributional reinforcement learning and hypothesis testing frameworks. As an advisor, he supervises multiple PhD students including Jakub Wornbard, Zikai (Steve) Shen, and Zonghao (Hudson) Chen, while co-supervising others. His methodological contributions are implemented in various software packages available at the Gatsby Unit, including tools for kernel-based covariate shift correction, independence testing, and maximum mean discrepancy calculations.
