- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper studies directly readable detection information in MLLM visual encoders and dataset shortcuts involving format, encoding, and geometry. It audits twelve datasets and training resources, then fine-tunes a single visual encoder using source-paired real and edited Mani-X images. Evaluation covers established benchmarks, real-world images, processing alignment, and recent synthesis and manipulation generators.
Critical strengths
S1: This paper audits twelve datasets and training resources using shallow metadata-only classifiers, finding several cases where format or encoding nearly determines the label. These results provide concrete reasons to revisit existing evaluation protocols.
S2: This paper compares Mani-X, DDA, and B-Free with the backbone, training size, and update count controlled, and observes similar gains with CLIP-L and DINOv2-L. This strengthens the evidence that the training data contributes beyond DINOv3 itself.
Critical weaknesses
W1:This paper extends existing source-aligned training with selected editing data, while retaining a standard DINOv3 encoder, linear head, and BCE loss. Its methodological advance over Aligned, B-Free, and DDA is mainly in the training-data recipe, with limited independent technical novelty.
W2:This paper does not isolate the contribution of semantic cues or distinguish shortcut reliance from information loss in its geometric experiments. Its cross-generator gains also remain uneven, with substantial performance gaps on some recent editors.
Questions for authors
Q1: This paper compares DDA and B-Free. With source images, generators, backbone, and training budget matched, how much does full instruction-based editing improve over reconstruction and inpainting, and is this gain the main methodological contribution?
Q2: Does the model actually rely on semantic anomalies?
Q3: How much of the sensitivity to image geometry is attributable to dataset shortcuts?
Q4: Does the computational shortcut finding apply to training, inference, or both?