acceptodds
Under review as a conference paper at ICLR 2027

Learning Adaptive Evidence Selection for Generalizable AI-Generated Image Detection

Abstract

Generalizable AI-generated image (AIGI) detection aims to identify synthetic images and generalize to unseen generators.To improve the generalization ability, recent detectors increasingly adopt Vision Foundation Models (VFMs).However, most VFM-based detectors use the VFM as the image representation, leaving two issues unresolved.First, the global token is dominated by high-level semantic content, which can induce reliance on semantic content rather than generation-related forensic cues.Second, the global token focuses on a few patches, leaving complementary evidence in other patches underused.To address these issues, we propose the Adaptive Evidence Selection (AES) framework for generalizable AIGI detection.To reduce the influence of semantic content, we propose Cluster-centered Bilinear Aggregation (CBA), which suppresses shared semantic content and models local features within each cluster.To exploit forensic cues distributed across regions, we propose Determinantal Evidence Selection (DES), which selects cluster features by jointly evaluating task relevance and feature diversity. Experiments on four benchmarks demonstrate the effectiveness of our proposed method.Our source code will be released soon.

Primary area:
applications to computer vision, audio, language, and other modalities
Keywords:
AI-generated image detection

Reviews

Among:
Shape:
1234this paper, Top 30%
Figure 1. Mean review rating of the reviewed papers at ICLR 2027. This paper averages 2.67 over 3 reviews, above 70% of the others.
Reviewer_Xp92OpenReview ↗
Rating
2
Confidence
3
Informativeness
3
Presentation
3
Soundness
3
Read review
Paper summary

This paper proposes Adaptive Evidence Selection (AES) for generalizable AI-generated image detection, aiming to improve generalization to unseen generators. It addresses two limitations of many existing vision foundation model–based detectors that rely on the [CLS] token: semantic shortcuts arising from image content and over-reliance on a few salient patches. AES first extracts patch features and groups them using K-means clustering. Cluster-centered Bilinear Aggregation (CBA) then subtracts each cluster’s mean and models low-rank second-order statistics of the residuals to suppress shared semantic content and capture subtle within-cluster variations. Subsequently, Determinantal Evidence Selection (DES) combines relevance scores derived from learnable class prototypes with a determinant-based measure of feature diversity to select compact, complementary evidence separately for the real and generated classes. Experiments across multiple benchmarks support the effectiveness of the framework and demonstrate improved cross-generator generalization.

Critical strengths

1.The motivation is insightful and clearly articulated. The paper identifies two limitations of global representations used by many existing VFM-based detectors—semantic shortcuts and concentrated reliance on a few salient patches—and introduces CBA and DES to address them, respectively. This provides a coherent connection between the motivation and the proposed framework. 2.The experimental evaluation is broad, and the results are competitive. Experiments cover cross-generator and cross-dataset generalization, including an in-the-wild benchmark. Component ablations show that CBA and DES each improve performance, with further gains when combined. The representation analyses provide additional empirical support, while the appendix derives the gradients of the auxiliary prototype loss to help explain its optimization behavior.

Critical weaknesses

1.The use of fixed cluster and subset sizes may limit adaptability to individual images. Although the paper studies different values of K and S, image content varies in complexity, and the amount of informative forensic evidence may also differ across images. A fixed number of clusters and selected descriptors may therefore be suboptimal for some images. 2.The connection between the proposed operations and their intended forensic effects needs stronger justification. Cluster centering does not necessarily disentangle semantic content from generation-related traces, and diversity in feature directions does not necessarily imply complementary forensic evidence. Further analysis would help establish when these assumptions hold. 3.Robustness to common image post-processing operations remains insufficiently evaluated. Although the paper includes an in-the-wild evaluation on Chameleon, it does not systematically assess robustness to JPEG compression, resizing, or blurring. This leaves uncertainty about AES’s reliability under common image degradations encountered in practical deployment.

Questions for authors

1.Could the authors evaluate AES under different levels of JPEG compression? This would help assess its robustness to compression artifacts commonly encountered in real-world images. 2.Does AES generalize to vision foundation models beyond CLIP? Evaluating the framework with a backbone such as DINOv2 would help clarify whether its benefits extend to other pretrained representations or depend on CLIP-specific feature properties.

