Bhavana Dalvi Mishra
I am a Staff Research Scientist at Google, specializing in self-evolving agents, interactive reasoning, and AI for scientific discovery. My current focus is on building intelligent systems that can adapt dynamically, reason effectively, and accelerate how we process complex information. I am deeply committed to fostering the next generation of AI talent and am always open to mentoring student researchers and partnering with internal teams across Google in pushing the boundaries of AI reasoning and agent self-evolution. https://scholar.google.com/citations?hl=en&user=9e0uFr4AAAAJ&view_op=list_works&authuser=1&sortby=pubdate
Prior to Google, I was a Lead Research Scientist at the Allen Institute for AI (Ai2). I hold a Ph.D. in Computer Science from Carnegie Mellon University and a Master's from IIT Bombay. My research contributions have been honored with a Google Ph.D. Fellowship, CMU's Barbara Lazarus Women@IT Fellowship, and two Best Paper runner-up awards.
Prior to Google, I was a Lead Research Scientist at the Allen Institute for AI (Ai2). I hold a Ph.D. in Computer Science from Carnegie Mellon University and a Master's from IIT Bombay. My research contributions have been honored with a Google Ph.D. Fellowship, CMU's Barbara Lazarus Women@IT Fellowship, and two Best Paper runner-up awards.
Authored Publications
Sort By
LiSA: Lifelong Safety Adaptation via Conservative Policy Induction
Minbeom Kim
Phil Wallis
Bharath Chandrasekhar
Kyomin Jung
NeurIPS (2026)
Preview abstract
Large language model agents increasingly act in deployment environments where failures are contextual, user-specific, and costly. In such settings, a \emph{static general-purpose guardrail is often insufficient}: whether an action should be allowed may depend on local privacy norms, organizational rules, or evolving user expectations that are difficult to enumerate fully in advance. We study \emph{lifelong deployment-time guardrail adaptation}, where a fixed base guardrail improves over time from sparse, noisy user-reported failures without repeated fine-tuning. We propose a conservative policy induction framework organized as an online--offline loop. Online, the deployed guardrail uses structured policy memory to guide runtime decisions. Offline, newly accumulated reports are converted into reusable policy items and folded back into memory through periodic refresh. The method combines three ingredients: \emph{broad policy abstraction} for sparse failure generalization, \emph{conflict-aware local policies} for mixed-label regions where broad reuse becomes too coarse, and \emph{confidence-gated reuse} based on conservative posterior lower bounds so that weakly supported memory does not influence inference too early. Across PrivacyLens+, ConFaide+, and AgentHarm, the resulting system consistently improves over a lightweight base guardrail and strong memory-based baselines in sparse-feedback regimes, remains robust to noisy feedback, traces a better cost--performance frontier than scaling the base model alone, and jointly reduces over-refusal and over-acceptance without an explicit balance knob.
View details
Preview abstract
Autonomous research agents can now produce competitive solutions and complete manuscripts, yet their papers routinely contain fabricated citations, method descriptions disconnected from the code, and scores on incorrect scales---failures invisible to evaluations that assess fluency rather than evidentiary grounding. The core problem is verifiability: no existing system maintains a traceable chain from each claim in the paper to its grounding evidence, and current evaluation protocols assess output fluency rather than evidentiary grounding. We address this with Chaine-of-Evidence (CoE), a verifiability standard requiring every claim to trace to its grounding evidence, and instantiate it in Scientist One, an end-to-end research system that maintains evidence chains natively, and CoE Audit, an evaluation protocol with four integrity checks targeting the most damaging chain failures. Auditing 60 papers from four systems, we find every baseline exhibits at least one failure: phantom citations at 4--25%, method-code alignment in at most 2/15 papers. Scientist One achieves zero phantom citations (0/830), the highest alignment rate (7/15), and competitive solver scores.
View details
Preview abstract
Automating AI research differs from general software engineering due to computationally expensive evaluation (e.g., model training) and opaque performance attribution. Current LLM-based agents struggle here, often generating monolithic scripts that ignore execution costs and causal factors. We introduce MARS (Modular Agent with Reflective Search), a framework optimized for autonomous AI research. MARS relies on three pillars: (1) Budget-Aware Planning via cost-constrained Monte Carlo Tree Search (MCTS) to explicitly balance performance with execution expense; (2) Modular Construction, employing a "Design-Decompose-Implement" pipeline to manage complex research repositories; and (3) Comparative Reflective Memory, which addresses credit assignment by analyzing solution differences to distill high-signal insights. MARS achieves state-of-the-art performance among open-source frameworks on MLE-Bench under comparable settings, maintaining competitiveness with the global leaderboard's top methods. Furthermore, the system exhibits qualitative "Aha!" moments, where 63% of all utilized lessons originate from cross-branch transfer, demonstrating that the agent effectively generalizes insights across search paths.
View details
