Pith. sign in

REVIEW 3 major objections 5 minor 1 cited by

Ditto: Accelerating Diffusion Model via Temporal Value Similarity

T0 review · 3 major / 5 minor · reviewed 2026-08-10 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read Diffusion model inference can be accelerated by computing only the differences between consecutive denoising steps, with nearly all of those differences representable in 4 bits or as zeros.

desk verdict Useful accelerator co-design, but the accuracy-preservation claim conflates quantization with the difference path and needs a quantized baseline before it can be believed. read the letter →

arxiv 2501.11211 v1 pith:IGAOHJAM submitted 2025-01-20 cs.AR cs.CVcs.LG

Sungbin Kim , Hyunwuk Lee , Wonho Cho , Mincheol Park , Won Woo Ro This is my paper · ORCID
classification cs.ARcs.CVcs.LG
keywords diffusionmodelaccelerationtemporalvaluesimilaritydifferenceprocessingpost-trainingquantizationhardwareacceleratordynamicbit-widthzeroskippingimagegeneration
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

Diffusion models generate images by repeatedly denoising, and each step recomputes the whole network on slightly different inputs. This paper argues that those inputs are so similar that the step-to-step difference is a much cheaper operand, and that computing linear layers on the difference (then adding the previous output) costs fewer bits and skips many zeros. Across seven diffusion models, about 96% of temporal differences fit in 4 bits or are zero, a pattern that holds at every time step. If the claim holds, accelerators built around this difference processing can reach about 1.5x speedup and 17.7% energy savings over an 8-bit baseline while keeping image quality statistically unchanged. The paper completes the argument with a hardware design whose processing elements natively handle both 4-bit and 8-bit data and skip zero differences.

What carries the argument

The central identity is the distributive property of linear layers, $f(x_{t-1}) = f(x_t + \Delta_t) = f(x_t) + f(\Delta_t)$, where $\Delta_t = x_{t-1} - x_t$ is the temporal difference between adjacent denoising steps. Because $f(\Delta_t)$ is computed on data that is mostly zero and mostly 4-bit, an adder-tree MAC unit with 4-bit multipliers (and a shifter to compose 8-bit products from two 4-bit products) executes the bulk of the arithmetic at reduced cost, then a summation unit adds $f(\Delta_t)$ back to the previous step's output. The second mechanism is Defo, which uses a layer table and cycle counters to freeze, at the second time step, whether each linear layer will run in difference mode or original-activation mode, and bypasses difference calculation and summation around non-linear functions based on static dependency analysis.

What would settle it

Run a diffusion model with a high-order sampler (e.g., DPM-Solver or EDM) on the same seven benchmarks and record, for every layer and every step, whether difference processing or original-activation execution finishes in fewer cycles; if the per-layer winner changes substantially after step 2 in any model — as it would if temporal similarity surges near the final denoising steps — then the fixed Defo decision becomes suboptimal and the claimed 98.8% of ideal speedup would be violated in a directly measurable way.

Watch

Extended reading notes

Core claim

On the paper's own terms, Ditto establishes that the reverse diffusion chain is temporally sparse: adjacent time steps share cosine similarity above 0.94 (0.98 on average), so the temporal difference between consecutive activations occupies a value range up to 8.96x narrower than the activations themselves. In an 8-bit quantized model, 44.48% of those differences are exactly zero and 96.01% require 4 bits or fewer, meaning only 3.99% need full bit-width. Ditto exploits this by running the first time step at full bit-width, then for each linear layer applying the distributive property to compute the layer output as the previous output plus the layer applied to the temporal difference, using 4-bit multipliers and zero skipping. A runtime and compile-time optimization (Defo) decides per layer, after observing the first two time steps, whether difference processing or original-activation processing is faster, and a companion accelerator (Ditto hardware) implements dynamic sparsity and mixed precision in a single adder-tree PE. Evaluated on seven diffusion models from DDPM to DiT, the hardware achieves up to 1.5x speedup and 17.74% energy savings over an iso-area 8-bit tensor-core baseline while matching FP32 FID/IS/CLIP metrics within noise.

Load-bearing premise

Defo fixes each layer's execution type at the second time step and applies it to all later time steps, assuming the relative efficiency of difference processing versus original activations stays stable across the whole reverse diffusion chain.

Editorial extensions

If this is right

  • If Ditto is right, a large fraction of diffusion inference work is redundant: roughly 44% of multiply-accumulates can be skipped as zero differences and most of the rest run at 4-bit precision, so the speedup does not rely on approximate computing — outputs are numerically equivalent to the 8-bit baseline.
  • The mechanism generalizes across model families: the paper evaluates pixel-space DDPM, latent-space conditional/unconditional LDM (BED, CHUR, IMG, SDM), and diffusion transformers (DiT, Latte), and reports consistent BOPs reduction at every adjacent time step, including the final cleaning steps.
  • Difference processing can be combined with existing time-step-aware quantization schemes such as Q-Diffusion, since Ditto operates on the quantized activations and does not require retraining.
  • Defo+ shows that spatial similarity inside a tensor can be harvested alongside temporal similarity using the same hardware, with only an offset register and a multiplexer, which is a direct extension the paper evaluates.
  • The hardware's uniform 4-bit PE design avoids the outlier-PE area penalty of mixed-precision accelerators like Cambricon-D, so the comparison runs at iso-area with more effective PEs.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The same temporal-difference trick should transfer to other iterative generative or inference loops where consecutive states are highly correlated, such as video diffusion, autoregressive token generation, and iterative refinement in super-resolution; the load-bearing condition is only that the difference signal is sparser in bit-width and zeros than the state itself.
  • The paper's own Fig. 19 suggests a stress test: with samplers that take larger or non-uniform jumps (e.g., DPM-Solver or EDM), temporal similarity may fluctuate near the final steps, and the fixed-at-step-2 Defo decision would become suboptimal; a dynamic re-evaluation every few steps would reclaim most of the gap at negligible control cost.
  • A testable extension is to measure the temporal-difference bit-width distribution per layer and per step for a broader sampler set; if 4-bit-or-zero fractions stay above roughly 90% throughout, Ditto's hardware case strengthens, and if they collapse, the accelerator's PE count and Defo policy would need to be re-tuned.
  • Because Ditto's benefit scales with the number of time steps, its relative advantage should shrink with fast samplers that use 10-20 steps; the paper's 20-step IMG and Latte benchmarks already show the trend, and the practical sweet spot is likely in high-step fidelity regimes.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 5 minor