2 comments

Response to Reviewer Xp92 — Part 1/2

Thanks for your constructive feedback. Changes are marked in red.

W1: Fixed K and s.

R1: We tested image-dependent cluster and subset sizes on GenImage (§4.4, Table 12; Appendix A.3.1). For adaptive K, we select K ∈ {4, 6, 8, 10} for each training image using the highest mean silhouette score from K-means clustering. For adaptive s, we evaluate s ∈ {1, 2, 3, 4} at inference and select the value whose generated-class probability is farthest from 0.5. Joint adaptation combines these two strategies.

PolicymACC (%)mAP (%)mAUC (%)
Fixed K=8, s=298.0399.8199.80
Adaptive K, s=298.1299.8799.86
K=8, adaptive s97.8599.8599.80
Adaptive K and s97.5499.8299.77

Adaptive K improves mACC by only 0.09 percentage points, while adaptive s and joint adaptation reduce it by 0.18 and 0.49 points. We therefore retain fixed K=8 and s=2 as the default.

Fixed counts do not fix the number of selected patch tokens. As you note, image complexity and the amount of informative forensic evidence may vary across images. Although K and s are fixed, the number of patches in each selected cluster can vary with the image. On GenImage, the reported interquartile range of cluster sizes is 23.71–39.50 patches. With s=2, the real and generated branches select 51.8 and 55.0 patches on average, respectively; their union contains 77.6 distinct patches on average, with an interquartile range of 52–101 patches (Appendix B.1, Fig. 9). Thus, fixed K and s still allow the amount of selected image evidence to vary across images.

W2: Cluster-centered residual features as forensic evidence.

R2: We agree that additional experiments are needed to support this claim. In the revised paper (§4.4 and Appendix B.2), we compare CBA (second-order statistics after cluster centering) with three alternative ways to aggregate features within each cluster: direct cluster means, uncentered second-order statistics, and second-order statistics after image centering.

  • Semantic probe. We fit a semantic probe to predict the donor image category. CBA reaches chance-level accuracy, substantially lower than the alternatives.

  • t-SNE. In Appendix B.2, Figure 10 and Table 14, we divide the 20 categories into four groups of five and measure category structure in the original feature space and after t-SNE. Visually, CBA features from the same category are more dispersed, with greater mixing between categories. We use normalized neighborhood entropy to measure category mixing: it ranges from 0 to 1, with higher values indicating greater mixing.

Aggregation methodSemantic probeDetection mACC
CBA5.0098.03
Cluster mean79.5895.58
Uncentered second-order77.3795.24
Image-centered second-order61.9695.07
Aggregation methodSame-category neighbors: original (%)Same-category neighbors: t-SNE (%)t-SNE entropy
CBA27.1824.770.870
Cluster mean55.5055.890.492
Uncentered second-order49.9050.590.554
Image-centered second-order34.3232.280.781

CBA reaches 5.00% accuracy on the 20-class semantic probe, matching the 5% chance level. In the five-class t-SNE analysis, its same-category neighbor fraction is 24.77%, close to the 20% chance level and lower than for the other aggregation methods. Together, these results support the effectiveness of our approach to suppressing semantic information: CBA features contain less object-category information while achieving better detection performance than the compared aggregation methods.

Response to Reviewer Xp92 — Part 2/2**

W2. DES and complementary evidence.

Response: We agree that feature-direction diversity alone does not guarantee complementary forensic evidence. DES combines class relevance with feature diversity, following the quality–diversity principle of determinantal point processes [1]: relevance favors discriminative cluster features, while diversity discourages the selection of similar features.

To examine the effect of diversity, we compare the cosine similarity distributions of the two selected cluster features under full AES and relevance-only selection. After fitting kernel density estimates, the mean cosine similarity decreases from 0.6351 to 0.4265 with diversity (Appendix Fig. 14), indicating that the selected features are less similar.

We also compare detection performance under matched training on GenImage (§4.4, Table 9):

SelectionmACC (%)
Full AES98.03
Relevance only97.16
Diversity only94.85

Full AES improves mACC by 0.87 and 3.18 percentage points over relevance-only and diversity-only selection, respectively. Together, these results support combining class relevance and diversity to select less similar features that improve detection.

