Consistency Models (CMs) have made significant progress in accelerating the generation of diffusion models. However, their application to high-resolution, text-conditioned image generation in the latent space remains unsatisfactory. In this paper, we identify three key flaws in the current design of Latent Consistency Models (LCMs). We investigate the reasons behind these limitations and propose Phased Consistency Models (PCMs), which generalize the design space and address the identified limitations. Our evaluations demonstrate that PCMs outperform LCMs across 1--16 step generation settings. While PCMs are specifically designed for multi-step refinement, they achieve comparable 1-step generation results to previously state-of-the-art specifically designed 1-step methods. Furthermore, we show the methodology of PCMs is versatile and applicable to video generation, enabling us to train the state-of-the-art few-step text-to-video generator. Our code is available at https://github.com/G-U-N/Phased-Consistency-Model.
Paper
Similar papers
Peer review
Summary
The paper introduces the Phased Consistency Model (PCM), which enhances stability and speed in high-resolution image and video generation by improving the design of consistency (trajectory) models. The main improvement of PCM is a new Parameterization of consistency function and the phase trajectory. There is also a new method to improve the utilization of CFG. Experimental results show that PCM performs better across 1 to 16-step generation settings.
Strengths
1. The architecture of the method is straight-forward and clear. 2. The insights gained from observing the multi-step process are commendable. 3. The results are solid and demonstrate the effectiveness of the proposed approach. 4. Detailed proofs have been provided for all the hypotheses.
Weaknesses
Despite the strong experimental results, I still have many reservations about this work. The primary concern stems from the inaccurate description and the incomplete experiments. Here's my MAJOR concerns: 1. The author also asserts that the findings are derived based on CTM. However, the author does not provide any comparisons with the official CTM, e.g., ImageNet or CIFAR. 2. Another concern is that the author claims to have compared the results with SD15 CTM and SDXL CTM. However, I could not find any related descriptions or implementations in the official CTM publications or GitHub repository. The authors claimed such models are implemented by theirs but there's no detail. Specifically, the author stated they *additionally learned a timestep embedding to indicate the target timestep* but without any details and reasons. 3. A further question about implement detail: 1-step PCM and multi-step PCM are trained separately? If so, only the range of training parameters different? Are there any further differences? 4. The author appears to misunderstand the concept of the negative prompt, e.g. Controllability in the LCM drawbacks. Furthermore, the provided results do not demonstrate that PCM can mitigate the impact of the negative prompt. 5. The author does not clearly explain the differences between CTM and PCM, especially without a clear description of implementation of CTM in SD15 and SDXL. Based on CTM, the novelty of this work on my side is 4-fold: a re-parameterization method, an improved GAN structure, an edged timestep and a CFG guidance method. In conclusion, the main problem is the authors **did not** conduct an objective comparison and the work lacks sufficient quantitative ablation analysis with official CTM on ImageNet or CIFAR. From the existing data, it is difficult for me to determine whether the proposed solutions by the authors are truly effective. Here's some minor questions: 1. The author relied heavily on FID and CLIP metrics for comparison, but these have known limitations, particularly in large-scale text-to-image applications. More contemporary metrics, such as HPS or PICK-SCORE, should be used to demonstrate the effectiveness. 2. Additionally, I suggest author to use recall to demonstrate the diversity of the model. The introduction of additional GAN modules can lead to a lack of diversity in the model.
Questions
please see Weaknesses
Rating
3
Confidence
5
Soundness
2
Presentation
2
Contribution
1
Limitations
The author has already discussed limitations.
Thank you for your response!
Thank you for your response! Could you specify `which parts are not resolved properly`? We are willing for further reply and discussion. For the data, we already showed that our model without applying any adversarial loss consistently surpassing the CTM w/ GAN on CIFAR through multistep refinement. Additionally, we show that our model trained with only 3.5% training budget of the official CM achieved even superior performance.
We are willing for further discussion!
Besides, when comparing each baseline for fair, the principle design of CTM without GAN loss is even inferior to naive CM. The core difference of CM, CTM and PCM are listed as the following table. | Methods | timesteps sampled | adjacent timesteps | target timesteps | | ------- | ------------------------------------------------------ | ------------------ | --------------------------------------------------- | | CM | $t_{n+1}\sim\textrm{Uniform}(\{t_1, t_2, \dots\})$ | $t_{n}$ | $s:=t_1:=0$ | | CTM | $t_{n+1}\sim\textrm{Uniform}(\{t_1, t_2, \dots\})$ | $t_{n}$ | $s\sim\textrm{Uniform}(\{t_1, t_2, \dots, t_{n}\})$ | | PCM | $t_{n+1}\sim\textrm{Uniform}(\{s_m, \dots, s_{m+1}\})$ | $t_{n}$ | $s := s_{m}$ | In our paper, we have provided `thorough analysis and discussion with CTM`. The random choice design of target timestep make the design of CTM : - more complex (additionally target timestep embedding) - need more capacity ($\mathcal O (N^2)$ learning objectives) - and harder to train (inferior performance without GAN loss) Please let us know which part do you think is not convincing enough, we are willing for further discussion!
We are willing for further discussion! CTM metrics needs to generate much more samples than compared methods, which is unfair to compare directly.
**The main metrics listed in the Table 1 of original CTM paper is augmented with more advanced sampling techniques while all the compared methods do not use them**. CTM applies a pretrained image classification model to score the generated samples, and only retain the sample with higher confidence and regenerate new samples if the confidence of the classification model is low. That means, `It needs to generate much more samples than all the compared methods`. It is noting that FID will generally become smaller when the number of samples become larger.
We are willing for further discussion! We validate the design of PCM on much more baselines than all compared papers!
Except for the validation on CIFAR and ImageNet. We hope to emphasize that we validate the design of PCM on much more baselines for all compared methods. PCM (Ours): 1. `CIFAR-10`, 2. `ImageNet`, 3. `SD-v15`, 4. `SDXL`, 5.`Text-to-Video` Instaflow: SD-v15 SDXL-Lightning: SDXL CTM: CIFAR, ImageNet CM: CIFAR, ImageNet SDXL-Turbo: SDXL LCM: SD v1-5, SDXL AnimateLCM: Text-to-Video We sincerely hope any further chance for discussion! Looking forward to your reply!
A suspicion of potential plagiarism.
I respectfully request that the other reviewers and the Area Chair take note of the potential plagiarism concerns regarding this paper. I suspect that this paper may have plagiarized the work of [1] Zheng, Jianbin, et al. "Trajectory Consistency Distillation: Improved Latent Consistency Distillation by Semi-Linear Consistency Function with Trajectory Mapping." arXiv preprint arXiv:2402.19159 (2024). https://arxiv.org/abs/2402.19159v2 In accordance with Harvard’s Plagiarism Policy(https://usingsources.fas.harvard.edu/what-constitutes-plagiarism-0), this paper may be engaging in ***Inadequate Paraphrase*** and ***Uncited Paraphrasing***. The reasons for my concerns are as follows: 1. In the manuscript submitted by the author, from lines L134 to L161, the author asserts that their proposed parameterization is one of their core contributions. However, the equations presented, specifically Eq. 2 and 3, are identical to Eqs. 19 and 20 in [1]. Moreover, [1] was the first to apply Eq. 19 to the task of latent consistency distillation in text to image diffusion models. The description L134 to L161 also significantly overlaps with the parameterization discussion in Sec 4.2 of [1]. 2. The objective function detailed in lines L62 to L178 of the manuscript are consistent with Eq. 29 in [1], and the content and explanation in Sec 4.2 “training” of [1] closely resemble the author’s manuscript. 3. The author frequently references [2] CTM, which conducted extensive experiments on CIFAR and ImageNet datasets during the experimental phase. However, the author’s manuscript does not mention these tasks in experiment at all. In their rebuttal, the author mentioned lacking sufficient computational resources to conduct experiments related to [2] CTM, which is particularly confusing to me. Furthermore, the tasks in the author’s manuscript are identical to those in [1]. And obviously, given the knowledge of [1], the innovation of this paper is significantly weakened both in task and experimental results. ***I am not able to make a definitive judgment at this stage. However, based on the current evidence, I believe this paper may be suspected of plagiarism.*** ------ Here we paste the definition of Uncited Paraphrasing and Inadequate Paraphrase here: 1. Inadequate Paraphrase: When you paraphrase, your task is to distill the source's ideas in your own words. It's not enough to change a few words here and there and leave the rest; instead, you must completely restate the ideas in the passage in your own words. If your own language is too close to the original, then you are plagiarizing, even if you do provide a citation. In order to make sure that you are using your own words, it's a good idea to put away the source material while you write your paraphrase of it. This way, you will force yourself to distill the point you think the author is making and articulate it in a new way. Once you have done this, you should look back at the original and make sure that you have represented the source’s ideas accurately and that you have not used the same words or sentence structure. If you do want to use some of the author's words for emphasis or clarity, you must put those words in quotation marks and provide a citation. 2. Uncited Paraphrasing: When you use your own language to describe someone else's idea, that idea still belongs to the author of the original material. Therefore, it's not enough to paraphrase the source material responsibly; you also need to cite the source, even if you have changed the wording significantly. As with quoting, when you paraphrase you are offering your reader a glimpse of someone else's work on your chosen topic, and you should also provide enough information for your reader to trace that work back to its original form. The rule of thumb here is simple: Whenever you use ideas that you did not think up yourself, you need to give credit to the source in which you found them, whether you quote directly from that material or provide a responsible paraphrase. [1] Zheng, Jianbin, et al. "Trajectory consistency distillation: Improved Latent Consistency Distillation by Semi-Linear Consistency Function with Trajectory Mapping" arXiv preprint arXiv:2402.19159 (2024). https://arxiv.org/abs/2402.19159v2 [2] Kim, Dongjun, et al. "Consistency trajectory models: Learning probability flow ode trajectory of diffusion." arXiv preprint arXiv:2310.02279 (2023). https://arxiv.org/abs/2310.02279v3
Thank you for your further response!
Thank you for your reply! We understand your concern on the paper: Trajectory Consistency Distillation: Improved Latent Consistency Distillation by Semi-Linear Consistency Function with Trajectory Mapping (TCD) [1]. **Parameterization** The parameterization of PCM was induced from the analysis form of the exact solution provided in the paper DPM-Solver [2]. All the characters used in our paper and first-order approximation proof follow DPM-Solver (including Eq. 2 - 3). We carefully checked the paper TCD and found it provided a similar discussion from DPM-Solver. It appeared on the arXiv earlier. We are willing to add citations of TCD in the relevant discussion. Both PCM and TCD cite DPM-Solver. Additionally, we hope to clarify that's just a initially basic part for our further discussion. Our further discussion on the parameterization including the analysis of $\boldsymbol \epsilon_{\theta} (\mathbf x_t, t) = \frac{\int_{\lambda_t}^{\lambda_s}e^{-\lambda} \boldsymbol \epsilon_{\boldsymbol \phi}(\mathbf x_{t_{\lambda}(\lambda)}, t_{\lambda}(\lambda))\mathrm d \lambda}{\int_{\lambda_t}^{\lambda_s} e^{-\lambda} \mathrm d\lambda} $ and relevant proofs including, `error bound`, `CFG`, `adversarial loss`, have no intersections with TCD. **Training objective** The objective design of PCM is `totally different` from TCD. For equation 29 in TCD, please note that the loss of TCD accepts an additional timestep `$t_m$` for training, which is equivalent to the `$s$` in the third row of following table. That is, they have to `randomly choose` the target timestep. While for PCM, we fixed the target timestep (i.e., $s:=s_{m}$) before training and `set them to pre-defined`. `This is exactly the core difference between PCM and TCD, CTM [3]`. Considering your concern, we are also willing to run additional comparison experiments with the official TCD and have a specific discussion on it in our paper. We list the loss design comparison in the following table | Methods | timesteps sampled | adjacent timesteps | target timesteps | | ------- | ------------------------------------------------------------ | ------------------ | ------------------------------------------------------------ | | CM | $t_{n+1}\sim\textrm{Uniform}(\{t_1, t_2, \dots\})$ | $t_{n}$ | $s:=t_1:=0$ (`Fixed`) | | CTM | $t_{n+1}\sim\textrm{Uniform}(\{t_1, t_2, \dots\})$ | $t_{n}$ | $s\sim\textrm{Uniform}(\{t_1, t_2, \dots, t_{n}\})$ (`Random`) | | TCD | $t_{n+1}\sim\textrm{Uniform}(\{t_1, t_2, \dots\})$ (Sampled from all possible timesteps) | $t_{n}$ | $s\sim\textrm{Uniform}(\{t_1, t_2, \dots, t_{n}\})$ (`Random`) | | PCM | $t_{n+1}\sim\textrm{Uniform}(\{s_m, \dots, s_{m+1}\})$ (Sampled within pre-defined phases) | $t_{n}$ | $s := s_{m}$ (`Fixed`, no target timestep embedding) | From a more high-level perspective, as the sentence "enabling `seamless transitions at any point` along the trajectory governed by the PF ODE" stated in TCD, CTM and TCD all try to learn arbitrary pairs. While our method PCM `only learns transition within each sub-phase`, which not only easy to train but also does not require any target timestep embeddings. **New Experiments** Our paper is originally for high-resolution text-conditioned image and video generation, where we try to tackle the limitations of LCM in text-to-image generation and text-to-video generation, as stated in our paper. We did not test on the CIFAR and ImageNet since they are for unconditional or class-conditional low-resolution generation. For your request, we have tried our best to run as many experiments as possible on the CIFAR and ImageNet. Following the official CM, the ImageNet experiments require training on 64 A100 GPUs for a week, which we can not afford in the limited rebuttal period. [1] Trajectory consistency distillation [2] Dpm-solver: A fast ode solver for diffusion probabilistic model sampling in around 10 steps [3] Consistency trajectory models: Learning probability flow ode trajectory of diffusion
Summary
The paper titled "Phased Consistency Model" (PCM) introduces a novel model designed to address the limitations of Latent Consistency Models (LCMs) in high-resolution, text-conditioned image generation. The authors identify three primary flaws in LCMs: inconsistency, controllability, and efficiency. PCM is proposed to generalize the design space of LCMs and overcome these limitations by segmenting the ODE trajectory into multiple sub-trajectories and enforcing self-consistency within each sub-trajectory. This approach allows for more stable and deterministic sampling, better control over image generation with larger CFG values, and improved quality in low-step settings through an adversarial loss in the latent space. Extensive experiments demonstrate PCM’s superior performance in both image and video generation tasks compared to existing methods.
Strengths
1. **Technical contribution**: PCM introduces a novel approach of segmenting the ODE trajectory, which is a significant advancement over traditional LCMs. This phasing approach effectively tackles the identified limitations of LCMs. 2. **Comprehensive Evaluation**: The paper provides extensive experimental results on widely recognized benchmarks, showing PCM's superiority in both image and video generation tasks across various settings. 3. **Versatility**: PCM’s methodology is versatile, supporting multi-step refinement and enabling state-of-the-art few-step text-to-video generation. 4. **Clear Illustrations and Comparisons**: Figures and tables in the paper clearly illustrate the performance improvements and qualitative differences between PCM and other models, aiding in understanding the advantages of PCM.
Weaknesses
No specific weakness to mention.
Questions
- Could the author provide some other human related evaluation metrics, e.g., ImageReward, Aesthetic scores, etc, to compare the generation quality within different efficient diffusion models? - Given the introduction of an adversarial loss, how stable is the training process of PCM? Are there any observed issues with training stability or convergence, and how are they addressed?
Rating
8
Confidence
4
Soundness
4
Presentation
3
Contribution
3
Limitations
The authors have demonstrated the limitations, e.g., inability in 1-step generation, in their paper.
Summary
The paper investigates three issues of Consistency Models on Latent space, thereby making a proposal named Phased Consistency Model that handles these weaknesses, supported by theoretical proofs and derivations. To assess the efficacy of their proposed solution, the authors conduct extensive experiments on two main scenarios: text-to-image and text-to-video generation. Additionally, details ablation studies and analysis on negative prompting, the self-consistency property and adversarial design to provide a strong motivation for the proposed approach.
Strengths
1. The method separates consistency objective by splitting the ODE trajectory into sub-trajectories, therefore it has better ability on preserving image consistency when varying inference steps in deterministic sampling. Theoretical proofs provide good bounds for these objectives. 2. Reasonable arguments come from theoretical perspectives to address the CFG scale problem of Consistency Models. 3. The proposed Adversarial Consistency Loss for distribution consistency distillation makes sense in design of discriminator’s architecture.
Weaknesses
1. Pre-defined number of sub-trajectories seems to fix the number of inference steps, which reduces the model’s flexibility. 2. Lack of explanation for the design of formula of Adversarial Consistency Loss, which employs ReLU function. 3. Need an ablation study to investigate impact of Adversarial Consistency Loss, for example what is model’s behaviour and result without this loss? 4. Detailed hyper-parameters used in settings, for example preconditioning weight, Adversarial Consistency Loss weight.
Questions
See the weakness above
Rating
6
Confidence
3
Soundness
3
Presentation
2
Contribution
2
Limitations
The authors analyse the limitations of their method in case of 1-step generation in a few lines.
Sincerely thank you for raising the score!
We are grateful for your decision to raise the score. Your recognition and feedback mean a lot to us. Please feel free to reach out if there’s anything else we can assist with. Best regards, The Authors
I don’t believe the author’s response has adequately addressed my concerns. The paper still requires substantial experimental validation before it can be considered for publication. The author repeatedly compares their work with CTM throughout the paper, yet I found no clear advantages in the data provided in the rebuttal. This raises serious doubts about the paper’s contribution. As a result, I will be lowering my score.
Thank you for the rebuttal. I will maintain my original score.
Sincerely thank you for the very positive review!
Thank you for maintaining the very positive score. We sincerely appreciate the time and effort you invested in reviewing our paper. Your feedback has been exceptionally valuable, and we are deeply grateful for your support. We are always here should you have any further questions or need additional information. Best regards, The Authors
Regarding the accusation of Reviewer ukQK
Dear AC and Reviewers, We are writing to **strongly** defend the plagiarism accusation of Reviewer ukQK. A plagiarism accusation is very serious and shall not be made based on the incomplete understanding. We defend Reviewer ukQK's plagiarism accusation on our paper as follows: 1. Reviewer ukQK thinks our Equations 2, 3 are copied from TCD. However, `our Equation 2 is a direct conclusion formula from the previous paper DPM-Solver [2]`, which we have cited. In our submission, we write the sentence as the following: > For the above-discussed PF-ODE, there exists an exact solution [Citation to DPM-Solver [2]] from timestep t and s, > > [Equation 2] In addition, our equation 3 is also a direct adaption of first-order approximation, which is equivalent to DDIM in implementation format. This is also a clear conclusion by DPM-Solver. Both TCD and PCM clearly cited DPM-Solver [2]. The important conclusion of DPM-Solver (NeurIPS 2022) shall not be considered as contributions of TCD (arXiv 2024). For the accusation from Line 134 to Line 161. - From Line 134 to 139, it follows the standard definition of Consistency Models [1], which is not proposed by TCD. - From Line 143 to 150, it follows the standard conclusion of DPM-Solver [2], which is not proposed by TCD. - From Line 151 to 157, it is our clarification on the epsilon prediction meaning of consistency models. We do not find any relevant discussion in the TCD paper. - From Line 158 to 161, we do find some similar discussion on the boundary condition in the TCD paper. But please note that it is a natural conclusion from the exact solution formula proposed in DPM-Solver. Thereby, we believe the plagiarism accusation on our paper copying TCD's formulas is groundless.
2. Reviewer ukQK thinks we have the same training objective as TCD. Instead, our design is **totally and inherently different** from the training objective of TCD and CTM, which we have explained in our submission and the rebuttals. Firstly, from a high-level perspective, we enforce the model to follow self-consistency within the pre-defined sub-phases (i.e. Our ODE is firstly split into multiphases along the time axis, and then we learn CM within the sub-trajectory). Therefore, our model enforces multiphase consistency. Instead, TCD just follows CTM and learns to follow trajectory consistency. That is, they enforce their model to learn how to move from arbitrary initial timesteps to arbitrary other timesteps. We provide a not strict but very straightforward example to better illustrate the difference. Assume, the model has 1000 timesteps (0, 1, ..., 999) in total and we hope to train a 4-step model of PCM. Then we have The learning objectives of PCM: $f(x_{999}, 999) = x_{749}$ $f(x_{749}, 749) = x_{499}$ $f(x_{499}, 499) = x_{249}$ $f(x_{249}, 249) = x_0$ The learning objectives of TCD: $ f(x_{999}, 999, 749) = x_{749} $ $ f(x_{999}, 999, 499) = x_{499} $ $ f(x_{999}, 999, 249) = x_{249} $ $ f(x_{999}, 999, 0) = x_0 $ $ f(x_{749}, 749, 499) = x_{499} $ $ f(x_{749}, 749, 249) = x_{249} $ $ f(x_{749}, 749, 0) = x_0 $ $ f(x_{499}, 499, 249) = x_{249} $ $ f(x_{499}, 499, 0) = x_0 $ $ f(x_{249}, 249, 0) = x_0 $ In the above example, PCM only maps one timestep to a predefined corresponding middle timestep (e.g., $999 \rightarrow 749$ ), which is pre-defined. That is, PCM is a one-to-one mapping. But for TCD, it has to accept an additional target timestep to indicate which timestep prediction it hopes to predict, and learn to predict all the other timesteps. That is, TCD is a one-to-N mapping. Therefore, PCM only has $O(N)$ training objectives but TCD has $\mathcal O(N + (N-1) + \cdots + 1) = \mathcal O(N^2)$. This is also the direct reason why it requires a target timestep embedding. We list a more straightforward illustration of the differences of the loss functions, | Methods | timesteps sampled | adjacent timesteps | target timesteps | | ------- | ------------------------------------------------------------ | ------------------ | ------------------------------------------------------------ | | CM | $t_{n+1}\sim\textrm{Uniform}(\{t_1, t_2, \dots\})$ | $t_{n}$ | $s:=t_1:=0$ (`Fixed`) | | CTM | $t_{n+1}\sim\textrm{Uniform}(\{t_1, t_2, \dots\})$ | $t_{n}$ | $s\sim\textrm{Uniform}(\{t_1, t_2, \dots, t_{n}\})$ (`Random`) | | TCD | $t_{n+1}\sim\textrm{Uniform}(\{t_1, t_2, \dots\})$ (Sampled from all possible timesteps) | $t_{n}$ | $s\sim\textrm{Uniform}(\{t_1, t_2, \dots, t_{n}\})$ (`Random`) | | PCM | $t_{n+1}\sim\textrm{Uniform}(\{s_m, \dots, s_{m+1}\})$ (Sampled within pre-defined phases) | $t_{n}$ | $s := s_m$ (`fixed`) | For the accusation of Equation 29 in TCD, please note that the loss of TCD accepts an additional timestep `$t_m$` for training, which is equivalent to the `$s$` in the third row of the above table. That is, TCD needs to `randomly choose` the target timestep. While for PCM, we fixed the target timestep (i.e., $s:=s_{m}$) before training and `set them to pre-defined`. `This is exactly the core difference between PCM and TCD, CTM`. Therefore, `we argue that the training design of PCM and TCD, CTM are inherently different and the reviewer ukQK might misunderstand key aspects of our method`.
3. In the following table, we summarize more differences between TCD and PCM. | Method | Learning Paradigm | Adversarial Loss | 1-Step Generation | Video Generation | Sampling Method | CFG Analysis | Consistent Generation | Num Traing Objects | Prediction | FID / NFE | | ------ | ---------------------- | ---------------- | ----------------- | ---------------- | --------------- | ------------ | --------------------- | ------------------- | ----------- | --------------------------------------- | | TCD | Trajectory Consistency | No | No | No | Gamma-Sampling | No | No | $\mathcal O(N^2)$ | 1-N mapping | Worse when NFE > 4 | | PCM | Multiphase Consistency | yes | yes | yes | Deterministic | Yes | Yes | $\mathcal O(N)$ | 1-1 mapping | Continue to be better as the NFE larger | In addition to the above accusation of plagiarism, we find the reviewer also made judgments on our method that we believed to be unfair. 4. The model of CTM requires a target timestep embedding. But the reviewer asked us the question `Why does CTM need target timestep embeddings`. It is clearly stated in the paper of CTM and also shown in the official code of CTM. Besides, we also set up an independent section to discuss why CTM needs target timestep embeddings (Ln 602 - 615, titled exactly "Why CTM Needs Target Timestep Embeddings?"). The comment might suggest that the reviewer may `have a gap` in understanding the related works and might not have fully grasped the details of our paper. 5. The motivation of our paper is to analyze the limitations of previous LCMs and generalize the design space to solve these limitations (as stated in the abstract, introduction, teaser figure). The LCM is only for high-resolution `text-conditioned` image and video generation. Therefore, we believe we have efficiently validate the effectiveness of PCM. For the reviewers' request to run CIFAR and ImageNet which are low-resolution unconditional generation and class-conditional generation tasks and have no direct relations to LCM, we have tried our best to run as many experiments as possible and provide clear evidence of the superiority of PCM compared to CM and CTM in the fair comparison setting. We have validated our methods on `five baselines` including CIFAR, ImageNet, SD v1-5, SDXL, and Text-to-Video. It is noting that all compared methods only validate their methods for `at most two baselines`, but the reviewer still claims that our method lacks validation. We believe the contribution of our paper is underestimated. Please kindly take the time to look at our detailed rebuttal. Thanks, Paper 2513 Authors [1] Consistency Models. ICML 2023 [2] DPM-Solver: A Fast ODE Solver for Diffusion Probabilistic Model Sampling in Around 10 Steps. NeurIPS 2022
I disagree with the author's current response. Given that the author was aware of [1], deliberately using the same reparameterization scheme without proper citation clearly constitutes plagiarism. I am **not questioning the innovation or contribution of this work**. I am simply questioning why [1] was not mentioned at all in this manuscript submitted by authors, despite the striking similarity of both submitted manuscript and [1]. This seems to go beyond just a lack of citation. Also I totally agree about `The important conclusion of DPM-Solver (NeurIPS 2022) shall not be considered as contributions of TCD (arXiv 2024).` But I also do believe TCD as the first work to apply a reparameterization method [2] for large-scale text-to-image distillation does exhibit a degree of innovation and contribution. (If using [2] for distillation doesn't qualify as contribution, then this reparameterization should have been placed in the *related work* section rather than the *method* section of the submitted manuscript.) Furthermore, the author's explanation is intriguing. `From Line 158 to 161, we do find some similar discussion on the boundary condition in the TCD paper. But please note that it is a natural conclusion from the exact solution formula proposed in DPM-Solver.` I'm wondering if the author was aware of the TCD paper, does this not suggest the possibility of plagiarism, as I previously mentioned: Uncited Paraphrasing and Inadequate Paraphrase? Lastly, I find it somewhat ironic that the author seems to suggest that if [1] cites [2], and their submitted work also cites [2], then their work can avoid citing [1], even though the author(s) know their work and [1] share substantial similarities in terms of tasks, comparisons, and experiments, while [2] is from an entirely different field compared to [1] and their work. [1] Trajectory consistency distillation [2] Dpm-solver: A fast ode solver for diffusion probabilistic model sampling in around 10 steps
**Parameterization** Our final parameterization is finally parameterized in the same format as DDIM for simplicity (as stated in the paper). For distillation-based acceleration, using the format of DDIM for distillation is a common practice. We list works using the format for large-scale text-to-image distillation in the following: 1. Progressive Distillation for Fast Sampling of Diffusion Models. ICLR 2022 2. On Distillation of Guided Diffusion Models. CVPR 2023 3. BOOT : Data-free Distillation of Denoising Diffusion Models with Bootstrapping. arXiv 2023 We list the works using the format of DDIM for distillation in unconditional and class-conditional in the following 1. TRACT: Denoising Diffusion Models with Transitive Closure Time-Distillation. arXiv 2023 2. BOOT : Data-free Distillation of Denoising Diffusion Models with Bootstrapping. arXiv 2023 Therefore, we believe It is not TCD (arXiv 2024) that first applied the parameterization for either large-scale text-to-image distillation or unconditional image generation and class-conditional generation. And we would say it's not strange to potentially have a similar parameterization. The important thing is the discussion in the paper on how to understand and explain the parameterization, which we believe we have an entirely different discussion with TCD (Ln 151 -- 157). **Boundary condition** The DPM-Solver has shown that the denoising from $t$ to $s$ is to add an integral of weighted epsilon from $t$ to $s$. So it is obvious that the integral from $s$ to $s$ (i.e., the integral length is 0, $\int_{s}^s f = 0$, where $f$ can be any function) will equal 0. We believe this is an evident and natural conclusion and can be easily observed with minor exposure to calculus. We admit we did not notice relevant discussion in TCD. As stated in our previous reply, we are willing to add citations to it. Sincerely,
Decision
Accept (poster)