RIZZ: Routing Interactions to Near Zero-Interference Zones for Continual Adaptation of Black-Box Agents

• URL: http://arxiv.org/abs/2606.20638v1
• Date: Tue, 02 Jun 2026 14:40:01 GMT
• Title: RIZZ: Routing Interactions to Near Zero-Interference Zones for Continual Adaptation of Black-Box Agents
• Abstract summary: RIZZ is a continual adaptation framework for compound language-model systems.<n>It learns entirely through verifier-gated memory, routing, and prompt compilation.<n>RIZZ targets the regime where adaptation must occur online under context budgets.
• Score: 0.09786690381850356
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Large language models are increasingly deployed as long-lived agents that must adapt across users, tasks, domains, modalities, and feedback regimes without access to model weights. Existing black-box adaptation methods typically optimize a single prompt, maintain an undifferentiated memory, or rely on repeated rollout-heavy search. However, these designs struggle when streams of input are nonstationary, feedback is sparse, and failures from one task family can contaminate behavior on another. We introduce RIZZ (Routing Interactions to Near Zero-interference Zones), a continual adaptation framework for compound language-model systems that learns entirely through verifier-gated memory, routing, and prompt compilation. RIZZ organizes input streams into dynamically spawned memory branches. At inference time, either while online or offline, a context-aware router selects or creates a branch that retrieves branch-local, global, graph-structured, and working-memory context, which is compiled into a bounded prompt together with retrieved task evidence. After the model acts, task verifiers score the output, and only verified interactions can update memory, promote reusable rules, demote harmful rules, or create anti-patterns. This yields a black-box agent that improves through persistent natural-language feedback while explicitly controlling interference. RIZZ targets the regime where adaptation must occur online under context budgets. Finally, we demonstrate the effectiveness of our framework against state-of-the-art baselines on competitive benchmarks.

Related papers

• ScrambleToolBench: Agents Search Exhaustively Even When Their Own Map Points to the Next Step [74.83535434786145]
  We introduce ScrambleToolBench, an interactive terminal benchmark designed to isolate behavioral reasoning.<n>The benchmark requires agents to uncover hidden tool behaviors entirely through trial-and-error interaction.<n>Our evaluation of state-of-the-art language models reveals that successful initial discovery does not translate into robust adaptation.
  arXiv  Detail & Related papers  (2026-08-03T15:07:46Z)
• STAMP: Training Explicit Memory for Mobile GUI Agents in Controllable and Scalable Virtual Environments [63.39393178045112]
  Mobile agents excel at immediate reactive control but frequently fail in realistic, longhorizon tasks that require memory.<n>We present STAMP, a framework that trains explicit memory in mobile agents through controllable virtual environments.<n>The resulting StampGUI agent sets a new high watermark on our Memory-World benchmark, demonstrating exceptional memory accuracy and task resilience.
  arXiv  Detail & Related papers  (2026-05-28T04:00:13Z)
• OLIVIA: Online Learning via Inference-time Action Adaptation for Decision Making in LLM ReAct Agents [74.20327254615854]
  Large language model agents interleave reasoning, action selection, and observation to solve sequential decision-making tasks.<n>Existing inference-time adaptation methods for LLM agents mainly rely on prompting or retrieval.<n>We propose OLIVIA, an inference-time action adaptation framework for ReAct-style agents.
  arXiv  Detail & Related papers  (2026-05-11T19:28:20Z)
• MoshiRAG: Asynchronous Knowledge Retrieval for Full-Duplex Speech Language Models [62.05118198431989]
  Asynchronous full-speech models are distinguished by their full-time interactivity and naturalness of AI pauses.<n>Our framework enables the model to identify knowledge-demand conversational queries and ground responses in external information.<n>Our design supports plug-and-play retrieval methods without retraining and demonstrates strong performance on out-of-toe reasoning tasks.
  arXiv  Detail & Related papers  (2026-04-14T16:17:52Z)
• GAM: Hierarchical Graph-based Agentic Memory for LLM Agents [45.876418535406714]
  Large Language Model (LLM) agents must navigate the tension between acquiring new information and retaining prior knowledge.<n>Current unified stream-based memory systems facilitate context updates but remain vulnerable to interference from transient noise.<n>We propose GAM, a hierarchical Graph-based Agentic Memory framework that explicitly decouples memory encoding from consolidation.
  arXiv  Detail & Related papers  (2026-04-14T04:53:00Z)
• PERMA: Benchmarking Personalized Memory Agents via Event-Driven Preference and Realistic Task Environments [72.02445514666428]
  We introduce PERMA, a benchmark designed to evaluate persona consistency over time beyond static preference recall.<n>PerMA consists of temporally ordered interaction events spanning multiple sessions and domains, with preference-related queries inserted over time.<n> Experiments demonstrate that by linking related interactions, advanced memory systems can extract more precise preferences and reduce token consumption.
  arXiv  Detail & Related papers  (2026-03-24T14:04:11Z)
• Relevance Feedback in Text-to-Image Diffusion: A Training-Free And Model-Agnostic Interactive Framework [7.254162537916632]
  We propose RFD, an interactive framework that adapts the relevance feedback mechanism from information retrieval to diffusion models.<n>In RFD, users replace explicit textual dialogue with implicit, multi-select visual feedback to minimize cognitive load.<n>RFD operates entirely within the external text space, making it strictly training-free and model-agnostic as a universal plug-and-play solution.
  arXiv  Detail & Related papers  (2026-03-16T07:38:23Z)
• Memory for Autonomous LLM Agents:Mechanisms, Evaluation, and Emerging Frontiers [0.42061757959666934]
  Large language model (LLM) agents increasingly operate in settings where a single context window is too small to capture what has happened.<n>Memory is what turns a stateless text generator into a genuinely adaptive agent.<n>This survey offers a structured account of how memory is designed, implemented, and evaluated in modern LLM-based agents.
  arXiv  Detail & Related papers  (2026-03-08T15:08:01Z)
• AMA: Adaptive Memory via Multi-Agent Collaboration [54.490349689939166]
  We propose Adaptive Memory via Multi-Agent Collaboration (AMA), a novel framework that leverages coordinated agents to manage memory across multiple granularities.<n>AMA significantly outperforms state-of-the-art baselines while reducing token consumption by approximately 80% compared to full-context methods.
  arXiv  Detail & Related papers  (2026-01-28T08:09:49Z)
• From Atom to Community: Structured and Evolving Agent Memory for User Behavior Modeling [25.74573956240653]
  STEAM (textittextbfSTructured and textbfEvolving textbfAgent textbfMemory) is a novel framework that reimagines how agent memory is organized and updated.<n>It decomposes preferences into atomic memory units, each capturing a distinct interest dimension with explicit links to observed behaviors.<n>To exploit collaborative patterns, STEAM organizes similar memories across users into communities and generates prototype memories for signal propagation.
  arXiv  Detail & Related papers  (2026-01-23T16:24:57Z)
• Towards Rehearsal-Free Continual Relation Extraction: Capturing Within-Task Variance with Adaptive Prompting [2.818102173042532]
  WAVE++ is a novel approach inspired by the connection between prefix-tuning and mixture of experts.<n>We introduce task-specific prompt pools that enhance flexibility and adaptability across diverse tasks.<n>We incorporate label descriptions that provide richer, more global context, enabling the model to better distinguish among different relations.
  arXiv  Detail & Related papers  (2025-05-20T05:22:17Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.