Mahdi Haghifam
Mahdi Haghifam is a machine learning researcher whose theory work covers generalization, memorization and privacy in learning algorithms, and whose recent interests include distillation and inference-time algorithms for language models. After a B.Sc. and an M.Sc. at Sharif University of Technology in Tehran, he completed a PhD in machine learning at the University of Toronto and the Vector Institute, advised by Daniel Roy. In 2024, he coauthored “Information Complexity of Stochastic Convex Optimization: Applications to Generalization, Memorization, and Tracing”, which received a Best Paper award at ICML 2024. He then worked as a Distinguished Postdoctoral Fellow at Northeastern University's Khoury College with Jonathan Ullman, joined the Toyota Technological Institute at Chicago as a research assistant professor in 2025, and was a Research Fellow at the Simons Institute in Spring 2026. His 2026 affiliation is Google Research.
- Now at
- Google Research
Timeline
-
By 2019
A PhD at Toronto and Vector
After a B.Sc. and an M.Sc. at Sharif University of Technology in Tehran, he works toward a PhD in machine learning at the University of Toronto and the Vector Institute, advised by Daniel M. Roy. In 2019, he interns at ServiceNow Research in Toronto with Gintare Karolina Dziugaite, where he proposes data-dependent generalization estimates for noisy SGD and SGLD.
-
2020–2021
Conditional mutual information bounds
In 2020, he coauthors “Sharpened Generalization Bounds based on Conditional Mutual Information and an Application to Noisy, Iterative Algorithms” with Jeffrey Negrea, Ashish Khisti, Daniel M. Roy and Gintare Karolina Dziugaite, which shows that bounds built on conditional mutual information are tighter than those built on unconditional mutual information and applies them to Langevin dynamics. A 2021 paper with Dziugaite, Shay Moran and Roy, “Towards a Unified Information-Theoretic Framework for Generalization”, investigates whether the conditional mutual information framework can unify generalization bounds in the realizable setting.
-
2022–2023
A Google Brain/DeepMind internship
From September 2022 to December 2022, he is a research intern at Google Brain/DeepMind in Mountain View, working with Thomas Steinke. In 2023, he coauthors “Why Is Public Pretraining Necessary for Private Model Training?” with Arun Ganesh, Milad Nasr, Sewoong Oh, Thomas Steinke, Om Thakkar, Abhradeep Thakurta and Lun Wang, which proposes that training must first select a good basin in the loss landscape, a task that is harder with private data.
-
2024
An ICML Best Paper
In 2024, he coauthors “Information Complexity of Stochastic Convex Optimization: Applications to Generalization, Memorization, and Tracing” with Idan Attias, Gintare Karolina Dziugaite, Roi Livni and Daniel Roy, and it receives a Best Paper award at ICML 2024. The paper characterizes the tradeoff between the accuracy of a learning algorithm and the conditional mutual information it reveals about its training data in stochastic convex optimization.
-
By 2025
Postdoc at Northeastern's Khoury College
By 2025, he is a Distinguished Postdoctoral Fellow at Northeastern University's Khoury College of Computer Sciences, advised by Jonathan Ullman, and he also works with Adam Smith. His research there centers on the theoretical foundations of trustworthy machine learning, with an emphasis on privacy and generalization.
-
2025–2026
Research assistant professor at TTIC
In 2025, he joins the Toyota Technological Institute at Chicago (TTIC) as a research assistant professor. In August 2025, he submits “The Sample Complexity of Membership Inference and Privacy Auditing” with Adam Smith and Jonathan Ullman, which shows for the first time that a membership-inference attacker sometimes needs many more samples than the training algorithm uses, and it is a FOCS 2026 paper.
-
2026
Research Fellow at the Simons Institute
In Spring 2026, he is a Research Fellow at the Simons Institute for the Theory of Computing at UC Berkeley, taking part in the Federated and Collaborative Learning program. His recent interests include problems motivated by language models, such as distillation and inference-time algorithms.
-
Since 2026
Google Research affiliation
His TTIC appointment runs from 2025 to 2026, and his affiliation in 2026 is Google Research. His research interests are machine learning, trustworthy AI, data privacy and information theory.
Career
- Since 2026Google Research
- 2026University of California, BerkeleyResearch Fellow
- Until 2025Northeastern UniversityDistinguished Postdoctoral Fellow
- 2025–2026Toyota Technological Institute at ChicagoResearch Assistant Professor
- 2022GoogleResearch Intern
- 2019ServiceNowResearch Intern
Education
Sources and credits
Photo: We have no published photo of Mahdi Haghifam yet. Send us a free-licensed photo.
- Mahdi Haghifam
- [2004.12983] Sharpened Generalization Bounds based on Conditional Mutual Information and an Application to Noisy, Iterative Algorithms
- [2111.05275] Towards a Unified Information-Theoretic Framework for Generalization
- [2302.09483] Why Is Public Pretraining Necessary for Private Model Training?
- ICML 2024 Awards
- Khoury PhD students, postdocs make the jump to professor in 2025 - Khoury College of Computer Sciences
- TTIC Faculty Alumni
- [2508.19458] The Sample Complexity of Membership Inference and Privacy Auditing
- Mahdi Haghifam

