- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper studies visual attribution from a mask-first perspective: instead of constructing a complete ranking of image regions, it first searches for a compact set of regions that gives a high target response. The authors introduce CoPAIR, which searches over coarse spatial groups and their pairs, and TRACE, which samples fixed-size region subsets and updates its sampling distribution using high-scoring candidates. The resulting mask can be used directly or passed to Greedy or PhaseWin to construct a full ordering. The experiments cover three classification backbones and two MLLMs. Initialization often improves insertion performance while reducing the total number of selection-time forward calls. TRACE also achieves high single-mask repair rates on RePOPE, offering a useful trade-off between repair success and search cost.
Critical strengths
The initialization strategy produces useful gains with inclusive cost accounting. On CLIP ViT-L/14 Correct, TRACE+Greedy improves insertion AUC from 0.8431 to 0.8679 while reducing selection cost from 4.08k to 3.69k forward calls. Similar improvements appear in several other settings. I appreciate that the reported cost includes initialization rather than treating it as free. This makes the practical benefit more convincing.
The direct-mask results offer a meaningful efficiency trade-off. TRACE repairs 255/270 Qwen cases and 288/300 LLaVA cases using one final mask. Table 17 reports roughly 164–165 selection calls, compared with thousands for full search. Full-curve search achieves higher repair rates, so TRACE is not the strongest method in absolute repair success, but retaining most of that success at a much smaller selection budget is a worthwhile result.
Critical weaknesses
The experiments do not fully isolate the benefit of adaptation. Table 8 tests random initializers, but not best-of-160 uniform mask search. The one-round ablation in Table 9 also uses fewer samples, so budget and adaptation are confounded. A matched-budget comparison and repeated TRACE runs would strengthen the evidence. The broader faithfulness claim also needs qualification: on CLIP ViT-L/14 Correct, TRACE+Greedy improves insertion but worsens deletion AUC from 0.1173 to 0.1342.
The recovery analysis relies on favorable assumptions about the update. Equations (38) and (41) assume basin-mass amplification and balance without deriving either from Equation (17). Equation (22) also multiplies round-wise miss probabilities despite their dependence on earlier random samples; this needs proper conditioning or bounds that hold across histories. These issues look fixable, but the current analysis does not establish that TRACE’s actual update improves recovery probability.
Questions for authors
With the same budget of 160 candidate evaluations and the same mask size, how does TRACE compare with uniform random search that returns its best sampled mask? Please use the same ordering and release procedure for the initialization comparison, and report variability across TRACE seeds. This would directly address whether adaptation is responsible for the gain.
Can you derive the amplification and balance conditions in Equations (38) and (41) from Equation (17), or explicitly limit the result to a conditional analysis? How should Equation (22) be reformulated to account for the adaptive sampling history?
For RePOPE repair, what exact answer token is optimized, and how is it selected before mask search? Is the corrected answer supplied to the optimizer? I am not assuming that it is, but this distinction is necessary to interpret the result as either target-conditioned repair or a correction procedure that can operate without the correct answer.
Could you clarify how the main search backends balance sufficiency and necessity, and whether the classification deletion losses mainly come from the sufficiency-only initializer? A comparison using the combined objective already defined in Equation (2) would help establish whether this is an adjustable trade-off.