arXiv:2605. 03065v2 Announce Type: replace Abstract: Generative control policies (GCPs), such as diffusion- and flow-based control policies, have emerged as effective parameterizations for robot learning.
arXiv:2610.35090v1 Announce Type: new Abstract: Test-Time Prompt Tuning (TPT) adapts large pretrained models to unseen target distribution shifts by updating only lightweight prompt tokens. Existing...
arXiv:2505.13546v2 Announce Type: replace-cross Abstract: Automatic prompt generation plays a crucial role in enabling general-purpose multi-agent systems to perform diverse tasks autonomously. Exist...
GFlowPO introduces a probabilistic framework for optimizing language model prompts by treating prompt search as posterior inference over latent prompts, regularized by a meta-prompted reference-LM prior. The method first fine‑tunes a lightweight prompt‑LM using an off‑policy Generative Flow Network objective that reuses past prompt evaluations for sample‑efficient exploration. It then applies a training‑free Dynamic Memory Update to refine the meta‑prompt with diverse and top‑performing prompts, leading to consistent improvements over recent discrete prompt optimization baselines on few‑shot classification, instruction induction, and question‑answering tasks.
The paper investigates how a higher‑level controller in a hierarchical latent reasoner decides whether to preserve or replace a lower‑level strategy. Experiments across different training seeds show that learned revision timing can produce varied policies, but none surpasses a fixed, forced timing policy on the same checkpoint. The study highlights that state‑dependent control can alter actions without improving task performance, and that timing decisions are order‑sensitive and largely captured by a strong fixed schedule.
arXiv:2609.39927v1 Announce Type: new Abstract: Prompt optimization improves the performance of language-model systems on downstream tasks by refining their prompts. Classical methods evaluate prompt...
arXiv:2609.00874v1 Announce Type: new Abstract: As agentic systems become compound systems, increasingly important decisions move above task execution itself: when should a higher-level controller pr...
arXiv:2610.20318v1 Announce Type: cross Abstract: Reinforcement-learning policies for robot locomotion can fail at deployment when operating conditions shift (e.g., rough or slippery terrain, payload...
arXiv:2606. 06698v1 Announce Type: new Abstract: Production agentic systems routinely face evolving constraints and must comply from the very next interaction.
The paper introduces Harness Continual Learning (HCL), a paradigm where an agent’s state evolves through prompts, memories, tools, skills, and routing rules while keeping the underlying foundation model frozen. HCL defines harness-level forgetting and proposes a guarded evolution process involving a Continual Optimizer and Evaluator to ensure improvements without losing prior behavior. Experiments across textual reasoning, multimodal perception, and open‑world interaction show over 10% performance gains and demonstrate how the stability–plasticity trade‑off can be explicitly tuned.
arXiv:2509.23166v4 Announce Type: replace Abstract: Large Language Models (LLMs) employ multi-turn interaction as a fundamental paradigm for completing complex tasks. However, their performance often...
The paper investigates how large language model (LLM) agents can improve performance by storing and reusing experience in external memory. It identifies a problem called error reproduction, where mistakes in stored abstractions propagate through cycles of abstraction, execution, and re-abstraction, leading to persistent errors. To mitigate this, the authors propose Anti-Persistence, a memory design that retains raw trajectories and outcomes but reconstructs task-specific guidance on demand, discarding it after use. Experiments across multiple benchmarks show that Anti-Persistence yields higher held‑out success rates and lower LLM‑call costs compared to other memory designs, supporting the idea of separating experience accumulation from abstraction persistence.