Token Merging for Fast Stable Diffusion

Abstract

The landscape of image generation has been forever changed by open vocabulary diffusion models. However, at their core these models use transformers, which makes generation slow. Better implementations to increase the throughput of these transformers have emerged, but they still evaluate the entire model. In this paper, we instead speed up diffusion models by exploiting natural redundancy in generated images by merging redundant tokens. After making some diffusion-specific improvements to Token Merging (ToMe), our ToMe for Stable Diffusion can reduce the number of tokens in an existing Stable Diffusion model by up to 60% while still producing high quality images with-out any extra training. In the process, we speed up image generation by up to 2× and reduce memory consumption by up to 5.6×. Furthermore, this speed-up stacks with efficient implementations such as xFormers, minimally impacting quality while being up to 5.4× faster for large images. Code is available at https://github.com/dbolya/tomesd.

Cite

Text

Bolya and Hoffman. "Token Merging for Fast Stable Diffusion." IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops, 2023. doi:10.1109/CVPRW59228.2023.00484

Markdown

[Bolya and Hoffman. "Token Merging for Fast Stable Diffusion." IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops, 2023.](https://mlanthology.org/cvprw/2023/bolya2023cvprw-token/) doi:10.1109/CVPRW59228.2023.00484

BibTeX

@inproceedings{bolya2023cvprw-token,
  title     = {{Token Merging for Fast Stable Diffusion}},
  author    = {Bolya, Daniel and Hoffman, Judy},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops},
  year      = {2023},
  pages     = {4599-4603},
  doi       = {10.1109/CVPRW59228.2023.00484},
  url       = {https://mlanthology.org/cvprw/2023/bolya2023cvprw-token/}
}