ConceptioArchivearXiv CS
arXiv CSopen access

Adversarial Deepfake Generation and an Investigation of Purification-Based Adversarial Detection

Unknown · 2026 · arxiv_cs
arXiv CS · Papers · License: Open Access · 2026
Open Source ↗Direct PDF ↓
cryptography, security, privacy, cybersecurity

Adversarial Deepfake Generation and an Investigation of Purification-Based Adversarial Detection Notebook for the ImageCLEF at CLEF 2026 Junghyun Kim1,* , Seunghyun Kim1 and Jiyoung Woo1 1

Department of AI and Big Data Engineering, Soonchunhyang University, Asan, South Korea

Abstract

This paper describes the participation of team “Go To Germany” in the ImageCLEF 2026 Deepfake Detection and Generation Task [1]. For the image generation task, we employ FLUX.1-dev with PuLID for identity-preserving face synthesis, combined with a multi-model PGD adversarial attack targeting 12 detectors simultaneously (DiffJPEG-in-loop, MI/DI/EoT, adaptive weighting, two-stage warm-start). Our approach achieved 90% evasion against organizer detectors and 57.6% against participant detectors, with a final generation score of 0.4170. For the image detection task, we combine two complementary detectors — SigLIP+DINOv2 for AI-generated images and GenD-DINOv3 [2] for face manipulations — in a max-probability ensemble, achieving 99.4% accuracy on baseline deepfakes but suffering from high false-positive rates on real images, resulting in a final detection score of 0.6986. Beyond the official submission, we conducted a self-initiated investigation of purification-based adversarial detection, comparing three families of detection signals across six detectors that share a CLIP ViT-L/14 backbone. We find that raw |Δlogit| under median-3 purification, applied through the EFFORT detector [3], separates adversarial inputs from clean inputs with AUROC 0.81–0.98 across four adversarial source types — a finding that refutes the simple backbone-preservation hypothesis and exposes a sharp JPEG-quality cliff at 𝑄70 where the signal collapses.

Keywords

Deepfake Detection, Deepfake Generation, Adversarial Attack, Adversarial Detection, Input Purification, FineTuning Ablation, ImageCLEF 2026

1. Introduction Deepfake technology has advanced to the point where synthetic media can convincingly deceive both human observers and automated detection systems. The ImageCLEF 2026 Deepfake Detection and Generation Task [1], part of the broader ImageCLEF 2026 evaluation campaign [4], challenges participants to both generate realistic deepfakes that evade state-of-the-art detectors and build robust detection systems capable of identifying diverse manipulation types under real-world conditions. Our team participated in both the image generation and image detection sub-tasks. Observing during the generation track that adversarial attacks can substantially degrade detection performance, we conducted a self-initiated investigation of purification-based methods for detecting adversarial perturbations, reported here as further experiments beyond the competition submission. Our main contributions are as follows: • A multi-stage adversarial generation pipeline combining FLUX.1-dev and PuLID with a custom PGD attack that simultaneously targets 12 detectors and integrates DiffJPEG-in-loop, adaptive per-image weighting, and two-stage warm-start beyond standard PGD/MI/DI/EoT, achieving ≥ 95% evasion on 15 of 17 evaluated detectors (Section 3). • A two-detector max-probability ensemble combining SigLIP+DINOv2 (AI-generated image specialist) and GenD-DINOv3 [2] (face manipulation specialist) for complementary deepfake detection, achieving 99.4% accuracy on baseline deepfakes (Section 4).

CLEF 2026 Working Notes, 21 – 24 September 2026, Jena, Germany Corresponding author. $ [email protected] (J. Kim); [email protected] (S. Kim); [email protected] (J. Woo)

*

© 2026 Copyright for this paper by its authors. Use permitted under Creative Commons License Attribution 4.0 International (CC BY 4.0).

• A further-experiments investigation of purification-based adversarial detection across six detectors sharing a CLIP ViT-L/14 backbone, identifying EFFORT [3] (SVD-residual fine-tuning) as the only configuration that broadly generalizes (AUROC 0.81–0.98 across four adversarial source types in the raw input regime) and refuting the simple backbone-preservation hypothesis (Section 6). All experiments in this work were conducted on a server with four NVIDIA A100 40 GB GPUs.

2. Related Work 2.1. Deepfake Generation Modern face manipulation methods fall into three categories by mechanism. Face-swap methods (FaceShifter [5], SimSwap [6]) transfer identity onto a target face while preserving expression and background. Face reenactment (Face2Face [7], NeuralTextures [8]) preserves identity while transferring expressions and pose. Lip synchronization methods (Wav2Lip [9]) drive the mouth region alone. All three modify only local regions of the frame, making detection challenging. A separate line, full-face synthesis, generates entire faces from scratch, driven by an evolution from generative adversarial networks through denoising diffusion models [10], Latent Diffusion [11], and the Diffusion Transformer (DiT) architecture [12] that replaces the U-Net backbone with a transformer operating on tokenized noised latent patches. Several large-scale DiT systems have been released as this paradigm matured — including Stable Diffusion 3 and the FLUX family — of which we adopt the open-source FLUX.1-dev [13] for the compatibility of its ecosystem with the ControlNet and identity-injection modules described below. For identity-preserving generation, base diffusion generators are augmented with two families of conditioning modules. Structural controllers such as ControlNet [14] and its unified variants [15] enforce geometric constraints, typically using the OpenPose [16] convention. Identity-injection modules — IP-Adapter [17], PuLID [18] — add subject-specific features through cross-attention or contrastive alignment without per-identity fine-tuning. The off-the-shelf assembly of DiT, structural ControlNet, and identity-injection module underlies the generation pipeline of Section 3.

2.2. Deepfake Detection Deepfake detection has evolved rapidly, driven by an arms race with improving generation methods. Early efforts focused on hand-crafted artefacts specific to face manipulation: physiological inconsistencies, blending-region signatures (Face X-ray [19]), and frequency-domain irregularities specific to GAN upsampling [20, 21]. Data-synthesis strategies such as Self-Blended Images [22] extended this line by generating pseudo-fakes at training time. These signal-level cues were designed for the face-swap and reenactment regime dominant at the time and degrade quickly under real-world post-processing [23]. A second wave targeted cross-generator generalization while staying within the face-manipulation regime: latent-space augmentation [24] perturbs intermediate representations during training, and dual data alignment [25] aligns train-test distributions. Complementary temporal-modeling approaches — LipForensics [26], FTCN [27] — exploit frame-level inconsistencies that image-level detectors miss. These methods typically operate on face-cropped inputs and target the manipulation types collected in FaceForensics++. The most recent shift adopts representation-based detection built on large pretrained vision foundation models and, critically, broadens scope from face-only manipulation to a unified regime that also covers full-image AI synthesis. Ojha et al. [28] first demonstrated that a linear classifier on frozen CLIP [29] features generalizes across synthetic-image generator families, motivating parameter-efficient specialization strategies for VFM backbones — CLIP, SigLIP [30], and self-supervised vision transformers DINOv2 [31] and DINOv3 [32] — such as LoRA low-rank tuning [33, 34], adapter modules in ForAda [35], LayerNorm-only fine-tuning in GenD [2], and SVD-residual decomposition in EFFORT [3].

This paradigm shift toward unified detection is exemplified by UNITE [36], which builds on a SigLIP backbone with an attention-diversity loss to detect both face-manipulation and fully AI-generated content within a single model without requiring face-crop preprocessing. Very recent work on frozen DINOv3 features [37] further argues that foundation-model representations already encode global, lowfrequency structural cues transferable across generator families, though with caveats about localized face editing where signature preservation remains challenging. Two observations from this literature inform our design. First, even in the emerging era of unified detectors, face manipulation produces local artefacts around the modified region, while full-image AI synthesis produces global artefacts spanning the image; on our internal benchmark (Section 4.3) these signatures remain qualitatively different enough that an ensemble of specialists outperforms any single unified detector we surveyed, motivating the two-detector architecture of Section 4. Second, the diversity of parameter-efficient fine-tuning strategies on a shared backbone raises the question of whether they differ in properties beyond raw classification accuracy — specifically, their behavior under input perturbations relevant to adversarial detection — which forms the basis of our Section 6 investigation.

2.3. Adversarial Robustness of Deepfake Detectors Deep neural network classifiers, including deepfake detectors, exhibit a fundamental vulnerability: their predictions can be reversed by adversarial perturbations — small, carefully crafted modifications to an input, imperceptible to human observers, that change the classifier’s output class. In the deepfake context this creates a concrete threat model: an attacker can post-process a fake image with a tailored noise pattern that drives the detector’s fake-class probability below the decision threshold, effectively laundering the deepfake past automated detection. Perturbations are typically constrained to small ℓ∞ norm (each pixel modified by at most 𝜖, commonly 𝜖 = 2/255 or 8/255). The standard attack family progresses from single-step FGSM [38] through multi-step BIM [39] to projected gradient descent (PGD) [40], with Carlini & Wagner [41] representing an optimization-based alternative and AutoAttack [42] providing an ensemble benchmark that resists gradient-masking artefacts. Transferability techniques — Momentum Iterative [43], Input Diversity [44], Expectation over Transformation [45] — boost cross-model generalization, and DiffJPEG [46] provides a differentiable surrogate for nondifferentiable post-processing. Defenses fall into three broad camps. Adversarial training [40] jointly trains on clean and perturbed inputs at substantial compute cost and typically at the price of clean accuracy. Input purification transforms the input before classification to remove perturbations while preserving semantic content; Feature Squeezing [47] is the canonical instantiation and additionally proposes a detection variant that flags an input as adversarial when the classifier’s predictions disagree between the original and squeezed views. Detection-based defenses separately flag adversarial inputs without modifying the classifier — the Mahalanobis-distance framework of Lee et al. [48], developed and evaluated on generic out-of-distribution benchmarks such as CIFAR-10/100 and SVHN, treats them as off-manifold samples detectable by per-class Gaussian fits on intermediate features, with complementary lines using local intrinsic dimensionality [49]. Both purification-based detection and feature-space outlier detection have been studied extensively on generic image classifiers, but their behavior on modern foundationmodel-based deepfake detectors — where the choice of parameter-efficient fine-tuning strategy varies substantially across detectors sharing a common backbone — has not been systematically characterized. Our Section 6 investigation addresses this gap by quantifying the output logit shift under a median-filter operator across six detectors that share a CLIP ViT-L/14 backbone but differ in fine-tuning strategy, isolating fine-tuning method as the variable that governs signal strength.

