- Rating
- 3
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper introduces a new perspective that interprets agentic continual learning as Bayesian discovery. From this perspective, the authors argue that learning should be represented as belief updates supported by evidence, refutation should correct existing knowledge, and streams without supporting or contradicting evidence are effectively silent. They propose DiscoverCL, a training-free continual-learning framework that maintains memory through a “propose hypotheses–execute tasks–record evidence” loop, and DiscoverScore, which measures how much each task updates the agent’s existing beliefs.
Critical strengths
A meaningful new perspective. The paper reframes agentic continual learning as Bayesian discovery and uses hypotheses and evidence to explain learning, refutation, and forgetting. This perspective is conceptually clear and provides a degree of novelty.
Critical weaknesses
The method relies on somewhat strong assumptions about how environmental knowledge is represented. DiscoverCL assumes that knowledge can be expressed as independent, falsifiable textual hypotheses and that a single contradiction is sufficient to remove a hypothesis. These assumptions may be restrictive for ambiguous, probabilistic, or interdependent knowledge.
Questions for authors
-
How robust is DiscoverCL when environmental knowledge is probabilistic, interdependent, or only partially falsified? Is deleting a hypothesis after a single contradiction always justified, or would a graded belief-revision mechanism be more appropriate?
-
Does DiscoverScore correlate with actual continual-learning gains across different LLM backbones, task streams, and memory systems? How sensitive is it to errors or biases introduced by the proposer and summarizer LLMs?
2 comments
[Sensitivity of DiscoverScore to verdict errors] We sampled 423 verdicts, stratified by stream and type, and had Claude Sonnet 5 and Claude Opus 5 re-judge each independently (Table R4). The summarizer's in-run marks are not retained, so the audit covers verdicts reconstructed after the run (see our response to Reviewer U8id).
Table R4: Verdict audit.
| Verdict | # Sampled | Judged correct (of decidable) | Inter-judge κ |
|---|---|---|---|
| SUPPORTED | 173 | 47.0% | 0.35 |
| CONTRADICTED | 105 | 30.4% | 0.63 |
| SILENT | 145 | 54.5% | 0.44 |
| All | 423 | 45.6% | 0.46 |
Verdicts are noisy, CONTRADICTED most of all, so the score is sensitive to these errors. The audit is model-judged with moderate agreement, so these rates are estimates. App. A.1 already notes that a false refutation counts as learning; we will expand this into an explicit limitation.
We thank the reviewer for the positive assessment and provide new experiments and clarifications below. Baseline values differ from Table 1 because additional runs have completed under the same configuration; the largest change is Full ICL on Poker, where five runs span 0.54 to 2.36. DiscoverCL is the mean ± SD of three runs; new ablation arms are single runs.
[Graded vs. hard deletion] We tested graded revision directly with two alternatives to the original: removal only after two contradictions, and no removal (Table R1; parentheses give the difference from the original).
Table R1: Deletion settings.
Waiting for two contradictions does not help: it leaves Database and Spectrum unchanged and hurts Sales and Poker, the stochastic stream where it was expected to help. A higher threshold is therefore not the remedy for probabilistic knowledge, which we will state as a limitation; frequency-type hypotheses are a natural next step.
[Deletion audit] To understand why a higher threshold does not help, we sampled 100 removed hypotheses and asked two model judges whether the agent's observations actually contradicted each one (Table R2; κ = 0.73).
Table R2: Audit of removed hypotheses.
Across all 239 removals, a hypothesis leaves memory in one of three ways: 41% after being marked contradicted, 18% retired by code after ten tasks without being referenced (these can return), and 41% simply no longer written by the proposer. The paper describes only the first. Only 23.8% of removals that follow a contradiction were judged unjustified, against 89.3% of those that do not, so a higher threshold acts on the path that is the smaller source of error. (Table R4 audits reconstructed labels over all hypotheses, while Table R2 audits actual removals under a stricter criterion, both judges, so the two rates are not directly comparable.) We will document all three paths and list the unprompted removals as a limitation.
[Partially falsified knowledge] In practice a hypothesis is revised far more often than discarded: across 3,227 before-and-after comparisons, 17.8% of hypotheses are rewritten and 7.4% disappear, while 74.9% keep their meaning. The implementation is therefore closer to revision than to strict falsification, and we will describe it that way.
[Independence between hypotheses] Independence is encouraged by anchoring each hypothesis to a distinct entity and is not otherwise checked. It is a modeling assumption of DiscoverScore, so interdependent knowledge is not handled explicitly; we will state this as a limitation.
[DiscoverScore and continual-learning gains] We divide the score by the number of hypotheses kept and compare it with CL gain (DiscoverCL − Base) and Full ICL gain (Full ICL − Base), a reference independent of our method (Table R3).
Table R3: Normalized DiscoverScore and learning gains.
The normalized score does not track learning gains (ρ = +0.14 with CL gain; −0.43 with Full ICL gain) and is close to a plain contradiction count (r = 0.92). We will therefore present DiscoverScore as an exploratory statistic, not as a diagnostic of learnability.
[DiscoverScore across backbones and memory systems] Across runs the score varies moderately (SD 0.017–0.064), and it is lower with Opus 5 than with Sonnet 5 on every stream (by 0.042–0.083), so it characterizes a model–stream pair, as the paper states (lines 315–316). It is defined over DiscoverCL's own hypothesis set and does not apply directly to other memory systems; extending it is future work.