[1] Kulesza and Taskar. Determinantal Point Processes for Machine Learning. Foundations and Trends in Machine Learning, 2012.

W3 / Q1. JPEG compression, blur, and resizing.

Response: We evaluated AES under JPEG compression, Gaussian blur, and resizing on GenImage. JPEG results for the CLIP configuration are:

JPEG conditionCleanQ100Q90Q80Q70Q60
mACC (%)97.5596.1993.5690.3487.4384.60

Blur and resize results are:

OperationLevelmACC (%)
Gaussian blurσ=0.5 / 1 / 295.20 / 90.35 / 88.70
Resize×0.5 / ×0.75 / ×1.588.20 / 94.10 / 91.80

These results are reported in the revised paper and appendix.

Q2. Backbones beyond CLIP.

Response: We also report AES results with DINOv2 alongside CLIP on three benchmarks (mACC, %):

BenchmarkAES (CLIP)AES (DINOv2)
GenImage98.0396.97
UFD (19 subsets)94.9793.46
DRCT-2M (16 domains)95.0991.40

These results show that AES can also be applied to a visual backbone beyond CLIP.

We hope these results address your concerns.

Reviewer_7ndrOpenReview ↗
Rating
2
Confidence
4
Informativeness
2
Presentation
2
Soundness
2
Read review
Paper summary

This paper aims to address the problem of generalizable AI-generated image detection (AIGID). The authors argue that detectors built on vision foundation models (VFMs) may rely on semantic content and concentrate their decision evidence on a few patches. To address this, they propose AES. The patch tokens of each image are first grouped by K-means. CBA subtracts the mean of each cluster from its patch tokens and applies low-rank bilinear pooling to the centered residuals (i.e., second-order statistics within each cluster), aiming to obtain semantics-agnostic features. DES uses learnable real/fake prototypes to select and aggregate cluster features for each class according to relevance and diversity (a DPP-style objective), aiming to reduce the few-patch bias. The method is evaluated on GenImage, UniversalFakeDetect, Chameleon, and Synthbuster and gains promising results.

Critical strengths

1. Clear motivation and an intuitive, well-targeted design. The two issues identified by the authors, namely the reliance of VFM-based detectors on semantic content and the concentration of decision evidence on a few patches, are key factors for the generalization of AIGI detectors, and the paper articulates them clearly and with good motivation. CBA and DES each target one of these issues, so the correspondence between the motivation and the modules is explicit.

2. Strong detection performance. The method achieves an average ACC of 98.03% on GenImage (above 96.9% on every subset), 84.53% on Synthbuster (7.1 points higher than the strongest baseline, AlignedForensics), and 78.72% on Chameleon; on UFD it reaches 95.98%, second only to FatFormer (96.11%).

Critical weaknesses

1. The descriptions of the method and experiments lack clarity, which hinders reproduction and the assessment of the results.

  • Feature extraction: The authors fuse patch tokens from layers 6/12/18/24 with adapters but only cite Houlsby et al. (2019), without specifying the adapter architecture (e.g., the bottleneck dimension) or where the adapters are placed, i.e., inside the frozen encoder or on the extracted tokens. Section 3.1 suggests that the fusion happens before K-means, but the fusion operation (concatenation, summation, or weighted sum) is not described; Section 4.2 (l.356–357) states "as described in Section 3.1", yet Section 3.1 contains no such description.
  • Ablation settings: The Baseline in Table 5 is not defined, and for baseline + clustering + DES/CBA, the paper does not explain how the features and the final output are computed when DES or CBA is absent. The pooling variants of CBA in Table 6 (L1L_1-norm pooling and max pooling) are not defined either; the method section only describes mean pooling (Eq. 3).

2. The core claims are not sufficiently validated.

  • Semantic removal in CBA: The paper provides no visualization of the patches grouped by K-means, so it remains unclear whether each cluster corresponds to a semantic entity. In addition, direct controls are missing, such as second-order statistics without centering and using the cluster mean directly (first-order).
  • Evidence expansion in DES: The paper does not show how the clusters selected by DES are spatially distributed in the image. Moreover, for every KK, performance drops at s=3s=3 and s=4s=4, i.e., using more patch clusters actually hurts performance, which appears to be in tension with the motivation of collecting evidence from more different regions. With s=2s=2, the two classes each select two clusters, which may overlap, so at most four clusters are used; the paper does not report how many patch tokens these clusters cover.
