- Rating
- 1
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper addresses skill repository bloat in self-evolving LLM agents. It proposes SkillAge, a lifecycle governance framework that computes a six-dimensional handcrafted retention score, models skill state transitions (Retain, Decay, Refresh, Protect, Quarantine) as a Constrained Markov Decision Process (CMDP) trained via primal-dual reinforcement learning, and verifies candidate deletions through historical task replay (Algorithm 1). Experiments on a 238-task stream (158 initial skills) across three LLM backbones report 87%-90% repository compression while maintaining task utility.
Critical strengths
Practical regression-testing intuition for skill pruning. Treating skill deletion as a reversible process gated by historical task replay (Algorithm 1) is a sensible engineering practice, analogous to regression testing for software plugins. The ablation in Table 6 (- Quarantine Replay, where degradation rises from 0.031 to 0.142) demonstrates that outcome-based verification before permanent deletion effectively prevents the accidental removal of useful skills.
Critical weaknesses
W1. Unjustified complexity of the CMDP/RL controller and incomplete MDP specification. Skills in modern agent frameworks are modular tools whose maintenance primarily requires deduplication, usage tracking, and regression testing. In SkillAge, the authors already define a comprehensive handcrafted retention score (Eq. 7), enforce a hard quarantine threshold (Eq. 8), and deterministically sort candidates by during replay (Algorithm 1). With these explicit heuristics and hard verification gates already in place, the necessity of training a 3-layer MLP policy via primal-dual RL is unconvincing. Notably, the paper omits the most fundamental ablation: removing the RL policy and directly triggering Algorithm 1 whenever (or equipping baseline heuristics with Algorithm 1). Moreover, the MDP formulation itself is incomplete: (i) the Decay action has no mathematical definition anywhere in the paper or appendices and never enters the retrieval scoring function; and (ii) Table 2 and Figure 9 report 1,500 RL policy updates on an online stream of only 238 tasks, which is impossible in a true single-pass online setting without multi-epoch offline training on the test stream.
W2. Theoretical over-packaging and a direct contradiction between Theorem 1 and Table 6. Several theoretical claims formalize elementary algebra as heavy theorems. Theorem 1 (Appendix B.1) simply states that if each step enforces and updates , then , which is a trivial accounting identity. Similarly, Proposition 1 invokes Clarke's generalized subdifferential merely to differentiate a 1D piecewise-linear hinge function with slopes 1/6 and 1/12, and Corollary 1 is a simple rearrangement of . More importantly, Theorem 1 directly contradicts the empirical results in Table 6: as long as Algorithm 1 (Quarantine Replay) is active, the hard gate must bound cumulative replay degradation by regardless of how candidates are proposed. Yet in Table 6, three ablations that retain Quarantine Replay (- Retention Barrier, - Epistemic Buffer, and Fixed Dual Multiplier) report replay degradations of 0.068, 0.079, and 0.071, all violating the 0.05 bound.
W3. Unrealistic online oracle assumptions and inconsistent overhead arithmetic. Algorithm 1 requires an automated ground-truth task verifier during online deployment to re-evaluate historical tasks. Assuming test-time access to ground-truth evaluators is unrealistic for open-ended online agents, and evaluating baselines (e.g., LRU, Cosine Dedup, ASAP, MemGPT) without this oracle rollback mechanism makes the comparison unfair. Furthermore, the claim that replay verification adds only 4.1% amortized token compute is arithmetically inconsistent with the reported statistics. On a stream of 238 tasks, triggering replay in 14.7% of rounds ( rounds) with an average of 8.4 tasks per replay requires at least full task re-executions (and up to executions if pruned candidates are evaluated sequentially as written in Line 8 of Algorithm 1). Executing 294 to 1,176 extra tasks on a 238-task stream implies 123% to 490% additional task runs, which cannot plausibly correspond to a 4.1% token overhead.
Questions for authors
Q1. How does a simple rule-based variant that bypasses the RL policy---directly passing skills with to Algorithm 1---perform in Table 3 and Table 6? Also, where is the mathematical definition of how the Decay mode alters skill retrieval or task execution?
Q2. Given that Algorithm 1 enforces a hard budget gate () guaranteeing (Theorem 1), how can the three ablations in Table 6 that retain Quarantine Replay (- Retention Barrier, - Epistemic Buffer, and Fixed Dual Multiplier) yield replay degradations of 0.068, 0.079, and 0.071?
Q3. How were 1,500 RL policy updates executed on a 238-task online stream without multi-epoch passes over the evaluation tasks? Please also provide the exact token accounting that reconciles at least 294 replay task executions () with the claimed 4.1% token overhead.