Organizations: School of Computer Science, Wuhan University · School of Integrated Circuits, Peking University · School of Information, Huazhong Agricultural University · Cyberspace Institute of Advanced Technology, Guangzhou University
Standard supervised training for deepfake detection treats all samples with uniform importance, which can be suboptimal for learning robust and generalizable features. In this work, we propose a novel Tutor-Student Reinforcement Learning (TSRL) framework to dynamically optimize the training curriculum. Our method models the training process as a Markov Decision Process where a Tutor'' agent learns to guide a Student'' (the deepfake detector). The Tutor, implemented as a Proximal Policy Optimization (PPO) agent, observes a rich state representation for each training sample, encapsulating not only its visual features but also its historical learning dynamics, such as EMA loss and forgetting counts. Based on this state, the Tutor takes an action by assigning a continuous weight (0-1) to the sample's loss, thereby dynamically re-weighting the training batch. The Tutor is rewarded based on the Student's immediate performance change, specifically rewarding transitions from incorrect to correct predictions. This strategy encourages the Tutor to learn a curriculum that prioritizes high-value samples, such as hard-but-learnable examples, leading to a more efficient and effective training process. We demonstrate that this adaptive curriculum improves the Student's generalization capabilities against unseen manipulation techniques compared to traditional training methods. Code is available at https://github.com/wannac1/TSRL.
Figures & tables
Figure 1: Comparison of hard sample (Historical EMA Loss > 0.7) reduction efficiency during training. Our TSRL framework (red) demonstrates a significantly faster convergence in resolving difficult samples compared to the traditional baseline (blue), as highlighted by the logarithmic scale.
Figure 2: A simplified overview of our proposed Tutor-Student Reinforcement Learning (TSRL) framework. The Tutor (RL Agent) learns a policy to dynamically assign weights to training samples (e.g., up-weighting “Hard” samples, down-weighting “Easy” samples) to optimize the Student (Detector) for generalization.
Figure 3: The Tutor-Student Reinforcement Learning (TSRL) Framework
Methods
Cross-dataset Evaluation
Cross-method Evaluation
CDF-v2
DFD
DFDC
DFDCP
Avg.
UniFace
BleFace
MobSwap
e4s
FaceDan
FSGAN
InSwap
SimSwap
Avg.
F3Net [ 23 ]
0.789
0.844
0.718
0.749
0.775
0.809
0.808
0.867
0.494
0.717
0.845
0.757
0.674
0.746
SPSL [ 18 ]
0.799
0.871
0.724
0.770
0.791
0.747
0.748
0.885
0.514
0.666
0.812
0.643
0.665
0.710
SRM [ 19 ]
0.840
0.885
0.695
0.728
0.787
0.749
0.704
0.779
0.704
0.659
0.772
0.793
0.694
0.732
RECCE [ 4 ]
0.823
0.891
0.696
0.734
0.786
0.898
0.832
0.925
0.683
0.848
0.949
0.848
0.768
0.844
SLADD [ 5 ]
0.837
0.904
0.772
0.756
0.817
0.878
0.882
0.954
0.765
0.825
0.943
0.879
0.794
0.865
Table 1: Cross-dataset and Cross-method Evaluation. All models are trained on FF++ (c23) [ 25 ] and evaluated on the other datasets/fake data. Results from models trained with our TSRL are highlighted. † denotes models retrained by us; results for all other methods are sourced from [ 35 , 7 , 38 ] .
Metric
Method
UniFace
BleFace
MobSwap
e4s
FaceDan
FSGAN
InSwap
SimSwap
Avg.
CORE [ 22 ]
0.855
0.843
0.936
0.658
0.741
0.942
0.834
0.700
0.814
AUC
CORE + CL
0.862
0.821
0.913
0.675
0.774
0.911
0.851
0.732
0.817
CORE + TSRL
0.926
0.867
0.930
0.537
0.855
0.923
0.941
0.858
0.855
CORE [ 22 ]
0.725
0.713
0.825
0.600
0.648
0.837
0.718
0.580
0.706
ACC
CORE + CL
0.767
0.692
0.811
0.631
0.684
0.807
0.734
0.654
0.723
CORE + TSRL
0.815
0.752
0.844
0.562
0.764
0.817
0.833
0.750
0.767
Table 2: Ablation study on the CORE model. We compare the baseline CORE with its variants: CORE + CL and our proposed CORE + TSRL. All models are trained on FF++ (c23) and evaluated on the DF40 dataset. We report Area Under the Curve (AUC), Accuracy (ACC), and Equal Error Rate (EER) metrics.
Figure 4: Visual comparison of the average AUC (on DF40) for the standard CORE baseline, CORE with a static Curriculum Learning (CL) heuristic, and the full CORE + TSRL framework. Our dynamic TSRL approach shows a significant performance gain over both other methods.
Figure 5: UMAP visualization of feature spaces. We present two comparative visualizations. (a) Fake vs Real: Visualization by class (Green: Real, Red: Fake). The Baseline model (left) exhibits a single manifold with heavy class overlap, indicating a confused feature space. In contrast, our TSRL framework (right) learns a perfectly disentangled representation, cleanly separating all Real samples (green arc) from all Fake samples (red arc and cloud). (b) Fake Only: Visualization of only Fake samples, colored by difficulty (Blue/Cyan: Easy, Purple/Magenta: Hard). The Baseline (left) shows a single, continuous arc with easy (blue/cyan) samples mixed throughout. Our TSRL model (right) again demonstrates superior structure, partitioning the Fake samples into two distinct clusters: a separate cloud of “Easy Fakes” (blue/cyan) and a primary arc of “Hard Fakes” (purple).
The rapid advancement of deepfake generation techniques poses significant threats to public safety and causes societal harm through the creation of highly realistic synthetic facial media. While existing detection methods demonstrate limitations in generalizing to emerging forgery patterns, this paper presents Deepfake Forensics Adapter (DFA), a novel dual-stream framework that synergizes vision-language foundation models with targeted forensics analysis. Our approach integrates a pre-trained CLIP model with three core components to achieve specialized deepfake detection by leveraging the powerful general capabilities of CLIP without changing CLIP parameters: 1) A Global Feature Adapter is used to identify global inconsistencies in image content that may indicate forgery, 2) A Local Anomaly Stream enhances the model's ability to perceive local facial forgery cues by explicitly leveraging facial structure priors, and 3) An Interactive Fusion Classifier promotes deep interaction and fusion between global and local features using a transformer encoder. Extensive evaluations of frame-level and video-level benchmarks demonstrate the superior generalization capabilities of DFA, particularly achieving state-of-the-art performance in the challenging DFDC dataset with frame-level AUC/EER of 0.816/0.256 and video-level AUC/EER of 0.836/0.251, representing a 4.8% video AUC improvement over previous methods. Our framework not only demonstrates state-of-the-art performance, but also points out a feasible and effective direction for developing a robust deepfake detection system with enhanced generalization capabilities against the evolving deepfake threats. Our code is available at https://github.com/Liao330/DFA.git
Jianfeng Liao, Yichen Wei, Raymond Chan Ching Bon +3
Shenzhen Technology University, Guangdong, China · Singapore Institute of Technology, Singapore, Singapore · The University of Hong Kong, Hong Kong, China +1
Current deepfake detection models achieve state-of-the-art performance on pristine academic datasets but suffer severe spatial attention drift under real-world compound degradations, such as blurring and severe lossy compression. To address this vulnerability, we propose a foundation-driven forensic framework that integrates an extreme compound degradation engine with a structurally constrained, multi-stream architecture. During training, our degradation pipeline systematically destroys high-frequency artifacts, optimizing the DINOv2-Giant backbone to extract invariant geometric and semantic priors. We then process images through three specialized pathways: a Global Texture stream, a Localized Facial stream, and a Hybrid Semantic Fusion stream incorporating CLIP. Through analyzing spatial attribution via Score-CAM and feature stability using Cosine Similarity, we quantitatively demonstrate that these streams extract non-redundant, complementary feature representations and stabilize attention entropy. By aggregating these predictions via a calibrated, discretized voting mechanism, our ensemble successfully suppresses background attention drift while acting as a robust geometric anchor. Our approach yields highly stable zero-shot generalization, achieving Fourth Place in the NTIRE 2026 Robust Deepfake Detection Challenge at CVPR. Code is available at https://github.com/khoalephanminh/ntire26-deepfake-challenge.
Minh-Khoa Le-Phan, Minh-Hoang Le, Trong-Le Do +1
University of Science, VNU-HCM, Ho Chi Minh City, Vietnam · Vietnam National University, Ho Chi Minh City, Vietnam
Continual audio deepfake detection requires learning newly emerging deepfake methods while retaining discrimination of previously encountered speech. Existing dataset-incremental evaluation changes both real-speech domains and deepfake mechanisms, making their effects difficult to distinguish. We construct five task organizations over identical training, development, and evaluation pools to study these factors under a controlled sample budget. Our proposed Real-Anchored Mechanism-Incremental (RAMI) protocol reflects the practical setting in which available real speech provides a recurring mixed-domain reference while new deepfake mechanisms arrive incrementally. We further propose RF-Prompt, an asymmetric continual prompt-learning method that preserves reusable real-speech knowledge through a shared real prompt and expands mechanism-specific knowledge through inherited fake experts with orthogonal residuals. Input-adaptive soft fusion combines the accumulated experts into a fixed number of injected tokens without requiring task identity at inference. On RAMI, RF-Prompt achieves 10.110% average EER and 10.370% pooled EER, outperforming all evaluated continual-learning baselines. Across the five controlled protocols, RAMI yields the lowest common-average and pooled EER. Component ablations, limited-data experiments, and cross-backbone evaluations further validate the proposed design.
Yuankun Xie, Xiaoxuan Guo, Xiaopeng Wang +3
The Hong Kong Polytechnic University, Hong Kong SAR, China · Communication University of China, Beijing, China · Beijing Institute of Technology, Beijing, China