Find Academic Supervisors

Esther Duflo is the Abdul Latif Jameel Professor of Poverty Alleviation and Development Economics at the Massachusetts Institute of Technology (MIT), where she is affiliated with the Department of Economics within the School of Humanities, Arts, and Social Sciences. She co-founded and co-directs the Abdul Latif Jameel Poverty Action Lab (J-PAL) and holds the position of Chaire, Pauvreté et politiques publiques at the Collège de France. Duflo also serves as President of the Paris School of Economics, demonstrating her significant international influence in economic policy and research. Her educational background includes first degrees in history and economics from Ecole Normale Superieure, Paris, followed by a Ph.D. in Economics from MIT in 1999. This strong foundation has enabled her to become one of the most influential economists of her generation. Duflo's research focuses on understanding the economic lives of people living in poverty, with the explicit aim of informing effective social policy design and evaluation. Her work spans critical areas including health, education, financial inclusion, environmental sustainability, and governance. What distinguishes her approach is the rigorous application of randomized controlled trials to evaluate development interventions, bringing scientific precision to poverty alleviation efforts. Her research methodology has revolutionized how economists approach development questions, moving beyond theoretical models to evidence-based policy recommendations. Her scholarly output demonstrates remarkable breadth and impact, with publications spanning from technical academic papers to influential books for general audiences. Duflo's work consistently bridges the gap between academic research and practical policy applications, with recent publications addressing contemporary challenges including climate change adaptation, pandemic response, and economic policy for hard times. Her research trends reveal a deepening commitment to translating complex economic concepts for broader audiences while maintaining scholarly rigor. Sveriges Riksbank Prize in Economic Sciences in Memory of Alfred Nobel (2019, with Abhijit Banerjee and Michael Kremer) Princess of Asturias Award for Social Sciences (2015) A.SK Social Science Award (2015) Infosys Prize (2014) John Bates Clark Medal (2010) MacArthur 'Genius Grant' Fellowship (2009) Member of the National Academy of Sciences (2017) Duflo has supervised numerous graduate students and collaborated extensively with researchers worldwide through J-PAL, which has grown into a global network conducting field experiments across multiple continents. Her grant portfolio includes substantial funding from major foundations and government agencies supporting large-scale development research. Beyond traditional academic advising, Duflo has mentored a generation of development economists through J-PAL's training programs and field research opportunities. Her primary institutional home is the Abdul Latif Jameel Poverty Action Lab (J-PAL), which she co-founded at MIT. J-PAL has grown into a major research center with offices worldwide, connecting academic researchers with policymakers to ensure that program evaluations inform real-world decisions. Duflo also leads research teams at the Collège de France and the Paris School of Economics, creating a transatlantic network focused on evidence-based poverty reduction strategies.

• Development Economics
• Poverty Alleviation
• Health Economics
• +4 more

Esther Duflo is the Abdul Latif Jameel Professor of Poverty Alleviation and Development Economics in the Department of Economics at the Massachusetts Institute of Technology (MIT). She is also co-founder and co-director of the Abdul Latif Jameel Poverty Action Lab (J-PAL), holds the Chaire, Pauvreté et politiques publiques at the Collège de France, and serves as President of the Paris School of Economics. Her research focuses on understanding the economic lives of people living in poverty to help design and evaluate social policies. Her work spans multiple domains including: Development Economics Poverty Alleviation strategies Health interventions Educational programs Financial inclusion initiatives Environmental policy Governance improvements Duflo revolutionized developmental economics by pioneering the use of randomized controlled trials to test poverty reduction measures. Her empirical approach has challenged conventional opinions about development and has helped improve the efficient use of resources in poverty alleviation programs worldwide. She co-authored the influential books "Poor Economics" and "Good Economics for Hard Times" with Abhijit Banerjee, demonstrating through field experiments how specific interventions (like providing lentils to mothers for child immunization) can dramatically improve social outcomes. Her notable scientific achievements include: Sveriges Riksbank Prize in Economic Sciences in Memory of Alfred Nobel (2019) Princess of Asturias Award for Social Sciences (2015) Infosys Prize (2014) John Bates Clark Medal (2010) MacArthur "Genius Grant" Fellowship (2009) A.SK Social Science Award (2015) Duflo has established J-PAL as a global network of over a hundred affiliated professors who use scientific evidence to inform policy decisions in the fight against poverty. J-PAL has offices across Africa, Europe, Latin America and the Caribbean, North America, and South and Southeast Asia. Her work has demonstrated the crucial importance of information in policymaking, with numerous field experiments showing how carefully designed interventions can have significant impacts on social outcomes across multiple domains including health, education, and economic opportunity.

• Development Economics
• Poverty Alleviation
• Health
• +7 more

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.

• Machine Learning
• Data Analytics
• Databases
• +10 more

Michael Kremer is a University Professor in Economics at the University of Chicago, holding positions in the Kenneth C. Griffin Department of Economics, the College, and the Harris School of Public Policy. He is the 2019 Nobel Laureate in Economic Sciences for pioneering experimental methods to address global poverty. Kremer earned his Ph.D. from Harvard University in 1992 and has been affiliated with the University of Chicago since 2020. His research focuses on development economics, field experiments, and policies impacting education, health, water, and agriculture in developing countries. He directs the Development Innovation Lab and leads the Development Economics Center at Chicago, emphasizing evidence-based solutions to poverty. Kremer’s work combines rigorous academic inquiry with practical policy applications, bridging theoretical economics and real-world interventions. Awarded the MacArthur Fellowship in 1997 and a Fellow of the American Academy of Arts and Sciences since 2003, Kremer’s contributions have shaped modern development economics. He has collaborated extensively with institutions worldwide, advocating for randomized controlled trials (RCTs) to evaluate social programs. His interdisciplinary approach integrates insights from economics, public policy, and experimental methods, fostering global partnerships to combat poverty effectively.

