I'm a Research Scientist at Google DeepMind working on improving Gemini's fundamental capabilities for generative and agentic retrieval.
I completed my Ph.D. in Statistics at the University of Michigan in 2025, where I was fortunate to be advised by Ambuj Tewari. My Ph.D. was graciously supported by the 2022 National Science Foundation Graduate Research Fellowship (NSF GRFP) and the 2025 Apple Scholars in AI/ML PhD Fellowship. Prior to my Ph.D, I double-majored in Computer Science and Chemical Engineering and worked with Mahdi Cheraghchi, Sindhu Kutty, and Andrej Lenert.
My research interests lie in the Foundations of Machine Learning. During my Ph.D, I worked on various topics in learning theory, including online learning, adversarial robustness, differential privacy, and language generation. Nowadays, I work broadly in Post-training and Reinforcement Learning for large language models.
My younger brother is a classical trumpeter.
Selected Publications
- S1Missing Mass for Differentially Private Domain Discovery International Conference on Learning Representations (ICLR), 2026
- S2Generation through the lens of learning theory Conference on Learning Theory (COLT), 2025
- S3Apple Tasting: Combinatorial Dimensions and Minimax Rates Conference on Learning Theory (COLT), 2024
In Submission
- W1GroupDPO: Memory Efficient Group-wise Direct Preference Optimization In Submission, 2026
- W2On Generation in Metric Spaces In Submission, 2026
- W3Optimal Stopping vs Best-of-N for Inference Time Optimization In Submission, 2026
Preprints
- P1Estimating the (Un)seen: Sample-dependent Mass Estimation Preprint, 2025
- P2AdaBoN: Adaptive Best-of-N Alignment Preprint, 2026
- P3Transductive and Learning-Augmented Online Regression Preprint, 2025
- P4Online Boosting for Multilabel Ranking with Top-k Feedback Preprint, 2020
All Publications
- 1AI-rithmetic ICLR Workshop on I Can't Believe It's Not Better (ICBINB), 2026
- 2Learning to Choose or Choosing to Learn: Best-of-N vs. Supervised Fine-Tuning for Bit String Generation AISTATS 2026 · DeepMath 2025
- 3Generation through the lens of learning theory Conference on Learning Theory (COLT), 2025
- 4Representative Language Generation International Conference on Machine Learning (ICML), 2025
- 5Generation from Noisy Examples International Conference on Machine Learning (ICML), 2025
- 6Missing Mass for Differentially Private Domain Discovery ICLR, 2026
- 7Tracking the Best Expert Privately ICML, 2025
- 8Faster Rates for Private Adversarial Bandits ICML, 2025
- 9Online Classification with Predictions NeurIPS, 2024
- 10Smoothed Online Classification can be Harder than Batch Classification NeurIPS, 2024
- 11Multiclass Transductive Online Learning NeurIPS, 2024
- 12On Proper Learnability between Average- and Worst-case Robustness NeurIPS, 2023
- 13The Complexity of Sequential Prediction in Dynamical Systems L4DC, 2025
- 14A Unified Theory of Supervised Online Learnability ALT, 2025
- 15Online Learning with Set-Valued Feedback COLT, 2024
- 16Online Infinite-Dimensional Regression: Learning Linear Operators ALT, 2024
- 17Multiclass Online Learning and Uniform Convergence COLT, 2023
- 18Online Agnostic Multiclass Boosting NeurIPS, 2022
- 19Apple Tasting: Combinatorial Dimensions and Minimax Rates COLT, 2024
- 20Multiclass Online Learnability under Bandit Feedback ALT, 2024
- 21A Characterization of Multioutput Learnability Journal of Machine Learning Research (JMLR), 2024
- 22On the Learnability of Multilabel Ranking NeurIPS, 2023
- 23Design of thermophotovoltaics for tolerance of parasitic absorption Optics Express, 2019
