Skip to content

RECAP: Regression Evaluation for Continual Adaptation of Prompts

Jun 2026 · arXiv.org · Vol abs/2606.06698 · 0 citations · 32 references
Computer Science

TL;DR

RecAP is introduced, a benchmark that measures continual-learning phenomena at the constraint level under a strictly proactive adapt-then-test protocol: prompt optimization methods receive only the constraint specification and must generalize before seeing any test data.

Abstract

Production agentic systems routinely face evolving constraints and must comply from the very next interaction. Scenarios like a tool-call notification changing a compliance threshold or a policy update adding disclosure requirements fit this criteria, having close to no room for errors in production. This proactive adaptation setting is common in deployment, but absent from current benchmarks, which assume either static constraint sets or reactive protocols with evaluation feedback. We introduce RECAP, a benchmark that measures continual-learning phenomena (forgetting, regression, forward transfer) at the constraint level under a strictly proactive adapt-then-test protocol: prompt optimization methods receive only the constraint specification and must generalize before seeing any test data. Evaluating six methods across five LLMs and three schedules with evolving constraints, we find that these methods show no significant improvement in performance, even after incurring a higher latency. These methods, designed for offline or reactive settings, are inadequate for the proactive paradigm. Our work emphasizes the growing need for designing proactive prompt adaptation methods, where the models must remain robust to evolving needs in deployment.

View source

Similar papers

Preprint Aug 2026

CAPO: Constraint-Aware Prompt Optimization for LLM Agents

This work introduces CAPO (Constraint-Aware Prompt Optimization), a primal-dual method that combines pool-based rewrites with adaptive constraint weighting to optimize system prompts under explicit operational constraints.

Victor Ye Dong, Reid Pryzant, Yi Liu et al. · 0 citations
#artificial intelligence Review Sep 2026

CART: Closed-Loop Adaptive Red Teaming for Large Language Models

Automated red teaming often replays a fixed set of prompts, which measures known risks but cannot learn from failures found during testing. We present CART (Closed-Loop Adaptive Red Teaming), a framework that uses each result to guide what it tests next. CART begins with broad risk coverage, follows weaknesses that eme...

Dong-Dong Zhang, Teng-Chao Lv, Yi-Ling Jia et al. · 0 citations
#human-computer interacti... Preprint Sep 2026

Prompting Against Persona Drift: Comparing Intervention Timing and Content in LLM-Simulated Conversations

Simulating student personas with large language models (LLMs) enables scalable evaluation of educational systems. However, behavioral drift, a progressive decline in persona consistency, can emerge over extended conversations, limiting the validity of such simulations. We evaluate five prompt-level mechanisms using sep...

Nicolas Leins, Jennifer Haase, Varvara Geronimus et al. · 0 citations
Preprint Aug 2026

PILOT Technical Report

PILOT (Proactive Insight Learner for Online Tree-Experiments), an LLM-agent framework that organizes three roles within a constrained control loop where deterministic services enforce all safety, statistical, and permission boundaries, is presented.

Jiuning Lin, Ruiquan Lan, Xiaodong Zhu et al. · 0 citations
#natural language process... Preprint Sep 2026

AdaGEPA: Adaptive Feedback Allocation for Reflective Prompt Optimization

AdaGEPA is proposed, an adaptive feedback-allocation method that uses the prompt's performance and task structure to select examples for the next prompt revision, and highlights the potential of adaptive feedback allocation to improve both the effectiveness and rollout-budget efficiency of reflective prompt optimizatio...

Jun-Yang Chen, Ze-Cheng Wang, Jing-Bang Chen · 0 citations

Related blog posts

MIT News · Artificial Intelligence Aug 27, 2026

Looking beyond natural sequences

A new machine-learning framework aims to improve the success rate of computational protein design while moving away from results that reproduce sequences found in nature.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.