mlsanityData to 14 Oct 2026

Unifying Locality of KANs and Feature Drift Compensation Projection for Data-free Replay based Continual Face Forgery Detection

arXiv 2508.03189 ↗First posted 5 Aug 2025cs.CVcited by 1

Not on the map. Why?

Abstract (arXiv)

The rapid advancements in face forgery techniques necessitate that detectors continuously adapt to new forgery methods, thus situating face forgery detection within a continual learning paradigm. However, when detectors learn new forgery types, their performance on previous types often degrades rapidly, a phenomenon known as catastrophic forgetting. Kolmogorov-Arnold Networks (KANs) utilize locally plastic splines as their activation functions, enabling them to learn new tasks by modifying only local regions of the functions while leaving other areas unaffected. Therefore, they are naturally suitable for addressing catastrophic forgetting. However, KANs have two significant limitations: 1) the splines are ineffective for modeling high-dimensional images, while alternative activation functions that are suitable for images lack the essential property of locality; 2) in continual learning, when features from different domains overlap, the mapping of different domains to distinct curve regions always collapses due to repeated modifications of the same regions. In this paper, we propose a KAN-based Continual Face Forgery Detection (KAN-CFD) framework, which includes a Domain-Group KAN Detector (DG-KD) and a data-free replay Feature Separation strategy via KAN Drift Compensation Projection (FS-KDCP). DG-KD enables KANs to fit high-dimensional image inputs while preserving locality and local plasticity. FS-KDCP avoids the overlap of the KAN input spaces without using data from prior tasks. Experimental results demonstrate that the proposed method achieves superior performance while notably reducing forgetting.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 20 of its 34 references that are in the map. First posted on arXiv 5 Aug 2025.

Builds on

20 of 34 references.

References · 20

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2018UMAP: Uniform Manifold Approximation and Projection for Dimension Reductioncited by 2,898
  3. 2016Learning without Forgettingcited by 2,496
  4. 2017Continual Learning with Deep Generative Replaycited by 1,158
  5. 2019FaceForensics++: Learning to Detect Manipulated Facial Imagescited by 1,101
  6. 2020Face2Face: Real-time Face Capture and Reenactment of RGB Videoscited by 632
  7. 2019Celeb-DF: A Large-scale Challenging Dataset for DeepFake Forensicscited by 575
  8. 2022Detecting Deepfakes with Self-Blended Imagescited by 338
  9. 2020Semantic Drift Compensation for Class-Incremental Learningcited by 241
  10. 2023DeepfakeBench: A Comprehensive Benchmark of Deepfake Detectioncited by 166
  11. 2024LAA-Net: Localized Artifact Attention Network for Quality-Agnostic and Generalizable Deepfake Detectioncited by 89
  12. 2024Generalizing Deepfake Video Detection with Plug-and-Play: Video-Level Blending and Spatiotemporal Adapter Tuningcited by 59
8 more
  1. 2022SeeABLE: Soft Discrepancies and Bounded Contrastive Learning for Exposing Deepfakescited by 49
  2. 2021CoReD: Generalizing Fake Media Detection with Continual Representation using Distillationcited by 37
  3. 2024Resurrecting Old Classes with New Data for Exemplar-Free Continual Learningcited by 33
  4. 2024Exemplar-free Continual Representation Learning via Learnable Drift Compensationcited by 31
  5. 2023Continual Face Forgery Detection via Historical Distribution Preservingcited by 23
  6. 2023DFIL: Deepfake Incremental Learning by Exploiting Domain-invariant Forgery Cluescited by 23
  7. 2024CF-KAN: Kolmogorov-Arnold Network-based Collaborative Filtering to Mitigate Catastrophic Forgetting in Recommender Systemscited by 8
  8. 2025KAC: Kolmogorov-Arnold Classifier for Continual Learningcited by 4

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.