Ph.D. student, Stanford AI
I am a final-year Ph.D. student at Stanford University, advised by Chelsea Finn and Aviral Kumar, and a Research Scientist Intern at Meta Superintelligence Labs (MSL). Prior to Stanford, I was at UC Berkeley, where I was advised by Sergey Levine, and I have held internships at Microsoft Research NYC, Google DeepMind Robotics, and Toyota Research Institute. My research is supported by the NSF Graduate Research Fellowship.
My research develops efficient adaptation algorithms for open-ended discovery, with the long-term goal of building AI systems that can make progress on problems such as scientific research. Large-scale pre-training and post-training have given foundation models broad world knowledge and strong reasoning priors, yet adapting to novel environments remains a bottleneck when tasks require new knowledge or behaviors. I study how AI systems can adapt efficiently through interaction, developing algorithms for three complementary capabilities: exploring new behaviors, incorporating new knowledge, and uncovering the underlying structure of an environment. Together, these capabilities can form a flywheel for improvement in open-ended settings, where agents synthesize experience and new knowledge gathered through environmental interaction to direct future exploration.
I’m on the industry job market for 2026–27. Please reach out via email!
Under Submission to ICLR 2027
Trains a builder agent with RL to curate document corpora into reusable workspaces that anticipate future queries and preserve links to source documents.
ICLR 2026 · ES-FoMo Workshop @ ICML 2025 Spotlight
A multi-agent RL method (RLAD) that trains LLMs to discover reusable reasoning abstractions, steering exploration toward useful strategies on hard problems.
LM4Sci Workshop @ CoLM 2026 Oral
An LM trained with RL to anticipate a paper's core insight from its foundational references, generalizing to unseen scientific disciplines.
Reasoning and Planning for LLMs Workshop @ ICLR 2025 Runner-Up Best Paper
Pairs process verifiers with preemptive backtracking to resample only problematic steps, cutting test-time compute.
CoLM 2025 Oral
Shows that intrinsic reasoning behaviors — verification, backtracking, subgoal setting, and backward chaining — are what let LLMs self-improve under reinforcement learning.
Preprint 2025
Extends chain-of-thought by explicitly modeling the latent reasoning behind each CoT, via process supervision, synthetic data, and search.
Preprint 2024
A generative self-evaluation scheme that lets an LLM predict mid-generation whether restarting would yield a better response, cutting sampling cost.
CoLM 2025
Over 250,000 high-quality, verifiable math problems built for reinforcement learning in language models.
ICLR 2026
FSPO, a meta-learning framework that leverages in-context learning to personalize LLM responses to individual users from only a few preferences.
ICML 2024
Shows that on-policy sampling and negative-gradient methods outperform offline maximum-likelihood objectives for preference fine-tuning.
TMLR 2026
HyRe adapts a multi-head model at test time from about five labeled examples, matching state-of-the-art reward models at the cost of fine-tuning one.
CVPR 2025
Personalizes text-to-image diffusion models from a few examples via user preference embeddings and cross-attention during DPO fine-tuning.
RSS 2023
Combines offline-RL pre-training on diverse robot data with rapid fine-tuning, learning new tasks from as few as 10 demonstrations.
NeurIPS 2023
A calibrated, conservative value initialization that enables fast and stable offline-to-online fine-tuning.
NeurIPS 2023
Reworks the CQL distribution constraint into an approximate support constraint, enabling offline RL on realistic, heteroskedastic data.