- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper studies catastrophic forgetting in continual instruction tuning and proposes Task Circuit Replay (TCR), a framework that aims to preserve previously learned capabilities by maintaining task-relevant internal computations rather than relying solely on historical examples or output-level knowledge distillation.
The proposed method consists of three main components. First, TCR constructs task-specific representations from a frozen pretrained model and injects them into the beginning-of-sequence (BOS) position to establish explicit task-conditioned computation. Second, it identifies sparse task-relevant components through contrastive gradient-based attribution, measuring the influence of task conditioning on model behavior. Third, during subsequent training stages, the method preserves the historical activations of selected components using a circuit-level regularization objective, together with conventional experience replay.
Critical strengths
-
A coherent approach to preserving task-relevant internal computation. The main strength of this work is its attempt to formulate knowledge preservation at the level of task-conditioned computation. The Task-BOS mechanism provides an explicit conditioning signal, while contrastive attribution and selective activation replay translate this idea into a concrete training framework. Although component-level regularization and representation preservation have been explored in prior continual learning work, their integration with task-specific computational conditioning is a meaningful methodological contribution.
-
Encouraging experimental performance accompanied by relevant diagnostic analyses. TCR achieves the highest overall performance in five of the six main experimental settings reported in Table 1. On TRACE, the overall performance improvements over the strongest competing baseline are 1.65 points for Qwen3-1.7B and 1.25 points for Qwen3-8B. The component ablations in Table 2 also provide useful evidence. Removing circuit replay decreases overall performance from 56.93 to 56.28, while replacing the selected circuit with random components reduces performance to 55.95.
Critical weaknesses
-
Insufficient causal validation of the identified circuits. The main circuit selection relies on gradient-based attribution, while the causal interventions in Appendix C.2 use a different identification procedure. Thus, the causal relevance of the circuits selected by TCR remains insufficiently validated.
-
Limited statistical evidence and efficiency analysis. Some improvements over strong baselines are marginal, and the main results rely on a single training seed. Moreover, the additional storage and computational costs of circuit replay are not sufficiently quantified.
Questions for authors
-
Causal validation of TCR-selected circuits. Could the authors clarify whether the components used in the historical activation restoration experiment in Appendix C.7 are selected using exactly the same Task-BOS contrastive attribution procedure as Equations (8)–(10)? More importantly, could the authors provide direct activation patching or component ablation results for circuits selected by the full TCR procedure, preferably across multiple tasks or task sequences? Such evidence would help determine whether the main attribution method identifies causally important computation rather than components that are merely sensitive to task conditioning.
-
Statistical reliability of the reported improvements. Could the authors report results from multiple independent training seeds, including means and standard deviations for OP, BWT, and FGT? This would be particularly important for settings where TCR improves over the strongest baseline by less than one point and for the relatively small contribution of circuit replay observed in Table 2(a). The results would help assess whether the improvements are robust to training randomness.
-
Storage and computational efficiency. Could the authors quantify the total additional storage required for task prototypes, selected component identities, and reference activations? It would also be useful to report circuit discovery time, training overhead, and inference-time routing costs. If possible, a comparison against experience replay under a matched total storage or computational budget would help establish whether the proposed circuit-level preservation offers a favorable practical trade-off.
-
Impact of task routing on end-to-end performance. Appendix C.5 reports a strong prototype routing accuracy of 99.87% on TRACE, which is encouraging. Could the authors additionally report the end-to-end task performance under predicted Task-BOS conditions versus oracle task identities, and analyze the effect of incorrect routing decisions? This distinction would help assess the practical robustness of the approach beyond task-identification accuracy alone.
5 comments
Response to Reviewer eLoD (2/3)
Q3. Storage and computational efficiency
To address this concern, we conduct a comprehensive computational analysis covering task-vector construction, circuit discovery, comparisons with existing discovery methods, scalability, and end-to-end training overhead. All measurements are conducted on a single NVIDIA RTX PRO 6000 Blackwell GPU.
(1) Cost of task-vector construction and circuit discovery.
We first profile the complete offline preprocessing pipeline across five model scales, from Qwen3-0.6B to Qwen3-14B. The measurements use 32 task anchors and 32 prior anchors for task-vector construction, and 32 anchors for circuit discovery, with three independent timing repetitions.
| Model | Task vector (s) | Discovery + selection (s) | Total (s) | Peak GPU (GiB) |
|---|---|---|---|---|
| Qwen3-0.6B | ||||
| Qwen3-1.7B | ||||
| Qwen3-4B | ||||
| Qwen3-8B | ||||
| Qwen3-14B |
The results show that TCR's complete offline preprocessing remains relatively inexpensive across the evaluated model sizes. Even at 14B parameters, task-vector construction and circuit discovery, including component selection and reference activation capture, require only 23.45 seconds in this setting.
(2) Comparison with existing circuit discovery methods.
We additionally compare TCR with Edge Attribution Patching (EAP), its integrated-gradients variant (EAP-IG), and Automated Circuit Discovery (ACDC).
All methods are evaluated using the same setting elaborated in Appendix.
| Scale | TCR (s) | EAP (s) | EAP-IG (s) | TCR peak (GiB) | EAP / EAP-IG peak (GiB) |
|---|---|---|---|---|---|
| 0.6B | |||||
| 1.7B | |||||
| 4B | |||||
| 8B | |||||
| 14B |
At the 14B scale, TCR achieves 3.99× lower runtime than EAP and 16.43× lower runtime than EAP-IG, while reducing peak GPU memory by approximately 33.4% relative to EAP. The runtime advantage becomes more pronounced for the larger models.
For ACDC, the runs are truncated after approximately 732 seconds on models up to 8B without producing complete circuits, while the 14B run encounters an out-of-memory error.
(3) Scalability with the number of anchor examples.
We further investigate how circuit discovery scales with the number of attribution examples. On Qwen3-14B, increasing the number of anchors from 32 to 512 (16×) increases discovery, selection, and reference-capture time from 13.77 seconds to 226.68 seconds (16.46×), while peak GPU memory increases only from 29.53 GiB to 29.97 GiB.
This indicates approximately linear runtime scaling with the number of anchors and limited additional peak memory consumption under the evaluated configuration.
(4) Conditioning and replay overhead.
We additionally profile the computational cost of the replay objectives using single training exsample on Qwen3-1.7B.
| Replay objective | Time (s) | Peak GPU (GiB) |
|---|---|---|
| ER-LM | ||
| Task-BOS + LM | ||
| Task-BOS + LM + logit KD | ||
| Task-BOS + LM + circuit matching + KD |
The complete TCR replay objective requires 2.38× the time of standard ER-LM for the measured microbatches, with an additional 0.529 GiB of peak GPU memory.
(5) Additional storage efficiency. For Qwen3-1.7B on SuperNI-5, stored circuit and logit memories occupy approximately 329.19 MiB across five tasks. The task-routing encoder requires approximately 7.68 ms per query over 2,500 evaluated queries.
Overall, these experiments show that TCR enables relatively efficient component-level circuit identification across the evaluated model scales, while also making clear that activation matching introduces non-negligible recurring training overhead. We believe this more comprehensive analysis addresses the reviewer's central concern regarding computational efficiency and practical scalability.
Response to Reviewer eLoD (3/3)
Q4. Impact of task routing
We thank the reviewer for this valuable suggestion. To evaluate the impact of task routing on end-to-end performance, we compare oracle task identities with prototype-predicted Task-BOS under identical evaluation settings.
For Task-BOS, the overall performance decreases only from 56.3089 to 56.2977. This result indicates that predicted routing introduces slightly degradation in overall task performance.
We further analyze all evaluation samples and identify 198 incorrect routing decisions, primarily concentrated in Py150 (188), NumGLUE-ds (9), and MeetingBank (1), with no routing errors in the remaining five tasks. These results demonstrate that TCR maintains nearly identical end-to-end performance without requiring oracle task identities, supporting the practical robustness of prototype-based routing.
Response to Reviewer eLoD (1/3)
Thank you for your thoughtful and constructive feedback. We appreciate your recognition of the methodological contribution of integrating task-specific conditioning with circuit-level preservation, as well as your positive assessment of our experimental results and diagnostic analyses. We address each concern below.
Q1. Causal Validation of TCR-Selected Circuits
We thank the reviewer for highlighting the need for a clearer distinction between our causal analyses. We acknowledge that the original manuscript did not clearly clarify the different objectives of Appendices C.2 and C.7.
Specifically, Appendix C.2 investigates the causal relevance of task components using a separate identification procedure, whereas Appendix C.7 examines whether restoring historical circuit activations can recover forgotten capabilities during continual learning. Importantly, the circuits in Appendix C.7 are identified using the TCR attribution-based selection procedure employed in our continual learning experiments, rather than the separate procedure in Appendix C.2. The activation restoration results in Appendix C.7 therefore provide evidence that restoring historical computation in TCR-selected circuits can recover previously learned task performance.
Additional Causal Validation through Component Ablation. To further address the reviewer's concern that the identified components may be merely sensitive to Task-BOS conditioning rather than causally important for task execution, we conduct an additional component ablation experiment. We compare three selection strategies: (1) circuits identified by TCR's contrastive attribution, (2) randomly selected components, and (3) sensitivity-only components identified based solely on their activation sensitivity to Task-BOS, without gradient-based attribution.
These results demonstrate that TCR's attribution procedure identifies components whose removal has a substantially larger impact on task performance than either random components or components selected solely by Task-BOS sensitivity. Together with the historical activation restoration results in Appendix C.7, these complementary interventions provide direct causal evidence that TCR-selected circuits contribute to task-relevant computation, rather than merely responding to Task-BOS conditioning.
Q2. Statistical reliability
We agree that evaluating performance variability across independent training runs is essential. We would also like to emphasize that the primary objective of TCR is to mitigate catastrophic forgetting, for which backward transfer (BWT) and forgetting (FGT) provide important complementary measures. As shown in Table 1, TCR achieves positive BWT across all six experimental settings and the lowest FGT in five settings (tied for the lowest in the remaining one). For example, on TRACE with Qwen3-1.7B, TCR improves BWT from 0.80 to 1.45 and reduces FGT from 1.43 to 0.19 compared with ER. These results demonstrate encouraging improvements in historical knowledge retention, even when the gains in overall performance (OP) are relatively modest.
Due to the computational cost of repeated sequential training, we first prioritize two representative benchmarks, TRACE and SuperNI-5, using Qwen3-1.7B. We conduct three independent training runs for TCR and three competitive baselines (ER, PaRSP, and CER), reporting the mean and standard deviation of OP, BWT, and FGT.
On TRACE, TCR improves OP and BWT over ER by 1.30 and 1.45 percentage points, respectively, while reducing FGT by 0.56 points. On SuperNI-5, although TCR achieves comparable OP to PaRSP, it improves BWT by 0.58 points and reduces FGT by 0.20 points. These results provide further evidence that TCR's improvements in historical knowledge retention are not limited to the original single-seed evaluation.