2.4. Datasets FaceForensics++ [50] is the de-facto benchmark for face manipulation, providing five manipulation methods (Deepfakes, Face2Face [7], FaceSwap, FaceShifter [5], NeuralTextures [8]) over 1,000 source

videos at three compression levels; larger and more diverse successors include Celeb-DF [51], DFDC [52], and DF40 [53]. For the full-image AI-synthesis regime distinct from face manipulation, GenImage [54] and DiffusionForensics [55] are standard cross-generator benchmarks, with DiFF [56] targeting diffusiongenerated faces specifically; because these benchmarks do not cover the FLUX-family generators we expected to appear both in our own submissions and in participant deepfakes, we additionally use FLUXinclusive public pools such as BitMind on HuggingFace for detector model selection and calibration. The ImageCLEF 2026 Deepfake Detection task [1] we participate in combines organizer-generated face-manipulation deepfakes, participant-submitted AI-generated images, and curated real images into a heterogeneous evaluation scored under a weighted rule that emphasizes cross-team generalization.

3. Image Generation 3.1. Task Overview The generation task requires producing 1,002 deepfake face images (256×256 PNG) corresponding to 335 target identities. The organizers provide one reference video per identity (12–45 seconds of a single person speaking under varied lighting and pose) and 1–3 sets of MediaPipe FaceMesh landmark coordinates per identity that serve as facial geometry constraints for generation. The evaluation criteria are: (1) landmark distance to the reference geometry, (2) identity similarity via face recognition embeddings, and (3) deepfake evasion scores against both organizer and participant detection systems, with evasion weighted most heavily in the final score.

3.2. Base Generation Pipeline The base image synthesis assembles three off-the-shelf components without architectural modification (Figure 1): 1. FLUX.1-dev [13]: a Diffusion Transformer generates 512×512 face images using a fixed prompt describing a person against a light blue wall with natural lighting. 2. ControlNet-Union-Pro-2.0 [15]: enforces facial geometry and body pose constraints via its pose conditioning mode. Because this ControlNet variant is pretrained on the OpenPose [16] input convention rather than the MediaPipe convention used by the competition’s supplied landmarks, we render the provided MediaPipe 478-point face landmarks and 33-point body pose into an OpenPose-style control image: the 33 MediaPipe body joints are mapped to the 18 OpenPose keypoints with the standard colored-limb encoding (limbs drawn as colored ellipses, joints as colored dots), and a subset of the 478 face landmarks — aligned with the dlib 68-point convention and extended with the FaceMesh lip contour — is overlaid as white dots. This conversion bridges the format gap between the competition constraints and the ControlNet’s pretrained input distribution, allowing the model to naturally respect the provided facial geometry. The control image is applied with conditioning strength 0.85. 3. PuLID [18]: injects target identity features with weight 0.85 to maximize identity similarity to the reference set. For each identity we construct the identity embedding by averaging PuLID encodings of up to 20 reference face crops selected from the available per-identity image pool via farthest-first diversity sampling on InsightFace embeddings (starting from the crop with the highest face-detection score and greedily adding the candidate that maximizes its minimum cosine distance to the already-selected set). The resulting embedding is cached once per identity and reused across all generations. Each generated image is downsampled from 512×512 to 256×256 using cv2.INTER_AREA. Candidate selection. For each identity we generate 11 candidates with different random seeds. We first remove candidates whose landmark distance to the reference geometry is a clear outlier (lm_dist above a standard outlier threshold of 0.02, derived from the per-identity score distribution); from the

(a) Reference crop (one of up to 20 per identity)

(b) Competition landmark (c) Our OpenPose-style map (MediaPipe) control image

(d) Final generated image

Figure 1: Base generation pipeline for one identity (ID_139, frame 3), shown at the final 256×256 submission resolution. (a) PuLID reference crop; (b) competition-supplied MediaPipe landmark map; (c) our OpenPose-style ControlNet input; (d) final submission image. Panel (d) was generated at 512×512 by FLUX.1-dev with PuLID identity injection and OpenPose-style ControlNet conditioning, downsampled to 256×256 via cv2.INTER_AREA, and then perturbed by our PGD adversarial attack (Section 3.3); the 𝜖 = 2/255 perturbation is visually imperceptible. See Section 3.2 for component details.

remaining candidates we select the one with the highest identity similarity to the reference anchor (Section 3.5). After this automatic selection, a small number of final images that still exhibited visible artifacts (e.g., malformed or bent fingers) were manually replaced with the next-best candidate by identity similarity among the remaining seeds.

3.3. Adversarial Attack Design The selected images are perturbed with a custom Projected Gradient Descent (PGD) [40] attack jointly optimized against 12 white-box detectors: sdxl_det, effort, haywood, npr, xception, dfdc_b7, ateeq, umm_maybe, f3net, siglip_dino, freqnet, and srm. An additional five detector groups (AIDE [3 checkpoints], UCF, RECCE, DistilDIRE, SIDA-7B) are held out as black-box detectors used only for transferevaluation (Section 3.6). The attack minimizes a weighted sum of per-detector AI-class logits, ℒadv (𝑥) =

12 ∑︁ 𝑘=1

𝑤𝑘 𝑓𝑘 (𝑥)fake ,

∑︁

𝑤𝑘 = 1,

(1)

𝑘

where weights 𝑤𝑘 are tuned to balance per-detector difficulty. Updates follow sign-based momentum PGD, ∇𝑥 ℒadv (𝑥𝑡 ) , 𝑥𝑡+1 = Π‖𝑥−𝑥0 ‖∞ ≤𝜖 (𝑥𝑡 − 𝛼 · sign(𝑔𝑡+1 )) , (2) 𝑔𝑡+1 = 𝜇 · 𝑔𝑡 + ‖∇𝑥 ℒadv (𝑥𝑡 )‖1 with 𝜖 = 2/255, step size 𝛼 = 0.5/255, 𝑇 = 25 iterations, and momentum decay 𝜇 = 1.0. Three additional components are inserted in the attack loop to improve robustness and transferability: • DiffJPEG-in-loop [46]: a differentiable JPEG simulation at quality 𝑄 = 80 is applied to the perturbed image before each forward pass, so gradients reflect the post-compression image actually seen by detectors. • Input Diversity (DI) [44]: with probability 𝑝 = 0.5 at each step the perturbed image is randomly resized to 𝑟 ∈ [224, 256] and zero-padded back to 256 × 256. • Expectation over Transformation (EoT) [45]: realized implicitly by averaging gradients across the stochastic DI and DiffJPEG transformations.

3.4. Challenges and Solutions Challenge 1: Modern ViT-based detectors resist conventional post-processing. Frequencydomain detectors can be evaded by JPEG compression or histogram matching, but Vision Transformer detectors built on CLIP [29] or SigLIP [30] features proved robust to such techniques. Our initial evasion rate on siglip_dino was only 8%. Switching to gradient-based PGD raised this to 96.9% (Table 1). Challenge 2: Low-frequency attacks block SRM gradients. An early attempt applied Gaussian blur to the perturbation in order to concentrate noise in low-frequency bands. This evaded frequency-based detectors but completely zeroed out gradients through SRM-based detectors (0% evasion). Removing the blur and instead inserting DiffJPEG [46] in the attack loop preserves gradients through all detector types while keeping perturbations JPEG-robust. SRM evasion recovered to 83.4%. Challenge 3: Transfer to unknown detectors. White-box attacks optimized for the 12 known detectors may not transfer to unseen ones. We combined three transferability techniques in a single attack loop — Momentum Iterative (MI) gradient accumulation [43], Input Diversity (DI) [44], and Expectation over Transformation (EoT) [45] — achieving 89–100% evasion on the five held-out black-box detector groups. Challenges 4 & 5: Per-detector failures and multi-detector conflicts. Individual detectors with stubborn failure cases were addressed through (i) adaptive per-image weighting that doubles the loss weight for images with 𝑃 (fake) > 0.5, and (ii) two-stage attacks that use the first-stage perturbation as a warm start for a targeted second optimization. These recovered 104 images for freqnet and 31 images for f3net / UCF. Challenge 6: Face-crop evasion is structurally infeasible. When detection pipelines crop the face region before analysis, perturbations optimized over the full 256 × 256 image lose effectiveness because spatial cropping breaks the pixel patterns the perturbation depends on. Within the 𝜖 = 2/255 budget we could not simultaneously satisfy full-image and face-crop evasion. We did observe, however, that the loss of effectiveness varied substantially across detectors — some retained their fooled prediction under cropping while others recovered sharply — and this asymmetry later motivated the multidetector response instability investigation of Section 6.1. Robust solutions to the fundamental ℓ∞ -bound limitation under spatial transformation are left to future work.

3.5. Internal Evaluation For both official image metrics we run the official competition scoring code without modification; the only piece we supply ourselves is the ground-truth identity embedding file, which the organizers do not release. In addition, we evaluate detection-evasion performance against the 17 detectors that we used inside the attack loop (Section 3.3) and as held-out transfer verification, summarised in Table 1. Identity similarity. The official scoring routine (process_frames_similarity) extracts a single 512-d face embedding from each submitted image using InsightFace buffalo_s [57], L2-normalizes it, and computes the cosine similarity against a per-identity ground-truth embedding stored in all_embeddings_images.json. Because the organizers do not release this ground-truth file, we construct it ourselves: for each of the 335 identities, we extract face embeddings with the same buffalo_s model from multiple frames of the corresponding development video, L2-normalize them individually, and take the mean, yielding one 512-d unit-norm anchor per identity. When the scoring routine cannot read an image or InsightFace fails to detect a face in a submitted image, the per-image similarity defaults to −1; the final score is the mean cosine similarity over all 1,002 submissions (including these −1 penalties). Under this procedure with our self-constructed anchors, our submission attains a mean identity distance (1 − mean cosine similarity) of 0.2858.

