- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
This paper studies the problem of selecting sparse intervention locations in Activation Steering and points out that traditional neuron relevance scores cannot accurately reflect the actual utility of jointly intervening on multiple neurons. The authors propose SCOUT, which first uses perturbation sensitivity to construct a candidate neuron set, then accepts neurons one by one according to their conditional marginal benefit under the currently selected set, and finally approximates the dynamic intervention as static scaling coefficients to enable a single forward inference. Experiments cover Qwen3-0.6B to 8B and show that the method can achieve certain classification accuracy improvements with fewer intervention locations.
Critical strengths
S1. The research problem is clear and has certain research value. The paper distinguishes Representation Relevance from Intervention Utility and points out that neurons with higher relevance do not necessarily bring positive benefits in joint interventions. This provides a reasonable motivation for location selection in sparse Activation Steering.
S2. The ablation experiments on the conditional selection strategy are convincing. Table 4 compares different selection strategies under fixed candidate pools, intervention operators, budgets, and calibration methods. Conditional Utility outperforms Contrastive, Sensitivity, and Random Selection in all nine experiments across three datasets, which fairly well validates the value of conditional utility selection.
Critical weaknesses
W1. The methodological novelty is limited, and the core selection strategy is a relatively direct greedy search. The main idea of SCOUT is to measure, under a fixed candidate order, the marginal benefit of adding each neuron to the current set one by one, and to accept candidates with positive benefit. This is essentially an application of the Greedy Forward Selection idea to Activation Steering. Proposition 1 only proves that accepting positive gains makes the search objective monotonically increase, which is a direct algebraic conclusion and does not provide stronger optimization guarantees. Can the authors further clarify the substantive technical innovation of SCOUT relative to standard Greedy Forward Selection, and compare it with other budget-constrained greedy search or forward selection methods?
W2. The main performance improvements are limited and do not consistently surpass existing methods. Table 2 shows that SCOUT achieves +3.44 pp on Qwen3-1.7B, but this is lower than CAA’s +4.36 pp; on Qwen3-4B and 8B, the average accuracy improvements are only +0.01 pp and +0.26 pp, respectively. This indicates that its actual gains on larger models are very limited. Although SCOUT uses significantly fewer intervention locations, the paper mainly compares it with baselines using 100–4096 locations, making it difficult to determine whether its advantage holds under the same sparse budget. Can the authors conduct a fair comparison with CAA, SADI, and AUSteer under the same number of intervention locations, and explain why SCOUT’s gains almost disappear on 4B and 8B models?
Questions for authors
See weaknesses.