REVIEW 2 cited by
Exploring Continual Learning of Diffusion Models
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
Diffusion models have achieved remarkable success in generating high-quality images thanks to their novel training procedures applied to unprecedented amounts of data. However, training a diffusion model from scratch is computationally expensive. This highlights the need to investigate the possibility of training these models iteratively, reusing computation while the data distribution changes. In this study, we take the first step in this direction and evaluate the continual learning (CL) properties of diffusion models. We begin by benchmarking the most common CL methods applied to Denoising Diffusion Probabilistic Models (DDPMs), where we note the strong performance of the experience replay with the reduced rehearsal coefficient. Furthermore, we provide insights into the dynamics of forgetting, which exhibit diverse behavior across diffusion timesteps. We also uncover certain pitfalls of using the bits-per-dimension metric for evaluating CL.
Forward citations
Cited by 2 Pith papers
-
Stable Continual Reinforcement Learning via Diffusion-based Trajectory Replay
DISTR combines a task-conditioned diffusion model that generates whole high-return trajectories with behavior-cloning replay, and reports higher average success than several baselines on Continual World.
-
Towards General Purpose Robots at Scale: Lifelong Learning and Learning to Use Memory
A thesis presenting t-DGR for continual learning and AttentionTuner for learning memory use from demonstrations, with benchmark results that are partly state-of-the-art and partly based on prior papers by the same authors.
Discussion (0). Continue with ORCID to comment.