Table 1 Detector evasion rates for the 1,002 generated images. The upper block lists the 12 white-box detectors used inside the attack loop; the lower block lists the 5 held-out detector groups used only for transfer evaluation. Detector

Evaded

Rate

1002/1002 1001/1002 1000/1002 981/1002 975/1002 971/1002 962/1002 836/1002

100% 99.9% 99.8% 97.9% 97.3% 96.9% 96.0% 83.4%

Transfer-verification (held-out black-box) AIDE (3 checkpoints) 1002/1002 UCF 1002/1002 RECCE 1000/1002 DistilDIRE 953/1002 SIDA-7B 893/1002

100% 100% 99.8% 95.1% 89.1%

White-box (attack targets) sdxl_det / effort / haywood / npr xception / dfdc_b7 ateeq umm_maybe f3net siglip_dino freqnet srm

Landmark distance. The official scoring routine (compare_landmarks) extracts 478 facial landmarks from each submitted image with MediaPipe FaceMesh (refine_landmarks=True) and computes the mean per-landmark Euclidean distance, in normalized image coordinates [0, 1]2 , against the target landmarks supplied by the organizers in the constraint JSON. A default penalty of 0.5 is substituted when the submitted image is missing, when MediaPipe fails to detect a face in it, or when the extracted and target landmark sets have mismatched shapes. The final score is the mean of these per-image distances across all 1,002 submissions. Under this procedure, our submission attains a mean landmark distance of 0.0065 (approximately 1.66 pixels at the 256×256 submission resolution). Detector evasion. Table 1 summarizes evasion rates across all 17 detectors (12 white-box plus 5 held-out groups) that we used as internal validation of our attack pipeline. We achieved ≥ 95% evasion on 15 of 17 detectors; only srm (83.4%) and SIDA-7B (89.1%) fell below this threshold.

3.6. Score on Official Evaluation The official evaluation scores across all sub-metrics are consolidated in Table 4 (Section 5). In the official evaluation, our submission achieved an evasion score of 0.9019 against organizer detectors (90% evaded) and 0.5762 against participant detectors (57.6% evaded). The gap between organizer (90%) and participant (57.6%) evasion reflects the model-specific nature of adversarial attacks: perturbations optimized against our 12 white-box targets transferred well to organizer detectors (likely sharing architectural families with our targets) but less effectively to participant detectors with unknown architectures. On the official image-quality side, the raw landmark distance was 0.0065 (identical to our internal measurement, since both rely on the publicly supplied constraint landmarks) and the raw identity distance was 0.5366 (versus our internal 0.2858 in Section 3.5; the gap reflects the difference between our self-constructed reference anchors — drawn from the same development videos that supplied the constraint frames — and the organizers’ held-out evaluation embeddings). After the official scaling, √︀ these become a Landmark Distance Score of 0.7823 (concave normalization max(0, 1 − 𝑑/0.137089) against a random-match baseline) and an Identity Distance Score of 0.4553 (linear normalization clipped between 0.4 and 0.7), averaged into an Image Quality Score of 0.6188 and combined with the evasion scores via the official rule Quality × (0.7 Participants + 0.3 Organizers) to give a final task score of 0.4170.

Figure 2: Image detection pipeline. An input is first matched against the perceptual hashes of our own 1,002 generated submissions; an exact match short-circuits to Fake. Otherwise the image is scored by two complementary detectors — SigLIP+DINOv2 (AI-generated content) and GenD-DINOv3 (face manipulation) — and classified by the decision rule of Section 4.4.

4. Image Detection 4.1. Task Overview The detection task requires classifying 24,404 images as Real (label 0) or Fake (label 1), without any training set provided by the organizers. Crucially, the Fake portion of the test set is itself heterogeneous: it contains both organizer-generated face-manipulation deepfakes (e.g., face-swap and reenactment outputs) and participant-generated AI-synthesized images produced under the parallel generation track. The official score is a weighted combination of accuracy on organizer-generated deepfakes (weight 0.1), organizer-provided real data (0.1), curated real ground-truth images (0.4), and participantgenerated deepfakes weighted by realism (0.4).

4.2. Detection Framework The two distinct fake types in the test set — face manipulation and full-image AI synthesis — have different statistical signatures (local face artifacts vs. global generation artifacts), and no single off-theshelf detector we surveyed covers both well. We therefore deploy a two-detector max-probability ensemble of specialists, one targeted at each fake type (Figure 2): • SigLIP+DINOv2 [30, 58, 31]: a publicly released HuggingFace checkpoint combining SigLIPso400m and DINOv2 ViT-L dual encoders with LoRA [33] fine-tuning, specialized for full-image AI-generated content detection. • GenD DINOv3 [2, 59]: a publicly released HuggingFace checkpoint with a DINOv3 ViT-L backbone and LayerNorm fine-tuning, specialized for face manipulation detection. An image is first matched against a pre-computed perceptual hash (pHash) set of our own 1,002 generated submissions; an exact match short-circuits to Fake. Otherwise the image is scored by both detectors and classified by a thresholded decision rule combining their per-image probabilities 𝑝1 (SigLIP+DINOv2) and 𝑝2 (GenD DINOv3): the image is Fake if max(𝑝1 , 𝑝2 ) > 0.5, or if min(𝑝1 , 𝑝2 ) > 𝜏min with 𝜏min = 0.04 (calibrated in Section 4.4); otherwise Real.

4.3. Model Selection Because no training set was provided, we compiled our own 10,000-image evaluation benchmark to compare candidate pre-trained/fine-tuned detectors under conditions matching the two expected fake types. The benchmark comprises 5,000 face-cropped images from FaceForensics++ [50] (1,000 real frames plus five manipulation algorithms: 1,000 Deepfakes, 1,000 Face2Face, 500 FaceSwap, 500 FaceShifter, 1,000 NeuralTextures) for the face-manipulation regime, and 5,000 images from BitMind public pools1 (2,500 SDXL and 2,500 FLUX) for the AI-generation regime. 1

