- Rating
- 2
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper studies continual learning for audio deepfake detection, aiming to learn emerging deepfake methods without forgetting previously acquired knowledge. It makes two main contributions:
RAMI Evaluation Protocol: Organizes incremental tasks by four generation mechanisms while maintaining a consistent mixture of real speech sources, addressing the confounding of real speech domains and fake generation methods in dataset-based protocols. Five protocols are constructed for comparison. RF-Prompt: Combines a shared Real Prompt with expanding Fake Prompt Experts. It uses cosine regularization to preserve shared knowledge, expert inheritance and residual orthogonality to learn new knowledge, and Soft MoE to adaptively fuse experts. The authors evaluate RF-Prompt against several continual learning baselines, with additional ablation, limited-data, and cross-backbone experiments. Results show improved detection performance and reduced forgetting, and ablations support the effectiveness of the key components.
Critical strengths
Meaningful and practical problem setting: The paper addresses an important challenge in audio deepfake detection: adapting to emerging generation methods while retaining previously learned knowledge. The proposed RAMI protocol provides a more targeted evaluation setting than conventional dataset-based task organizations.
Well-motivated and coherent method design: RF-Prompt combines shared knowledge preservation with expandable fake experts. Historical expert inheritance and residual orthogonality encourage knowledge transfer and complementary learning, while adaptive fusion enables inference without task identity.
Comprehensive experimental evaluation: The paper compares against a range of continual learning baselines and includes ablation studies, limited-data experiments, and cross-backbone evaluations. The results demonstrate competitive detection performance and reduced forgetting, with ablations supporting the effectiveness of key components.
Critical weaknesses
Confounding between generation mechanisms and dataset sources: Although RAMI aims to isolate different generation mechanisms, the training samples for M1, M3, and M4 each come from a single dataset. This makes it difficult to distinguish mechanism-specific knowledge from dataset-specific characteristics.
Limited evaluation of long-term continual learning: RAMI groups generation methods into only four broad mechanisms, making it unclear how newly emerging generators within existing mechanisms can be incorporated as additional tasks. Moreover, all experiments use a single random seed, leaving the stability of the reported improvements uncertain.
Insufficient validation of key design choices: While the ablation studies support the effectiveness of the main components, some design choices lack direct evidence. For example, both Real and Fake Prompts are trained on both classes without explicit class-specific constraints, making it unclear whether the Real Prompt specifically preserves real-speech knowledge.
Questions for authors
See weakness
Response to Reviewer DcSR
Thank you for recognizing the practical motivation and coherent design. Following your suggestions, we added the experiments below.
W1. Mechanism/source confounding
We added separate budget and source controls. Primary epochs are complete passes; the new experiments explicitly match optimization settings.
Matched-budget control: 50 epochs/task, 200 updates/epoch, and 16 real plus 16 fake utterances/batch. All organizations are evaluated on the same 40,000 utterances (Table 4, seed 2026).
Same-source control: identical AT-ADD M2/M4 subsets and real samples; 50 epochs/task, 75 updates/epoch, and 16+16 utterances/batch for both streams (Table 16, seed 2026).
The first control matches budget and batch balance; the second holds dataset identity fixed. Together they support mechanism organization. Appendix I gives settings, and Appendix A documents the full mechanism/source composition.
W2. New generators within a mechanism and stability
M1-M4 are families, not a maximum of four updates. Following your suggestion, we added generator-incremental streams using all original samples and 40 training generators. The 10-task order is M1a/M2a/M3a/M4a/M1b/M2b/M3b/M4b/M2c/M3c; the 20-task stream splits each batch into two.
Seed 2026; Table 5:
These experiments directly test later generators from recurring mechanism families.
We also added two seeds per method. Table 1 now reports seeds 2026/2027/2028. RF-Prompt achieves Avg EER 10.118 +/- 0.058% and Pool EER 10.402 +/- 0.076% (mean +/- sample SD), the lowest mean aggregate EER among continual methods. Supplementary diagnostics remain seed 2026.
W3. Why associate the shared prompt with real knowledge?
The sharing choice follows the practical update scenario. We have real speech from known domains and finite observed deepfake data, while new methods continually emerge. A protected shared prompt reuses real reference knowledge; fake experts expand for new patterns.
Related motivation comes from ASDG (real aggregation), OC-Softmax (compact real representations), and LSR/LSA (one real/multiple fake prototypes), already cited in Section 2.
Both prompt types receive binary supervision and participate in every prediction. Their names denote intended roles; real-reference knowledge need not be learned with real-only classification updates.
Added structure/plasticity controls: Table 12 favors shared-real/expanding-fake over its reverse and symmetric alternatives. Freezing the shared branch is also worse than protected adaptation. The table below includes the original real-anchoring ablation as a reference (seed 2026):
Added class-conditioned sensitivity experiment: after zeroing the shared prompt, the mean absolute change in predicted real probability is:
The branch has a stronger influence on real-example scores. These are absolute probability changes on a 0-1 scale, not EER improvements (Table 21). The training controls establish detection benefits; Appendix K.2 characterizes score sensitivity.