Michael Kim
Also known as Michael P. Kim
Michael Kim is a computer scientist whose research develops algorithms for responsible machine learning. He earned a computer science PhD at Stanford in 2020 and served as a Miller postdoctoral fellow at UC Berkeley, hosted by Shafi Goldwasser, in March 2023. His papers cover multicalibration, auditing risk predictions, hidden model backdoors, privacy certification and omniprediction. As of October 2026, he is an assistant professor of computer science at Cornell, where he coauthors work on hybrid online learning.
- Now at
- Cornell University
Timeline
-
2018
Multicalibration for fair predictions
In 2018, he coauthors Multicalibration: Calibration for the (Computationally-Identifiable) Masses at ICML. The paper defines a fairness measure that offers calibrated predictions across computationally identifiable subgroups.
-
2020
A Stanford PhD in fairness
In 2020, he completes a computer science PhD at Stanford with the dissertation A Complexity-Theoretic Perspective on Fairness.
-
November 2020
Outcome Indistinguishability
In November 2020, he coauthors Outcome Indistinguishability, a framework that uses computational indistinguishability to study prediction algorithms. The paper argues that auditors need oracle access to risk-prediction systems.
-
2022
Undetectable backdoors in models
In 2022, he coauthors Planting Undetectable Backdoors in Machine Learning Models. The paper presents one method using digital signatures and another for Random Fourier Features or Random ReLU models.
-
March 2023
A Miller postdoc at Berkeley
In March 2023, he is a postdoctoral research fellow at UC Berkeley's Miller Institute, hosted by Shafi Goldwasser. His seminar presents research on foundations of responsible machine learning.
-
2024
Certifying private mechanisms
For CRYPTO 2024, he coauthors Certifying Private Probabilistic Mechanisms. Its protocol requires an untrusted party to follow a specified probabilistic mechanism or be caught, and the paper demonstrates certification for differentially private counting queries.
-
2025
Algorithms for omniprediction
In 2025, he coauthors Near-Optimal Algorithms for Omniprediction, which develops online and offline learning algorithms for predictions across a class of loss functions.
-
As of October 2026
Assistant professor at Cornell
As of October 2026, he is an assistant professor of computer science at Cornell and researches algorithmic methods for responsible machine learning. In 2026, he coauthors Oracle-efficient Hybrid Learning with Constrained Adversaries, an efficient ERM-oracle algorithm for online learning with constrained adversarial labels.
Career
- NowCornell UniversityAssistant professor of computer science
- 2023University of California, BerkeleyPostdoctoral research fellow
Education
- 2020Stanford UniversityPhD
Sources and credits
Photo: We have no published photo of Michael Kim yet. Send us a free-licensed photo.
- Multicalibration: Calibration for the (Computationally-Identifiable) Masses
- A complexity-theoretic perspective on fairness | Stanford Digital Repository
- [2011.13426] Outcome Indistinguishability
- [2204.06974] Planting Undetectable Backdoors in Machine Learning Models
- CITP Seminar: Michael Kim – Foundations of Responsible Machine Learning | Princeton Alumni
- Certifying Private Probabilistic Mechanisms
- [2501.17205] Near-Optimal Algorithms for Omniprediction
- Michael Kim | Department of Computer Science | Cornell Bowers
- [2603.04546] Oracle-efficient Hybrid Learning with Constrained Adversaries


