MMODELYST
Papers/Evaluating Memory Condensation Strategies for Coding Agents in Data-Driven Scientific Discovery
PAP

Evaluating Memory Condensation Strategies for Coding Agents in Data-Driven Scientific Discovery

May 13, 2026

arXiv
Abstract

Coding agents accumulate extensive context during long-running tasks, yet fixed context windows force practitioners to choose between truncation and task failure. While numerous memory condensation strategies have been proposed, from simple sliding windows to LLM-generated summaries, no systematic comparison exists to guide strategy selection, especially in scientific discovery tasks. We evaluate eight memory condensation strategies using GPT-4o on sixty DiscoveryBench tasks spanning six scientific domains (480 total evaluations). We find that no condenser significantly alters hypothesis quality, while LLM-based condensers increase token costs by 24-94 percent, and masking tool-call outputs achieves an 8.6 percent net savings. We also observe that the optimal condenser for data-driven scientific discovery varies by scientific domain and task length.

Select text to highlight · click a highlight to remove · saved in this browser only
Authors
Renuka Chintalapati, Sid Raskar, Anurag Acharya, Jared Willard, Patrick Emami, Sameera Horawalavithana
Your notes (browser-local)
saved
arXiv:2605.18854