BitMind image pool of SDXL- and FLUX-generated faces (https://huggingface.co/bitmind), used here as a stand-in for the unseen participant-generated AI imagery.

Table 2 Detection model comparison on our benchmark (5,000 FaceForensics++ + 5,000 BitMind images). DF=Deepfakes, F2F=Face2Face, FS=FaceSwap, FSh=FaceShifter, NT=NeuralTextures; AI-gen aggregates 2,500 BitMind SDXL and 2,500 BitMind FLUX. FM avg is the mean AUROC over the five FF++ methods; Overall is the mean over all six columns. Model

DF

F2F

FS

FSh

NT

FM avg AI-gen Overall

ForAda [35] GenD CLIP [2, 60] GenD DINOv3 [2, 59] SigLIP+DINOv2 [58]

0.942 0.959 0.930 0.637

0.714 0.774 0.810 0.558

0.852 0.916 0.877 0.565

0.678 0.677 0.678 0.488

0.690 0.664 0.754 0.562

0.775 0.798 0.810 0.562

0.583 0.921 0.724 0.995

0.743 0.819 0.796 0.634

On this benchmark we evaluated four candidate detectors, each taken off-the-shelf without further fine-tuning: ForAda [35], GenD CLIP [2, 60], GenD DINOv3 [2, 59], and the publicly released LoRA fine-tuned SigLIP+DINOv2 [58] checkpoint. We measured AUROC separately on the two face-manipulation sub-categories (Face Swap = FaceSwap+FaceShifter, Reenactment = Face2Face+NeuralTextures+Deepfakes) and the AI-generation set (AI-gen = BitMind). Table 2 shows a clear specialization pattern. GenD DINOv3 leads face-manipulation detection with the highest FF++ average (FM avg 0.810), while SigLIP+DINOv2 dominates AI-generation (0.995). GenD CLIP achieves the highest Overall average (0.819) as a balanced generalist, but our specialist ensemble surpasses it in both target regimes (GenD DINOv3 0.810 > 0.798 on face manipulation; SigLIP 0.995 > 0.921 on AI-generation), justifying the two-detector design of Section 4.2. Notably, FaceShifter is universally the hardest FF++ method (AUROC 0.488–0.678), and FLUX-generated faces are harder to detect than SDXL for most detectors, indicating that newer DiT-based generators are pushing detection difficulty upward. We note that GenD DINOv3’s absolute AUROC on face manipulation shows some dependence on the face-crop preprocessing pipeline, though it consistently ranks as the strongest face-manipulation detector among the four models evaluated.

4.4. Threshold Calibration The default rule “classify as Fake if either detector exceeds 0.5” is conservative: an image can have both detectors weakly flagging it (e.g., 𝑝1 = 0.3, 𝑝2 = 0.2) without being marked Fake, even though their joint signal is suspicious. We therefore introduced an auxiliary prob_min rule — classify as Fake when min(𝑝1 , 𝑝2 ) > 𝜏min — and calibrated 𝜏min on a held-out 7,000-image calibration set composed as follows: • Real (2,000): 1,500 FF++ original frames + 500 frames extracted from the generation-task reference videos. • Face manipulation, Fake (4,000): FF++ five manipulation algorithms. • AI-generated, Fake (1,000): 500 images sampled from our own generation pipeline + 500 BitMind SDXL/FLUX images. Sweeping 𝜏min on this set, we recorded the additional true positives (TP) and false positives (FP) introduced by the prob_min rule on top of the 0.5-baseline classification (Table 3). We selected 𝜏min = 0.04, which yields the largest count-based net gain (+433) and raises overall calibration-set accuracy from 78.0% to 84.6%.

4.5. Score on Official Evaluation The official evaluation scores across all sub-metrics are consolidated in Table 4 (Section 5). In the official evaluation, our two-detector ensemble achieved 99.4% accuracy on organizer baseline deepfakes, 88.2% on participant-generated deepfakes, and 43–57% on real images across the curated and organizerprovided real subsets. Combined under the official weighting 0.1 × OrgFake + 0.1 × OrgReal + 0.4 ×

Table 3 Threshold sweep for the prob_min rule on the calibration set (2,000 Real / 5,000 Fake). “+TP” and “+FP” count the additional true and false positives produced by the rule beyond the 0.5-baseline. We selected 𝜏min = 0.04 based on maximum net gain. 𝜏min

+TP

+FP

Net gain (TP − FP)

0.04 0.06 0.10 0.30

825 578 356 74

392 173 94 13

433 405 262 61

CuratedReal + 0.4 × ParticipantFakerealism-weighted , this yields a final image detection score of 0.6986. Because real images carry the dominant 0.4 weight, the weak real-side accuracy substantially depressed the final score. Post-competition analysis. Two compounding errors in our 𝜏min calibration strategy explain the real-image underperformance: 1. Inappropriate metric. We optimized count-based net gain (TP − FP), which implicitly assumes the test set’s class proportions match the calibration set’s. Expressed as rates on the calibration set, however, the 𝜏min = 0.04 rule produces a true-positive-rate gain of 825/5000 = 16.5% while incurring a false-positive rate of 392/2000 = 19.6% — a higher rate of new false positives than new true positives. The rule looked profitable in raw counts only because Fake outnumbered Real 5,000 : 2,000 in our calibration set. 2. Distribution mismatch. Our calibration set had a Real:Fake ratio of 1:2.5, but the official test set, given the 0.4 weight on curated real images, contains a higher real fraction. Because the rule’s 19.6% FPR exceeds its 16.5% TPR gain (item 1), at any balanced or real-dominant test distribution the new false positives outweigh the new true positives, turning the rule into a net loss regardless of absolute test-set size. The principled remedy would have been to calibrate per-detector thresholds against the ROC curve of each detector on the FF++ benchmark, or to use rate-independent target metrics (TPR / FPR / balanced accuracy) instead of count-based net gain. Given that our AI-generation specialist SigLIP+DINOv2 achieves AUROC 0.995 on BitMind and our face-manipulation specialist GenD DINOv3 averages 0.810 across all five FaceForensics++ methods (Table 2), correct threshold selection alone is expected to lift overall accuracy above 90%.

5. Official Competition Results Table 4 consolidates our official CLEF 2026 ImageCLEF Deepfake Task scores across both sub-tasks; per-task derivations and post-mortem discussion appear in Sections 3.6 and 4.5. The benchmark’s scoring rules concentrate weight on components that require generalization beyond the organizer-provided baselines: on the generation side, participant-side evasion carries 0.7 weight within the evasion factor (versus 0.3 for organizer-side evasion); on the detection side, a held-out curated real subset carries the single largest weight (0.4). Our submission scores highly on the lower-weight components of both tasks — 0.9019 organizer evasion, 0.9939 accuracy on baseline organizer deepfakes — but is bounded by the high-weight components (0.5762 participant evasion, 0.5729 curated-real accuracy). The final scores of 0.4170 (generation) and 0.6986 (detection) therefore reflect the difficulty of the benchmark’s explicit generalization objective rather than raw capability limits on the organizeronly regime. Reading across the two tasks, a common thread connects them to our further experiments. On the generation side, we demonstrably drove the fake-class probability of most off-the-shelf detectors

Table 4 Official CLEF 2026 ImageCLEF Deepfake Task results for team “Go To Germany”. Generation final score = Quality × (0.7 Participants + 0.3 Organizers), where Quality is the mean of the Landmark and Identity distance scores. Detection final score is a weighted sum with weights 0.1, 0.1, 0.4, 0.4 over Baseline Deepfakes, Organizers Real, Organizers Real GT, and realism-weighted Participant Deepfakes, respectively. The high-weight components (participant evasion, curated real) are the primary drivers of the final scores. Metric

Score

Generation Task (Section 3) Landmark distance score Identity distance score Image Quality Score (mean) Evasion, Organizer detectors Evasion, Participant detectors Final Generation Score

0.7823 0.4553 0.6188 0.9019 0.5762 0.4170

Detection Task (Section 4) Baseline Deepfakes Organizers Real Data Organizers Real GT Data (curated) Participant Deepfake Data (unweighted, info.) Participant Deepfake Data, realism-weighted Final Detection Score

0.9939 0.4324 0.5729 0.8822 0.8171 0.6986

below the decision threshold using standard adversarial post-processing techniques. On the detection side, our ensemble’s accuracy dropped from 0.9939 on baseline organizer deepfakes to 0.8822 on participant-generated deepfakes — a gap most plausibly explained by distribution shift between the two generation pipelines, with adversarial post-processing as a possible secondary contributor if participants applied comparable techniques. Since our own generation track directly demonstrates the adversarial vulnerability affecting raw-pixel detectors, Section 6 investigates whether the same off-the-shelf detectors can be used to flag adversarial-post-processed inputs as such.

6. Further Experiments: Purification-Based Adversarial Detection Building on the observation of Section 5 that adversarial post-processing bounds detector accuracy regardless of representational backbone, we asked whether our own detectors can flag such inputs — not necessarily recover the correct fake-vs-real label, but distinguish them from natural, clean, or naturally-degraded inputs. We explored three families of detection signals in sequence: multi-detector response instability (Section 6.1), feature-space Mahalanobis outlier detection (Section 6.2), and input-space purification response (Section 6.3). The first two yielded informative failure modes; purification is where our final positive result is concentrated.

6.1. Multi-Detector Response Instability Motivation from Challenge 6. Challenge 6 of Section 3.4 reported that face-cropping an adversarial image before inference changed the perturbation’s effectiveness differently across detectors. This suggested that adversarial inputs leave a signature in the joint response of multiple detectors to controlled input modifications, even when no single detector’s modified output is individually informative. Method. For each input 𝑥 we generated three perturbed variants — center crop 192 × 192, random crop 192 × 192, and a face-aware crop (variable size around the detected face) — and passed each through a panel of eight detectors: AIDE (three checkpoints: progan, genimage, sd14), DistilDIRE, NPR, Haywood, Xception, and SigLIP+DINOv2. The resulting 8 × 3 = 24-dimensional shift vector was the

input to logistic regression (LR) and random forest (RF) classifiers trained on a 1,001-image train / 1,001image test split. Adversarial inputs are stored as PNG but generated through the JPEG-𝑄80-in-loop PGD pipeline of Section 3.3, so the perturbations are JPEG-survivable by construction. Initial results. Single-detector AUROCs spanned a wide range (Table 5), with the best configuration at 0.761 and several sub-random (signal direction reversed). The combined classifiers reached LR AUROC 0.971 / RF AUROC 0.981 (accuracies 0.914 / 0.932) with clean-fake false-positive rate below 0.5%. A controlled discrimination test on 400 adversarials vs. 400 real images JPEG-compressed at 𝑄 ∈ {50, 60, 70, 80} reached RF AUROC 0.952, further suggesting the signal could be made JPEG-robust with augmented training. Table 5 Section 6.1 — per-detector AUROC of single-variant probability shift (selected entries) and combined-vector classifier AUROC on the clean-vs-adversarial split. Single detectors give weak and sometimes reversed signal; combining the 24 features by LR or RF yields a strong adversarial detection signal. Configuration

AUROC

Accuracy

aide_genimage / center crop (best single) distildire / face crop aide_genimage / random crop npr / face crop distildire / center crop aide_progan / random crop aide_sd14 / random crop haywood / random crop

0.761 0.761 0.757 0.663 0.557 0.507 0.338 0.338

— — — — — — — —

Logistic regression (24-dim) Random forest (24-dim)

0.971 0.981

0.914 0.932

Diagnosis: JPEG re-encoding mimics the adversarial signature. The pilot did not survive deployment conditions. A control experiment applied nine augmentations — Gaussian noise (𝜎 ∈ {0.02, 0.05}), Gaussian blur (𝑘 ∈ {3, 5}), JPEG re-encoding (𝑄 ∈ {50, 70}), rotation ({15∘ , 20∘ }), and Poisson noise — to twenty real images and measured the cosine similarity of each instability vector to the adversarial-suspect cluster (Table 6). JPEG re-encoding at any moderate quality produced cosine similarity above 0.92, indistinguishable from the adversarial signature; all other augmentations stayed below 0.90. Table 6 Section 6.1 — cosine similarity of augmented-real instability vectors to the adversarial-suspect cluster. JPEG re-encoding at 𝑄 ∈ {50, 70, 80} produces signatures indistinguishable from adversarial (cos > 0.92), while natural noise and blur augmentations stay below 0.70. Augmentation JPEG Q70 JPEG Q80 JPEG Q50 Gaussian noise (𝜎=0.02) Rotation 20∘ Rotation 15∘ Gaussian blur (𝑘=3) Gaussian noise (𝜎=0.05) Gaussian blur (𝑘=5) Poisson noise

cos to adversarial signature 0.964 0.952 0.921 0.890 (grey) 0.826 (grey) 0.817 (grey) 0.765 (grey) 0.682 (distinct) 0.674 (distinct) 0.642 (distinct)

A deployment check on the full 24,404-image test set confirmed the consequence. The organizers released the test images without processing metadata, so we estimated per-image JPEG quality from the block-artifact ratio (BAR). On this estimate, the random-forest adversarial probability correlated negatively with BAR-estimated quality (Spearman 𝜌 = −0.519, 𝑝 < 10−50 ) and the false-positive rate scaled monotonically with estimated compression strength (Table 7), from 87.2% at estimated 𝑄 < 50 down to 6.7% at estimated 𝑄 ≥ 90. Combined with the controlled-augmentation result above (Table 6), this indicates that the instability signal is entangled with JPEG-like block artifacts and cannot serve as an adversarial-specific decision on test inputs whose compression history is unknown. This motivated the move to a single-detector feature-space signal (Section 6.2) that could distinguish adversarial perturbations from such structured high-frequency content. Table 7 Section 6.1 — adversarial false-positive rate on the 24,404-image deployment test set, binned by estimated JPEG quality (random forest, threshold 0.5). Low-quality JPEG real images trigger almost-certain false positives, revealing that the instability signal is structurally entangled with JPEG quantization artifacts. JPEG quality bin 𝑄 < 50 𝑄 ∈ [50, 60) 𝑄 ∈ [60, 70) 𝑄 ∈ [70, 80) 𝑄 ∈ [80, 90) 𝑄 ≥ 90

𝑛

False-positive rate

556 618 469 823 1091 2445

87.2% 71.7% 43.1% 23.0% 10.5% 6.7%

6.2. Mahalanobis Feature-Space Outlier Detection Hypothesis. The instability signal of Section 6.1 failed because the JPEG signature is empirically indistinguishable from the adversarial signature at the level of multi-detector probability shifts. We hypothesized that a single-detector signal computed on the detector’s internal features might separate the two: adversarial inputs are optimized against the classification head and should land in low-likelihood regions of the per-class feature distribution, while JPEG-compressed clean inputs — though highfrequency-distorted — should still sit on the natural-image feature manifold. Mahalanobis distance to per-class Gaussian fits, following the adversarial / out-of-distribution detection framework of Lee et al. [48], is the natural test of this off-manifold property. 6.2.1. Per-detector single-distance Mahalanobis Throughout Section 6.2 we use four image categories: real (3,350 face crops from the generation-task reference videos), clean fake (our 1,002 FLUX+PuLID generations before PGD), JPEG-Q70/Q80 (the same real frames re-encoded at the indicated quality), and adversarial (our 1,002 PGD-perturbed submission images). For both SigLIP+DINOv2 and ForAda we fitted per-class Gaussians on the penultimate features and scored each test image by the minimum Mahalanobis distance to either class centroid, min(𝑑real , 𝑑fake ). The result repeated the Section 6.1 failure mode (Table 8): adv-vs-all is barely above chance (AUROC 0.515 on SigLIP), and adv-vs-JPEG is near-zero on both detectors and both quality levels — a near-perfect reverse signal in which JPEG-compressed reals sit farther from the real-class centroid than adversarial images do. JPEG quantization predominantly affects shallow-layer features (where high-frequency content lives), while the adversarial signal is structured to fool the classification head and should concentrate near deep layers. A multi-layer pooled distance should therefore amplify the adversarial-specific component and suppress the JPEG-driven shallow component.

Table 8 Section 6.2.1 — AUROC of min 𝑑maha as a single-distance adversarial detector on two detectors. On both advvs-JPEG comparisons the score is near-zero, meaning JPEG-compressed real images are pushed farther into the off-manifold region than adversarial images are. The same JPEG confound that defeated multi-detector instability re-emerges at the feature level. Detector

adv vs all

adv vs JPEG-Q60

adv vs JPEG-Q80

0.515 0.427

0.022 0.010

0.182 0.072

SigLIP+DINOv2 ForAda

6.2.2. Multi-layer Mahalanobis ensemble Following Lee et al. [48], we extracted DINOv2 features at five depths (𝐿4 , 𝐿9 , 𝐿14 , 𝐿19 , 𝐿23 ), fitted perclass Gaussians at each depth with Ledoit-Wolf shrinkage covariance, and combined the five per-layer Mahalanobis distances via logistic regression on a balanced pilot set of 100 images per category (real, clean fake, JPEG-Q80, adversarial; sources as defined in Section 6.2.1). Pilot. The LR ensemble reached AUROC 1.000 on all three reference sets (real, clean fake, JPEG) — the strongest single-signal result of our exploration (Table 9). Single-layer failures at 𝐿4 and 𝐿14 on adv-vs-JPEG were absorbed by the ensemble. A pilot t-SNE projection (Figure 3a) shows four cleanly separated clusters — the first time in this investigation that adversarial and JPEG-Q80 inputs separated in a learned feature space. Table 9 Section 6.2.2 — per-layer DINOv2 Mahalanobis AUROC on the pilot (100 images per category). Single layers fail catastrophically at 𝐿4 and 𝐿14 on adv-vs-JPEG, but the LR ensemble of all five depths reaches AUROC 1.0 across all three reference sets — the strongest pilot result of our exploration. Layer 𝐿4 𝐿9 𝐿14 𝐿19 𝐿23 LR ensemble

real vs adv

adv vs JPEG

adv vs clean

1.000 1.000 1.000 1.000 1.000 1.000

0.463 1.000 0.193 1.000 0.981 1.000

1.000 1.000 1.000 1.000 0.923 1.000

Deployment failure. The pilot did not survive the move to the full 24,404-image test set. We refit the per-class Gaussians on the full pilot+test feature corpus and re-evaluated the LR ensemble. CV AUROC remained 1.000, but test-set detection rate dropped to 0.0% and recall on our own 1,002 submitted adversarials was also 0.0%. The full-data Gaussian has substantially broader covariance than the pilot Gaussian: mean Mahalanobis distance is 6.75× larger (1,514 vs. pilot 224), so the LR boundary trained on pilot-scale distances is meaningless at the deployment scale. Five rescue attempts — Gaussian refit on test features, per-dimension z-score normalization, raw-distance thresholding, inter-class distance ratios, and inverted-distance classification — all yielded ≤ 4.4% recall on our own adversarials. The pilot t-SNE separation (Figure 3a) is qualitatively gone at deployment scale (Figure 3b). Diagnosis. The multi-layer ensemble did resolve the JPEG confound of Sections 6.1 and 6.2.1 at pilot scale — the first signal in our investigation to do so. But any Mahalanobis-based score requires a fixed-reference Gaussian whose statistics depend on the calibration data, and when the deployment distribution is broader than the calibration distribution the distance scale shifts and any pilot-calibrated decision boundary loses meaning. We therefore abandoned feature-space outlier signals in favor of an input-space approach (Section 6.3) that measures detector behaviour under a controlled input

change rather than fitting a statistical model over features — a formulation that does not depend on calibration-scale matching.

6.3. Input-Space Purification The Mahalanobis ensemble of Section 6.2 collapsed at deployment because its decision boundary was tied to calibration-scale Gaussian statistics. We therefore moved to signals that require no fitted reference: input-space purification. The hypothesis is that detectors respond differently to controlled image filters on adversarially perturbed inputs than on natural inputs, because adversarial perturbations are gradient-aligned and lose their effect once the gradient-relevant pixel pattern is smoothed away. We investigated this in three steps of increasing scope: a single-operator pilot on the two-detector ensemble (Section 6.3.1), a multi-operator combination on a single detector (Section 6.3.2), and a fine-tuning ablation across six detectors sharing the same backbone (Section 6.3.3). 6.3.1. Single-operator median-3 on the two-detector ensemble The simplest instantiation applied a 3 ×3 median filter to each input and recorded the change in detector probability, Δ = 𝜎 −1 (𝑝(𝑇 (𝑥))) − 𝜎 −1 (𝑝(𝑥)), where 𝜎 −1 is the logit function. We evaluated this score on the two-detector ensemble of Section 4.2 (SigLIP+DINOv2 and GenD-DINOv3) across five categories of 100 images each: clean real, clean fake, JPEG-𝑄80 compressed reals, adversarial against ForAda, and adversarial against SigLIP+DINOv2. Table 10 Section 6.3.1 — single-operator median-3 purification AUROC on the two-detector ensemble. Each own-target adversarial separates well from clean fakes on the target detector itself, but the signal collapses on other detectors and on the JPEG-𝑄80 contrast. Detector SigLIP+DINOv2 GenD_DINOv3 ForAda EFFORT

adv_forada vs clean

adv_forada vs JPEG

adv_siglip vs clean

adv_siglip vs JPEG

0.872 0.481 0.642 0.093

0.225 0.496 0.554 0.693

0.997 0.384 0.241 0.088

0.834 0.385 0.183 0.701

Ensemble adv-vs-JPEG (combined)

0.530

SigLIP+DINOv2 separates its own-target adversarials cleanly from clean fakes (AUROC 0.997), but JPEG-𝑄80-compressed reals dilute the ensemble signal back to chance (0.530) — the same JPEG confound that defeated Sections 6.1 and 6.2, now reappearing in the input domain. This motivates combining purification operators whose responses to adversarial perturbation and JPEG quantization differ. 6.3.2. Multi-operator combination on GenD-DINOv3 We applied three input filters (median 5×5, bit-depth 4, Gaussian 𝜎=1) and recorded the feature shift each induced at layer 𝐿19 of GenD-DINOv3, plus the raw output Δ-logit as a fourth feature. A logistic regression classifier on this four-dimensional response vector reached AUROC 0.998 ± 0.004 on adversarial vs. JPEG-𝑄80 (5-fold CV) and 0.932 ± 0.064 on adversarial vs. all non-adversarial inputs. The sign pattern in Table 11 is what the ensemble exploits: median and bit-depth reduce adversarial high-frequency content but leave JPEG quantization residuals relatively untouched, while the Gaussian operator and the raw output shift in the same direction on both input types. The signed combination amplifies the difference between the two regimes. This resolves the JPEG confound on GenD-DINOv3, but the LR weights must be refit per detector and per deployment distribution. The next section asks whether a simpler, weight-free signal can yield a JPEG-robust adversarial detector across an ablation of fine-tuning methods.

Table 11 Section 6.3.2 — logistic regression coefficients on the four-dimensional operator response vector at GenDDINOv3’s 𝐿19 . Median and bit-depth coefficients are negative; Gaussian and raw-Δlogit are positive. Feature Δ𝐿19 (median 5 × 5) Δ𝐿19 (bit-depth 4-bit) Δ𝐿19 (Gaussian 𝜎=1) Δ-logit (raw)

Coefficient −2.01 −1.96 +1.41 +1.21

6.3.3. Raw |Δlogit| with fine-tuning ablation Hypothesis. A simpler, weight-free signal — raw |Δlogit| from a single purification operator — would remove the per-detector and per-distribution recalibration constraints of Section 6.3.2, provided the underlying detector is sensitive enough to the adversarial perturbation. We hypothesized that this sensitivity is controlled by how strongly the detector’s fine-tuning modifies the pretrained backbone: a backbone-preserving detector should retain the smooth input-output mapping that makes gradientaligned perturbations stand out under purification, while a heavily fine-tuned backbone may have smoothed over that mapping. We tested this with a controlled ablation across six detectors sharing the same CLIP ViT-L/14 backbone. Setup. We trained three detectors ourselves on an identical FaceForensics++ split with all other hyperparameters matched, differing only in fine-tuning method: a linear probe (LP, 0% of backbone parameters updated), a LoRA fine-tune (𝑟=32, ≈ 1% updated), and a full fine-tune (≈ 100%). To test cross-recipe generalization, we added three publicly released checkpoints sharing the same backbone but with different fine-tuning strategies and training data: GenD-CLIP (LayerNorm-only), ForAda (adapter modules), and EFFORT [3] (SVD-residual decomposition). The detection signal is the raw output logit shift under median-3 purification, | 𝑓 (𝑇 (𝑥)) − 𝑓 (𝑥) |, computed in the pre-sigmoid logit domain. We read this from the final fake-class output rather than an intermediate feature because the six detectors share a backbone but differ in fine-tuning, so no intermediate layer is comparable across them. Pilot and metric correction. On a balanced 100-image-per-category pilot the backbone-preserving methods showed strong separation: the linear probe shifted by mean +31.06 logits on adversarial inputs versus +0.85 on real inputs, a 36× ratio. This signal is invisible in the sigmoid-saturated metric typically reported in prior work — after 𝜎(·) followed by 𝜎 −1 (·) with floating-point clipping, the +31 raw shift compresses to +0.30, smaller than the +0.85 apparent shift on real inputs. The discrepancy is purely metric-induced; we report raw logit shifts throughout the validations below. Deployment validation. We tested the pilot signal on a deployment matrix of four adversarial source types × two input degradations. The source types are: production (our 1,002 submitted images, PGD against a 12-detector ensemble with DiffJPEG-in-loop at 𝑄=80); cross AI-generated (BitMind SDXL/FLUX and our generation pipeline, attacked with PGD [40]/FGSM [38]/BIM [39] targeting forada/SigLIP/joint ensembles); cross face-swap (FF++ Deepfakes, FaceShifter, FaceSwap with the same attack matrix); and cross reenactment (FF++ Face2Face, NeuralTextures with the same attack matrix). The two degradations are raw PNG input and post-JPEG-𝑄80 input. AUROC is reported with bootstrap 95% confidence intervals over 5,000 resamples (Table 12). EFFORT is the only detector that generalizes broadly under raw input, with AUROC ≥ 0.81 on every source and ≥ 0.89 on both face-manipulation families. Linear probe comes second but plateaus around 0.77–0.91, leaving a clear gap on face manipulation. JPEG-𝑄80 post-degradation costs every detector 0.15–0.25 AUROC; EFFORT’s face-swap AUROC drops from 0.89 to 0.68.

Table 12 Section 6.3.3 — raw |Δlogit| AUROC for adversarial detection across six detectors, four source types, and two input degradations. EFFORT generalizes broadly under raw input (AUROC 0.81–0.98 across all four sources); JPEG-𝑄80 post-degradation reduces all signals. Detector

Prod

Raw input AIg FSw

Reen

Prod

JPEG 𝑄80 AIg FSw

Reen

LP LoRA FullFT GenD-CLIP ForAda EFFORT

0.91 0.53 0.61 0.65 0.41 0.98

0.78 0.66 0.75 0.65 0.50 0.81

0.78 0.61 0.78 0.65 0.55 0.89

0.71 0.44 0.44 0.65 0.44 0.79

0.62 0.56 0.62 0.60 0.48 0.58

0.58 0.51 0.69 0.62 0.54 0.72

0.77 0.64 0.76 0.66 0.66 0.89

0.56 0.53 0.64 0.63 0.65 0.68

Bootstrap 95% CIs (representative): EFFORT × prod 0.982 [0.961, 0.994]; EFFORT × cross-faceswap 0.891 [0.883, 0.899]; EFFORT × cross-reenact 0.890 [0.880, 0.898]; LP × prod 0.906 [0.873, 0.937].

Multi-operator refinement and the JPEG kernel shift. We re-applied the multi-operator combination of Section 6.3.2 — now using raw output |Δlogit| from four operators rather than internal features — to EFFORT individually. On raw input the multi-op LR adds +0.02 to +0.025 AUROC on cross face-manipulation, lifting cross-faceswap and cross-reenact each to 0.911. On JPEG-𝑄80 input the multi-op LR adds +0.04 to +0.09 AUROC on production (0.789 → 0.878) but fails to push cross face-manipulation above the 0.85 threshold (0.681 → 0.742, 0.722 → 0.761). Table 13 Section 6.3.3 — multi-operator logistic regression on four output |Δlogit| features (median 3×3, median 5×5, Gaussian 𝜎=1, bit-depth 4), applied to EFFORT. Under raw input the dominant feature is median-3 (+2.09); under JPEG-𝑄80 it shifts to median-5 (+0.88). Subset prod cross-AI-gen cross-face-swap cross-reenact

Raw input single med-3 multi-op LR 0.982 0.808 0.891 0.890

JPEG 𝑄80 single med-3 multi-op LR

0.986 0.820 0.911 0.911

LR coefficient, dominant operator (others omitted): Raw input median-3 = +2.09 JPEG-𝑄80 input

0.789 0.580 0.681 0.722

0.878 0.640 0.742 0.761

median-5 = +0.88

The coefficient shift between regimes is mechanistically meaningful. Under raw input, the 3×3 median dominates (+2.09): gradient-aligned adversarial perturbations live in the highest spatial frequencies that this kernel removes. Under JPEG-𝑄80 input the 3×3 median’s contribution collapses to near zero (−0.03) and the 5×5 median takes over (+0.88). JPEG quantization itself partially low-passes the input, so the smaller-kernel response no longer carries adversarial-specific information beyond what JPEG already removed; only the larger kernel still pulls discriminative signal out of the JPEG-residual texture. This is the structural reason to prefer multi-operator combinations when input quality is heterogeneous. Sensitivity to JPEG quality. We swept JPEG quality from 𝑄50 to 𝑄95 with EFFORT and the single median-3 operator (Figure 4). The 𝑄70 → 𝑄80 transition is a sharp cliff: cross-face-swap AUROC jumps from 0.47 (random) at 𝑄70 to 0.69 at 𝑄80, and from 0.69 to 0.85 between 𝑄80 and 𝑄95. At 𝑄95 the single-operator signal alone clears the broad cross-source claim (AUROC ≥ 0.85 on every source). At 𝑄70 and below, no operator combination tested here recovers usable signal.

Diagnosis. On uncompressed input, raw |Δlogit| under EFFORT separates adversarial from clean inputs across all four source types (AUROC 0.81–0.98, tight bootstrap CIs of representative width ±0.01). This is the broadest cross-source generalization observed in our exploration. The signal is detector-specific (the other five same-backbone detectors plateau between 0.40 and 0.78) and qualitydependent: the multi-operator LR partially compensates at 𝑄80, the single operator suffices at 𝑄95, and no combination we tested recovers usable signal at 𝑄70 or below. The original backbone-preservation hypothesis is not supported in its strongest form: backbone parameter-update fraction alone does not predict purification signal strength. Among our three controlled trained detectors, the predicted ordering by decreasing backbone preservation (LP > LoRA > FullFT) does not hold — the actual ordering is LP > FullFT > LoRA, with LoRA, which updates only ∼ 1% of parameters, the weakest of the three. Across all six detectors EFFORT, which carries one of the heaviest backbone modifications (SVD-residual decomposition over the full backbone), is by far the strongest. The relevant property must therefore involve the specific subspace targeted by the fine-tuning, or the smoothness of the resulting input-output map. One plausible intuition is that SVDresidual fine-tuning isolates the singular directions most strongly modified by the deepfake-detection task, which may coincide with the directions along which gradient-aligned adversarial perturbations concentrate; removing those perturbations under purification would then produce a disproportionately large output shift, while LoRA and adapter modules operate in parameter subspaces less aligned with the adversarial direction. We leave this conjecture untested with the current experiments. Implications. In practice, a self-defense pipeline based on this signal should route purification scoring through EFFORT, switch to the multi-operator combination when input quality is degraded, and fall back to alternative signals below 𝑄70. A mechanistic account of why SVD-residual fine-tuning produces qualitatively different purification behaviour, when the other detectors share its backbone and several share its parameter-update fraction, remains open.

6.4. Limitations and Future Work Mechanism of EFFORT’s generalization. Only EFFORT clears the cross-source 0.85 AUROC threshold under raw input; the other five same-backbone detectors plateau at 0.40–0.78 and the ordering does not align with backbone-preservation fraction (LP > FullFT > LoRA). Why SVD-residual fine-tuning produces this qualitatively different response is not addressed by our data. Promising probes are the input-output Jacobian smoothness per detector, which singular directions each fine-tuning method modifies, and controlled detectors with varied SVD ranks. JPEG-𝑄70 cliff. No operator combination we tested recovers usable signal at 𝑄70 or below (crosssource AUROC 0.47–0.58); heavy compression appears to erase the high-frequency adversarial residual entirely. Frequency-domain operators, perceptual-loss purification, and calibration on quality-stratified validation sets are candidate remedies that remain to be tested. Single-detector dependency and unexploited layers. Routing all purification through EFFORT concentrates the failure mode: an adversarial input crafted against EFFORT’s gradient geometry could plausibly evade both the classifier and the purification signal. The output-only measurement that we used for cross-detector comparison also leaves intermediate-layer signals unexploited — the multi-op result on GenD-DINOv3’s 𝐿19 (Section 6.3.2) shows such layers can add discriminative information, and a per-detector layer-sweep search might recover usable signal on the five non-EFFORT detectors. Attack coverage and self-defense framing. Our cross-distribution validation covers eight image sources with PGD (𝜖 ∈ {2, 4, 8}/255), FGSM, and BIM targeting ForAda, SigLIP+DINOv2, and a joint multi-detector objective. Novel attack families (AutoAttack, transfer attacks from foundation-modelscale detectors, attacks against unseen backbones) are not covered, and the production result (0.982)

is a self-defense scenario in which our own pipeline generated the adversarials. The gap between production and cross-source AUROCs (0.98 vs. 0.81–0.89) is informative: detection degrades as the attack distribution moves away from the training distribution, and we expect realistic cross-attacker deployments to fall closer to the cross-source numbers.

7. Discussion 7.1. Cross-Track Interpretation Viewed independently, our generation, detection, and further-experiments tracks report separate outcomes; viewed together they trace a single underlying tension. Section 3 demonstrates that a moderately sophisticated adversarial pipeline can drive the fake-class probability of most off-the-shelf detectors below their decision threshold within an 𝜖 = 2/255 budget. Section 4 implicitly encounters the consequence: any classifier operating on raw pixels — regardless of its representational backbone — is exposed to this manipulation when adversarially post-processed inputs appear in the wild. Section 6 reframes the problem as a two-stage defence: rather than continuing to raise classification accuracy against arbitrarily adaptive adversaries, it asks whether the same detectors can serve as a second-order signal that flags the presence of adversarial post-processing, and identifies EFFORT under median-3 purification as a working instantiation. Read as a whole, the three tracks are not three independent contributions but three moves in one attacker–defender exchange, with the purification signal emerging as a natural architectural complement to — rather than a replacement for — the underlying classifier.

7.2. Strengths of the Proposed Approach Each track exhibits distinct strengths. On the generation side, the iterative composition of DiffJPEG-inloop, MI/DI/EoT transferability techniques, and two-stage warm-start achieved ≥ 95% evasion on 15 of 17 evaluated detectors (Table 1) and 0.9019 on the held-out organizer detector pool, demonstrating that the attack ceiling under 𝜖 = 2/255 lies well above what standard PGD alone reaches. On the detection side, the complementary specialists ensemble (SigLIP+DINOv2 × GenD-DINOv3) achieved 0.9939 baseline-deepfake and 0.8822 participant-deepfake accuracy — outperforming any single unified detector we surveyed (Table 2) — with the design empirically justified by demonstrating that no single unified detector covered both fake regimes simultaneously in our benchmark. On the purification side, three distinct contributions emerge from the investigation. Empirically, the fine-tuning ablation across six same-backbone detectors establishes fine-tuning strategy — rather than backbone identity or update fraction — as the variable that governs purification signal strength, with EFFORT’s SVD-residual decomposition yielding AUROC 0.81–0.98 across four adversarial source types. Theoretically, this finding refutes the simple backbone-preservation hypothesis: LoRA, which updates only ∼ 1% of parameters, produced the weakest signal, while EFFORT with substantially heavier backbone modification produced the strongest. Methodologically, the raw |Δlogit| signal requires no per-detector or per-distribution recalibration — unlike the multi-layer Mahalanobis ensemble of Section 6.2 that collapsed at deployment — making it operationally attractive as a first-pass adversarial screen.

7.3. Limitations Limitations similarly cut across tracks. On the generation side, the transferability ceiling to unknown participant architectures (0.5762 vs. 0.9019 on organizers) is a structural rather than tuning-level constraint, and face-crop evasion remains infeasible within the 𝜖 = 2/255 budget (Challenge 6, Section 3.4). On the detection side, our count-based 𝜏min optimisation against a Real:Fake-imbalanced calibration set introduced a compounding pair of errors (Section 4.5) that ROC-based per-detector threshold selection would have avoided. On the purification side, four open issues bound the result: the unresolved mechanism behind EFFORT’s cross-source specificity, the JPEG-𝑄70 signal cliff that erases the high-frequency adversarial residual, single-detector routing as a bottleneck against adaptive

attackers, and attack-family coverage restricted to PGD/FGSM/BIM. Detailed treatment of each appears in Section 6.4. Collectively, the generation and detection limitations point to concrete engineering remedies (broader transfer objectives, rate-based calibration), while the purification limitations invite deeper mechanistic study.

7.4. Lessons Learned Three methodological lessons emerge from the purification investigation and transfer to any future work in this space. First, the JPEG-quality confound is structural rather than incidental — it defeated all three adversarial-signal families in Section 6, motivating quality-stratified validation in any future deployment. Second, pilot-scale AUROC systematically overstates deployment-scale performance for any signal whose decision boundary depends on calibration-data statistics, with the multi-layer Mahalanobis ensemble’s drop from CV AUROC 1.0 to test-set 0% (Section 6.2) the most extreme instance we observed. Third, sigmoid saturation can conceal substantial raw-logit signals from probabilitydomain metrics; we initially missed a 36× linear-probe separation this way, and raw logit shifts must be checked before concluding that a signal has failed. Two additional strategic lessons emerge from the competition side: rate-based rather than count-based metrics should govern any threshold calibration against distribution-shifted test sets (Section 4.5), and held-out cross-architecture evaluation on the attack side is essential to estimate the transferability gap before submission (Section 3.6).

8. Conclusion We presented our approaches to the two official sub-tasks of the ImageCLEF 2026 Deepfake Detection and Generation Task together with a self-initiated follow-up investigation. Our generation pipeline achieved a final score of 0.4170; our detection ensemble achieved 0.6986. Beyond the competition, we investigated purification-based adversarial detection across six detectors sharing a CLIP ViT-L/14 backbone, identifying EFFORT under median-3 purification as the broadest cross-source generalizer (AUROC 0.81–0.98 across four adversarial source types) — a finding that refutes the simple backbonepreservation hypothesis. A mechanistic account of why SVD-residual fine-tuning produces qualitatively distinct purification behaviour, and remedies for the JPEG-𝑄70 signal cliff, remain open directions for future work.

Author contributions J. Kim conceived the methodology, designed and conducted all experiments (image generation pipeline, detection ensemble, and the purification-based adversarial detection investigation), and authored the manuscript. S. Kim provided cross-track discussion and manuscript review. J. Woo provided supervisory feedback on the manuscript.

Acknowledgments This research was supported by the Ministry of Science and ICT (MSIT), Korea and the Institute of Information & Communications Technology Planning & Evaluation (IITP) under AI University (2026-0-00032, 2026).

Declaration on Generative AI During the preparation of this work, the author(s) used Claude (Anthropic) in order to: Drafting content, Grammar and spelling check, Paraphrase and reword, Improve writing style, Peer review simulation. After using these tool(s)/service(s), the author(s) reviewed and edited the content as needed and take(s) full responsibility for the publication’s content.

References [1] D. Stanciu, A. Radu, R. Bolborici, M. Negru, A. Ene, V. Vasilescu, A.-A. Nicolae, B. Ionescu, L. Ştefan, M. Constantin, M. Dogariu, A. Andrei, Overview of ImageCLEF 2026 deepfake task: Multimodal detection and generation of deepfakes, in: CLEF 2026 Working Notes, CEUR Workshop Proceedings, CEUR-WS.org, Jena, Germany, 2026. [2] A. Yermakov, J. Cech, J. Matas, M. Fritz, Deepfake detection that generalizes across benchmarks, in: Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision (WACV), 2026, pp. 773–783. [3] Z. Yan, J. Wang, Z. Wang, P. Jin, K.-Y. Zhang, et al., Orthogonal subspace decomposition for generalizable AI-generated image detection, in: Proceedings of the International Conference on Machine Learning (ICML), 2025. Oral. [4] B. Ionescu, H. Müller, D. Stanciu, et al., Overview of ImageCLEF 2026: Multimodal challenges in medicine, science, agritech, and security, in: Proceedings of the Seventeenth International Conference of the CLEF Association (CLEF 2026), Lecture Notes in Computer Science, Springer, Jena, Germany, 2026. [5] L. Li, J. Bao, H. Yang, D. Chen, F. Wen, FaceShifter: Towards high fidelity and occlusion aware face swapping, arXiv preprint arXiv:1912.13457 (2019). [6] R. Chen, X. Chen, B. Ni, Y. Ge, SimSwap: An efficient framework for high fidelity face swapping, in: Proceedings of the 28th ACM International Conference on Multimedia (MM), 2020, pp. 2003–2011. [7] J. Thies, M. Zollhöfer, M. Stamminger, C. Theobalt, M. Nießner, Face2Face: Real-time face capture and reenactment of RGB videos, in: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2016, pp. 2387–2395. [8] J. Thies, M. Zollhöfer, M. Nießner, Deferred neural rendering: Image synthesis using neural textures, ACM Transactions on Graphics (TOG) 38 (2019) 1–12. [9] K. R. Prajwal, R. Mukhopadhyay, V. P. Namboodiri, C. V. Jawahar, A lip sync expert is all you need for speech to lip generation in the wild, in: Proceedings of the 28th ACM International Conference on Multimedia (MM), 2020, pp. 484–492. [10] J. Ho, A. Jain, P. Abbeel, Denoising diffusion probabilistic models, in: Advances in Neural Information Processing Systems (NeurIPS), 2020. [11] R. Rombach, A. Blattmann, D. Lorenz, P. Esser, B. Ommer, High-resolution image synthesis with latent diffusion models, in: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), 2022, pp. 10684–10695. [12] W. Peebles, S. Xie, Scalable diffusion models with transformers, in: Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV), 2023. [13] Black Forest Labs, FLUX.1-dev: An open-source diffusion transformer for image generation, https://huggingface.co/black-forest-labs/FLUX.1-dev, 2024. Diffusion Transformer model used for face generation. [14] L. Zhang, A. Rao, M. Agrawala, Adding conditional control to text-to-image diffusion models, in: Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV), 2023, pp. 3836–3847. [15] Shakker Labs, FLUX.1-dev ControlNet Union Pro 2.0, https://huggingface.co/Shakker-Labs/FLUX. 1-dev-ControlNet-Union-Pro-2.0, 2024. Pretrained on OpenPose input convention. [16] Z. Cao, G. Hidalgo, T. Simon, S.-E. Wei, Y. Sheikh, OpenPose: Realtime multi-person 2D pose estimation using part affinity fields, IEEE Transactions on Pattern Analysis and Machine Intelligence 43 (2019) 172–186. [17] H. Ye, J. Zhang, S. Liu, X. Han, W. Yang, IP-Adapter: Text compatible image prompt adapter for text-to-image diffusion models, arXiv preprint arXiv:2308.06721 (2023). [18] Z. Guo, Y. Wu, Z. Chen, L. Chen, Q. He, PuLID: Pure and lightning ID customization via contrastive alignment, arXiv preprint arXiv:2404.16022 (2024). [19] L. Li, J. Bao, T. Zhang, H. Yang, D. Chen, F. Wen, B. Guo, Face X-ray for more general face forgery detection, in: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern

