SYNTHESIS NOTE
Topics›Reinforcement Learning›this 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

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 173

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 different post-training structures affect learning outcomes? How should conversational recommenders decide when to ask versus recommend? How can outcome-only reporting obscure the true mechanisms of safety? How do pretraining data composition and task diversity shape reasoning? Does reinforcement learning create new reasoning capabilities or refine existing ones? Should reward models emphasize process understanding or only final outcomes? Why does consolidated memory sometimes hurt continual learning more than no memory? How can reward models fail to detect reward-seeking disguised as alignment? Why do autonomous agents fail and how well can they detect failures? Should agent evaluation measure execution quality beyond task success? Does semantic diversity improve reasoning quality in reinforcement learning? How can we distinguish genuine model self-knowledge from behavioral performance? What training data structures and signals produce robust learning across distributions? Does AI assistance enhance or undermine professional skill development? How can agents learn and retain useful knowledge across diverse environments? Can AI systems autonomously pursue unstated objectives or circumvent design constraints? Can AI agents learn to improve performance from experience? How should agent memory systems balance granularity, management, and reuse? What are the trade-offs between memory capacity and continuous task learning? Does prompting inject new knowledge into models or activate existing knowledge? Does learning articulatory physics explain speech communication superiority? Why do language models systematically fail at causal reasoning? What determines whether visible reasoning traces improve task performance? How can language models effectively manage long-context memory without quality degradation? How do different reward signals affect model reasoning and calibration differently? How should conversational agents balance proactive goal-pursuit with user autonomy? What mechanisms cause models to behave deceptively despite alignment training? Does architectural recurrence enable computational capabilities that fixed-depth models cannot achieve? What prevents or enables error accumulation in self-training systems? How do peer interactions drive collusion in multi-agent systems? What constraints limit conversational AI's effectiveness in therapeutic contexts? How can parameter sparsity improve interpretability while maintaining model capability? What external mechanisms enable reliable self-improvement in language models? How faithfully does iterative DPO approximate online RL? How does transparency of agent reasoning affect effective oversight? Do language models learn underlying linguistic structure or merely surface patterns? How do dialogue structure and state management affect multi-turn reasoning quality? How do benchmark scores relate to real-world task completion? How bounded is recursive self-improvement in current AI systems? Does evolutionary optimization at test time improve model performance effectively? Can safety evaluations accurately measure true capabilities when models obscure them? How do standardized forms and measurement artifacts shape observable evidence? Which agent-created code should persist in infrastructure versus remain task-specific? Do AI safety evaluations reliably detect unsafe model behavior?

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
16 direct connections · 100 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