May 2025· IEEE Transactions on Image Processing· Vol 35, pp. 9184-9197· 2 citations· 77 references
Computer ScienceMedicine
TL;DR
The Continual Diffusion Generation (CDG) is introduced, a structured pipeline that redefines how diffusion models are implemented under CL and enables systematic evaluation of GCF, and a principled training framework that fosters long-term retention of generative knowledge and stable integration of new capabilities.
Abstract
While diffusion-based models have shown remarkable generative capabilities in static settings, their extension to continual learning (CL) scenarios remains fundamentally constrained by Generative Catastrophic Forgetting (GCF). We observe that even with a rehearsal buffer, new generative skills often overwrite previous ones, degrading performance on earlier tasks. Although some initial efforts have explored this space, most rely on heuristics borrowed from continual classification methods or use trained diffusion models as ad hoc replay generators, lacking a principled, unified solution to mitigating GCF and often conducting experiments under fragmented and inconsistent settings. To address this gap, we introduce the Continual Diffusion Generation (CDG), a structured pipeline that redefines how diffusion models are implemented under CL and enables systematic evaluation of GCF. Beyond the empirical pipeline, we propose the first theoretical foundation for CDG, grounded in a cross-task analysis of diffusion-specific generative dynamics. Our theoretical investigation identifies three fundamental consistency principles essential for preserving knowledge in the rehearsal buffer over time: inter-task knowledge consistency, unconditional knowledge consistency, and prior knowledge consistency. Motivated by these insights, we further propose Continual Consistency Diffusion (CCD), a principled training framework that enforces these consistency objectives via hierarchical loss functions: <inline-formula> <tex-math notation="LaTeX">${\mathcal {L}}_{IKC}$ </tex-math></inline-formula>, <inline-formula> <tex-math notation="LaTeX">${\mathcal {L}}_{UKC}$ </tex-math></inline-formula>, and <inline-formula> <tex-math notation="LaTeX">${\mathcal {L}}_{PKC}$ </tex-math></inline-formula>. This framework fosters long-term retention of generative knowledge and stable integration of new capabilities. Experiments show that CCD achieves state-of-the-art continual performance across various benchmarks, especially improving continual generative metrics in overlapping-task scenarios.
CAST (Causal Advantage-Structured Training), an RL fine-tuning method for pretrained DMs, which identifies the denoising step at which each model fixes the objects and their spatial arrangement in the image and uses that timing to set the SDE window and uses them to spatially weight the SDE policy objective.
Modern conditional generative models face significant challenges when learning complex covariate dependencies. While sufficient dimension reduction (SDR) provides a principled approach to compress these dependencies, traditional SDR frameworks were not formulated for conditional generation. To bridge this gap, we propo...
In many industrial applications, 1) tabular data is scarce and imbalanced and thus requires synthetic expansion; 2) input distributions drift between training and deployment (covariate shift); 3) validation sets often diverge from unseen test environments; or 4) standard generative models simply mimic outdated source d...
This work decomposes the expected generalization gap into a replay-induced representation drift and an optimization-dependence term, the latter further resolved into stability, plasticity, interaction, and residual-coupling components and develops a layer-wise information-theoretic framework that separates these effect...
Tie-Liang Gong, Zhong-Bo Zhang, Wen Wen et al.· 0 citations
A continual data unlearning framework that uses completed deletion transitions as directional references to regularize future updates and achieves a better balance between deletion persistence and generative utility than existing unlearning baselines as requests accumulate.
Sunbeom Jeong, Sehwan Kim, Sang-Woo Hong et al.· 0 citations
Experiments show that FiUni can effectively infer latent batch-level task affiliations and achieve competitive performance against advanced task-aware CL methods with fewer trainable parameters.
Dezheng Han, Anlan Zhang, Zhiwu Zhu et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.