- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This manuscript examines the issue of contagious attacks in networks where node values are initially unknown and must be determined through repeated interactions. The defender operates within a budget constraint and receives feedback from defended nodes and attacked neighbourhoods. The authors propose PatchLearn, a learning-based defence approach. In the known-value setting, they construct a monotone submodular threshold surrogate intended to bound the original worst-case defence loss. They evaluate PatchLearn using synthetic and real-world networks to assess its computational efficiency and compare its defence performance against baselines. The reported results suggest that PatchLearn achieves lower defence loss in the tested settings with heterogeneous node values. However, the paper would benefit from clearer presentation of the contagious attack threat model, clearer motivation of the proposed approach and more explicit explanation of its game-theoretic setting and how it outperforms state-of-the-art methods.
Critical strengths
- The paper considers network defense under contagious attacks while accounting for unknown and potentially heterogeneous node values. This setting is relevant because defense decisions must often be made under resource constraints and incomplete information.
- The proposed PatchLearn approach seeks to combine online learning with budget-constrained defense and evaluates its performance on synthetic and real-world networks. This provides a potentially useful basis for studying the trade-offs between learning node importance, computational efficiency, and defense effectiveness.
Critical weaknesses
- The limitations of existing approaches and the specific gap addressed by PatchLearn remain insufficiently articulated. These shortcomings make it difficult to identify the paper's precise contribution and assess its relevance to the network security games literature.
- The paper lacks to present the threat model that could help to understand the attacker's and defender's roles, objectives, available actions, or interaction model.
- The rationale for constructing a monotone submodular threshold surrogate that quantitatively bounds the original worst-case loss needs more clarifications. The authors should explain the purpose and implications of this surrogate, the precise guarantee it provides, and how that guarantee relates to the unknown-value setting.
- The term defense loss is not sufficiently defined in the reported performance claims. I have significant concerns about the clarity and completeness of the problem and the justification of the proposed approach.
- Although the paper is presented as a contribution to network security games, the threat model and the respective roles, objectives, and action spaces of the attacker and defender are not sufficiently explicit.
- The relationship between the known-value optimization problem and the unknown-value learning problem also requires clarification.
- The paper should explain how the theoretical guarantees derived from the monotone submodular surrogate relate to the actual defense objective when node values must be learned online.
- The claim that PatchLearn achieves lower defense loss in the abstract requires a precise definition of the metric and an explanation of how it is computed.
- The paper's presentation requires improvement. Although the general problem of network defense under contagious attacks and uncertain node values is relevant, the motivation, precise research challenge, and distinction from existing literature are not sufficiently clear. In particular, the paper does not appear to provide a dedicated formulation of the threat model or clearly distinguish the attacker's and defender's roles, objectives, and available actions. A more structured presentation of the security model, optimization problem and learning mechanism would make the contribution easier to understand.
- The paper addresses an interesting combination of contagious attack propagation, uncertain node values, and budget-constrained defense. However, the paper does not sufficiently explain what fundamental limitation of existing approaches PatchLearn overcomes. A clearer comparison with closely related work and a more explicit statement of the paper's key insights would strengthen its informativeness.
Questions for authors
-
Could the authors explicitly define the contagious attack model, including the attacker's objectives and available actions, the defender's decision variables and budget constraints, and the mechanism by which attacks propagate through the network? What are the assumptions about the interaction between the attacker and defender?
-
Patching-GSA provides an approximation guarantee for maximizing the surrogate function, but it is unclear how this guarantee translates to the original problem. Does the resulting solution still provide the same bound on the actual loss for a given threshold (W)? If not, can the authors provide a bound on the actual loss when the surrogate is only approximately optimized?
-
Patching-GSA Fast reduces the set of candidate seeds to improve computational efficiency. Does this restricted search still provide a theoretical approximation guarantee? If so, under what conditions? If not, can the authors quantify the loss in solution quality caused by this restriction?
-
PatchLearn provides a sublinear regret guarantee with respect to the surrogate objective. However, does this guarantee translate into a guarantee on the original loss? Can the authors show that PatchLearn approaches the optimal defense strategy for the original problem, or does the residual term in their loss bound prevent such a conclusion?
Thank you again for your constructive feedback. As the discussion period draws to a close, we would like to briefly summarize how our previous response addressed your questions and how these concerns are reflected in the revised manuscript.
Research motivation and threat model. In our previous response, we explained the distinction from known-value allocation, the role of fixed normalization in learning unknown values, and the actions, objectives, timing, and feedback of the attacker and defender. We have also added the ransomware-recovery and backup-power examples in the second paragraph of the Introduction to explain the practical meaning of local protection and the modeling assumptions.
Connection between the surrogate and original defense loss. Our previous answers to Q2 and Q4 explained how approximate surrogate optimization yields an explicit original-loss bound and under what conditions the online guarantee implies convergence to the original optimum. The revised manuscript makes this connection explicit in Sections 3 and 4, distinguishing the vanishing learning contribution from the approximation and coverage residuals. Appendix D.4 further explains the effect of optimization error in approximate implementations.
Effect of the restricted search in Fast. Our previous answer to Q3 clarified the scope of the Full approximation guarantee, quantified the additional slack in the loss certificate for Fast, and provided comparisons on 40 matched instances. We have incorporated these experiments into Appendix E.9, including Table 12 and Figure 9, with analysis of the loss gaps relative to MILP and the recorded threshold-search times. This makes the measured cost and benefit of the restricted search available in the paper itself.
We would be grateful if you could revisit our responses and the revised manuscript when time permits. If any concerns remain, we would welcome the opportunity to address them before the discussion closes. Thank you for your time and consideration.