Recognition (CVPR), 2020, pp. 5001–5010. [20] J. Frank, T. Eisenhofer, L. Schönherr, A. Fischer, D. Kolossa, T. Holz, Leveraging frequency analysis for deep fake image recognition, in: Proceedings of the International Conference on Machine Learning (ICML), 2020, pp. 3247–3258. [21] R. Durall, M. Keuper, J. Keuper, Watch your up-convolution: CNN-based generative deep neural networks are failing to reproduce spectral distributions, in: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), 2020, pp. 7890–7899. [22] K. Shiohara, T. Yamasaki, Detecting deepfakes with self-blended images, in: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), 2022, pp. 18720–18729. [23] Z. Yan, Y. Zhang, X. Yuan, S. Lyu, B. Wu, DeepfakeBench: A comprehensive benchmark of deepfake detection, in: Advances in Neural Information Processing Systems (NeurIPS), 2023, pp. 4534–4565. [24] Z. Yan, Y. Luo, S. Lyu, Q. Liu, B. Wu, Transcending forgery specificity with latent space augmentation for generalizable deepfake detection, in: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), 2024, pp. 8984–8994. [25] R. Chen, J. Xi, Z. Yan, K.-Y. Zhang, S. Wu, J. Xie, X. Chen, L. Xu, I. Guan, T. Yao, S. Ding, Dual data alignment makes AI-generated image detector easier generalizable, in: Advances in Neural Information Processing Systems (NeurIPS), 2025. [26] A. Haliassos, K. Vougioukas, S. Petridis, M. Pantic, Lips don’t lie: A generalisable and robust approach to face forgery detection, in: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), 2021, pp. 5039–5049. [27] Y. Zheng, J. Bao, D. Chen, M. Zeng, F. Wen, Exploring temporal coherence for more general video face forgery detection, in: Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV), 2021, pp. 15044–15054. [28] U. Ojha, Y. Li, Y. J. Lee, Towards universal fake image detectors that generalize across generative models, in: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), 2023, pp. 24480–24489. [29] A. Radford, J. W. Kim, C. Hallacy, et al., Learning transferable visual models from natural language supervision, in: Proceedings of the International Conference on Machine Learning (ICML), 2021, pp. 8748–8763. [30] X. Zhai, B. Mustafa, A. Kolesnikov, L. Beyer, Sigmoid loss for language image pre-training, in: Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV), 2023. [31] M. Oquab, et al., DINOv2: Learning robust visual features without supervision, arXiv preprint arXiv:2304.07193 (2023). [32] O. Siméoni, H. V. Vo, M. Seitzer, F. Baldassarre, M. Oquab, et al., DINOv3, arXiv preprint arXiv:2508.10104 (2025). [33] E. J. Hu, Y. Shen, P. Wallis, et al., LoRA: Low-rank adaptation of large language models, in: Proceedings of the International Conference on Learning Representations (ICLR), 2022. [34] C. Kong, H. Li, S. Wang, Enhancing general face forgery detection via vision transformer with low-rank adaptation, in: IEEE 6th International Conference on Multimedia Information Processing and Retrieval (MIPR), 2023, pp. 102–107. [35] X. Cui, Y. Li, A. Luo, J. Zhou, J. Dong, Forensics adapter: Adapting CLIP for generalizable face forgery detection, in: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), 2025, pp. 19207–19217. [36] R. Kundu, H. Xiong, V. Mohanty, A. Balachandran, A. K. Roy-Chowdhury, Towards a universal synthetic video detector: From face or background manipulations to fully AI-generated content, in: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), 2025. [37] Z. Huang, J. Li, H. Wen, T. Li, X. Yang, et al., Rethinking cross-generator image forgery detection through DINOv3, arXiv preprint arXiv:2511.22471 (2025). [38] I. J. Goodfellow, J. Shlens, C. Szegedy, Explaining and harnessing adversarial examples, in: Proceedings of the International Conference on Learning Representations (ICLR), 2015. [39] A. Kurakin, I. J. Goodfellow, S. Bengio, Adversarial examples in the physical world, in: Proceedings

