- Rating
- 3(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper asks whether a component can pass qualification yet change the behavior of the system that uses it. The authors call this adversarial qualified substitution and define audit fibers as states that produce the same checked output. Their analysis characterizes safe substitution by whether downstream consumers are constant on the fibers reachable by allowed implementations. For normalized representations with a linear readout, they derive an exact target-steering rule and turn it into a fixed FiberRouter component. They also give an orthogonal weight substitution that preserves the checked output and norm for all inputs and a KV-cache construction that preserves full logits during a specified finite teacher-forced replay while influencing the first unaudited prediction. Experiments cover image and text representations and KV-cache handoffs, including serialized artifacts, hidden qualification inputs, and distribution shift.
Critical strengths
-
The analysis does more than count unchecked dimensions. It asks whether an allowed implementation can reach those directions and whether a downstream consumer is sensitive to them. This helps explain when the attack should work. The KV result is particularly interesting: it identifies value-cache changes that leave all vocabulary logits unchanged along the specified replay. The image and text experiments, matched controls, and stronger-check ablations provide evidence for this mechanism across different component boundaries.
-
The same-execution constraint is an important part of this work. The replacement must preserve every checked output on the very input for which it changes downstream behavior; retaining average accuracy is not enough. I also find the fixed-component results useful. FiberRouter and the orthogonal weight construction go beyond finding a suitable perturbation for one feature vector. The serialized-artifact tests and tests on inputs selected after the artifact is fixed support this distinction.
Critical weaknesses
-
In the main example, classification outputs are checked, but the full embedding is later used for retrieval. The experiments show that this setup can be exploited. What is less clear is whether deployed systems actually approve a replacement on this basis. The cited optimization and compatibility work make the scenario plausible, but does not establish this particular combination of checks and downstream reuse. A concrete deployment configuration would help assess the practical reach of the result.
-
The evidence for the patched-weight model is not as complete as for the feature transformation. Full-output preservation is reported for 5,000 cached features. When the projection weights are actually patched and the model is run on raw images, the reported test uses one image per audited class, 100 in total, and reports unchanged predictions. An unchanged predicted class does not establish that all logits and the feature norm stay within tolerance. I would like to see these errors measured directly on the full raw-image cohort after saving and reloading the modified model, with the runtime precision and tolerance stated.
-
The KV experiments show that the first unaudited prediction can be influenced after a fixed teacher-forced replay. The stochastic-decoding tests are useful, but their lower target sampling rates also show that control depends on the generation path. I read this as evidence for the stated finite-replay attack, not for control over arbitrary continuations or complete task outcomes. It is also unclear whether the proposed replay check is used in an existing cache-handoff workflow.
-
Target Hit@1 and Hit@10 measure how often the attacker gets its chosen item into the results. They do not show what happens to the rest of the ranking, and classification accuracy is not a measure of retrieval quality. The appendix does report non-target behavior for a sparse, source-gated attack, but the main FiberRouter policy routes every checked state. For that setting, I would like to know how retrieval relevance or ranking stability changes with the attack budget.
Questions for authors
-
Can the authors give a concrete deployment configuration that qualifies an encoder through the stated classification readout and norm, then reuses its full embedding for retrieval? What additional compatibility or retrieval checks does that pipeline apply, and how would they change the attack surface?
-
For the actual patched-weight model, what are the maximum errors in the full checked-logit vector and representation norm on the complete raw-image validation set? Please report the serialization format, runtime dtypes, and acceptance tolerances.
-
Does the finite teacher-forced replay check come from an existing cache-handoff workflow, or is it a proposed evaluation setting? What do the stochastic-decoding results establish about control of the first unaudited prediction, and what remains untested at the task level?
-
For the main FiberRouter policy, how do ordinary retrieval quality or ranking stability change across attack budgets? Reporting these alongside target Hit@1 and Hit@10 would help separate target promotion from broader disruption of the retrieval results.