- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper studies online adaptation in network reconfiguration when the failure mode is a hidden parameter that can switch within an episode. The environments are synthetic graphs with 20–80 nodes (BA, ER, WS), and there are three failure modes, namely hub attack, regional failure and random failure. At each step the agent adds one edge, and the reward is the increment in network capability , defined as the average of normalized algebraic connectivity and giant-component fraction.
Critical strengths
The problem is well motivated, since unlabeled failure-mode switches within an episode occur in real infrastructure networks. The comparison is fair in the sense that all learned baselines share the graph encoder, edge-scoring head and transition tokens and differ only in the context pathway. Results use 10 seeds on the same 20 test episodes per mode, and recovery time handles right-censoring with its bias stated openly. The OOD sweeps cover mixture, intensity and scale. The appendix gives full hyperparameters and code is provided. The limitations section is candid about the single switch schedule, the missing specialist bound and the unisolated contribution of the prior.
Critical weaknesses
W1. All ablations and the sweep (Section 5.4) use stationary episodes, so they say nothing about switch recovery. The claim that is worse because stale tokens delay turnover cannot be tested without switches. It is also unclear whether PPO-GRU uses the same window.
W2. A baseline for memoryless PPO is missing. A true-mode oracle and per-mode specialists are also missing, so the paper never shows that the best repair differs across modes. Finally, the paper does not say whether the baselines use the bridging prior. If they do not, LINC's advantage at may come from the prior, since Prior-only already beats every other learned baseline there.
W3. The learned baselines are PEARL (2019), ESCP (2022) and PPO-GRU. The authors name SeCBAD (Chen et al., 2022) and Ren et al. (2022) as closest to their setting but do not compare with them, although SeCBAD targets exactly piecewise-stable contexts with abrupt intra-episode changes. MoSS (Wang et al., 2023) and TIGR (IEEE TNNLS), which also learn self-supervised contexts for non-stationary tasks, are missing too.
W4. The components come from CaDM, VICReg, ESCP and Stooke et al. (2021), and the authors state that predictive context learning is not their contribution. Therefore, precise ablation of the contribution of each component should be provided.
Questions for authors
Q1. Do ESCP, PEARL and PPO-GRU use the bridging prior? How does Figure 4(c) change if all baselines use the prior, or if LINC uses ?
Other questions please refer to the weakness.
2 comments
Response to Reviewer wabD (new results)
We thank the reviewer again for the detailed suggestions. The first results are now in the General Response (Update: New Results, 1/2 and 2/2).
W1. On the switching episodes of Section 5.2, against full LINC trained with the same budget and seeds, removing the context input or roughly doubles the recovery time, and removing the prior or has smaller effects (Table R2). The recovery time increases monotonically with H (0.68, 0.91, 1.00, and 1.47 times that of H = 20 for H = 5, 10, 20, and 40), and the ordering H = 5 < 10 < 40 holds in all 16 further switching settings. This directly tests the stale-token explanation, and Section 5.4 now cites this result.
W2. The memoryless variant (w/o Context) reaches a post-switch capability of 0.769 ± 0.050, versus 0.894 ± 0.020 for full LINC, and takes 2.33 times as long to recover (Table R2).
Q1. Removing the prior lowers AUC@50 by at most 0.039 on the three OOD sweeps, and its contribution at N = 200 is similar to that within the training range (Table R3).
SeCBAD and the KL-regularized variant (W3) and the stop-gradient ablation (W4) are in progress, and we will post them in this thread. We hope these results address your concerns.
Response to Reviewer wabD
We sincerely thank the reviewer for the careful and detailed review.
W1. Thank you for raising this point. Because switch patterns cannot be enumerated at training time (cf. Luo et al., 2022), we trained on stationary episodes, so the curves in Figure 5 reflect stationary training only. We are now evaluating the four ablations and the H sweep on the switching episodes of Section 5.2 (General Response, point 3). We also agree that the stale-token explanation for H = 40 is not supported by the current evidence, and we will revise Section 5.4 according to the switching results. Regarding PPO-GRU: it uses the same H = 20 window and transition tokens as LINC, and differs only in that its encoder is trained end-to-end by the PPO loss, without Ldyn, LVC, or stop-gradient (Appendix C). We will state this explicitly in Section 5.1.
W2. The memoryless PPO baseline corresponds to the w/o Context ablation in Figure 5, which uses the same encoder, head, and prior but no history; its switching results are included in the evaluation above. Regarding the prior, all baselines use it (General Response, point 1). We agree that showing whether the best repair differs across modes is important, and we will follow up on the oracle and per-mode specialists in this thread.
W3. We thank the reviewer for these references. (i) SeCBAD: we are implementing SeCBAD in our shared framework, keeping the graph encoder, edge-scoring head, prior, and PPO budget fixed and replacing only the context pathway. Because SeCBAD is trained on switching episodes with access to the true context (Chen et al., 2022, Appendix A.6), whereas LINC is trained on stationary episodes without labels, we will report SeCBAD under both training protocols. (ii) MoSS and TIGR: both learn the context with a Gaussian-mixture VAE and are trained with SAC for continuous control (Wang et al., 2023; Bing et al.), whereas all compared methods here use PPO over a variable set of candidate edges. To compare their variational (KL-regularized) context objective under the shared framework, we are adding a KL-regularized variant of LINC (see also our response to Reviewer wNR9, W2). (iii) Ren et al. (2022) also model the switching process explicitly. As the reviewer notes, SeCBAD targets exactly piecewise-stable contexts with abrupt intra-episode changes, and, like LINC, it is trained with PPO; we therefore take SeCBAD as the representative of this class. We will cite TIGR in the revised related work.
W4. We agree that each component should be isolated. The context input, Ldyn, LVC, the prior, and the window H are ablated in Figure 5, and these ablations are now being evaluated on switching episodes (W1). The stop-gradient follows the decoupling of representation learning from RL (Stooke et al., 2021): the context encoder is trained only by the prediction loss, so that the policy gradient does not reshape the task-inference representation (Section 4.1). It was not ablated in the submission (Section 6); we are now training a variant without the stop-gradient and will report it if it completes within the discussion period.
Q1. Yes (General Response, point 1). We are adding LINC with β = 0 to the sweep of Figure 4(c).
We hope these responses address your concerns, and we would be happy to answer any further questions.