of the International Conference on Learning Representations (ICLR) Workshop, 2017. [40] A. Madry, A. Makelov, L. Schmidt, D. Tsipras, A. Vladu, Towards deep learning models resistant to adversarial attacks, in: Proceedings of the International Conference on Learning Representations (ICLR), 2018. [41] N. Carlini, D. Wagner, Towards evaluating the robustness of neural networks, in: Proceedings of the IEEE Symposium on Security and Privacy (S&P), 2017, pp. 39–57. [42] F. Croce, M. Hein, Reliable evaluation of adversarial robustness with an ensemble of diverse parameter-free attacks, in: Proceedings of the International Conference on Machine Learning (ICML), 2020. [43] Y. Dong, F. Liao, T. Pang, H. Su, J. Zhu, X. Hu, J. Li, Boosting adversarial attacks with momentum, in: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), 2018, pp. 9185–9193. [44] C. Xie, Z. Zhang, Y. Zhou, S. Bai, J. Wang, Z. Ren, A. Yuille, Improving transferability of adversarial examples with input diversity, in: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), 2019, pp. 2730–2739. [45] A. Athalye, L. Engstrom, A. Ilyas, K. Kwok, Synthesizing robust adversarial examples, in: Proceedings of the International Conference on Machine Learning (ICML), 2018, pp. 284–293. [46] R. Shin, D. Song, JPEG-resistant adversarial images, in: NIPS 2017 Workshop on Machine Learning and Computer Security, 2017. Differentiable JPEG simulation. [47] W. Xu, D. Evans, Y. Qi, Feature squeezing: Detecting adversarial examples in deep neural networks, in: Proceedings of the Network and Distributed System Security Symposium (NDSS), 2018. [48] K. Lee, K. Lee, H. Lee, J. Shin, A simple unified framework for detecting out-of-distribution samples and adversarial attacks, in: Advances in Neural Information Processing Systems (NeurIPS), 2018. [49] X. Ma, B. Li, Y. Wang, S. M. Erfani, S. Wijewickrema, G. Schoenebeck, D. Song, M. E. Houle, J. Bailey, Characterizing adversarial subspaces using local intrinsic dimensionality, in: Proceedings of the International Conference on Learning Representations (ICLR), 2018. [50] A. Rössler, D. Cozzolino, L. Verdoliva, C. Riess, J. Thies, M. Nießner, FaceForensics++: Learning to detect manipulated facial images, in: Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV), 2019, pp. 1–11. [51] Y. Li, X. Yang, P. Sun, H. Qi, S. Lyu, Celeb-DF: A large-scale challenging dataset for deepfake forensics, in: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), 2020, pp. 3207–3216. [52] B. Dolhansky, R. Howes, B. Pflaum, N. Baram, C. C. Ferrer, The DeepFake detection challenge dataset, arXiv preprint arXiv:2006.07397 (2020). [53] Z. Yan, T. Yao, S. Chen, Y. Zhao, X. Fu, J. Zhu, D. Luo, C. Wang, S. Ding, Y. Wu, et al., DF40: Toward next-generation deepfake detection, in: Advances in Neural Information Processing Systems (NeurIPS), 2024, pp. 29387–29434. [54] M. Zhu, H. Chen, Q. Yan, X. Huang, G. Lin, W. Li, Z. Tu, H. Hu, J. Hu, Y. Wang, GenImage: A million-scale benchmark for detecting AI-generated image, in: Advances in Neural Information Processing Systems (NeurIPS), 2023. [55] Z. Wang, J. Bao, W. Zhou, W. Wang, H. Hu, H. Chen, H. Li, DIRE for diffusion-generated image detection, in: Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV), 2023, pp. 22445–22455. [56] H. Cheng, Y. Guo, T. Wang, L. Nie, M. Kankanhalli, Diffusion facial forgery detection, in: Proceedings of the 32nd ACM International Conference on Multimedia (MM), 2024. [57] J. Deng, J. Guo, X. An, Z. Zhu, S. Zafeiriou, InsightFace: An open source 2d and 3d deep face analysis toolbox, https://github.com/deepinsight/insightface, 2018–present. buffalo_s model used for identity embedding. [58] Bombek, ai-image-detector-siglip-dinov2: Siglip + dinov2 lora fine-tuned detector for ai-generated images, https://huggingface.co/Bombek1/ai-image-detector-siglip-dinov2, 2025. Hugging Face model repository. [59] Yermandy, GenD_DINOv3_L: Dinov3 vit-l face-manipulation detector, https://huggingface.co/