Questions for authors

Q1 Please provide the implementation details mentioned in Weakness 1 and the detailed settings of each ablation in Tables 5–8.

Q2 Please provide the controls and visualizations mentioned in Weakness 2.

Q3 Evaluation scope:

  • UFD originally contains 19 subsets, whereas Appendix B.1 states that it "contains fourteen subsets"; the authors removed Deepfakes, SITD, SAN, CRN, and IMLE. Could the authors report the full evaluation results?
  • Could the authors validate the method on more benchmarks, e.g., DRCT-2M, WildRF, and SynthWildX and report the robustness of the model under different post-processing operations, e.g., different JPEG quality factors, blur, and resizing?
  • Prior work has shown that real and fake images in GenImage differ in JPEG compression and image size (Grommelt et al., 2024). Could the authors report results with format-aligned data?

Minor issues

  • Inconsistency between Fig. 2 and the equations: In the figure, the output of CBA is labeled z^\hat z and the Gram matrix is also computed from z^\hat z, whereas in the text CBA outputs fkf_k, z^k=Wafk+ba\hat z_k = W_a f_k + b_a is only used to compute the relevance (Eq. 5), and the Gram matrix is computed from f^k\hat f_k (l.258). In the figure, Bilinear Aggregation applies the square root before the summation and omits the ℓ2\ell_2 normalization, which does not match the order in Eqs. 3–4.
  • In Table 3, the oACC of UnivFD (55.62%) is inconsistent with its fake/real accuracies (17.65/93.50): given the numbers of fake and real images in Chameleon, these accuracies correspond to an oACC of about 60.95%. Please double-check this row.
  • Typos and leftover text: "Projectio" in l.371; "semanctic surpress" and "supuress" in Fig. 1; "Diversitye Estimate" in Fig. 2.
4 comments

Response to Reviewer 7ndr — Part 1/4

Thanks for your constructive feedback. Changes are marked in red.

W1/Q1: Implementation and ablation settings.

W1/R1: We clarify the following facts and settings.

Feature extraction.

  • Adapters: Layers 6, 12, 18, and 24 each have a residual adapter with a 1024→256 linear layer, GELU, and a 256→1024 linear layer. Adapters act on extracted patch tokens outside the frozen encoder.

  • Fusion: Tokens from layers 6, 12, 18, and 24 are concatenated at each patch position and fused by an MLP into 1024 dimensions.

  • CBA projections: Each projection has 256 dimensions.

  • K-means: We cluster the L2-normalized fused features once per image, using random initialization and at most 500 iterations. CBA and DES share the assignments. CBA centers the original, unnormalized features.

Ablation settings.

  • Components: Baseline averages all patch features. Clustering alone averages cluster means. Clustering + DES applies DES to cluster means. Clustering + CBA averages CBA features. Full AES uses both CBA and DES.

  • Pooling: Both variants first average the two centered projections for each patch. L1-norm pooling then averages absolute responses within each cluster; max pooling takes the coordinate-wise maximum without absolute values.

  • DES selection: Relevance-only selects by similarity to class prototypes. Diversity-only selects the feature subset with the largest corresponding Gram matrix determinant. All-cluster mean/max pools all normalized cluster features without selection.

In the revised paper, Section 3.1 clarifies the feature extraction and clustering pipeline, Section 4.2 reports the default settings, and Appendix A.3.1 (Training and Ablations) provides the detailed implementation and ablation definitions.

W2/Q2: The controls and visualizations.

W2/R2: To confirm the claims in our paper, we provide the following controls and visualizations.

Patch clustering. We agree that our original description may be unclear. We use K-means to adaptively group semantically similar patches for joint processing; we do not require each cluster to correspond to a complete semantic entity. A cluster may contain similar patches from different entities, while different parts of one entity may belong to different clusters.