• Development Economics
• Field Experiments
• Education Policy
• +3 more

Abhijit Banerjee is a Professor in the Department of Economics at the Massachusetts Institute of Technology (MIT). His research focuses on development economics, public health policy, and social protection programs, particularly addressing poverty and inequality in low- and middle-income countries. He has conducted large-scale experiments evaluating interventions such as conditional cash transfers, universal basic income, and healthcare policies. Key areas of interest include the design and implementation of anti-poverty programs, behavioral economics, and the long-term health impacts of infectious diseases like COVID-19. His work often integrates experimental methods to assess policy effectiveness, with contributions to global health studies and economic development strategies. Notably, his research on the RECOVERY trial evaluates treatments for hospitalized COVID-19 patients, while other studies explore financial spillover effects of electronic government transfers in Indonesia and savings behavior interventions in Chile. Banerjee has collaborated on projects analyzing post-COVID-19 health outcomes, labor market dynamics in India, and the role of trusted messengers in public health communication during crises. Despite the breadth of his contributions, specific details about his educational background, grants, or lab affiliations are not explicitly provided in the source text.

• Economics
• Development Economics
• Public Health Policy
• +3 more

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.

• Combinatorics
• Graph Theory
• Applied Probability
• +6 more

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 .

• Machine Learning
• Probability
• Mathematical Physics
• +6 more

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.

• Statistical Machine Learning
• Probabilistic Learning
• Deep Learning
• +4 more

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 .

• Machine Learning
• Statistics
• Theoretical Machine Learning
• +7 more

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.

• Artificial Intelligence
• Machine Learning
• Explainability
• +9 more

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.

• Schramm-Loewner Evolution
• Probability Theory
• Mathematical Physics
• +3 more

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.

• Data Algorithmics
• Probability and Networks
• Theoretical Computer Science
• +7 more

Chantal David is a Professor in the Department of Mathematics and Statistics at Concordia University. Her research focuses on number theory and its intersections with mathematical statistics. Formal Affiliation: Concordia University, Department of Mathematics and Statistics Email: chantal.david@concordia.ca Office: Library Building, LB 927.09 Research Interests revolve around Number Theory , particularly: L-functions and their non-vanishing properties Elliptic curves over finite fields and function fields Statistics of group structures and root numbers Connections to random matrix theory and metaplectic functions Extremal primes and Frobenius distributions Drinfeld modules and supersingular reductions Article Trends show a focus on cubic and quartic L-functions, non-vanishing phenomena, and statistical properties of elliptic curves over finite fields. Recent work explores metaplectic theta functions, extreme value distributions, and one-level density analysis. Labs & Teams : She is affiliated with the Montreal Number Theory Group (CICMA) .

• Number Theory
• Elliptic Curves
• L-functions
• +1 more

Stanislav Smirnov is a Professor of Mathematics at the University of Geneva, where he has been a faculty member since 2003. He also holds a part-time position at the Chebyshev Laboratory of St. Petersburg State University. As Director of the National Centre of Competence in Research SwissMAP since 2014, he leads a major research initiative funded by the Swiss National Science Foundation. His education includes a mathematics degree from St. Petersburg State University (1992) and a PhD from the California Institute of Technology (1996). Prior to joining Geneva, he held positions at Yale University, the Institute for Advanced Study in Princeton, the Max Planck Institute in Bonn, and the Royal Institute of Technology in Stockholm. Professor Smirnov's research focuses on the mathematical foundations of statistical physics, with particular emphasis on conformal invariance in two-dimensional lattice models. His work has revolutionized our understanding of critical phenomena through rigorous mathematical approaches, establishing deep connections between probability theory, complex analysis, and statistical mechanics. He develops novel discrete complex analysis techniques to prove continuum limits of lattice models at criticality. His publication record shows consistent advancement in understanding random planar geometry, percolation theory, and the Ising model, with increasing attention to Liouville quantum gravity in recent years. His work bridges deep mathematical analysis with physical insights, often providing rigorous proofs for phenomena previously understood only through physical intuition. Fields Medal (2010) for the proof of conformal invariance of percolation and the planar Ising model in statistical physics As an advisor, Professor Smirnov has mentored doctoral students including Ekin Arikök and Nikolai Bobenko. He leads the ANALYSE, PHYSIQUE MATHÉMATIQUE ET PROBABILITÉS research group at the University of Geneva. His research is supported by major grants including the NCCR SwissMAP, European Research Council's AG COMPASP, and Swiss National Science Foundation grants 200020_143434 and 200020_141329. Professor Smirnov has organized numerous influential conferences, including the "Conformal maps from probability to physics" workshop at Monte Verità (2010) and multiple "Random Planar Geometry" meetings in Les Diablerets, fostering collaboration between mathematicians and physicists working on critical phenomena and random geometry.

• Mathematical Physics
• Statistical Physics
• Probability Theory
• +4 more

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

• Mathematics of Data
• Numerical Linear Algebra
• Randomized Algorithms
• +5 more