Ricky Ini Liu is an Associate Professor in the Department of Mathematics at the University of Washington. Previously, he held positions at North Carolina State University, the University of Michigan, and the University of Minnesota. He earned his Ph.D. in Mathematics from MIT in 2010 under Alexander Postnikov. His research focuses on algebraic combinatorics, particularly its intersections with algebraic geometry, combinatorial geometry, and representation theory. Key interests include Schubert polynomials, polytopes, Hopf algebras, and Kronecker coefficients. He has contributed to foundational work on birational rowmotion, Gelfand-Tsetlin polytopes, and Fomin-Kirillov algebras. Liu has taught a wide range of courses at UW, including special topics in dynamical algebraic combinatorics, combinatorial theory, and problem-solving. He has also been a key instructor at the Mathematical Olympiad Summer Program since 2007 and mentored undergraduates in research programs at the University of Minnesota, Duluth. His publications span high-impact journals like Selecta Mathematica and Journal of Combinatorial Theory , with recent work addressing topics such as determinantal formulas for Schubert polynomials and applications of flow polytopes to diagonal harmonics. Though no specific awards are listed, his extensive publication record and academic roles reflect significant contributions to combinatorial mathematics.
Dr. Daniel J. Hsu is a Professor of Computer Science at Columbia University, affiliated with the Foundations of Data Science Center and TRIPODS Institute. His research focuses on algorithmic statistics, machine learning theory, and their applications in public health informatics. He has advised numerous students and postdocs, and his work bridges foundational theory with practical systems like foodborne illness detection via social media analysis. Key roles: Associate Editor (ACM Transactions on Algorithms), Program Chair (ICML 2025, COLT 2019) Research areas: Foundations of Data Science, Machine Learning Theory, Fairness, and High-dimensional Statistics His work on detecting foodborne illnesses using Yelp reviews has been deployed by NYC Health departments. Recent contributions include advancements in transformer architectures, group fairness algorithms, and multi-group learning frameworks. Scientific awards include the Sloan Fellowship and multiple NSF grants. He has pioneered interactive machine teaching methods and developed algorithms for robust parameter estimation in high-dimensional settings.
Haibin Ling is the SUNY Empire Innovation Professor in the Department of Computer Science at Stony Brook University, part of the College of Engineering and Applied Sciences. His research focuses on computer vision, medical image analysis, augmented reality, and AI applications in science. He holds a Ph.D. from the University of Maryland (2006) and prior degrees from Peking University. Previously, he worked at Temple University (2008–2019) and held roles at Siemens Corporate Research, UCLA, and Microsoft Research Asia. Professor Ling's work spans biomedical imaging, AI for science, and human-computer interaction. He leads the CV Lab and collaborates with the AI Institute at Stony Brook. Awards include the NSF CAREER Award (2014), Best Student Paper (ACM UIST 2003), and IEEE Fellow (2020). He serves on editorial boards for IEEE Trans. PAMI, Pattern Recognition, and CVIU, and chairs major conferences like CVPR. His research group includes over 50 students and alumni, with active projects in tracking benchmarks (LaSOT), Leafsnap, and medical imaging tools. Notable publications address OCTA flow estimation, backdoor attacks on vision models, and topology-guided medical learning. Collaborations involve institutions like Temple University and Stony Brook's Department of Applied Mathematics and Statistics.
Siva Balakrishnan is an Associate Professor at Carnegie Mellon University with a joint appointment in the Department of Statistics and Data Science and the Machine Learning Department . He holds an affiliation with the Dietrich College of Humanities and Social Sciences. Previously, he was a postdoctoral researcher at UC Berkeley's Department of Statistics, advised by Martin Wainwright and Bin Yu, and earned his Ph.D. in Computer Science from CMU's Language Technologies Institute under Jaime Carbonell. His research focuses on statistical machine learning, causal inference, and high-dimensional statistics, with notable contributions to domain adaptation, optimal transport, and robust statistics. Education: Ph.D. in Computer Science, Carnegie Mellon University (Language Technologies Institute) Postdoctoral Researcher, University of California, Berkeley (Department of Statistics) Research Interests: His work bridges theoretical foundations and algorithmic development, emphasizing robust statistical methods and their applications in causal inference, public policy, and machine learning. Key areas include nonparametric methods, optimization, and high-dimensional data analysis. He has pioneered techniques in domain adaptation, such as the RLSbench framework for relaxed label shift scenarios. Awards & Grants: Amazon Research Award (2021) Google Research Scholar Award (2021) NVIDIA Pioneer Award (2018) IMS Lawrence D. Brown Student Award (2020, 2022) National Science Foundation Grants (CCF-1763734, DMS-1713003, etc.) Professional Activities: He serves as an Associate Editor for JASA and on the editorial boards of Foundations and Trends in Statistics . His work has been featured in top venues like NeurIPS, ICML, and the Annals of Statistics. He currently holds a sabbatical at UC Berkeley's Department of Statistics (Spring 2025). Labs & Collaborations: He actively participates in the Statistics and Machine Learning Reading Group and the Causal Inference Working Group , fostering interdisciplinary research in CMU's vibrant academic community.
Kimon Fountoulakis is an Associate Professor at the University of Waterloo. His research focuses on Machine Learning on Graphs and Numerical Optimization, with a strong emphasis on algorithmic methods for graph-structured data. He holds a Ph.D. from The University of Edinburgh (2015), an M.Sc. from The University of Edinburgh (2010), and a B.Sc. from Athens University of Economics and Business (2009). His work spans theoretical foundations and practical applications in graph algorithms, optimization, and machine learning. Research interests include graph neural networks, local graph clustering algorithms, and algorithmic reasoning. His contributions address challenges in graph representation learning, message-passing architectures, and scalable optimization methods. Notable themes in his publications include improving counting abilities of vision-language models, analyzing graph convolutions, and developing flow-based clustering techniques with statistical guarantees. His work often bridges theory and practice, with applications in network analysis, pandemic containment strategies, and high-performance computing. While no specific grants or awards are listed, his research demonstrates significant contributions to graph-based machine learning and optimization. He maintains a research group at the University of Waterloo, with a focus on developing open-source tools and frameworks for graph algorithms. His lab’s work emphasizes local graph clustering methods and their scalability in real-world networks.
Olga Saukh is an Associate Professor at the Institute of Technical Informatics, Graz University of Technology (TU Graz), and a Faculty member at the Complexity Science Hub Vienna (CSH). She leads the Embedded Learning and Sensing Systems research group, which operates across both institutions, focusing on the design and deployment of efficient AI-based systems on edge and mobile platforms. Her work bridges deep learning and embedded systems, with applications in environmental monitoring, precision agriculture, and digital health. Ph.D. in Computer Science, University of Bonn (2009) Habilitation in Embedded Systems, TU Graz (2020) Postdoctoral Training, ETH Zurich (2010–2016) B.Sc. in Applied Mathematics, Taras Shevchenko National University of Kyiv (2002) M.Sc. in Applied Computer Science, University of Freiburg (2004) Her research centers on efficient machine learning, particularly model optimization, neural network pruning, and contrastive learning for resource-constrained devices. She is deeply engaged in solving real-world challenges in IoT, sensor networks, and cyber-physical systems. Her work emphasizes data privacy, sustainability, and practical deployment of AI at the edge. The 15 most recent publications highlight a strong trend in efficient deep learning, including model compression, pruning, and transfer learning, applied to diverse domains such as environmental sensing (air quality, pollution tracking), digital agriculture (cattle farming), and embedded AI (sensor calibration, on-demand sensing). Her work frequently appears in top-tier venues like NeurIPS, ICLR, and IEEE/ACM IPSN, reflecting her leadership at the intersection of machine learning and embedded systems. Scientific awards include: CONET Ph.D. Academic Award (2010) Multiple Best Paper Awards at IEEE PerCom, ACM/IEEE IPSN, IEEE ICPADS, IEEE SECON, and UrbCom Spotlight and Oral presentations at ICML and CoLLAs workshops Ph.D. scholarship from IPVS, University of Stuttgart (2004–2005) Prizes in Ukrainian national mathematics competitions (1996–1998) Olga Saukh actively serves on program committees of leading international conferences in machine learning and embedded systems. She has advised multiple students and leads a collaborative research group spanning TU Graz and CSH Vienna. Her group develops practical AI systems for real-world deployment, with a focus on sustainability and privacy. She co-organizes the public EfficientML reading group and has secured recognition through numerous grants and awards. Her future work continues to explore the theoretical and practical challenges of deploying efficient, trustworthy AI in mobile and embedded environments. Her research group, Embedded Learning and Sensing Systems, operates jointly between TU Graz and CSH Vienna, fostering interdisciplinary collaboration across institutions. The team develops AI solutions for edge computing, sensor networks, and cyber-physical systems, with a strong emphasis on environmental sustainability and data privacy. Members work on joint challenges using advanced collaboration tools, reflecting the distributed nature of modern academic research.
Kay Jin Lim serves as Senior Lecturer and Director of the MSc (Analytics) program at Nanyang Technological University's School of Physical & Mathematical Sciences, where he contributes significantly to both academic leadership and mathematical research within the Division of Mathematical Sciences. His educational foundation includes a B.Sc. (2005), M.Sc. (2007), and Ph.D. (2009) from the National University of Singapore, followed by doctoral research at the University of Aberdeen under David John Benson's supervision. Lim's research centers on representation theory of finite dimensional algebras, with deep connections to algebraic combinatorics and algebraic geometry. His work explores modular representation theory of symmetric groups, Specht modules, and Lie modules, emphasizing combinatorial structures and geometric interpretations in positive characteristic settings. This specialized focus has established him as a contributor to advanced algebraic frameworks. Analysis of his publication trajectory (2013-2025) reveals consistent advancement in understanding module complexities, rank varieties, and symmetric group representations, with increasing emphasis on interdisciplinary connections between algebraic combinatorics and geometric methods. His collaborative approach with international researchers like Karin Erdmann and David Benson demonstrates engagement with cutting-edge developments in the field. Scientific awards: No awards, fellowships, or major prizes are documented in the available information. Lim maintains an active supervisory role with four doctoral students: Yu Jiang (graduated May 5, 2021), Jialin Wang (graduated March 31, 2024), and current candidates Kua Hao Yan Manzu and Chen Siyuan. His teaching portfolio spans foundational to advanced algebra courses including MH2220 Algebra I, MH3220 Algebra II, and specialized topics in Homological Algebra, reflecting his commitment to mathematical education at multiple levels. He operates within NTU's vibrant mathematical research ecosystem, maintaining significant collaborations with leading algebraists globally while directing the MSc (Analytics) program to integrate theoretical mathematics with practical analytical applications.
Harri Lähdesmäki is an Associate Professor (tenured) at the Department of Computer Science, Aalto University, where he leads the Computational Systems Biology research group. His work focuses on probabilistic machine learning and deep generative models with applications in biomedicine and molecular biology. Key Research Interests: Probabilistic machine learning, deep generative models, computational biology, bioinformatics, longitudinal data modeling Contact: harri.lahdesmaki@aalto.fi | Konemiehentie 2, 02150 Espoo, Finland His recent publications highlight advancements in: Gaussian process priors for scalable deep generative models Single-cell analysis of immune repertoires in leukemia and diabetes Probabilistic deconvolution methods for RNA-seq data Epigenetic analysis using hidden Markov and mixed models Transformer-based survival prediction and missing data handling Harri’s work integrates mechanistic modeling with Bayesian inference, particularly applied to immunology, cancer biology, and early disease prediction.
Nicole Wein is an Assistant Professor in the Computer Science and Engineering Division of the Department of Electrical Engineering and Computer Science (EECS) at the University of Michigan, College of Engineering. Her research lies in theoretical computer science, focusing on graph algorithms, dynamic algorithms, parameterized algorithms, distributed algorithms, online algorithms, and fine-grained complexity. She is part of the Theory of Computation Lab and advises both PhD and undergraduate researchers. PhD, Massachusetts Institute of Technology (MIT), advised by Virginia Vassilevska Williams Postdoctoral Fellow, DIMACS Research Fellow, Simons Institute, UC Berkeley MS, Stanford University BS, Computer Science/Math, Harvey Mudd College Her research explores fundamental algorithmic questions in combinatorial settings, particularly how algorithms handle dynamic data, extract information efficiently (e.g., in linear time), and understand shortest path structures in graphs—especially directed ones. She investigates problems in distance estimation, spanners, hopsets, dynamic graph algorithms, and hardness of approximation. Her work combines theoretical depth with practical implications for algorithm design. The recent publications reflect a strong trend in fine-grained complexity and graph algorithm design, with a focus on proving tight bounds, developing efficient approximations, and understanding structural limitations in directed and dynamic graphs. Her work frequently appears in top venues such as STOC, FOCS, SODA, and ICALP, often in collaboration with leading researchers in the field. Scientific Awards and Recognition: Invited to special issue of SIAM Journal on Computing (SICOMP) (FOCS 2022 paper) Invited to Highlights of Algorithms (HALG) (FOCS 2022 paper) Invited to minisymposium at CANADAM (ESA 2022 paper) Work featured in Quanta Magazine Nicole Wein actively mentors students, including current PhD student Jubayer Nirjhor and former undergraduate researchers like Sam Hiken (now pre-doc at MIT). She has served on program committees for major conferences including SODA, FOCS, ICALP, and ITCS, and co-organized the DIMACS workshop on Modern Techniques in Graph Algorithms (2023). She also contributes to the academic community through outreach, such as her article offering reassurance to early-stage PhD students in theoretical computer science. She leads and participates in collaborative research groups and workshops, emphasizing supercollaboration and interdisciplinary communication in algorithms. Her lab fosters a strong research environment in theoretical computer science at the University of Michigan.
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.
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.
Professor Martin Liebeck is a Professor of Pure Mathematics and Head of the Pure Mathematics Section at the Department of Mathematics, Imperial College London. He is affiliated with the Algebra and Algebraic Combinatorics research groups and is part of the Mathematics research and teaching staff within the Faculty of Natural Sciences. His research interests span Pure Mathematics, with a focus on group theory, algebraic combinatorics, Lie groups, and representation theory. His work often involves the structure and properties of finite simple groups, algebraic groups, and their applications to permutation groups and character theory. Recent publications explore topics such as the actions of simple groups, unipotent classes in algebraic groups, character ratios, and the classification of permutation groups. His work frequently intersects with combinatorial and algebraic structures, with implications for both theoretical and applied mathematics. Professor Liebeck’s contributions include foundational studies on group generation, covering numbers, and character bounds, reflecting his deep engagement with the interplay between algebraic structures and combinatorial problems. His research has been published in leading mathematics journals, and he maintains an active academic profile through his personal webpage at http://www.ma.ic.ac.uk/~mwl/ .
Tengyao Wang is a Professor in the Department of Statistics at the London School of Economics and Political Science (LSE), serving as the MSc Statistics (Financial Statistics) Programme Director. Prior to LSE, he held positions as a Lecturer at University College London and a Research Fellow at the Cantab Capital Institute for the Mathematics of Information, University of Cambridge. His research focuses on high-dimensional statistics, computational efficiency, and statistical limitations imposed by computational constraints. Education: PhD in Statistics under Prof Richard Samworth at the University of Cambridge, with earlier studies including a Part III Essay in Empirical Process Theory. Research interests include sparse signal detection, change-point analysis, dimension reduction, robust statistics, and applications in medical statistics, financial data analysis, and material discovery. Key contributions include methodologies for handling missing data, high-dimensional change-point detection algorithms, and statistical learning techniques. Publications span theoretical advancements and applied innovations, with recent work emphasizing deep learning with missing data, residual permutation tests, and semi-supervised learning via random projections. His work has been recognized with awards such as the Royal Statistical Society Research Prize (2019) and the Guy Medal in Bronze (2023). He is an Associate Editor of the Journal of the Royal Statistical Society, Series B (JRSS B), and actively contributes to open-source tools like the 'ocd' and 'MissInspect' R packages for changepoint detection and missing data analysis.
Rina Foygel Barber is the Louis Block Professor in the Department of Statistics at the University of Chicago, where she also serves as Co-chair of the Committee on Community, Diversity, and Inclusion (CCDI) and is a member of the Committee on Computational and Applied Mathematics (CCAM). Her educational background includes: PhD in Statistics, University of Chicago (2012), advised by Mathias Drton and Nati Srebro MS in Mathematics, University of Chicago (2009) ScB in Mathematics, Brown University (2005) NSF postdoctoral fellow, Stanford University Department of Statistics (2012-13), supervised by Emmanuel Candès Professor Barber's research focuses on the theoretical foundations of statistical problems in estimation, prediction, and inference, particularly in high-dimensional settings where classical methods may not be reliable. She specializes in distribution-free inference methods such as conformal prediction, multiple testing methods, algorithmic stability, and shape-constrained inference. Her work also extends to modeling and optimization problems in medical imaging reconstruction. Her recent publications demonstrate a strong focus on distribution-free inference, with particular emphasis on conformal prediction, false discovery rate control, and algorithmic stability. Her work bridges theoretical statistics with practical applications, especially in the medical imaging domain. Professor Barber has received numerous prestigious awards: Elected to National Academy of Sciences (2025) MacArthur Fellowship (2023) IMS Fellow (2023) COPSS Presidents' Award (2020) Peter Gavin Hall Early Career Prize (2020) She actively mentors students and collaborators, with many co-authored publications across statistics, machine learning, and medical imaging. Her research has been supported by significant grants that enable her work on theoretical foundations of statistical inference and practical applications in medical imaging. Professor Barber also co-organizes the International Seminar on Selective Inference. Her research group focuses on developing and analyzing estimation, inference, and optimization tools for structured high-dimensional data problems. They work on false discovery rate control, distribution-free inference, and applications in medical imaging reconstruction.
Ben Green is the Waynflete Professor of Pure Mathematics at the University of Oxford and a Fellow of Magdalen College. His work spans additive combinatorics, analytic number theory, harmonic analysis, ergodic theory, discrete geometry, and group theory, with a focus on interdisciplinary approaches. Research Interests: Additive combinatorics and its applications to primes Analytic number theory (prime distribution, L-functions) Harmonic analysis (Fourier methods, spectral theory) Ergodic theory and its combinatorial applications Discrete geometry (ordinary lines, convex structures) Group theory (approximate groups, expansion) Article Trends: His recent work emphasizes multiplicative functions, Ramsey-type problems in number theory, expansion in finite groups, and extremal set theory. Themes include prime gaps, arithmetic progressions, and interactions between analysis and algebra. Scientific Awards: Clay Research Award (2004) Ostrowski Prize (2005) Whitehead Prize (2005) Leverhulme Prize (2007) European Mathematical Society Prize (2008) Royal Society Fellow (2010) Sylvester Medal (2014) Senior Whitehead Prize (2019) Advising: Ben has supervised numerous D.Phil students across additive combinatorics, analytic number theory, and related fields. Past students hold postdoctoral and academic positions globally.