yermandy/GenD_DINOv3_L, 2025. Hugging Face model repository. [60] Yermandy, GenD_CLIP_L_14: Clip vit-l/14 face-manipulation detector, https://huggingface.co/ yermandy/GenD_CLIP_L_14, 2025. Hugging Face model repository.

(a) Pilot t-SNE: 400 pilot points (100 each from the four categories defined in Section 6.2.1) plus 500 random points from the ImageCLEF test set and our 100 submitted adversarials. Markers: clean fakes (blue squares), JPEG-Q80 reals (orange diamonds), adversarials (red stars).

(b) Full 24,404-image ImageCLEF test set overlaid on the same Mahalanobis 20-dimensional feature space, with the pilot category clusters retained as small markers. Test points are binned by the LR ensemble’s predicted adversarial probability 𝑝: others_low (𝑝 < 0.4, grey dots), others_mid (0.4 ≤ 𝑝 ≤ 0.7, orange circles), and others_high (𝑝 > 0.7, red squares). Figure 3: Section 6.2.2 — multi-layer Mahalanobis t-SNE on the pilot (a) and after refitting on the full test feature corpus (b).

Figure 4: Section 6.3.3 — EFFORT single median-3 AUROC across the JPEG quality range. The sharp transition between 𝑄70 and 𝑄80 (red shading) marks where adversarial residuals survive compression sufficiently to be discriminated; at 𝑄70 and below all sources collapse to random. At 𝑄95 the single-operator signal alone clears the broad-claim threshold of AUROC 0.85 (dashed line) on every source: production 0.94, cross AI-gen 0.81, cross face-swap 0.85, cross reenactment 0.85.

Record · ID 410964 · SHA-256 d9bbcf46be282fa8
Retrieved via Conceptio — every document is proof-bundled with source, license, and retrieval metadata.