SYNTHESIS NOTE
TopicsReinforcement Learningthis note

Should successful and failed episodes be processed differently?

Explores whether asymmetric treatment of trajectories—preserving successes as full demonstrations while abstracting failures into lessons—could improve both the utility and efficiency of memory in reinforcement learning agents.

Synthesis note · 2026-05-18 · sourced from Reinforcement Learning
How should agents split planning from visual grounding? How does test-time scaling work at the agent level?

Existing memory-based RL methods primarily store raw trajectories. Raw trajectories are token-heavy and noise-saturated; storing them indiscriminately produces context pollution that degrades policy improvement. The alternative — uniform abstraction across all trajectories — destroys the specificity that makes the experience useful.

SkillRL (2602.08234) introduces differential processing as the load-bearing architectural choice. Successful episodes are preserved as full demonstrations — their specific action sequences are exactly what should be reused. Failed episodes are synthesized into concise failure lessons — the specifics of what went wrong don't transfer, but the abstracted lesson does. The asymmetry mirrors how human experts treat experience: remember concrete successes vividly, generalize failures into rules.

The two trajectory types feed a hierarchical SkillBank, partitioned into general skills (universal strategic guidance) and task-specific skills (task-level heuristics). The skill library co-evolves with the agent's policy through recursive failure analysis — each new RL iteration both refines the policy and updates the skill library based on what worked and what didn't.

The differential-processing claim resolves a tension across the agent-memory literature. Does agent memory degrade when continuously consolidated? shows that uniform consolidation regresses below baseline because the consolidation step strips applicability conditions. SkillRL's asymmetric treatment is the proposed fix: preserve raw episodes where the specifics matter (successes), abstract where they don't (failures-as-lessons). This is the third positive case for the condition-preservation hypothesis — alongside ReasoningBank (strategy-level distillation with conditions) and CLIN (causal abstractions preserving "may be necessary"). See ops/tensions/strategy-distillation helps when applicability conditions survive — and hurts when they are stripped.md.

The conceptual move is that abstraction is the right operation for some trajectory types and the wrong operation for others. Treating all experience the same — uniformly raw OR uniformly abstracted — is the failure mode. The right architecture differentiates by trajectory type, with the differentiation being driven by what each type actually contributes to future decision-making.

Empirically, SkillRL achieves state-of-the-art on ALFWorld and WebShop while using substantially less context than raw-trajectory-based memory approaches. The compression comes from the abstraction-of-failures step; the performance comes from preserving the demonstrations-of-successes step. Both halves of the asymmetry are doing work.

Update (2026-05-28) — the topological expression of the success-side operation. FluxMem (2605.28773, "Rethinking Memory as Continuously Evolving Connectivity") performs the differential-processing principle's success-side step as graph topology rather than a skill library. Its Long-Term Consolidation stage clusters recurring successful trajectories and crystallizes them into stable procedural circuits — high-utility pathways that mature (monitored by a convergence metric) so that recurring tasks bypass redundant retrieval and directly activate the mature subgraph. This is SkillRL's "preserve successes as reusable demonstrations" claim recast on a heterogeneous memory graph: where SkillRL stores successful episodes as full demonstrations in a SkillBank, FluxMem stores them as crystallized connections between co-activated units. The convergence is informative — two independently developed systems land on the same operation (durably encode recurring successes for direct reuse) through different data structures, which strengthens the case that the success/failure asymmetry is a structural requirement of self-evolving agent memory, not an artifact of one architecture.

Inquiring lines that read this note 129

This note is a source for these research framings, grouped by the broader line of inquiry each explores. Scan the bold lines of inquiry; follow any specific question forward.

How do self-generated feedback mechanisms enable effective model learning? How do aggregate reward models systematically exclude minority user preferences? How can AI systems learn from failures without cascading errors? How should dialogue systems best leverage conversation history for retrieval? What determines success in training models on multiple tasks? What constrains reinforcement learning's ability to expand model reasoning? How can process reward models supervise complex reasoning traces? What pretraining choices and baseline capability constrain reinforcement learning gains? What memory architectures best support persistent reasoning across extended interactions? Why do agents confidently report success despite actually failing tasks? Can alternative training methods improve on supervised fine-tuning for language models? Can ensemble evaluation methods reduce bias more than single judges? What properties determine whether reward signals teach genuine reasoning? Does self-reflection enable models to reliably correct their errors? How does AI adoption affect human skill development and labor equality? Why does reinforcement learning suppress output diversity compared to supervised fine-tuning? Does externalizing cognitive work and state improve agent reliability? How should iterative research systems allocate reasoning per search step? Can language model RL training avoid reward hacking and misalignment? How can AI agents autonomously learn and transfer skills across tasks? Why do continual learning scenarios trigger catastrophic forgetting and interference? Can prompting inject entirely new knowledge into language models? When does optimizing for quality undermine the value of diversity? How do LLMs distinguish causal reasoning from temporal and semantic associations? How does latent reasoning compare to verbalized chain-of-thought? How should agents balance memory condensation to optimize context efficiency? Does alignment training create blind spots in detecting genuine safety threats? Does reinforcement learning teach reasoning or just when to reason? What memory abstraction level best enables agent knowledge reuse? How can models identify insufficient information and respond appropriately without guessing? Why do reward structures fail to shape long-term agent learning? How should memory consolidation strategies shape agent performance over time? Why does consolidated memory sometimes degrade agent performance? How do multi-agent systems achieve genuine cooperation and reasoning? Can AI systems balance emotional competence with factual reliability? How does sequence length affect sparsity tolerance in models? What makes weaker teacher models effective for stronger student training? How do policy learning algorithm choices affect multi-objective optimization stability? How do training priors constrain what context information can override? How should models express uncertainty rather than forced confident answers? How should retrieval systems optimize for multi-step reasoning during inference? Why do multi-turn conversations degrade AI intent and coherence? Why do benchmark improvements fail to reflect actual reasoning quality? Can single-axis benchmarks accurately predict agent deployment success?

Related concepts in this collection 8

This note in its neighbourhood — explore the map, then jump to a related concept in the list below.

Concept map
13 direct connections · 86 in 2-hop network ·medium cluster Open in graph ↗

Click a node to walk · click center to open · click Open in graph to see this note in the full knowledge graph

your link semantically near linked from elsewhere

Related papers in this collection 8

Papers most semantically related to this note, ranked by cosine similarity in the embedding space.

Original note title

recursive skill-augmented RL applies differential processing to trajectories — successful episodes preserved as demonstrations while failures distilled into concise lessons