We have added visualizations of the patch clusters and selected clusters in Figs. 6–8 of Appendix B.1. For example, in the right image of the third row of Fig. 6, the dog’s head, body, and legs are assigned to different clusters. These examples illustrate that clustering is adaptive to image content and can group semantically similar patches without requiring a one-to-one correspondence between clusters and objects.

CBA controls. Following your suggestion, we compare CBA with direct cluster means and uncentered second-order statistics. We also include second-order statistics after image-level centering. We evaluate the category information in the resulting features and their detection performance.

  • Semantic probe. We fit a semantic probe to predict the image category. CBA reaches chance-level accuracy, substantially lower than the alternatives.

  • t-SNE. In Appendix B.2, Figure 10 and Table 14, we divide the 20 categories into four groups of five and measure category structure in the original feature space and after t-SNE. Visually, CBA features from the same category are more dispersed, with greater mixing between categories. We use normalized neighborhood entropy to measure category mixing: it ranges from 0 to 1, with higher values indicating greater mixing.

Aggregation methodSemantic probe (%)Detection mACC (%)
CBA5.0098.03
Cluster mean79.5895.58
Uncentered second-order77.3795.24
Image-centered second-order61.9695.07
Aggregation methodSame-category neighbors: original (%)Same-category neighbors: t-SNE (%)t-SNE entropy
CBA27.1824.770.870
Cluster mean55.5055.890.492
Uncentered second-order49.9050.590.554
Image-centered second-order34.3232.280.781

CBA has the lowest same-category neighbor fraction in both spaces, indicating weaker category organization.

CBA also achieves higher detection mACC than the three controls. Together, these results support that CBA suppresses object-category information more effectively while retaining information useful for detection.

In Fig. 11, we also compare image-level features from AES and other detectors. The t-SNE visualization shows greater mixing of object categories in AES features.

The detection results are reported in §4.4 and Table 10 of the revised paper. The semantic probe and category-structure analyses are reported in Appendix B.2, Tables 13–14 and Fig. 10. The comparison with other detectors is in Appendix B.3, Fig. 11.

Response to Reviewer 7ndr — Part 2/4

Q3 (i). Full UFD.

Thank you for pointing this out. We have corrected the dataset description and added results for all 19 UFD subsets in Table 3 of the revised paper. The results (ACC, %) are:

MethodRefProGANCycleGANBigGANStyleGANGauGANStarGANGuidedLDM 200 stepsLDM 200 w/ CFGLDM 100 stepsmACC (19)
CNNSpotCVPR202099.9985.2070.2085.7078.9591.7060.0754.0354.9654.1469.58
UnivFDCVPR2023100.098.5094.5082.0099.5097.0070.0394.1973.7694.3681.38
FreqNetAAAI202497.9095.8490.4597.5590.2493.4186.7084.5599.5865.5685.09
FatFormer (original)CVPR202499.999.399.597.299.499.876.198.694.998.7–
NPRCVPR202499.8495.0087.5596.2386.5799.7584.5597.6598.0098.2087.56
C2P-CLIPAAAI202599.9897.3199.1296.4499.1799.6069.1099.2597.2599.3093.79
FatFormer (IAPL)CVPR202499.8999.3299.5097.1599.4199.7576.0098.6094.9098.6590.86
EffortICML2025100.0099.8599.6095.0599.60100.0069.1599.3096.8099.4595.19
IAPLCVPR2026100.0098.6098.6594.8999.3996.7072.7599.5097.7099.1595.61
MiraGeACM MM2025100.094.396.596.893.696.182.098.394.698.692.9
PGCICML202697.399.196.777.298.690.787.592.798.197.690.6
Ours (CLIP)–99.8195.1696.8594.0697.3599.8285.2599.0595.3599.2094.97
Ours (DINOv2)–99.4193.7394.7094.5595.4895.3484.5596.1095.8496.8593.46

W2 / Q2. DES subset size. We have added cluster-size and coverage statistics in Fig. 9 and visualizations of the clusters and selected regions in Figs. 6–8. Each cluster contains multiple patches, which can be spatially separated. On GenImage, a cluster contains 32 patches on average; when selecting two clusters per class, the two branches jointly select 77.6 distinct patches on average. Thus, selecting a small number of clusters is consistent with our motivation of collecting evidence from different image regions. The visualizations are in Figs. 6–8.

