- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 1
Read review
Paper summary
This paper studies continual image editing, where a diffusion-based editing model sequentially learns new editing skills while retaining earlier ones. The proposed ACE-LoRA penalizes alignment between the current LoRA-B and an online interference vector, defined as the gradient of the current-task loss with respect to historical LoRA-B. It compresses historical LoRAs into a fixed-rank pair via truncated SVD and adopts a two-stage schedule that first trains without constraints and then refines with orthogonality and norm regularizers. The authors also introduce CIE-Bench, which has six editing tasks evaluated by a task-specific MLLM judge, and report gains over merging, architecture-based and regularization-based baselines.
Critical strengths
- Timely problem and a useful benchmark. Continual image editing is largely unexplored in continual learning. CIE-Bench spans physical perception, entity manipulation and cognitive reasoning, with task-specific evaluation prompts and a human-agreement study, making it a potentially reusable testbed.
Critical weaknesses
- The core mechanism is conceptually disconnected from forgetting. Forgetting means an increase in old-task loss, yet Eq. (7) measures the sensitivity of the current-task loss to historical parameters, and no old-task loss or gradient enters the procedure. Moreover, the penalty is a single scalar per sample summed over the rank dimension, so it can vanish even when individual columns are aligned with the interference vector.
- The experiments have several issues. Hyperparameters and task order appear to be selected on the test set, as the defaults are the best entries in Tab. 11/12 and no validation split is described. λo is further tuned per task. Key ablations such as λo = 0 and λn = 0 are missing. The introduction claims to preserve the base model's original abilities, but there is no capability-retention evaluation on general editing benchmarks such as GEdit or ImgEdit.
- Reported results do not match the stated definition. The paper describes BWT as the average degree of forgetting. Computing BWT = mean(Last) − mean(Imd.) on Tab. 5 exactly reproduces the reported values for Random and Summation, but gives −0.3369 for ACE-LoRA instead of the reported −0.1702. This raises concerns about the reliability of the reported results.
Questions for authors
- Please give the precise definition of BWT. Under mean(Last) − mean(Imd.), ACE-LoRA should be −0.3369, while Random, Summation and the Static row in Tab. 1 are all exactly reproduced by this formula. How was −0.1702 obtained?
- Please report ablations with λo = 0 and λn = 0 to separate the contributions of the interference vector, the norm term and the training schedule.
- Why does orthogonality to an interference vector derived from the current-task loss protect old tasks? Eq. (8) effectively constrains ⟨∇_W ℓ_n, B_n A_i⟩, and Eq. (10) constrains ⟨∇_W ℓ_n, B_n A_his⟩, rather than the actual update B_n A_n. Why does the derivation use the squared form while the implementation uses the absolute value?
- How were the hyperparameters and task order selected, and was a held-out validation split used?
- How well is the base model's general editing ability on GEdit or ImgEdit retained after the full task sequence?