- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper studies fixed-threshold transfer failure in VLM jailbreak detection and proposes FOSTER. The proposal builds an unsafe reference banks that updates in runtime. A frozen router classifies high-confidence inputs, while uncertain inputs receive layer-wise KNN safety scores using benign and unsafe reference banks. The unsafe bank is updated via several predefined checks on anchor topology. The proposal keeps model parameters and all operating thresholds fixed, and manages memory to retain diverse unsafe modes. The evaluations report improved streaming recall, alongside targeted contamination tests, benign distribution shifts, and ablations.
Critical strengths
(1) The paper addresses a practically relevant jailbreak detection problem in VLMs. How to transfer detections to unseen attacks is an important research gap in this area. It does not focus on a specific detection method improvement but generalize the given detection capability into OOD attack samples.
(2) The asymmetric memory update is a sensible design. Authors provide sufficient evidence that the full admission gate reduces erroneous benign insertions and subsequent false positives relative to relaxed gates in the tested contamination setting.
(3) The authors explicitly distinguish their structural bounds from guarantees of correct admission or benign safety. They also acknowledge cold-start limitations, report attack-specific regressions, and evaluate OOD benign false positives.
Critical weaknesses
(1) The anchor/topology mechanism lacks sufficient independent validation. Section 3 presents transferable unsafe geometry as a critical hypothesis and explicitly does not report quantitative layer-wise diagnostic results. Although Sections 4.4-4.6 explain how eligible anchors may increase local unsafe support, the full-system gains do not independently validate this explanation or establish why unseen attacks satisfy such conditions. The concern is not about the use of memory itself, but the evidence for the claimed mechanism and its generalization ability.
(2) The contribution of topology update is not sufficiently isolated from the frozen router. The offline trained router classifies some inputs, determines which inputs reach topology scoring, and constrains anchor admission. Its reliability therefore affects both detection and the opportunity to adapt. However, it looks the router is not the core novelty. The frozen-versus-online comparison establishes an update benefit conditional on the chosen router, but does not establish how robust that benefit is to router quality or whether simpler memory updates would achieve comparable gains. The existing ablation does not fully settle this issue. As in Table 4, removing the router changes AUROC from 0.9900 to 0.9895 while TPR falls from 90.27% to 0.0. This shows failure at the evaluated operating point, but does not disentangle router utility from threshold mismatch. Moreover, the ablation uses a validation subset and an ablation-specific threshold but not the main deployment protocol settings.
(3) Robustness to adaptive memory poisoning is insufficiently evaluated. Section 5.5 already evaluates hard-benign contamination and demonstrates benefits from the full gate. However, the paper does not establish whether the attacker can exploit feedback to adapt its inputs against all admission checks and the evolving memory. This distinction matters because successful poisoning could cause persistent false positives or displace useful anchors.
(4) Threshold sensitivity and the increment over naive methods need clearer evaluation. Using several fixed thresholds in the proposed system can make it depend on their joint selection. Decision, routing, and admission thresholds can affect recall, access to repair, and contamination risk in different ways. The evaluation should characterize these tradeoffs in the designed system across attack shifts, and test whether the conclusion holds under alternative source-only calibration rules. Also, matched comparisons with simpler online KNN updates would better isolate the benefits of layer-wise scoring and the full memory design.
Minor issue: In Figure 1, the green elements and small boxes are difficult to distinguish at the displayed scale. Improving presentation or sizing would make the figure more readable.
Questions for authors
(1) What evidence supports the transferable-topology hypothesis? Authors should clarify which properties of unseen attacks enable eligible seeds and subsequent repair, and provide controlled comparisons that distinguish the proposed layer-wise mechanism from simpler KNN adaptation, including tests on deduplicated held-out instances and attack families.
(2) How much performance comes from the standalone router, and what errors does topology repair actually correct? How sensitive are results to router reliability and the joint choice of routing, decision, and admission thresholds?
(3) Beyond the existing targeted attacks, can the authors evaluate or clearly delimit a feedback-driven attacker targeting the memory bank? Also, authors should additionally assess persistent false positives and later attack recall, and characterize sensitivity to initial attack, stream order, recurrence, and lower attack prevalence.