Figure 3 reports the effect of subset size, and Table 9 compares selection with pooling all clusters. The results on GenImage are:

SelectionmACC (%)
DES, s = 197.01
DES, s = 298.03
DES, s = 396.49
DES, s = 495.24
All clusters: mean pooling93.97
All clusters: max pooling92.72

Selecting more clusters does not necessarily improve detection: additional clusters may contain less discriminative or redundant information that dilutes useful evidence during aggregation.

Response to Reviewer 7ndr — Part 3/4

W2 / Q2. DES coverage and overlap.

Thank you for the suggestion. We report cluster sizes and the coverage and overlap of the selected patches below. Figs. 6–8 visualize the selected clusters.

Cluster size distribution.

MeasureMean±SD10th pct.Median90th pct.IQR
Patches per cluster32.0±11.8018304823.71–39.50

Selected evidence and branch overlap.

SelectionMean patchesPatch fraction (%)Patch-count IQR
Real branch51.820.2454–76
Generated branch55.021.4858–80
Union77.630.3077–117
Overlap29.211.4222–53

IQR denotes the 25th–75th percentiles.

The two branches jointly select 77.6 distinct patches on average, with 29.2 patches shared by both branches.

Q3 (ii). Additional benchmarks.

Thank you for the suggestion. We have added results on WildRF, SynthWildX, and DRCT-2M to Tables 6, 7, and 2 of the revised paper, respectively. The WildRF and SynthWildX results are shown below (BACC, %).

WildRF.

MethodRedditTwitterFacebookMean
B-Free86.297.395.693.0
CuRe96.695.695.395.8
Ours97.6797.6697.8197.71

SynthWildX.

MethodDALL·E 3FireflyMidj. v5Mean
B-Free–––95.6
CuRe94.688.694.992.7
Ours95.5193.7394.3294.52

On SynthWildX, B-Free achieves a higher mean BACC (95.6%) than AES (94.52%).

DRCT-2M. The complete results across all 16 domains (ACC, %) are:

MethodLDMSDv1.4SDv1.5SDv2.1SDXLSDXL-RefinerSD-TurboSDXL-TurbomACC
With generative image reconstruction
DRCT (Conv-B)99.9199.9099.9096.3283.8785.6391.8870.0490.79
DDA99.298.999.098.398.096.897.994.898.1
PPL (CLIP)99.7099.7099.6999.6799.7199.4099.4899.4099.50
Without generative image reconstruction
CNNSpot99.8799.9199.9097.5566.2586.5586.1572.4281.12
UnivFD98.3096.2296.3393.8391.0193.9186.3885.9283.46
NPR94.9297.7397.7882.9667.5279.7295.8195.8583.63
SAFE50.350.150.050.049.950.150.050.059.3
C2P-CLIP83.051.751.752.951.964.651.750.659.2
Effort99.95100.00100.0099.9399.7499.7399.8599.7590.44
SDID97.696.996.697.293.794.493.296.892.4
DCCT99.7099.7099.7099.3299.7099.7099.7099.7091.13
MIRROR (DINOv3)99.899.699.699.591.799.599.496.993.0
Ours (CLIP)99.0099.0099.0099.0099.0099.0099.0099.0095.09
Ours (DINOv2)98.8098.8198.8198.8198.8198.8098.7298.6791.40
MethodLCM-SDv1.5LCM-SDXLSDv1-CtrlSDv2-CtrlSDXL-CtrlSDv1-DRSDv2-DRSDXL-DRmACC
With generative image reconstruction
DRCT (Conv-B)99.6678.7699.9095.0181.2199.9095.4075.3990.79
DDA95.998.298.799.099.499.099.596.398.1
PPL (CLIP)99.6299.7099.6899.6499.5199.6199.6797.8099.50
Without generative image reconstruction
CNNSpot98.2661.7297.9685.8982.8460.9351.4150.2881.12
UnivFD90.4488.9990.4181.0689.0651.9651.0350.4683.46
NPR97.6880.3294.4592.9690.2249.2449.4149.0183.63
SAFE50.150.049.950.054.798.298.597.359.3
C2P-CLIP52.066.156.954.777.867.257.156.759.2
Effort99.8999.5399.9798.9999.7650.0050.0050.0090.44
SDID96.391.397.095.796.686.775.971.992.4
DCCT99.7099.7099.3999.1499.4754.1054.5154.9591.13
MIRROR (DINOv3)99.997.099.899.098.780.967.959.493.0
Ours (CLIP)99.0099.0099.0099.0099.0089.2676.0469.0995.09
Ours (DINOv2)98.7998.7998.8098.7698.7663.8059.7954.6591.40

