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.
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.
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 .
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.
Fanny Yang is an Assistant Professor in the Computer Science Department at ETH Zurich . She previously held postdoctoral positions at Stanford University and a Junior Fellowship at the Institute for Theoretical Studies at ETH Zurich, advised by Nicolai Meinshausen . Her PhD was completed at the EECS Department of UC Berkeley , supervised by Martin Wainwright . Research Interests : Theoretical foundations of machine learning and statistics , particularly focusing on overparameterized models and high-dimensional data . Developing trustworthy ML models with emphasis on distributional robustness , domain generalization , and interpretability . Applications in medical diagnostics and treatment effect analysis , aiming to address reliability issues in real-world domains. Recent Work Trends : 2025 Articles : Theoretical analysis of semi-supervised multi-objective learning , test-time scaling with verifiers, and foundation models for efficient randomized experiments . 2024 Articles : Studies on robust mixture learning , privacy-preserving data synthesis via optimal transport , confounding quantification in causal inference , and semi-private learning frameworks. 2023 Articles : Investigations into active vs. passive learning in high dimensions, inductive bias in noisy interpolation , and semi-supervised novelty detection using model ensembles .
Adrian Weller is a prominent researcher and academic at the University of Cambridge, serving as a Director of Research in Machine Learning within the Department of Engineering. He holds multiple significant leadership roles including Programme Director for Trust and Society at the Leverhulme Centre for the Future of Intelligence (CFI), and previously served as Programme Director for AI at The Alan Turing Institute, the UK national institute for data science and AI. His work bridges theoretical machine learning research with practical applications and societal implications of artificial intelligence. Weller's research interests span a broad spectrum of AI and machine learning topics with a particular focus on ensuring beneficial societal outcomes. His work encompasses explainability, fairness, robustness, scalability, privacy, safety, and ethics in AI systems. He has made significant contributions to trustworthy machine learning, including developing frameworks for AI governance, certification, and human-AI collaboration. His research group actively investigates neuro-symbolic approaches, privacy-preserving techniques, and methods for improving the reliability and interpretability of AI systems. His recent publications demonstrate a strong trend toward addressing the practical challenges of deploying AI systems in real-world contexts, particularly focusing on certification frameworks, governance mechanisms, and human-centered approaches. His work spans theoretical advances in machine learning architectures while maintaining a strong connection to societal impact, with publications appearing in top venues across AI, machine learning, and interdisciplinary applications. Scientific Awards: MBE for services to digital innovation (2022 Queen's Birthday Honours) Turing AI Fellowship for Trustworthy Machine Learning Weller actively supervises a large group of PhD students and postdocs, with current students including Juyeon Heo, Yanzhi Chen, Katie Collins, Isaac Reid, Yichao Liang, Herbie Bradley, and Shoaib Siddiqui. His former students have gone on to positions at leading institutions including Google DeepMind, ETH Zurich, NYU, and MPI-IS Tübingen. He has served on numerous advisory boards including the Centre for Data Ethics and Innovation, UNESCO's expert group on AI ethics, and the World Economic Forum's Global Future Council on AI. His research has been supported through his Turing AI Fellowship and various collaborative projects focused on safe and ethical AI development. Weller leads a vibrant research group focused on trustworthy machine learning, which actively organizes workshops and conferences including ICML 2024 (where he served as Program Chair), multiple workshops on responsible AI, and events through the ELLIS network. His group collaborates extensively across disciplines, working with researchers in computer science, social sciences, law, and policy to address the multifaceted challenges of developing beneficial AI systems.
Wendelin Werner is a renowned mathematician and currently the Rouse Ball Professor of Mathematics at the University of Cambridge (since 2023). Previously, he held professorships at ETH Zürich (2013–2023) and the University of Paris-Sud in Orsay (1997–2013). His research focuses on probability theory, mathematical physics, and complex analysis, particularly Schramm-Loewner evolution and conformal invariance. He has received prestigious awards, including the Fields Medal (2006), SIAM George Pólya Prize (2006), and Fermat Prize (2001). His work bridges stochastic processes and geometric structures, with implications for statistical mechanics and critical phenomena. Werner studied at the École Normale Supérieure (1987–1991) and earned his PhD from Université Paris VI under J. F. Le Gall (1993). Early career positions included postdoctoral research at Cambridge (1993–1995) and roles at CNRS (1991–1993, 1995–1997). His academic contributions span stochastic geometry, critical systems, and random curves, with seminal papers on loop measures, percolation, and SLE. He has delivered major lectures globally, including at the International Congress of Mathematicians (IMC 2006) and the College de France's Cours Peccot. Werner’s honors include membership in the French Academy of Sciences (2008), the Berlin-Brandenburg Academy (BBAW), and the German National Academy Leopoldina. He is also an honorary fellow of Gonville and Caius College, Cambridge (2009). His research has advanced understanding of universal scaling limits in two-dimensional models, earning recognition as a leader in probability and mathematical physics.
Amitabha Bagchi is a Professor in the Department of Computer Science and Engineering at IIT Delhi. His research spans data algorithmics, probability, networks, and theoretical computer science, with applications in distributed systems, social networks, and AI-driven platforms. He has published extensively in leading venues such as SIGMOD, VLDB, ICDE, AAAI, and KDD, often collaborating with students and researchers on problems involving graph algorithms, fairness, and large-scale data analysis. Research Interests: His primary research interests include Data Algorithmics, Probability and Networks, Theoretical Computer Science, Distributed Algorithms, Graph Algorithms, and Machine Learning Theory. He investigates algorithmic foundations for real-world problems such as food delivery optimization, social network analysis, and efficient data structures for streaming and large graphs. Publication Trends: Recent publications focus on fairness in gig economy platforms, efficient solvers for graph Laplacians, generalization in neural networks, and temporal graph querying. His work combines theoretical rigor with practical impact, often involving GPU acceleration, distributed computing, and data-aware algorithm design. Scientific Service: Editor, Algorithms (2020–present) Editor, Journal of Discrete Algorithms , Elsevier (2006–2018) Guest Editor, special issue on Algorithms for Shortest Paths in Dynamic and Evolving Networks , Algorithms (2021) Volume Editor for proceedings of ESA, ATMOS, COCOON, and others Conference Leadership: He has served on numerous program committees and as chair for conferences including ESA (Engineering Track, 2016), ATMOS (2020), and ICALP (2019). His involvement spans algorithmic engineering, transportation optimization, and theoretical computer science forums. Teaching: He currently teaches COL863: Special Topics in Theoretical Computer Science on concentration inequalities and their applications. He has previously taught advanced courses in algorithms and data structures.
Maya Ramanath is an Associate Professor in the Department of Computer Science and Engineering at Indian Institute of Technology (IIT) Delhi. She joined IIT Delhi in 2011 after a postdoctoral research stint at the Max-Planck Institute for Informatics in Germany. Her research interests focus on database systems, information retrieval, semantic web technologies, and knowledge graph construction and applications. Education: PhD in Computer Science, Indian Institute of Science, Bangalore M.Sc.(Engg.) in Computer Science, Indian Institute of Science, Bangalore B.E. in Computer Science and Engineering, Bangalore University, Bangalore Her recent work emphasizes efficient query processing over large-scale graphs, knowledge graph applications, and natural language interfaces for semantic data. Notable contributions include algorithms for reachability approximation in web-scale graphs, speculative query planning for knowledge graphs, and exploratory querying techniques. She has collaborated extensively on projects like NAGA, ESTHETE, and KlusTree, advancing the state of the art in graph-based data management and semantic search. Publications span conferences such as ICDE, ECIR, EDBT, and VLDB, reflecting a strong focus on database systems, graph algorithms, and semantic web applications. Her work bridges theoretical foundations with practical implementations, addressing scalability and efficiency challenges in modern data management systems. Research and advising activities include supervision of projects on distributed graph processing, query optimization, and knowledge representation. She has contributed to open-source tools like LegoDB and StatiX, and her lab focuses on interdisciplinary approaches to data-centric AI.
Peter Bühlmann is a Professor at ETH Zürich within the Seminar für Statistik , focusing on high-dimensional statistics, causal inference, and machine learning. His work bridges theoretical advancements with practical software implementations in R packages like pcalg , mboost , and glmmlasso , impacting fields such as genomics, proteomics, and intensive care analytics. Key Contributions : Causal structure learning, stability selection, anchor regression, and deconfounding. Software : Developed widely used R packages for statistical modeling and causal inference. Teaching : Courses on high-dimensional statistics at ETH Zürich and international institutions. Research Trends : Recent articles emphasize causal robustness, domain adaptation, and applications in medicine. His work addresses challenges in heterogeneous data, missing values, and covariate shifts using methods like spectral deconfounding and residual prediction tests. Scientific Recognition : Co-author of a paper designated as a New Hot Paper (Meinshausen and Bühlmann, 2006) by Essential Science Indicators, indicating significant impact in high-dimensional multiple testing.
Renjie Feng is a Research Fellow in Mathematics and AI at the School of Mathematics and Statistics and the Sydney Mathematical Research Institute , University of Sydney. His work bridges probability theory, statistics, and applications in machine learning, deep learning, and artificial intelligence. His research interests focus on probability theory and its applications to machine learning , random matrix theory , and statistical physics . He investigates extreme value problems, spectral properties of random matrices, and topological features of random fields over Riemannian manifolds. Recent publications highlight trends in random matrix theory (GUE, GOE, GSE), extreme gap problems , determinantal point processes , and Wiener chaos . Collaborative works with F. Götze, D. Yao, and R. Adler emphasize U-statistics , multivariate linear statistics , and random topology inspired by Poisson point process studies.
Dr. Amin Keramati is an Assistant Professor of Supply Chain Management at Widener University’s School of Business Administration. He holds a PhD in Transportation & Logistics from North Dakota State University and previously served as a graduate research assistant at the Upper Great Plains Transportation Institute. His work includes federally funded projects like the Mountain-Plains Consortium’s MPC-550 project, focusing on highway-rail grade crossing safety. Dr. Keramati teaches courses in enterprise resource planning, decision analytics, database management, transportation/logistics, project management, and data analytics. Education: PhD in Transportation & Logistics, North Dakota State University Graduate Research Assistant at Upper Great Plains Transportation Institute Research Focus: Dr. Keramati develops mathematical, statistical, and machine learning approaches to solve complex problems in transportation, supply chain, and logistics. Key areas include data mining, big data decision support, transportation network analytics, project scheduling, smart manufacturing, and accident analysis. His interdisciplinary work bridges supply chain optimization with emerging technologies like blockchain for healthcare and clinical trials. Awards & Recognition: Student Paper Award, American Association of State Highway and Transportation Officials (2017) Grants & Projects: Lead researcher on the Mountain-Plains Consortium’s MPC-550 project, which expanded his dissertation work on safety systems for highway-rail crossings. Collaborates on federally funded transportation safety initiatives and supply chain optimization for bioethanol and pharmaceutical industries. Labs/Teams: Active in Widener’s School of Business research groups focusing on supply chain innovation and interdisciplinary projects combining logistics with emerging technologies.
Dr. Sudie E. Back is a Professor in the Department of Psychiatry and Behavioral Sciences at the Medical University of South Carolina (MUSC), College of Medicine. She also serves as Director of the NIH-sponsored Drug Abuse Research Training (DART) program and is a Staff Psychologist at the Ralph H. Johnson VA's STAR program. Her expertise lies in treating substance use disorders and PTSD, particularly among veterans and civilians. She leads both behavioral and pharmacological clinical trials, as well as neuroimaging studies. Education: PhD in Clinical Psychology from the University of Georgia (2004), clinical internship at Yale University School of Medicine (2002–2003), and postdoctoral training at MUSC (2004–2005). Research Interests: Co-occurring substance use and PTSD, trauma-focused therapies, veterans' mental health. Funding: NIH, Department of Defense, and VA grants, including K23, R01, K02, and a Fulbright award. Dr. Back has pioneered integrated treatment approaches, such as combining oxytocin with exposure therapy for AUD and PTSD. She also developed COPEWeb , a web-based training program for providers treating PTSD and SUD. Her trials include randomized clinical trials on cognitive processing therapy and relapse prevention. Awards: Career Development Award (K23) R01 grants Independent Scientist Award (K02) Fulbright Scholar Award (Australia) Labs/Teams: Director of DART program at MUSC and STAR program at the VA, focusing on translational research and clinical training.
Stanislav Smirnov is a Professor at the University of Geneva's Department of Mathematics since 2003 and Head of the Chebyshev Laboratory at St. Petersburg State University since 2010. He holds a Ph.D. from the California Institute of Technology (1996) and a B.Sc./M.Sc. from St. Petersburg State University (1992). His research focuses on mathematical physics, probability, complex analysis, and dynamical systems, with groundbreaking contributions to the understanding of critical phenomena in statistical physics. Key achievements include receiving the Fields Medal (2010), the highest honor in mathematics, for his work on percolation and the Ising model. He has organized major international conferences, such as the 'St. Petersburg School in Probability & Statistical Physics' (2012) and the '2D Statistical Physics Workshop' (2013). His academic career includes positions at Yale University, the Max-Planck Institute, and KTH Royal Institute of Technology. Education: Ph.D., Mathematics, California Institute of Technology (1996) B.Sc./M.Sc., Mathematics (with honors), St. Petersburg State University (1992) Awards: Fields Medal (2010) European Research Council Advanced Grants (2008, 2013) Rollo Davidson Prize (2002) Salem Prize (2001) Smirnov’s research bridges probability theory and complex analysis, with notable results on conformal invariance in two-dimensional models. His work has advanced understanding of critical exponents, percolation thresholds, and the universality of phase transitions. He advises doctoral students and collaborates internationally on projects funded by Swiss and European grants. He co-organized over 20 conferences worldwide, including plenary talks at the International Congress of Mathematicians (2006, 2010) and the World Congress in Probability and Statistics (2012). His lab fosters interdisciplinary research, linking mathematics to physics and computer science.
Osman Yağan is a Research Professor in the Department of Electrical and Computer Engineering at Carnegie Mellon University (CMU), with affiliate faculty status in the School of Computer Science. He is also a core member of CyLab Security and Privacy Institute. Prior to joining CMU in 2013, he was a Postdoctoral Research Fellow at CyLab. He holds a Ph.D. in Electrical and Computer Engineering from the University of Maryland (2011) and a B.S. from Middle East Technical University (2007). His research focuses on modeling, analysis, and optimization of computing systems, leveraging applied probability, network science, data science, and machine learning. Key areas include multi-armed bandits, resilient machine learning, contagion processes in networks, and cybersecurity. Research Interests include Machine Learning, Data Science, Network Science, Cybersecurity, and Robustness in Cyber-Physical Systems. He has advised numerous students, including current PhD candidates Yurun Tian, Orkun İrsoy, and Ishank Juneja, as well as notable alumni such as Mansi Sood (now at MIT) and Jun Zhao (Assistant Professor at Nanyang Technological University). Key Awards include the CIT Dean's Early Career Fellowship, IBM Academic Award, and Best Paper Awards at ICC 2021, IPSN 2022, and ASONAM 2023. His work spans theoretical contributions (e.g., contagion models in multi-layer networks) and applied research (e.g., mitigating cascading failures in power systems). He leads or co-leads grants from ONR, NSF, and ARO, focusing on resilient machine learning, network robustness, and pandemic modeling.