Summary. The paper proposes Ditto, a software-hardware co-design to accelerate diffusion model inference by exploiting the high value similarity between adjacent time steps in the reverse diffusion process. The Ditto algorithm computes temporal differences between consecutive time-step activations, executes linear layers on these differences using reduced bit-width and zero-skipping, and adds the previous output back. A static/runtime execution-flow optimization (Defo) decides per layer whether difference processing or original-activation processing is more efficient, and Defo+ additionally applies spatial difference processing to layers that remain in the original-activation mode. The Ditto hardware combines adder-tree PEs with an encoding unit that reorders and classifies differences, supporting dynamic 4/8-bit operations and zero skipping. The evaluation covers seven diffusion models (DDPM, BED, CHUR, IMG, SDM, DiT, Latte), compares against GPU, ITC, Diffy, and Cambricon-D, and reports up to 1.5x speedup and 17.74% energy saving over ITC, with ablations for Defo and dynamic execution-flow exploration.

Significance. If the claims hold, this is a substantive contribution to efficient diffusion-model inference, as it shows how temporal similarity can be systematically exploited in both software and hardware. The distributive rewrite for linear layers and the Q/K split for attention are algebraically exact, the hardware is evaluated with a cycle-accurate simulator across seven diverse models, and the paper includes ablations (Fig. 16), decision-accuracy analysis (Fig. 17), and a design-space exploration of dynamic temporal similarity (Fig. 19). The main weakness is the accuracy evidence: Table II compares FP32 against Ditto with no quantized baseline, so the central claim of 'preserving accuracy' is not yet substantiated, and the Defo fixed-decision policy's generality is asserted rather than demonstrated across models with fluctuating temporal similarity. These issues are local and fixable, but they are load-bearing for the paper's main conclusions.

major comments (3)
  1. [Section VI-A, Table II] The claim that 'the Ditto algorithm preserves the accuracy of all diffusion models compared to baseline FP32 models' is not supported by the reported data, because no quantized baseline (e.g., Q-Diffusion 8-bit without Ditto) is reported. For BED, FID degrades from 2.962 to 5.897 while IS changes from 2.227 to 2.338; without the quantized baseline the reader cannot tell whether this degradation comes from quantization or from the difference-processing path (Encoding Unit classification, Defo nonlinear-function bypasses, or the attention factorization). If Ditto is bit-identical to its quantized baseline, as suggested by the 'numerical equivalent results' statement in Section V-A, then Table II measures only quantization error and the text overstates the algorithm's accuracy behavior; if Ditto is not bit-identical, the additional error must be quantified and attributed. Please report the quantized-model accuracy for the same 8-bit setting used by the hardware evaluation, and ideally an ablation that turns off Defo and the difference path to isolate their effects.
  2. [Section IV-B, Figs. 17 and 19] The Defo policy fixes each layer's execution type at the second time step and applies it to all later time steps, and the paper supports this with 92% decision accuracy and 98.8% performance of an ideal per-step re-decision design. However, the main evaluation (Figs. 13 and Table II) only includes models whose temporal similarity is stable in the sense of Fig. 6b; the paper's own synthetic exploration (Fig. 19) shows that decision accuracy drops by 7% when temporal similarity fluctuates, and the authors note that 'some future models with high temporal similarity may exhibit dynamic temporal similarity across the time domain.' The claim in Section I that Ditto is effective 'regardless of the type of diffusion model' is therefore too broad, and the paper should either scope that claim to models with temporally stable similarity or include a real model or sampler chain where the fixed second-step decision is challenged.
  3. [Section VI-B, Fig. 15] The crossover experiment applies Ditto's software techniques (attention difference, Defo, Defo+) to Cambricon-D and sign-mask data flow to Ditto, and reports speedups, but it does not report the accuracy of these modified configurations. Because sign-mask data flow alters the treatment of nonlinear functions and Defo changes layer execution types, the numerical results of the modified baselines may differ from the unmodified ones, and the speedup comparison is only meaningful if these modifications are accuracy-neutral or if the accuracy of every configuration is reported. Please provide accuracy numbers for the configurations in Fig. 15, or a statement of numerical equivalence with the original quantized model.
minor comments (5)
  1. [Abstract and Section VI-B] The abstract says 'up to 1.5x speedup and 17.74% energy saving', but Section VI-B reports these as averages over the benchmarks; please make the wording consistent (e.g., 'up to 1.5x average speedup' or provide the per-model maximum).
  2. [Fig. 3a] The caption states cosine-similarity values of 0.9997, 0.9972, 0.9934, and 0.948, while the text in Section II-B says the similarity 'exceeds 0.94' for these layers; the lower value 0.948 is inconsistent with the claim if it refers to the same layers, so please clarify which time-step pair each value corresponds to.
  3. [Section IV-A, Attention Layers] The key identity for attention difference processing, QtKt = Qt+1Kt+1 + QtΔK + ΔQKt+1, is stated in prose but not numbered; please number it as an equation, since it is central to the attention-layer optimization.
  4. [Section V and Table III] Table III lists Ditto as 'A4W8', but the hardware supports both 4-bit and 8-bit activations; to avoid confusion with the A4W8 configuration of Diffy, please label Ditto's bit-width as 'A4/8W8' and state in the text that the hardware is evaluated for support of both modes.
  5. [References] References [46] and [47] are the same paper (Shapeshifter) and should be merged or the duplicate removed.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: Ditto's difference processing is an exact algebraic rewrite, Defo is evaluated against an independent oracle, and hardware speedup is measured from real activation traces rather than derived from the motivating similarity statistics.

full rationale

The claimed derivation chain is empirical and non-circular. The motivating observation (temporal activation similarity, Fig. 3) is measured on real diffusion workloads, not assumed in the algorithm's definition. The Ditto algorithm is an exact algebraic application of distributivity: for linear layers, computing f(x_t) = f(x_{t+1}) + f(Δ) is algebraically equivalent to f(x_t) once f(x_{t+1}) is known (Section IV-A, Fig. 7); no fitted parameter is renamed as a prediction. Defo's per-layer execution-type decision is a run-time heuristic (Section IV-B) whose accuracy is assessed against an independent oracle: Fig. 18 compares against Ideal-Ditto/ideal-Ditto+ that always choose the optimal flow, and Fig. 17 reports 92%/88.11% accuracy, so the evaluation does not define optimality as whatever Defo chose. The hardware claims are supported by cycle-accurate simulation using actual input activation data (Section VI-A) and iso-area comparisons against external baselines (ITC, Diffy, Cambricon-D); the speedup is not derived from the bit-width distribution but measured from the simulated execution. The self-citations [41] and [48] are non-load-bearing references to prior accelerator techniques. The main evidentiary weakness is that Table II compares FP32 against the full Ditto system (Q-Diffusion quantized plus difference processing) without reporting a quantized-only baseline, so the accuracy claim conflates quantization error with any Ditto-specific error; that is a correctness/evidence gap, not circularity, because no equation or fitted parameter in the derivation is equivalent to the claimed outcome.