AES with CLIP achieves 95.09% mACC, compared with 93.00% for MIRROR under the reported training protocols.

Response to Reviewer 7ndr — Part 4/4

Q3 (ii). Post-processing.

Thank you for the suggestion. We have added results under JPEG compression, Gaussian blur, and resizing to the revised paper. JPEG results (%) are:

ConditionmACCmAPmAUC
Clean97.5599.7199.71
Q10096.1999.2699.24
Q9093.5698.5598.60
Q8090.3497.7497.88
Q7087.4397.1197.29
Q6084.696.5896.85

Blur and resize results (mACC, %) are:

OperationLevelmACC (%)
Gaussian blurσ=0.595.2
σ=190.35
σ=288.7
Resize×0.588.2
×0.7594.1
×1.591.8

Performance decreases as JPEG compression and blur become stronger; mACC is 84.60% at JPEG Q60 and 88.70% at Gaussian blur σ = 2. Across the tested resize levels, mACC ranges from 88.2% to 94.1%.

Q3 (iii). Format-aligned data.

Thank you for the suggestion. Following MIRROR's format-alignment setting, we have added the results to §4.4 (Fig. 4) and the implementation details to Appendix A.3.4.

Format-aligned GenImage (Fig. 4). BACC (%) on aligned test data is:

MethodOriginal weightsAligned retraining
AIDE88.488.6
FatFormer52.271.5
NPR84.773.7
SAFE50.647.7
UnivFD67.262.5
AES95.395.9

Minor issues. Thank you for pointing out these issues. We have made the following corrections in the revised paper:

  • Fig. 2 and equations: The CBA output, relevance and Gram-matrix inputs, and operation order now follow Eqs. 3–5.

  • UnivFD on Chameleon: We have corrected the UnivFD row in Table 5. The oACC remains 55.62%; generated/real accuracies are 74.97/41.09%. The previous values were copied from another detector's row.

  • Typographical errors: We have corrected the typos in the text and Figs. 1–2.

Reviewer_Qx7hOpenReview ↗
Rating
4(+2)
Confidence
4
Informativeness
2
Presentation
3
Soundness
2
Read review
Paper summary

This paper proposes an AI-generated image detection method that aims to ensure both forensic relevance and evidence diversity. The authors identify two major limitations of existing vision foundation model (VFM)-based detectors: reliance on semantic shortcuts and insufficient utilization of local forensic evidence. To address these issues, the proposed method reorganizes and selects forensic features by first suppressing locally shared semantic information and then selecting discriminative and diverse evidence from different regions. Experimental results demonstrate that the proposed method achieves competitive performance across multiple datasets.

Critical strengths
  1. This paper is well organized and easy to follow.

  2. The method is evaluated on public benchmarks, providing a stronger and more convincing assessment of its generalization ability across diverse and recent diffusion-based generative models.

Critical weaknesses
  1. The core idea of combining evidence relevance and evidence diversity has already been explored in a CVPR 2026 paper [1]. Beyond differences in methodological implementation, the authors should clarify the key contributions and novelty of this work relative to [1].

  2. The mean feature of a cluster does not necessarily represent semantic information. Therefore, subtracting the cluster center does not guarantee that the residual features capture meaningful forensic cues. This assumption requires further justification and empirical validation.

  3. The experimental comparisons omit several relevant methods published in 2026.

[1] He Q, Zhang H, Qin Q, et al. Diversity over uniformity: Rethinking representation in generated image detection[C]//Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. 2026: 40407-40417.

Questions for authors

Please refer to the Weaknesses section above for detailed questions and concerns, particularly regarding the novelty relative to [1], the validity of using cluster-centered residual features as forensic evidence, and the lack of comparisons with recent methods published in 2026.

2 comments

