paper-with-me

홈 › Papers

Direct Discrepancy Replay: Distribution-Discrepancy Condensation and Manifold-Consistent Replay for Continual Face Forgery Detection

2026-04-14 · Tianshuo Zhang, Haoyuan Zhang, Siran Peng, Weisong Zhao, Xiangyu Zhu, Zhen Lei arxiv

Continual face forgery detection (CFFD) requires detectors to learn emerging forgery paradigms without forgetting previously seen manipulations. Existing CFFD methods commonly rely on replaying a small amount of past data to mitigate forgetting. Such replay is typically implemented either by storing a few historical samples or by synthesizing pseudo-forgeries from detector-dependent perturbations. Under strict memory budgets, the former cannot adequately cover diverse forgery cues and may expose facial identities, while the latter remains strongly tied to past decision boundaries. We argue that the core role of replay in CFFD is to reinstate the distributions of previous forgery tasks during subsequent training. To this end, we directly condense the discrepancy between real and fake distributions and leverage real faces from the current stage to perform distribution-level replay. Specifically, we introduce Distribution-Discrepancy Condensation (DDC), which models the real-to-fake discrepancy via a surrogate factorization in characteristic-function space and condenses it into a tiny bank of distribution discrepancy maps. We further propose Manifold-Consistent Replay (MCR), which synthesizes replay samples through variance-preserving composition of these maps with current-stage real faces, yielding samples that reflect previous-task forgery cues while remaining compatible with current real-face statistics. Operating under an extremely small memory budget and without directly storing raw historical face images, our framework consistently outperforms prior CFFD baselines and significantly mitigates catastrophic forgetting. Replay-level privacy analysis further suggests reduced identity leakage risk relative to selection-based replay.

📄 PDF Abstract BibTeX arXiv:2604.12941

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

M3D: Dataset Condensation by Minimizing Maximum Mean Discrepancy

2023-12-26 · Hansong Zhang, Shikun Li, Pengju Wang, Dan Zeng 외

Training state-of-the-art (SOTA) deep models often requires extensive data, resulting in substantial training and storage costs. To address these challenges, dataset condensation has been developed to learn a small synth…

Dataset Condensation

A Discrepancy-Based Perspective on Dataset Condensation

2025-09-12 · Tong Chen, Raghavendra Selvan arxiv

Given a dataset of finitely many elements $\mathcal{T} = \{\mathbf{x}_i\}_{i = 1}^N$, the goal of dataset condensation (DC) is to construct a synthetic dataset $\mathcal{S} = \{\tilde{\mathbf{x}}_j\}_{j = 1}^M$ which is …

A practical algorithm to calculate Cap Discrepancy

2020-10-20 · Milad Bakhshizadeh, Ali Kamalinejad, Mina Latifi

Uniform distribution of the points has been of interest to researchers for a long time and has applications in different areas of Mathematics and Computer Science. One of the well-known measures to evaluate the uniformit…

Dataset Condensation with Latent Quantile Matching

2024-06-14 · Wei Wei, Tom De Schepper, Kevin Mets

Dataset condensation (DC) methods aim to learn a smaller synthesized dataset with informative data records to accelerate the training of machine learning models. Current distribution matching (DM) based DC methods learn …

Dataset CondensationGraph Learning

Direct Segmentation without Logits Optimization for Training-Free Open-Vocabulary Semantic Segmentation

2026-04-09 · Jiahao Li, Yang Lu, Yachao Zhang, Fangyong Wang 외 arxiv

Open-vocabulary semantic segmentation (OVSS) aims to segment arbitrary category regions in images using open-vocabulary prompts, necessitating that existing methods possess pixel-level vision-language alignment capabilit…

Semantic Segmentation