Assumptions & free parameters 1 free parameters · 3 assumptions · 0 invented entities

The design has no fitted constants in the physics sense; the 4-bit threshold and the second-step decision point are engineering choices. The main assumptions are standard linear algebra and the empirical generality of temporal similarity.

free parameters (1)
  • Low-precision bit-width threshold = 4 bits
    Chosen because 96.01% of temporal differences fit in 4 bits or fewer; it is an engineering choice that drives the PE design and BOPs estimates, not a constant derived from theory.
assumptions (3)
  • standard math Distributive property of matrix multiplication over addition
    Invoked in Section IV-A to express layer output at time t as output at time t+1 plus a term computed from temporal differences (Fig. 7).
  • domain assumption Temporal value similarity observed on the seven benchmark models generalizes to other diffusion models and sampling schedules
    Section III measures cosine similarity and value ranges on DDPM, BED, CHUR, IMG, SDM, DiT, Latte; the algorithm assumes this pattern is inherent to diffusion models, not an artifact of these benchmarks.
  • ad hoc to paper Execution-flow decision made at the second time step remains near-optimal for all later time steps
    Defo (Section IV-B) fixes each layer's execution type after time step 2 based on cycle counts; the paper evaluates this at 92% accuracy but the fixed decision is a load-bearing premise for the claimed memory reduction and speedup.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Ditto: Accelerating Diffusion Model via Temporal Value Similarity." pith.science (2026). https://pith.science/paper/IGAOHJAM

@misc{pith2026250111211,
  author       = {Pith},
  title        = {Pith review of: Ditto: Accelerating Diffusion Model via Temporal Value Similarity},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/IGAOHJAM}},
  note         = {Machine review of arXiv:2501.11211}
}
read the original abstract

Diffusion models achieve superior performance in image generation tasks. However, it incurs significant computation overheads due to its iterative structure. To address these overheads, we analyze this iterative structure and observe that adjacent time steps in diffusion models exhibit high value similarity, leading to narrower differences between consecutive time steps. We adapt these characteristics to a quantized diffusion model and reveal that the majority of these differences can be represented with reduced bit-width, and even zero. Based on our observations, we propose the Ditto algorithm, a difference processing algorithm that leverages temporal similarity with quantization to enhance the efficiency of diffusion models. By exploiting the narrower differences and the distributive property of layer operations, it performs full bit-width operations for the initial time step and processes subsequent steps with temporal differences. In addition, Ditto execution flow optimization is designed to mitigate the memory overhead of temporal difference processing, further boosting the efficiency of the Ditto algorithm. We also design the Ditto hardware, a specialized hardware accelerator, fully exploiting the dynamic characteristics of the proposed algorithm. As a result, the Ditto hardware achieves up to 1.5x speedup and 17.74% energy saving compared to other accelerators.

Figures

Figures reproduced from arXiv: 2501.11211 by the authors.