Response to Reviewer Qx7h

Thanks for your helpful feedback. Changes are marked in red.

W1: The key contributions and novelty.

R1: We agree that both the outstanding method DoU [1] and our proposed method combine evidence relevance and evidence diversity for AIGI. However, the main differences are as follows:

  • Problem and evidence unit. DoU addresses the concentration of discriminative information in a few feature subspaces using multi-stage global representations. In contrast, our AES captures the retained semantic content and reliance on a few salient regions, using groups of similar patches within each image as evidence units.

  • Evidence construction. DoU uses information bottlenecks and cue-removal consistency at each stage. Our CBA subtracts each cluster mean and models second-order variations within that cluster to suppress shared contents.

  • Selection and aggregation. DoU applies an inter-stage HSIC constraint over training batches and learns stage weights shared across images. Our DES uses a log-determinant objective within each image and selects evidence separately for the real and generated classes.

Beyond the above key differences, our key contribution is cluster-level evidence construction and image-dependent, class-specific information selection. We have revised §2.3 to describe DoU's global-feature aggregation and compare it with our per-image, per-class patch-cluster aggregation.

W2: Cluster-centered residual features as forensic evidence.

R2: We agree that additional experiments are needed to support this claim. In the revised paper (§4.4 and Appendix B.2), we compare CBA (second-order statistics after cluster centering) with three alternative ways to aggregate features within each cluster: direct cluster means, uncentered second-order statistics, and second-order statistics after image centering.

  • Semantic probe. We fit a semantic probe to predict the image category. CBA reaches chance-level accuracy, substantially lower than the alternatives.

  • t-SNE. In Appendix B.2, Figure 10 and Table 14, we divide the 20 categories into four groups of five and measure category structure in the original feature space and after t-SNE. Visually, CBA features from the same category are more dispersed, with greater mixing between categories. We use normalized neighborhood entropy to measure category mixing: it ranges from 0 to 1, with higher values indicating greater mixing.

Aggregation methodSame-category neighbors: original (%)Same-category neighbors: t-SNE (%)t-SNE entropy
CBA27.1824.770.870
Cluster mean55.5055.890.492
Uncentered second-order49.9050.590.554
Image-centered second-order34.3232.280.781
Aggregation methodSemantic probeDetection mACC
CBA5.0098.03
Cluster mean79.5895.58
Uncentered second-order77.3795.24
Image-centered second-order61.9695.07

CBA has the lowest same-category neighbor fraction in both spaces, indicating weaker category organization.

CBA also achieves higher detection mACC on GenImage. Together, these results support that cluster centering with second-order statistics reduces object-category information while retaining information useful for detection.

W3: Comparisons with recent methods.

R3: Thank you for the valuable suggestion. Considering model size and training and evaluation protocols, we compare AES with four methods published in 2026. The results have been added to Table 1 of the revised paper:

  • MCAN aggregates image, high-frequency, and chromaticity cues using multiple experts.

  • AIDE + FAIR trains AIDE with a scene-structure prior to reduce reliance on generator-specific textures.

  • GenSign learns generative signatures using reconstruction residuals as supervision.

  • OmniAID combines specialized semantic experts with a universal artifact expert.

The reported accuracy results (%) are:

GenImage

MethodSourceMidjourneySDv1.4SDv1.5ADMGLIDEWukongVQDMBigGANmACC
MCANAAAI 202694.398.898.590.298.698.896.898.896.9
AIDE + FAIRECCV 202683.6299.6399.6184.0596.6699.1187.2378.1891.01
GenSignCVPR 202699.3099.8099.7084.3090.4099.8099.6099.8096.60
OmniAIDICML 202685.7098.9098.8091.4098.7098.1097.3098.7095.90
Ours (CLIP)–98.3198.1198.0296.9798.1898.3598.2298.0898.03

We hope these results address your concerns.

Thank you for the author's reply. The author's reply clearly demonstrates the innovativeness of this work in terms of ideas and methods compared to existing work. It also answered my question about the practical significance of the cluster mean feature. Therefore, I am raising my score to 4 points.

From OpenReview, CC BY 4.0. Authors as signed there; shown unedited.

Related papers

Loading the map…

Discussion (0)

Sign in to comment.