Top AI Repos — open-source AI, indexed and scored
Top AI Repos tracks AI repositories on GitHub and answers two different questions about each one: is it moving right now, and would you bet a product on it.
Top AI Repos tracks AI repositories on GitHub and answers two different questions about each one: is it moving right now, and would you bet a product on it.
Official Repository of the paper "Trajectory Consistency Distillation"
| Date | Stars |
|---|---|
| 2026-07-24 | 361 |
| 2026-07-25 | 361 |
| 2026-07-28 | 361 |
| 2026-07-30 | 361 |
| 2026-08-06 | 361 |
Today
— stars today
This week
— stars this week
This month
— stars this month
Momentum
0.0
growth rate 0.00%/day
# Trajectory Consistency Distillation
[](https://arxiv.org/abs/2402.19159)
[](https://mhh0318.github.io/tcd)
[](https://huggingface.co/h1t/TCD-SDXL-LoRA)
[](https://huggingface.co/spaces/h1t/TCD)
Official Repository of the paper: [Trajectory Consistency Distillation](https://arxiv.org/abs/2402.19159)
## A Solemn Statement Regarding the Plagiarism Allegations.
We regret to hear about the serious accusations from the CTM team.
<blockquote class="twitter-tweet"><p lang="en" dir="ltr">We sadly found out our CTM paper (ICLR24) was plagiarized by TCD! It's unbelievable😢—they not only stole our idea of trajectory consistency but also comitted "verbatim plagiarism," literally copying our proofs word for word! Please help me spread this. <a href="https://t.co/aR6pRjhj5X">pic.twitter.com/aR6pRjhj5X</a></p>— Dongjun Kim (@gimdong58085414) <a href="https://twitter.com/gimdong58085414/status/1772350285270188069?ref_src=twsrc%5Etfw">March 25, 2024</a></blockquote>
Before this post, we already have several rounds of communication with CTM's authors.
We shall proceed to elucidate the situation here.
<blockquote class="twitter-tweet"><p lang="en" dir="ltr">We regret to hear about the serious accusations from the CTM team <a href="https://twitter.com/gimdong58085414?ref_src=twsrc%5Etfw">@gimdong58085414</a>. I shall proceed to elucidate the situation and make an archive here. We already have several rounds of communication with CTM's authors. <a href="https://t.co/BKn3w1jXuh">https://t.co/BKn3w1jXuh</a></p>— Michael (@Merci0318) <a href="https://twitter.com/Merci0318/status/1772502247563559014?ref_src=twsrc%5Etfw">March 26, 2024</a></blockquote>
1. In the [first arXiv version](https://arxiv.org/abs/2402.19159v1), we have provided citations and discussion in A. Related Works:
> Kim et al. (2023) proposes a universal framework for CMs and DMs. The core design is similar to ours, with the main differences being that we focus on reducing error in CMs, subtly leverage the semi-linear structure of the PF ODE for parameterization, and avoid the need for adversarial training.
2. In the [first arXiv version](https://arxiv.org/abs/2402.19159v1), we have indicated in D.3 Proof of Theorem 4.2
> In this section, our derivation mainly borrows the proof from (Kim et al., 2023; Chen et al., 2022).
and we have never intended to claim credits.
As we have mentioned in our email, we would like to extend a formal apology to the CTM authors for the clearly inadequate level of referencing in our paper. We will provide more credits in the revised manuscript.
3. In the updated [second arXiv version](https://arxiv.org/abs/2402.19159v2), we have expanded our discussion to elucidate the relationship with the CTM framework. Additionally, we have removed some proofs that were previously included for completeness.
4. CTM and TCD are different from motivation, method to experiments. TCD is founded on the principles of the Latent Consistency Model (LCM), aimed to design an effective consistency function by utilizing the **exponential integrators**.
5. The experimental results also cannot be obtained from any type of CTM algorithm.
5.1 Here we provide a simple method to check: use our sampler here to sample the checkpoint [CTM released](https://github.com/sony/ctm), or vice versa.
5.2 [CTM](https://github.com/sony/ctm) also provided training script. We welcome anyone to reproduce the experiments on SDXL or LDM based on CTM algorithm.
We believe the assertion of plagiarism is not only severe but also detrimental to the academic integrity of the involved parties.Excerpt of 21,913 characters
Read on GitHubWould you bet a product on this? Bounded 0–100 and slow moving.
matched fp:9866d97b3207ecf5, topic:stable-diffusion, topic:text-to-image