Figure 1
Figure 1. Image generation process of diffusion models. Dif [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
Figure 4
Figure 4. Analyses on value range of activations and temporal [PITH_FULL_IMAGE:figures/full_fig_p003_4.png] view at source ↗
Figure 5
Figure 5. Bit-width requirement of activations and differences in [PITH_FULL_IMAGE:figures/full_fig_p004_5.png] view at source ↗
Figures from the paper (9 more)
Figure 7
Figure 7. Figure 7: Process of linear layers in the Ditto algorithm. [PITH_FULL_IMAGE:figures/full_fig_p005_7.png]
Figure 8
Figure 8. Figure 8: Relative memory accesses of the temporal difference [PITH_FULL_IMAGE:figures/full_fig_p006_8.png]
Figure 11
Figure 11. Figure 11: Detailed architecture of Encoding Unit. [37], to maximize throughput and minimize latency. We set the frequency of all components as the same, and the number of each component to support the maximum throughput of the Compute Unit executing in a low bit-width activatio…
Figure 12
Figure 12. Figure 12: Detailed architecture and workflow of Compute Unit. [PITH_FULL_IMAGE:figures/full_fig_p008_12.png]
Figure 13
Figure 13. Figure 13: Comparison results of the various hardware in speedup (top), and relative energy consumption (bottom). Speedup [PITH_FULL_IMAGE:figures/full_fig_p010_13.png]
Figure 14
Figure 14. Figure 14: Relative memory accesses of the various hardware. [PITH_FULL_IMAGE:figures/full_fig_p010_14.png]
Figure 15
Figure 15. Figure 15: Comparison of Cambricon-D and the Ditto hardware [PITH_FULL_IMAGE:figures/full_fig_p011_15.png]
Figure 19
Figure 19. Figure 19: Design space exploration of Defo. Dyn.-Ditto indicate [PITH_FULL_IMAGE:figures/full_fig_p012_19.png]
Figure 18
Figure 18. Figure 18: Comparison results of the Ditto and Ditto [PITH_FULL_IMAGE:figures/full_fig_p012_18.png]

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Forecast then Calibrate: Feature Caching as ODE for Efficient Diffusion Transformers

    cs.CV 2025-08 conditional novelty 6.0 of 10

    A training-free predictor-corrector method that accelerates Diffusion Transformers by solving a feature-ODE, achieving large compute reductions with modest quality loss.

Reference graph

Works this paper leans on

96 extracted references · 35 canonical work pages · cited by 1 Pith paper

  1. [1]

    Slid: Exploiting spatial locality in input data as a computational reuse method for efficient cnn,

    F. Alantali, Y . Halawani, B. Mohammad, and M. Al-Qutayri, “Slid: Exploiting spatial locality in input data as a computational reuse method for efficient cnn,” IEEE Access, vol. 9, pp. 57 179–57 187, 2021

    2021

  2. [2]

    Bit-pragmatic deep neural network computing,

    J. Albericio, A. Delm ´as, P. Judd, S. Sharify, G. O’Leary, R. Genov, and A. Moshovos, “Bit-pragmatic deep neural network computing,” in Proceedings of the 50th annual IEEE/ACM international symposium on microarchitecture, 2017, pp. 382–394

    2017

  3. [3]

    Learning multiple layers of features from tiny images,

    K. Alex, “Learning multiple layers of features from tiny images,” https://www. cs. toronto. edu/kriz/learning-features-2009-TR. pdf , 2009

    2009

  4. [4]

    A multi-neural network acceleration architecture,

    E. Baek, D. Kwon, and J. Kim, “A multi-neural network acceleration architecture,” in 2020 ACM/IEEE 47th Annual International Symposium on Computer Architecture (ISCA) . IEEE, 2020, pp. 940–953

    2020

  5. [5]

    Uniq: Uniform noise injection for non-uniform quantization of neural networks,

    C. Baskin, N. Liss, E. Schwartz, E. Zheltonozhskii, R. Giryes, A. M. Bronstein, and A. Mendelson, “Uniq: Uniform noise injection for non-uniform quantization of neural networks,” ACM Transactions on Computer Systems (TOCS) , vol. 37, no. 1-4, pp. 1–15, 2021

    2021

  6. [6]

    A survey on generative diffusion models,

    H. Cao, C. Tan, Z. Gao, Y . Xu, G. Chen, P.-A. Heng, and S. Z. Li, “A survey on generative diffusion models,” IEEE Transactions on Knowledge and Data Engineering , 2024

    2024

  7. [7]

    Mix and match: A novel fpga-centric deep neural network quantization framework,

    S.-E. Chang, Y . Li, M. Sun, R. Shi, H. K.-H. So, X. Qian, Y . Wang, and X. Lin, “Mix and match: A novel fpga-centric deep neural network quantization framework,” in 2021 IEEE International Symposium on High-Performance Computer Architecture (HPCA) . IEEE, 2021, pp. 208–220

    2021

  8. [8]

    Point cloud acceleration by exploiting geometric similarity,

    C. Chen, X. Zou, H. Shao, Y . Li, and K. Li, “Point cloud acceleration by exploiting geometric similarity,” in Proceedings of the 56th Annual IEEE/ACM International Symposium on Microarchitecture , 2023, pp. 1135–1147

    2023

Show all 96 references
  1. [9]

    Characterization and analysis of text-to- image diffusion models,

    E. Cho, J. Bang, and M. Rhu, “Characterization and analysis of text-to- image diffusion models,” IEEE Computer Architecture Letters , 2024

    2024

  2. [10]

    Diffusion models in vision: A survey,

    F.-A. Croitoru, V . Hondru, R. T. Ionescu, and M. Shah, “Diffusion models in vision: A survey,” IEEE Transactions on Pattern Analysis and Machine Intelligence , 2023

    2023

  3. [11]

    Bit-tactical: A software/hardware approach to exploiting value and bit sparsity in neural networks,

    A. Delmas Lascorz, P. Judd, D. M. Stuart, Z. Poulos, M. Mahmoud, S. Sharify, M. Nikolic, K. Siu, and A. Moshovos, “Bit-tactical: A software/hardware approach to exploiting value and bit sparsity in neural networks,” in Proceedings of the Twenty-Fourth International Conference ...

    2019

  4. [12]

    Imagenet: A large-scale hierarchical image database,

    J. Deng, W. Dong, R. Socher, L.-J. Li, K. Li, and L. Fei-Fei, “Imagenet: A large-scale hierarchical image database,” in 2009 IEEE conference on computer vision and pattern recognition . Ieee, 2009, pp. 248–255

    2009

  5. [13]

    Diffusion models beat gans on image synthesis,

    P. Dhariwal and A. Nichol, “Diffusion models beat gans on image synthesis,” Advances in neural information processing systems , vol. 34, pp. 8780–8794, 2021

    2021

  6. [14]

    Sparse-dysta: Sparsity- aware dynamic and static scheduling for sparse multi-dnn workloads,

    H. Fan, S. I. Venieris, A. Kouris, and N. Lane, “Sparse-dysta: Sparsity- aware dynamic and static scheduling for sparse multi-dnn workloads,” in Proceedings of the 56th Annual IEEE/ACM International Symposium on Microarchitecture, 2023, pp. 353–366

    2023

  7. [15]

    Deltarnn: A power-efficient recurrent neural network accelerator,

    C. Gao, D. Neil, E. Ceolini, S.-C. Liu, and T. Delbruck, “Deltarnn: A power-efficient recurrent neural network accelerator,” in Proceedings of the 2018 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays, 2018, pp. 21–30

    2018

  8. [16]

    Edge- drnn: Recurrent neural network accelerator for edge inference,

    C. Gao, A. Rios-Navarro, X. Chen, S.-C. Liu, and T. Delbruck, “Edge- drnn: Recurrent neural network accelerator for edge inference,” IEEE Journal on Emerging and Selected Topics in Circuits and Systems , vol. 10, no. 4, pp. 419–432, 2020

    2020

  9. [17]

    Generative ai beyond llms: System implications of multi-modal generation,

    A. Golden, S. Hsia, F. Sun, B. Acun, B. Hosmer, Y . Lee, Z. DeVito, J. Johnson, G.-Y . Wei, D. Brooks et al. , “Generative ai beyond llms: System implications of multi-modal generation,” in 2024 IEEE Inter- national Symposium on Performance Analysis of Systems and Software (IS...

    2024

  10. [18]

    Sparten: A sparse tensor accelerator for convolutional neural networks,

    A. Gondimalla, N. Chesnut, M. Thottethodi, and T. Vijaykumar, “Sparten: A sparse tensor accelerator for convolutional neural networks,” in Proceedings of the 52nd Annual IEEE/ACM International Symposium on Microarchitecture, 2019, pp. 151–165

    2019

  11. [19]

    Eureka: Efficient tensor cores for one-sided unstructured sparsity in dnn inference,

    A. Gondimalla, M. Thottethodi, and T. Vijaykumar, “Eureka: Efficient tensor cores for one-sided unstructured sparsity in dnn inference,” in Proceedings of the 56th Annual IEEE/ACM International Symposium on Microarchitecture, 2023, pp. 324–337

    2023

  12. [20]

    Generative adversarial networks,

    I. Goodfellow, J. Pouget-Abadie, M. Mirza, B. Xu, D. Warde-Farley, S. Ozair, A. Courville, and Y . Bengio, “Generative adversarial networks,” Communications of the ACM , vol. 63, no. 11, pp. 139–144, 2020

    2020

  13. [21]

    Olive: Accelerating large language models via hardware- friendly outlier-victim pair quantization,

    C. Guo, J. Tang, W. Hu, J. Leng, C. Zhang, F. Yang, Y . Liu, M. Guo, and Y . Zhu, “Olive: Accelerating large language models via hardware- friendly outlier-victim pair quantization,” in Proceedings of the 50th Annual International Symposium on Computer Architecture , 2023, pp. 1–15

    2023

  14. [22]

    Ant: Exploiting adaptive numerical data type for low-bit deep neural network quantization,

    C. Guo, C. Zhang, J. Leng, Z. Liu, F. Yang, Y . Liu, M. Guo, and Y . Zhu, “Ant: Exploiting adaptive numerical data type for low-bit deep neural network quantization,” in 2022 55th IEEE/ACM International Symposium on Microarchitecture (MICRO) . IEEE, 2022, pp. 1414– 1433

    2022

  15. [23]

    20.2 a 28nm 74.34 tflops/w bf16 heterogenous cim- based accelerator exploiting denoising-similarity for diffusion models,

    R. Guo, L. Wang, X. Chen, H. Sun, Z. Yue, Y . Qin, H. Han, Y . Wang, F. Tu, S. Weiet al., “20.2 a 28nm 74.34 tflops/w bf16 heterogenous cim- based accelerator exploiting denoising-similarity for diffusion models,” in 2024 IEEE International Solid-State Circuits Conference (ISS...

    2024

  16. [24]

    Deep compression: Compressing deep neural networks with pruning, trained quantization and huffman coding,

    S. Han, H. Mao, and W. J. Dally, “Deep compression: Compressing deep neural networks with pruning, trained quantization and huffman coding,” arXiv preprint arXiv:1510.00149 , 2015

    2015 arXiv

  17. [25]

    Flexible diffusion modeling of long videos,

    W. Harvey, S. Naderiparizi, V . Masrani, C. Weilbach, and F. Wood, “Flexible diffusion modeling of long videos,” Advances in Neural Information Processing Systems , vol. 35, pp. 27 953–27 965, 2022

    2022

  18. [26]

    Ptqd: Accurate post-training quantization for diffusion models,

    Y . He, L. Liu, J. Liu, W. Wu, H. Zhou, and B. Zhuang, “Ptqd: Accurate post-training quantization for diffusion models,” Advances in Neural Information Processing Systems , vol. 36, 2024

    2024

  19. [27]

    Clipscore: A reference-free evaluation metric for image captioning,

    J. Hessel, A. Holtzman, M. Forbes, R. L. Bras, and Y . Choi, “Clipscore: A reference-free evaluation metric for image captioning,” arXiv preprint arXiv:2104.08718, 2021

    2021 arXiv

  20. [28]

    Gans trained by a two time-scale update rule converge to a local nash equilibrium,

    M. Heusel, H. Ramsauer, T. Unterthiner, B. Nessler, and S. Hochreiter, “Gans trained by a two time-scale update rule converge to a local nash equilibrium,” Advances in neural information processing systems , vol. 30, 2017

    2017

  21. [29]

    Denoising diffusion probabilistic models,

    J. Ho, A. Jain, and P. Abbeel, “Denoising diffusion probabilistic models,” Advances in neural information processing systems , vol. 33, pp. 6840– 6851, 2020

    2020

  22. [30]

    Cascaded diffusion models for high fidelity image generation,

    J. Ho, C. Saharia, W. Chan, D. J. Fleet, M. Norouzi, and T. Salimans, “Cascaded diffusion models for high fidelity image generation,” Journal of Machine Learning Research , vol. 23, no. 47, pp. 1–33, 2022

    2022

  23. [31]

    Learning a continuous and reconstructible latent space for hardware accelerator design,

    Q. Huang, C. Hong, J. Wawrzynek, M. Subedar, and Y . S. Shao, “Learning a continuous and reconstructible latent space for hardware accelerator design,” in 2022 IEEE International Symposium on Perfor- mance Analysis of Systems and Software (ISPASS) . IEEE, 2022, pp. 277–287

    2022

  24. [32]

    Tfmq-dm: Temporal feature maintenance quantization for diffusion models,

    Y . Huang, R. Gong, J. Liu, T. Chen, and X. Liu, “Tfmq-dm: Temporal feature maintenance quantization for diffusion models,” in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recogni- tion, 2024, pp. 7362–7371

    2024

  25. [33]

    Sibia: Signed bit-slice architecture for dense dnn acceleration with slice-level sparsity exploita- tion,

    D. Im, G. Park, Z. Li, J. Ryu, and H.-J. Yoo, “Sibia: Signed bit-slice architecture for dense dnn acceleration with slice-level sparsity exploita- tion,” in 2023 IEEE International Symposium on High-Performance Computer Architecture (HPCA). IEEE, 2023, pp. 69–80

    2023

  26. [34]

    Mercury: Accelerating dnn training by exploiting input similarity,

    V . Janfaza, K. Weston, M. Razavi, S. Mandal, F. Mahmud, A. Hilty, and A. Muzahid, “Mercury: Accelerating dnn training by exploiting input similarity,” in 2023 IEEE International Symposium on High- Performance Computer Architecture (HPCA) . IEEE, 2023, pp. 638– 650

    2023

  27. [35]

    Sparsity-aware and re-configurable npu architecture for samsung flagship mobile soc,

    J.-W. Jang, S. Lee, D. Kim, H. Park, A. S. Ardestani, Y . Choi, C. Kim, Y . Kim, H. Yu, H. Abdel-Azizet al., “Sparsity-aware and re-configurable npu architecture for samsung flagship mobile soc,” in 2021 ACM/IEEE 48th Annual International Symposium on Computer Architecture (IS...

    2021

  28. [36]

    Dissecting the nvidia volta gpu architecture via microbenchmarking,

    Z. Jia, M. Maggioni, B. Staiger, and D. P. Scarpazza, “Dissecting the nvidia volta gpu architecture via microbenchmarking,” arXiv preprint arXiv:1804.06826, 2018

    2018 arXiv

  29. [37]

    Tpu v4: An optically reconfigurable supercomputer for machine learning with hardware sup- port for embeddings,

    N. Jouppi, G. Kurian, S. Li, P. Ma, R. Nagarajan, L. Nai, N. Patil, S. Subramanian, A. Swing, B. Towles et al. , “Tpu v4: An optically reconfigurable supercomputer for machine learning with hardware sup- port for embeddings,” in Proceedings of the 50th Annual International Sym...

    2023

  30. [38]

    Stripes: Bit-serial deep neural network computing,

    P. Judd, J. Albericio, T. Hetherington, T. M. Aamodt, and A. Moshovos, “Stripes: Bit-serial deep neural network computing,” in 2016 49th Annual IEEE/ACM International Symposium on Microarchitecture (MI- CRO). IEEE, 2016, pp. 1–12

    2016

  31. [39]

    Bk-sdm: Archi- tecturally compressed stable diffusion for efficient text-to-image gen- eration,

    B.-K. Kim, H.-K. Song, T. Castells, and S. Choi, “Bk-sdm: Archi- tecturally compressed stable diffusion for efficient text-to-image gen- eration,” in Workshop on Efficient Systems for Foundation Models@ ICML2023, 2023

    2023

  32. [40]

    An energy- efficient gan accelerator with on-chip training for domain-specific op- timization,

    S. Kim, S. Kang, D. Han, S. Kim, S. Kim, and H.-J. Yoo, “An energy- efficient gan accelerator with on-chip training for domain-specific op- timization,” IEEE Journal of Solid-State Circuits , vol. 56, no. 10, pp. 2968–2980, 2021

    2021

  33. [41]

    Airgun: Adaptive granularity quantization for accelerating large language models,

    S. Kim, H. Lee, S. Kim, C. Kim, and W. W. Ro, “Airgun: Adaptive granularity quantization for accelerating large language models,” in 2024 IEEE 42nd International Conference on Computer Design (ICCD). IEEE, 2024, pp. 645–652

    2024

  34. [42]

    Auto-encoding variational bayes,

    D. P. Kingma and M. Welling, “Auto-encoding variational bayes,” arXiv preprint arXiv:1312.6114, 2013

    2013 arXiv

  35. [43]

    Cambricon-d: Full-network differential acceleration for diffusion models,

    W. Kong, Y . Hao, Q. Guo, Y . Zhao, X. Song, X. Li, M. Zou, Z. Du, R. Zhang, C. Liu et al., “Cambricon-d: Full-network differential acceleration for diffusion models,” in 2024 ACM/IEEE 51st Annual International Symposium on Computer Architecture (ISCA) . IEEE, 2024, pp. 903–914

    2024

  36. [44]

    On fast sampling of diffusion probabilistic models,

    Z. Kong and W. Ping, “On fast sampling of diffusion probabilistic models,” arXiv preprint arXiv:2106.00132 , 2021

    2021 arXiv

  37. [45]

    Lang, Introduction to linear algebra

    S. Lang, Introduction to linear algebra . Springer Science & Business Media, 2012

    2012

  38. [47]

    Shapeshifter: Enabling fine-grain data width adaptation in deep learning,

    A. D. Lascorz, S. Sharify, I. Edo, D. M. Stuart, O. M. Awad, P. Judd, M. Mahmoud, M. Nikolic, K. Siu, Z. Poulos et al. , “Shapeshifter: Enabling fine-grain data width adaptation in deep learning,” in Pro- ceedings of the 52nd Annual IEEE/ACM International Symposium on Microarc...

    2019

  39. [48]

    Exploit- ing inherent properties of complex numbers for accelerating complex valued neural networks,

    H. Lee, H. Jang, S. Kim, S. Kim, W. Cho, and W. W. Ro, “Exploit- ing inherent properties of complex numbers for accelerating complex valued neural networks,” in Proceedings of the 56th Annual IEEE/ACM International Symposium on Microarchitecture , 2023, pp. 1121–1134

    2023

  40. [49]

    Independently recurrent neural network (indrnn): Building a longer and deeper rnn,

    S. Li, W. Li, C. Cook, C. Zhu, and Y . Gao, “Independently recurrent neural network (indrnn): Building a longer and deeper rnn,” in Proceed- ings of the IEEE conference on computer vision and pattern recognition, 2018, pp. 5457–5466

    2018

  41. [50]

    Q-diffusion: Quantizing diffusion models,

    X. Li, Y . Liu, L. Lian, H. Yang, Z. Dong, D. Kang, S. Zhang, and K. Keutzer, “Q-diffusion: Quantizing diffusion models,” in Proceedings of the IEEE/CVF International Conference on Computer Vision , 2023, pp. 17 535–17 545

    2023

  42. [51]

    Snapfusion: Text-to-image diffusion model on mobile devices within two seconds,

    Y . Li, H. Wang, Q. Jin, J. Hu, P. Chemerys, Y . Fu, Y . Wang, S. Tulyakov, and J. Ren, “Snapfusion: Text-to-image diffusion model on mobile devices within two seconds,”Advances in Neural Information Processing Systems, vol. 36, 2024

    2024

  43. [52]

    E-rnn: Design optimization for efficient recurrent neural networks in fpgas,

    Z. Li, C. Ding, S. Wang, W. Wen, Y . Zhuo, C. Liu, Q. Qiu, W. Xu, X. Lin, X. Qian et al., “E-rnn: Design optimization for efficient recurrent neural networks in fpgas,” in 2019 IEEE International Symposium on High Performance Computer Architecture (HPCA) . IEEE, 2019, pp. 69–80

    2019

  44. [53]

    Microsoft coco: Common objects in context,

    T.-Y . Lin, M. Maire, S. Belongie, J. Hays, P. Perona, D. Ramanan, P. Doll ´ar, and C. L. Zitnick, “Microsoft coco: Common objects in context,” in Computer Vision–ECCV 2014: 13th European Conference, Zurich, Switzerland, September 6-12, 2014, Proceedings, Part V 13 . Springer,...

    2014

  45. [54]

    Pseudo numerical methods for diffusion models on manifolds,

    L. Liu, Y . Ren, Z. Lin, and Z. Zhao, “Pseudo numerical methods for diffusion models on manifolds,” arXiv preprint arXiv:2202.09778, 2022

    2022 arXiv

  46. [55]

    S2ta: Exploiting structured sparsity for energy-efficient mobile cnn acceleration,

    Z.-G. Liu, P. N. Whatmough, Y . Zhu, and M. Mattina, “S2ta: Exploiting structured sparsity for energy-efficient mobile cnn acceleration,” in 2022 IEEE International Symposium on High-Performance Computer Architecture (HPCA). IEEE, 2022, pp. 573–586

    2022

  47. [56]

    Repaint: Inpainting using denoising diffusion probabilistic models,

    A. Lugmayr, M. Danelljan, A. Romero, F. Yu, R. Timofte, and L. Van Gool, “Repaint: Inpainting using denoising diffusion probabilistic models,” in Proceedings of the IEEE/CVF conference on computer vision and pattern recognition , 2022, pp. 11 461–11 471

    2022

  48. [57]

    Latte: Latent diffusion transformer for video generation,

    X. Ma, Y . Wang, G. Jia, X. Chen, Z. Liu, Y .-F. Li, C. Chen, and Y . Qiao, “Latte: Latent diffusion transformer for video generation,”arXiv preprint arXiv:2401.03048, 2024

    2024 arXiv

  49. [58]

    Diffy: A d ´ej`a vu-free differ- ential deep neural network accelerator,

    M. Mahmoud, K. Siu, and A. Moshovos, “Diffy: A d ´ej`a vu-free differ- ential deep neural network accelerator,” in 2018 51st Annual IEEE/ACM International Symposium on Microarchitecture (MICRO). IEEE, 2018, pp. 134–147

    2018

  50. [59]

    Cacti 6.0: A tool to model large caches,

    N. Muralimanohar, R. Balasubramonian, and N. P. Jouppi, “Cacti 6.0: A tool to model large caches,” HP laboratories, vol. 27, p. 28, 2009

    2009

  51. [60]

    Improved denoising diffusion probabilis- tic models,

    A. Q. Nichol and P. Dhariwal, “Improved denoising diffusion probabilis- tic models,” in International conference on machine learning . PMLR, 2021, pp. 8162–8171

    2021

  52. [61]

    Glide: Towards photorealistic image gen- eration and editing with text-guided diffusion models,

    A. Q. Nichol, P. Dhariwal, A. Ramesh, P. Shyam, P. Mishkin, B. Mcgrew, I. Sutskever, and M. Chen, “Glide: Towards photorealistic image gen- eration and editing with text-guided diffusion models,” in International Conference on Machine Learning . PMLR, 2022, pp. 16 784–16 804

    2022

  53. [62]

    Deep reuse: Streamline cnn inference on the fly via coarse-grained computation reuse,

    L. Ning and X. Shen, “Deep reuse: Streamline cnn inference on the fly via coarse-grained computation reuse,” in Proceedings of the ACM International Conference on Supercomputing , 2019, pp. 438–448

    2019

  54. [63]

    Nvidia a100 tensor core gpu architecture,

    NVIDIA, “Nvidia a100 tensor core gpu architecture,” https://images.nvidia.com/aem-dam/en-zz/Solutions/data-center/nvidia- ampere-architecture-whitepaper.pdf, 2020

    2020

  55. [64]

    Scnn: An accelerator for compressed-sparse convolutional neural networks,

    A. Parashar, M. Rhu, A. Mukkara, A. Puglielli, R. Venkatesan, B. Khailany, J. Emer, S. W. Keckler, and W. J. Dally, “Scnn: An accelerator for compressed-sparse convolutional neural networks,” ACM SIGARCH computer architecture news, vol. 45, no. 2, pp. 27–40, 2017

    2017

  56. [65]

    Pytorch: An imperative style, high-performance deep learning library,

    A. Paszke, S. Gross, F. Massa, A. Lerer, J. Bradbury, G. Chanan, T. Killeen, Z. Lin, N. Gimelshein, L. Antiga et al. , “Pytorch: An imperative style, high-performance deep learning library,” Advances in neural information processing systems , vol. 32, 2019

    2019

  57. [66]

    Scalable diffusion models with transformers,

    W. Peebles and S. Xie, “Scalable diffusion models with transformers,” in Proceedings of the IEEE/CVF International Conference on Computer Vision, 2023, pp. 4195–4205

    2023

  58. [67]

    Computation reuse in dnns by exploiting input similarity,

    M. Riera, J.-M. Arnau, and A. Gonz ´alez, “Computation reuse in dnns by exploiting input similarity,” in 2018 ACM/IEEE 45th Annual Inter- national Symposium on Computer Architecture (ISCA) . IEEE, 2018, pp. 57–68

    2018

  59. [68]

    High- resolution image synthesis with latent diffusion models,

    R. Rombach, A. Blattmann, D. Lorenz, P. Esser, and B. Ommer, “High- resolution image synthesis with latent diffusion models,” in Proceedings of the IEEE/CVF conference on computer vision and pattern recognition, 2022, pp. 10 684–10 695

    2022

  60. [69]

    Dreambooth: Fine tuning text-to-image diffusion models for subject- driven generation,

    N. Ruiz, Y . Li, V . Jampani, Y . Pritch, M. Rubinstein, and K. Aberman, “Dreambooth: Fine tuning text-to-image diffusion models for subject- driven generation,” in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , 2023, pp. 22 500–22 510

    2023

  61. [70]

    Bitblade: Area and energy- efficient precision-scalable neural network accelerator with bitwise summation,

    S. Ryu, H. Kim, W. Yi, and J.-J. Kim, “Bitblade: Area and energy- efficient precision-scalable neural network accelerator with bitwise summation,” in Proceedings of the 56th Annual Design Automation Conference 2019, 2019, pp. 1–6

    2019

  62. [71]

    Similarity- aware cnn for efficient video recognition at the edge,

    A. Sabet, J. Hare, B. M. Al-Hashimi, and G. V . Merrett, “Similarity- aware cnn for efficient video recognition at the edge,”IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems , vol. 41, no. 11, pp. 4901–4914, 2021

    2021

  63. [72]

    Palette: Image-to-image diffusion models,

    C. Saharia, W. Chan, H. Chang, C. Lee, J. Ho, T. Salimans, D. Fleet, and M. Norouzi, “Palette: Image-to-image diffusion models,” in ACM SIGGRAPH 2022 conference proceedings , 2022, pp. 1–10

    2022

  64. [73]

    Photorealistic text-to-image diffusion models with deep language understanding,

    C. Saharia, W. Chan, S. Saxena, L. Li, J. Whang, E. L. Denton, K. Ghasemipour, R. Gontijo Lopes, B. Karagol Ayan, T. Salimans et al., “Photorealistic text-to-image diffusion models with deep language understanding,” Advances in neural information processing systems , vol. 35, ...

    2022

  65. [74]

    Image super-resolution via iterative refinement,

    C. Saharia, J. Ho, W. Chan, T. Salimans, D. J. Fleet, and M. Norouzi, “Image super-resolution via iterative refinement,” IEEE transactions on pattern analysis and machine intelligence, vol. 45, no. 4, pp. 4713–4726, 2022

    2022

  66. [75]

    Improved techniques for training gans,

    T. Salimans, I. Goodfellow, W. Zaremba, V . Cheung, A. Radford, and X. Chen, “Improved techniques for training gans,” Advances in neural information processing systems , vol. 29, 2016

    2016

  67. [76]

    Noise estimation for generative diffusion models,

    R. San-Roman, E. Nachmani, and L. Wolf, “Noise estimation for generative diffusion models,” arXiv preprint arXiv:2104.02600 , 2021

    2021 arXiv

  68. [77]

    Post-training quantiza- tion on diffusion models,

    Y . Shang, Z. Yuan, B. Xie, B. Wu, and Y . Yan, “Post-training quantiza- tion on diffusion models,” in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , 2023, pp. 1972–1981

    2023

  69. [78]

    Bit fusion: Bit-level dynamically composable architecture for accelerating deep neural network,

    H. Sharma, J. Park, N. Suda, L. Lai, B. Chau, J. K. Kim, V . Chandra, and H. Esmaeilzadeh, “Bit fusion: Bit-level dynamically composable architecture for accelerating deep neural network,” in 2018 ACM/IEEE 45th Annual International Symposium on Computer Architecture (ISCA). IE...

    2018

  70. [79]

    Neuron-level fuzzy memoization in rnns,

    F. Silfa, G. Dot, J.-M. Arnau, and A. Gonz `alez, “Neuron-level fuzzy memoization in rnns,” in Proceedings of the 52nd Annual IEEE/ACM International Symposium on Microarchitecture , 2019, pp. 782–793

    2019

  71. [80]

    Temporal dynamic quantization for diffusion models,

    J. So, J. Lee, D. Ahn, H. Kim, and E. Park, “Temporal dynamic quantization for diffusion models,” Advances in Neural Information Processing Systems, vol. 36, 2024

    2024

  72. [81]

    Denoising diffusion implicit models,

    J. Song, C. Meng, and S. Ermon, “Denoising diffusion implicit models,” arXiv:2010.02502, October 2020. [Online]. Available: https: //arxiv.org/abs/2010.02502

    2010 arXiv

  73. [82]

    Drq: dynamic region-based quantization for deep neural network ac- celeration,

    Z. Song, B. Fu, F. Wu, Z. Jiang, L. Jiang, N. Jing, and X. Liang, “Drq: dynamic region-based quantization for deep neural network ac- celeration,” in 2020 ACM/IEEE 47th Annual International Symposium on Computer Architecture (ISCA) . IEEE, 2020, pp. 1010–1021

    2020

  74. [83]

    Ucf101: A dataset of 101 human actions classes from videos in the wild,

    K. Soomro, A. R. Zamir, and M. Shah, “Ucf101: A dataset of 101 human actions classes from videos in the wild,”arXiv preprint arXiv:1212.0402, 2012

    2012 arXiv

  75. [84]

    Freepdk: An open-source variation-aware design kit,

    J. E. Stine, I. Castellanos, M. Wood, J. Henson, F. Love, W. R. Davis, P. D. Franzon, M. Bucher, S. Basavarajaiah, J. Oh et al. , “Freepdk: An open-source variation-aware design kit,” in 2007 IEEE international conference on Microelectronic Systems Education (MSE’07) . IEEE, 2...

    2007

  76. [85]

    Strang, Linear algebra and its applications , 2012

    G. Strang, Linear algebra and its applications , 2012

    2012

  77. [86]

    Convolutional tensor-train lstm for spatio-temporal learning,

    J. Su, W. Byeon, J. Kossaifi, F. Huang, J. Kautz, and A. Anandkumar, “Convolutional tensor-train lstm for spatio-temporal learning,” Advances in Neural Information Processing Systems , vol. 33, pp. 13 714–13 726, 2020

    2020

  78. [87]

    Spatten: Efficient sparse attention architecture with cascade token and head pruning,

    H. Wang, Z. Zhang, and S. Han, “Spatten: Efficient sparse attention architecture with cascade token and head pruning,” in 2021 IEEE International Symposium on High-Performance Computer Architecture (HPCA). IEEE, 2021, pp. 97–110

    2021

  79. [88]

    Dual- side sparse tensor core,

    Y . Wang, C. Zhang, Z. Xie, C. Guo, Y . Liu, and J. Leng, “Dual- side sparse tensor core,” in 2021 ACM/IEEE 48th Annual International Symposium on Computer Architecture (ISCA) . IEEE, 2021, pp. 1083– 1095

    2021

  80. [89]

    Diffusion models: A comprehensive survey of methods and applications,

    L. Yang, Z. Zhang, Y . Song, S. Hong, R. Xu, Y . Zhao, W. Zhang, B. Cui, and M.-H. Yang, “Diffusion models: A comprehensive survey of methods and applications,” ACM Computing Surveys , vol. 56, no. 4, pp. 1–39, 2023

    2023

  81. [90]

    Lsun: Construction of a large-scale image dataset using deep learning with humans in the loop,

    F. Yu, A. Seff, Y . Zhang, S. Song, T. Funkhouser, and J. Xiao, “Lsun: Construction of a large-scale image dataset using deep learning with humans in the loop,” arXiv preprint arXiv:1506.03365 , 2015

    2015 arXiv

  82. [91]

    Mokey: Enabling narrow fixed-point inference for out-of-the-box floating-point transformer models,

    A. H. Zadeh, M. Mahmoud, A. Abdelhadi, and A. Moshovos, “Mokey: Enabling narrow fixed-point inference for out-of-the-box floating-point transformer models,” in Proceedings of the 49th Annual International Symposium on Computer Architecture , 2022, pp. 888–901

    2022

  83. [92]

    Adding conditional control to text-to-image diffusion models,

    L. Zhang, A. Rao, and M. Agrawala, “Adding conditional control to text-to-image diffusion models,” in Proceedings of the IEEE/CVF International Conference on Computer Vision , 2023, pp. 3836–3847

    2023

  84. [93]

    Mo- tiondiffuse: Text-driven human motion generation with diffusion model,

    M. Zhang, Z. Cai, L. Pan, F. Hong, X. Guo, L. Yang, and Z. Liu, “Mo- tiondiffuse: Text-driven human motion generation with diffusion model,” IEEE Transactions on Pattern Analysis and Machine Intelligence , 2024

    2024

  85. [94]

    Training for multi- resolution inference using reusable quantization terms,

    S. Q. Zhang, B. McDanel, H. Kung, and X. Dong, “Training for multi- resolution inference using reusable quantization terms,” in Proceedings of the 26th ACM International Conference on Architectural Support for Programming Languages and Operating Systems , 2021, pp. 845–860

    2021

  86. [95]

    η-lstm: Co-designing highly-efficient large lstm training via exploiting memory-saving and architectural design opportunities,

    X. Zhang, H. Xia, D. Zhuang, H. Sun, X. Fu, M. B. Taylor, and S. L. Song, “ η-lstm: Co-designing highly-efficient large lstm training via exploiting memory-saving and architectural design opportunities,” in 2021 ACM/IEEE 48th Annual International Symposium on Computer Architec...

    2021

  87. [96]

    Truncated diffusion proba- bilistic models,

    H. Zheng, P. He, W. Chen, and M. Zhou, “Truncated diffusion proba- bilistic models,” arXiv preprint arXiv:2202.09671 , vol. 1, no. 3.1, p. 2, 2022

    2022 arXiv

  88. [97]

    Open-sora: Democratizing efficient video production for all,

    Z. Zheng, X. Peng, T. Yang, C. Shen, S. Li, H. Liu, Y . Zhou, T. Li, and Y . You, “Open-sora: Democratizing efficient video production for all,” March 2024. [Online]. Available: https://github.com/hpcaitech/Open- Sora

    2024

Pith tools

Reviewed August 10, 2026 · model on record in the stance chip above.