Pith. sign in

REVIEW 3 major objections 8 minor 3 cited by

BiDM: Pushing the Limit of Quantization for Diffusion Models

T0 review · 3 major / 8 minor · reviewed 2026-08-11 · deepseek-v4-flash

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

Pith's one-line read Diffusion models can be pushed all the way to 1-bit weights and activations without collapsing, provided the binary structure tracks timestep-varying activation ranges and training is guided by patch-level attention distillation.

desk verdict First real W1A1 diffusion model with a genuine FID win, but the headline 52.7x OPs savings does not survive the paper's own runtime measurements. read the letter →

arxiv 2412.05926 v1 pith:C2XIDFXZ submitted 2024-12-08 cs.CV

Xingyu Zheng , Xianglong Liu , Yichen Bian , Xudong Ma , Yulun Zhang , Jiakai Wang , Jinyang Guo , Haotong Qin This is my paper · ORCID
classification cs.CV
keywords diffusionmodelsbinarization1-bitquantizationweightsandactivationsmodelcompressionefficientinferenceknowledgedistillationlatent
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 high-quality images but need large memory and compute, and standard quantization usually stops at 4 bits or more because 1-bit binarization makes generation degrade or collapse. This paper tries to establish that full 1-bit binarization of diffusion models is viable if the binary structure is timestep-aware and training is guided patch-wise by a full-precision teacher. On a latent diffusion model, it reports a W1A1 model that generates recognizable LSUN-Bedrooms images with FID 22.74 (lower is better), versus 59.44 for the strongest prior binary baseline, while claiming 28.0x storage and 52.7x theoretical operation savings. If the claims hold, fully binarized diffusion models become a practical compression target for low-resource deployment rather than a degenerate extreme.

What carries the argument

The load-bearing mechanism is the pair (TBS, SPD). TBS modifies the classic binary-convolution approximation $I * W \approx (\mathrm{sign}(I) \otimes \mathrm{sign}(W)) \odot (A * k\alpha)$: instead of the fixed averaging filter $k$, it learns a tiny depth-1 convolution $k$, so the binary activation quantizer can match timestep-dependent activation ranges; it also adds a cross-timestep feature connection $\mathrm{Concat}(D^{t-1}_m, (1-\alpha^{t-1}_{m+1})U^{t-1}_{m+1} + \alpha^{t-1}_{m+1}U^{t}_{m+1})$ with learnable scalars, letting the current step borrow information from the similar previous step. SPD partitions intermediate features into $p^2$ patches, computes normalized spatial attention maps $P_{i,j}P_{i,j}^{\mathsf{T}}$ for binary and full-precision models, and sums patch-wise L2 losses into the training objective $L = L_{\mathrm{DM}} + \frac{\lambda}{2d+1}\sum_m L^m_{\mathrm{SPD}}$. Together, these components restore activation-range fidelity and give the discrete model a spatially local optimization target.

What would settle it

Run the released BiDM model end-to-end on the same GPU or edge device, measure total sampling latency against the full-precision model, and compare the ratio with the claimed 52.7x OPs savings; the paper's own appendix already reports an 8.07x per-convolution speedup on a Snapdragon 855 Plus, so an end-to-end ratio near 8x rather than 52.7x would falsify the practical-efficiency claim.

Watch

Extended reading notes

Core claim

The central claim is that a diffusion model can be fully binarized—both weights and activations reduced to 1 bit—without collapsing, provided the quantization respects two properties of diffusion models: activation ranges shift dramatically across long denoising horizons yet stay similar between adjacent timesteps, and image-generation features are spatially local. BiDM implements this with a Timestep-friendly Binary Structure (TBS), which makes the scaling factor of the binary convolution learnable through a tiny convolution so activation ranges can adapt per timestep, and connects each timestep's features to the previous timestep's through a learnable blending weight; it also adds Space Patched Distillation (SPD), which splits intermediate features into patches and enforces normalized attention-map agreement with a full-precision teacher patch by patch. On LDM-4 for LSUN-Bedrooms 256x256, the W1A1 BiDM achieves FID 22.74, down from 106.62 for the XNOR-style baseline and 59.44 for the strongest prior W1A1 baseline, while keeping the 28.0x storage and 52.7x OPs savings of the binary baseline.

Load-bearing premise

The headline efficiency claim assumes that the extra full-precision operations introduced by TBS—channel averaging, the tiny convolution, pointwise multiplications, and cross-timestep blending—add negligible inference cost; the paper's own appendix runtime measurement shows the binary model with these additions runs at 21.86 ms per convolution versus 17.70 ms for a simpler binary baseline and only 8.07x faster than full precision, not 52.7x.

Editorial extensions

If this is right

  • Fully binarized latent diffusion models can generate viewable images: on LSUN-Bedrooms 256x256, BiDM reaches FID 22.74, a 2.6x improvement over the strongest prior W1A1 baseline at FID 59.44.
  • Pixel-space diffusion models also survive full binarization: on CIFAR-10, BiDM raises the Inception Score from 4.23 for the XNOR-style baseline to 5.18 and reduces FID by roughly 28% relative to that baseline.
  • The model inherits the binary baseline's 28.0x storage reduction and 52.7x theoretical operation savings, with only minor added floating-point work for the scaling and cross-timestep connections, according to the paper's efficiency analysis.
  • The two design ideas—timestep-adaptive activation scaling and patch-level attention distillation—are presented as general remedies for the temporal and spatial properties of diffusion models, not as fixes tied to a single architecture.
  • BiDM is, per the paper, the only fully binarized diffusion model whose generated samples are visually acceptable, which would open 1-bit deployment of diffusion models in low-resource settings.

Reading between the lines

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

  • One testable extension: applying TBS's learnable timestep-adaptive activation scaling to other time-varying quantized models, such as video diffusion or autoregressive models with recurrent states, would show whether the temporal adaptivity transfers beyond image diffusion.
  • The paper's own training-efficiency table indicates that cross-timestep connections roughly double the number of sampling steps needed during training, so part of BiDM's accuracy gain is bought with extra training compute; equal-wall-clock-time comparisons may be the fairer benchmark.
  • If the extra TBS operations (channel averaging, tiny convolution, pointwise scaling) were fused into the binary kernels or precomputed offline, the gap between the theoretical 52.7x OPs saving and the measured 8.07x runtime speedup could narrow; this is an engineering path the paper notes but does not demonstrate.
  • SPD's per-patch attention loss could plausibly be replaced by other local patch statistics, such as per-patch Gram matrices, and still help; comparing variants on the same binary U-Net would isolate what part of the patch mechanism matters.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

3 major / 8 minor

Summary. The paper proposes BiDM, a fully binarized (W1A1) diffusion model method. It introduces Timestep-friendly Binary Structure (TBS), which uses learnable activation scaling and cross-timestep feature connections, and Space Patched Distillation (SPD), which applies attention-guided distillation on spatial patches. Experiments on DDIM (CIFAR-10) and LDM-4/LDM-8 (LSUN-Bedrooms, LSUN-Churches, FFHQ) report large FID improvements over binarization baselines, e.g., 22.74 vs. 59.44 on LSUN-Bedrooms, with claimed 28.0x storage and 52.7x OPs savings. The authors state that BiDM is the first fully binarized diffusion model capable of generating viewable images.

Significance. If the reported results replicate, this is a substantial empirical advance: it would be the first W1A1 binarization of latent diffusion models with non-degenerate generative quality, and the ablation study (Table 3) gives evidence that both TBS and SPD contribute to the improvement. The paper provides code, training settings, and an unusually transparent runtime benchmark in Appendix B. The main weakness is that the headline efficiency claim (52.7x OPs savings) is a theoretical bit-operation count that is not matched by the paper's own measured 8.07x wall-clock speedup, and the cross-timestep connections impose additional overhead not included in that measurement. The central FID claim is plausible and well supported by the ablations, but the efficiency framing needs correction.

major comments (3)
  1. [Abstract, §4.3, Table 4, Appendix B] The abstract and §4.3 present '28.0x storage and 52.7x OPs savings' as headline benefits without clearly labeling them as theoretical bit-operation counts. Appendix B, Table 8, however, reports a measured per-convolution runtime of 176,371.0 us for FP32 vs. 21,864.8 us for XNOR-Net/BiDM, an 8.07x speedup, and the simpler DoReFa baseline runs at 17,699.5 us, about 23% faster than BiDM. The 52.7x figure is obtained from the formula OPs = BOPs/64 + FLOPs, which omits the full-precision steps (3)-(6) of the XNOR scaling that Table 8 shows consume roughly 19% of BiDM's latency, and it also does not include the cross-timestep blending operations of TBS. Please report measured end-to-end or per-layer speedup alongside the theoretical OPs, and revise the abstract and §4.3 so that the reader is not led to expect a 52.7x practical speedup.
  2. [§3.3, Eq. (13)-(15), Appendix A] The patch size p is never specified. Equation (13) divides features into p^2 patches and Eq. (15) sums the patch-wise losses, but Appendix A gives learning rates, lambda, alpha_init, and the number of TBS connections without ever stating the value of p used for SPD. Since SPD is one of the two central contributions, omitting p makes the method irreproducible from the text. Please state the exact p used for each model and dataset, and clarify whether p is tuned.
  3. [§3.2, Eq. (12)] Equation (12) is ambiguous about which features are used in the cross-timestep connection. It writes Concat(D^{t-1}_m(·), (1-alpha^{t-1}_{m+1}) U^{t-1}_{m+1}(·) + alpha^{t-1}_{m+1} U^t_{m+1}(·)), i.e., the first argument is the previous timestep's encoder feature, whereas the standard U-Net skip connection in Eq. (5) uses D^t_m. This could mean that the method replaces the current encoder feature with the previous one, or it could be a typo for D^t_m. Please clarify the exact data flow, including how the previous-step features are cached and what happens at the first sampling step.
minor comments (8)
  1. [§3.3 heading] The heading 'Space Patched Distilation' contains a typo; it should be 'Distillation'.
  2. [Appendix B, Table 8] The table column header 'FID↓/convolution' mixes an image-quality metric with a runtime measurement; the table reports runtime only, so the header should be reworded.
  3. [References] Reference [4], 'Binarized diffusion model for image super-resolution', appears in the bibliography but is never cited in the body. If that prior work already performs full binarization of a diffusion model, the 'first fully binarized' claim in the abstract needs qualification.
  4. [§4 and Appendix A] The paper states in the NeurIPS checklist that random seeds are fixed, but no error bars or multiple-seed results are reported for the main FID/IS numbers in Tables 1-3. Please state explicitly whether the reported numbers are single runs and, if feasible, add variance information for the main comparisons.
  5. [Appendix A] Please specify the optimizer (e.g., Adam), weight decay, and any learning-rate schedule used for QAT; the current text gives learning rate and batch size but not the optimizer.
  6. [§4, LDM-4/LDM-8] The terms LDM-4 and LDM-8 are used without definition in the main text; please state that they refer to the latent-space downsampling factor of the LDM backbone.
  7. [Eq. (15)] The norm in Eq. (15) is written as ||.||_2 but is applied to matrices; please state explicitly that this is the Frobenius norm.
  8. [Appendix B, Table 9] The table is labeled 'Tabel 9'; please correct the spelling.

Circularity Check

0 steps flagged · score 1.0 of 10

No significant circularity: the FID/IS results are independent external empirical benchmarks, and the self-citations to BinaryDM are background motivation rather than load-bearing evidence.

full rationale

BiDM is an empirical system paper. Its central claims are generative quality (FID, IS, sFID, precision, recall) measured against full-precision models and external baselines (XNOR, XNOR++, DoReFa, ReActNet, ReSTE, BBCU, EfficientDM) on standard datasets; these numbers are not fitted parameters of the proposed method and cannot reduce to the method's inputs by construction. The two proposed techniques, TBS (learnable tiny convolution plus cross-timestep connections) and SPD (patch-wise attention-guided distillation loss), are validated by ablations in Tables 3, 5, 6, and 7; the reported gains are empirical rather than definitional. The paper does cite the same group's BinaryDM work [77] to motivate the difficulty of L2 distillation and to position the 'first fully binarized DM' claim, but that citation is background and is corroborated by the paper's own L2-versus-SPD ablation; it is not used as an external oracle that forces the result. The strongest caveat is not circularity: the headline 52.7x OPs savings is a theoretical complexity count (1/64 BOPs + FLOPs, Appendix A), while the paper's own Appendix B reports an 8.07x measured speedup for the same single convolution, with the extra TBS full-precision steps (3)-(6) consuming roughly 19% of latency. That is an overclaim or consistency weakness in how 'excellent' efficiency is characterized, but it is a mismatch between a defined complexity metric and measured runtime, not a derivation that reduces to its own inputs. Accordingly no circular step can be quoted with Eq. X = Eq. Y by construction, and the self-citations are not load-bearing.

Assumptions & free parameters 6 free parameters · 4 assumptions · 0 invented entities

The central result depends on several hand-set hyperparameters (lambda, alpha, connection count, learning rate, and patch size p, which is unreported). The assumptions are standard for BNN and distillation work, but the OPs-formula assumption contradicts the paper's own runtime measurement.

free parameters (6)
  • lambda (SPD loss weight) = 4 (default), 3e-2 (CIFAR-10), 1e-2 (LDM)
    Chosen by authors; directly controls the distillation loss strength in Eq. 16 and Appendix A.
  • alpha_init (cross-timestep connection initialization) = 0.3
    Initial value for learnable scaling factors in Eq. 12; set to 0.3 for all datasets.
  • Number of TBS connections = 2 (CIFAR-10), 8 (LDM)
    Ablated in Table 6; 8 connections selected for main LDM results based on FID/sFID.
  • Patch size p for SPD = not specified
    Eq. 13 partitions features into p^2 patches, but the paper does not report p; missing detail needed for reproduction.
  • Learning rate = 6e-5 (CIFAR-10), 2e-5 (LDM)
    Set per dataset in Appendix A; affects convergence and final FID.
  • Training iterations = 100k (CIFAR-10), 200k (LDM)
    All experiments run for these many iterations; longer training would likely change FID.
assumptions (4)
  • domain assumption Straight-through estimator provides usable gradients for binarized weights and activations.
    Used in Eq. 10 and all baseline comparisons; standard in BNN training but unverified here.
  • domain assumption The fixed full-precision teacher provides reliable feature targets for distillation.
    SPD (Eq. 13-15) distills from a pretrained FP model; if teacher features are not aligned, the loss may mislead.
  • domain assumption FID computed with LSUN reference batches is a valid measure of generation quality.
    All claims of improvement rest on FID/sFID metrics; no alternative perceptual metrics are reported.
  • domain assumption The OPs formula (1/64 BOPs + FLOPs) approximates real hardware efficiency.
    Used to claim 52.7x savings; the appendix runtime measurement shows a much smaller real speedup, so this assumption is questionable.

how reviews work

0 comments
Cite this review

Pith. "Pith review of BiDM: Pushing the Limit of Quantization for Diffusion Models." pith.science (2026). https://pith.science/paper/C2XIDFXZ

@misc{pith2026241205926,
  author       = {Pith},
  title        = {Pith review of: BiDM: Pushing the Limit of Quantization for Diffusion Models},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/C2XIDFXZ}},
  note         = {Machine review of arXiv:2412.05926}
}
abstract

Diffusion models (DMs) have been significantly developed and widely used in various applications due to their excellent generative qualities. However, the expensive computation and massive parameters of DMs hinder their practical use in resource-constrained scenarios. As one of the effective compression approaches, quantization allows DMs to achieve storage saving and inference acceleration by reducing bit-width while maintaining generation performance. However, as the most extreme quantization form, 1-bit binarization causes the generation performance of DMs to face severe degradation or even collapse. This paper proposes a novel method, namely BiDM, for fully binarizing weights and activations of DMs, pushing quantization to the 1-bit limit. From a temporal perspective, we introduce the Timestep-friendly Binary Structure (TBS), which uses learnable activation binarizers and cross-timestep feature connections to address the highly timestep-correlated activation features of DMs. From a spatial perspective, we propose Space Patched Distillation (SPD) to address the difficulty of matching binary features during distillation, focusing on the spatial locality of image generation tasks and noise estimation networks. As the first work to fully binarize DMs, the W1A1 BiDM on the LDM-4 model for LSUN-Bedrooms 256$\times$256 achieves a remarkable FID of 22.74, significantly outperforming the current state-of-the-art general binarization methods with an FID of 59.44 and invalid generative samples, and achieves up to excellent 28.0 times storage and 52.7 times OPs savings. The code is available at https://github.com/Xingyu-Zheng/BiDM .

Figures

Figures reproduced from arXiv: 2412.05926 by the authors.

Figure 1
Figure 1. Overview of BiDM with Timestep-friendly Binary Structure, which improves DM architec￾ture temporally, and Space Patched Distillation, which enhances DM optimization spatially. efficient computation in inference. Some existing works thus apply quantization to compress DMs, aiming to compress and accelerate them while maintaining the quality of generation. Among them, 1-bit quantization, namely binarization, can achie… view at source ↗
Figure 2
Figure 2. (a) The activation range of the 4th convolutional layer of the full-precision DDIM model on [PITH_FULL_IMAGE:figures/full_fig_p004_2.png] view at source ↗
Figure 3
Figure 3. An illustration of TBS. Since the feature space is [PITH_FULL_IMAGE:figures/full_fig_p006_3.png] view at source ↗
Figures from the paper (6 more)
Figure 4
Figure 4. Figure 4: Visualization of the last TimeStepBlock’s output of the LDM model on LSUN-bedroom [PITH_FULL_IMAGE:figures/full_fig_p007_4.png]
Figure 5
Figure 5. Figure 5: Visualization of samples generated by the W1A1 baseline and our BiDM. BiDM is the first [PITH_FULL_IMAGE:figures/full_fig_p009_5.png]
Figure 6
Figure 6. Figure 6: (a) Training iterations and training loss under different settings. (b) Training time and [PITH_FULL_IMAGE:figures/full_fig_p019_6.png]
Figure 7
Figure 7. Figure 7: Generation results of BiDM and baselines on the LSUN-Bedrooms dataset. [PITH_FULL_IMAGE:figures/full_fig_p019_7.png]
Figure 8
Figure 8. Figure 8: Generation results of BiDM and baselines on the LSUN-Churches dataset. [PITH_FULL_IMAGE:figures/full_fig_p020_8.png]
Figure 9
Figure 9. Figure 9: Generation results of BiDM and baselines on the FFHQ dataset. [PITH_FULL_IMAGE:figures/full_fig_p020_9.png]

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

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

  1. MPQ-DMv2: Flexible Residual Mixed Precision Quantization for Low-Bit Diffusion Models with Temporal Distillation

    cs.CV 2025-07 conditional novelty 6.0 of 10

    MPQ-DMv2 adds binary residual quantization, temporal relation distillation, and SVD-initialized LoRA to mixed-precision quantization, improving low-bit diffusion model generation quality.

  2. Q-VDiT: Towards Accurate Quantization and Distillation of Video-Generation Diffusion Transformers

    cs.CV 2025-05 conditional novelty 6.0 of 10

    Q-VDiT quantizes video diffusion transformers to 3-4 bit weights by adding a learned rank-1 error correction (TQE) and a temporal distribution distillation loss (TMD), nearly doubling VBench scene consistency at W3A6 ...

  3. Diffusion Model Quantization: A Review

    cs.CV 2025-05 conditional novelty 3.0 of 10

    A structured review and benchmark of methods for quantizing diffusion models, with a taxonomy of post-training and quantization-aware approaches and an analysis of quantization artifacts.

Reference graph

Works this paper leans on

93 extracted references · 41 canonical work pages · cited by 3 Pith papers

  1. [1]

    Reducing the Computational Cost of Deep Generative Models with Binary Neural Networks

    Thomas Bird, Friso H Kingma, and David Barber. Reducing the computational cost of deep generative models with binary neural networks. arXiv preprint arXiv:2010.13476, 2020

    work page Pith review arXiv 2010

  2. [2]

    Xnor-net++: Improved binary neural networks

    Adrian Bulat and Georgios Tzimiropoulos. Xnor-net++: Improved binary neural networks. arXiv preprint arXiv:1909.13863, pages 1–12, 2019

    arXiv 1909

  3. [3]

    Rethinking differentiable search for mixed-precision neural networks

    Zhaowei Cai and Nuno Vasconcelos. Rethinking differentiable search for mixed-precision neural networks. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 2349–2358, 2020

    2020

  4. [4]

    Binarized Diffusion Model for Image Super-Resolution

    Zheng Chen, Haotong Qin, Yong Guo, Xiongfei Su, Xin Yuan, Linghe Kong, and Yulun Zhang. Binarized diffusion model for image super-resolution. arXiv preprint arXiv:2406.05723, 2024

    work page Pith review arXiv 2024

  5. [5]

    Binarized neural networks: Training deep neural networks with weights and activations constrained to+ 1 or-1

    Matthieu Courbariaux, Itay Hubara, Daniel Soudry, Ran El-Yaniv, and Yoshua Bengio. Binarized neural networks: Training deep neural networks with weights and activations constrained to+ 1 or-1. arXiv preprint arXiv:1602.02830, pages 1–11, 2016

    arXiv 2016

  6. [6]

    Learned step size quantization

    Steven K Esser, Jeffrey L McKinstry, Deepika Bablani, Rathinakumar Appuswamy, and Dhar- mendra S Modha. Learned step size quantization. In International Conference on Learning Representations, pages 1–12, 2019

    2019

  7. [7]

    Structural pruning for diffusion models

    Gongfan Fang, Xinyin Ma, and Xinchao Wang. Structural pruning for diffusion models. arXiv preprint arXiv:2305.10924, 2023

    arXiv 2023

  8. [8]

    Larq: An open-source library for training binarized neural networks

    Lukas Geiger and Plumerai Team. Larq: An open-source library for training binarized neural networks. Journal of Open Source Software, 5(45):1746, 2020

    2020

Show all 93 references
  1. [9]

    A survey of quantization methods for efficient neural network inference

    Amir Gholami, Sehoon Kim, Zhen Dong, Zhewei Yao, Michael W Mahoney, and Kurt Keutzer. A survey of quantization methods for efficient neural network inference. In Low-Power Com- puter Vision, pages 291–326. Chapman and Hall/CRC, 2022

    2022

  2. [10]

    A survey of low-bit large language models: Basics, systems, and algorithms

    Ruihao Gong, Yifu Ding, Zining Wang, Chengtao Lv, Xingyu Zheng, Jinyang Du, Haotong Qin, Jinyang Guo, Michele Magno, and Xianglong Liu. A survey of low-bit large language models: Basics, systems, and algorithms. arXiv preprint arXiv:2409.16694, 2024

    2024

  3. [11]

    Semantic-aware knowledge distillation with parameter-free feature uniformization

    Guangyu Guo, Longfei Han, Le Wang, Dingwen Zhang, and Junwei Han. Semantic-aware knowledge distillation with parameter-free feature uniformization. Visual Intelligence, 1(1):6, 2023

    2023

  4. [12]

    Jointpruning: Pruning networks along multiple dimensions for efficient point cloud processing

    Jinyang Guo, Jiaheng Liu, and Dong Xu. Jointpruning: Pruning networks along multiple dimensions for efficient point cloud processing. IEEE Transactions on Circuits and Systems for Video Technology, 32(6):3659–3672, 2021

    2021

  5. [13]

    3d-pruning: A model compression framework for efficient 3d action recognition

    Jinyang Guo, Jiaheng Liu, and Dong Xu. 3d-pruning: A model compression framework for efficient 3d action recognition. IEEE Transactions on Circuits and Systems for Video Technology, 32(12):8717–8729, 2022

    2022

  6. [14]

    Multidimensional pruning and its extension: A unified framework for model compression

    Jinyang Guo, Dong Xu, and Wanli Ouyang. Multidimensional pruning and its extension: A unified framework for model compression. IEEE Transactions on Neural Networks and Learning Systems, 2023

    2023

  7. [15]

    Efficientdm: Efficient quantization-aware fine-tuning of low-bit diffusion models

    Yefei He, Jing Liu, Weijia Wu, Hong Zhou, and Bohan Zhuang. Efficientdm: Efficient quantization-aware fine-tuning of low-bit diffusion models. arXiv preprint arXiv:2310.03270, 2023

    2023 arXiv

  8. [16]

    Bivit: Extremely compressed binary vision transformers

    Yefei He, Zhenyu Lou, Luoming Zhang, Jing Liu, Weijia Wu, Hong Zhou, and Bohan Zhuang. Bivit: Extremely compressed binary vision transformers. In Proceedings of the IEEE/CVF International Conference on Computer Vision, pages 5651–5663, 2023

    2023

  9. [17]

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

    Martin Heusel, Hubert Ramsauer, Thomas Unterthiner, Bernhard Nessler, and Sepp Hochreiter. Gans trained by a two time-scale update rule converge to a local nash equilibrium. Advances in neural information processing systems, 30, 2017. 11

    2017

  10. [18]

    Imagen video: High definition video generation with diffusion models

    Jonathan Ho, William Chan, Chitwan Saharia, Jay Whang, Ruiqi Gao, Alexey Gritsenko, Diederik P Kingma, Ben Poole, Mohammad Norouzi, David J Fleet, et al. Imagen video: High definition video generation with diffusion models. arXiv preprint arXiv:2210.02303, 2022

    arXiv

  11. [19]

    Denoising diffusion probabilistic models

    Jonathan Ho, Ajay Jain, and Pieter Abbeel. Denoising diffusion probabilistic models. Advances in neural information processing systems, 33:6840–6851, 2020

    2020

  12. [20]

    Billm: Pushing the limit of post-training quantization for llms

    Wei Huang, Yangdong Liu, Haotong Qin, Ying Li, Shiming Zhang, Xianglong Liu, Michele Magno, and Xiaojuan Qi. Billm: Pushing the limit of post-training quantization for llms. arXiv preprint arXiv:2402.04291, 2024

    2024 arXiv

  13. [21]

    How good are low-bit quantized llama3 models? an empirical study

    Wei Huang, Xudong Ma, Haotong Qin, Xingyu Zheng, Chengtao Lv, Hong Chen, Jie Luo, Xiaojuan Qi, Xianglong Liu, and Michele Magno. How good are low-bit quantized llama3 models? an empirical study. arXiv preprint arXiv:2404.14047, 2024

    2024 arXiv

  14. [22]

    Tfmq-dm: Temporal feature maintenance quantization for diffusion models

    Yushi Huang, Ruihao Gong, Jing Liu, Tianlong Chen, and Xianglong Liu. Tfmq-dm: Temporal feature maintenance quantization for diffusion models. arXiv preprint arXiv:2311.16503, 2023

    2023 arXiv

  15. [23]

    Binarized neural networks

    Itay Hubara, Matthieu Courbariaux, Daniel Soudry, Ran El-Yaniv, and Yoshua Bengio. Binarized neural networks. Advances in Neural Information Processing Systems, 29:1–9, 2016

    2016

  16. [24]

    Diff-tts: A denoising diffusion model for text-to-speech

    Myeonghun Jeong, Hyeongju Kim, Sung Jun Cheon, Byoung Jin Choi, and Nam Soo Kim. Diff-tts: A denoising diffusion model for text-to-speech. arXiv preprint arXiv:2104.01409, 2021

    2021 arXiv

  17. [25]

    A style-based generator architecture for generative adversarial networks

    Tero Karras, Samuli Laine, and Timo Aila. A style-based generator architecture for generative adversarial networks. In Proceedings of the IEEE/CVF conference on computer vision and pattern recognition, pages 4401–4410, 2019

    2019

  18. [26]

    Auto-encoding variational bayes

    Diederik P Kingma and Max Welling. Auto-encoding variational bayes. arXiv preprint arXiv:1312.6114, 2013

    2013 arXiv

  19. [27]

    Learning multiple layers of features from tiny images

    Alex Krizhevsky, Geoffrey Hinton, et al. Learning multiple layers of features from tiny images. pages 1–60, 2009

    2009

  20. [28]

    Binaryvit: pushing binary vision transformers towards convolutional models

    Phuoc-Hoan Charles Le and Xinlin Li. Binaryvit: pushing binary vision transformers towards convolutional models. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 4664–4673, 2023

    2023

  21. [29]

    Q-diffusion: Quantizing diffusion models

    Xiuyu Li, Yijiang Liu, Long Lian, Huanrui Yang, Zhen Dong, Daniel Kang, Shanghang Zhang, and Kurt Keutzer. Q-diffusion: Quantizing diffusion models. In Proceedings of the IEEE/CVF International Conference on Computer Vision, pages 17535–17545, 2023

    2023

  22. [30]

    Q-dm: An efficient low- bit quantized diffusion model

    Yanjing Li, Sheng Xu, Xianbin Cao, Xiao Sun, and Baochang Zhang. Q-dm: An efficient low- bit quantized diffusion model. In Thirty-seventh Conference on Neural Information Processing Systems, 2023

    2023

  23. [31]

    Pseudo numerical methods for diffusion models on manifolds

    Luping Liu, Yi Ren, Zhijie Lin, and Zhou Zhao. Pseudo numerical methods for diffusion models on manifolds. arXiv preprint arXiv:2202.09778, 2022

    2022 arXiv

  24. [32]

    Bi-real net: Binarizing deep network towards real-network performance

    Zechun Liu, Wenhan Luo, Baoyuan Wu, Xin Yang, Wei Liu, and Kwang-Ting Cheng. Bi-real net: Binarizing deep network towards real-network performance. International Journal of Computer Vision, 128:202–219, 2020

    2020

  25. [33]

    Reactnet: Towards precise binary neural network with generalized activation functions

    Zechun Liu, Zhiqiang Shen, Marios Savvides, and Kwang-Ting Cheng. Reactnet: Towards precise binary neural network with generalized activation functions. In Proceedings of the European Conference on Computer Vision, pages 143–159. Springer, 2020

    2020

  26. [34]

    Dpm-solver: A fast ode solver for diffusion probabilistic model sampling in around 10 steps

    Cheng Lu, Yuhao Zhou, Fan Bao, Jianfei Chen, Chongxuan Li, and Jun Zhu. Dpm-solver: A fast ode solver for diffusion probabilistic model sampling in around 10 steps. Advances in Neural Information Processing Systems, 35:5775–5787, 2022

    2022

  27. [35]

    Dpm- solver++: Fast solver for guided sampling of diffusion probabilistic models

    Cheng Lu, Yuhao Zhou, Fan Bao, Jianfei Chen, Chongxuan Li, and Jun Zhu. Dpm- solver++: Fast solver for guided sampling of diffusion probabilistic models. arXiv preprint arXiv:2211.01095, 2022. 12

    2022 arXiv

  28. [36]

    A comprehensive survey on knowledge distillation of diffusion models

    Weijian Luo. A comprehensive survey on knowledge distillation of diffusion models. arXiv preprint arXiv:2304.04262, 2023

    2023 arXiv

  29. [37]

    Ptq4sam: Post-training quantization for segment anything

    Chengtao Lv, Hong Chen, Jinyang Guo, Yifu Ding, and Xianglong Liu. Ptq4sam: Post-training quantization for segment anything. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 15941–15951, 2024

    2024

  30. [38]

    Deepcache: Accelerating diffusion models for free

    Xinyin Ma, Gongfan Fang, and Xinchao Wang. Deepcache: Accelerating diffusion models for free. arXiv preprint arXiv:2312.00858, 2023

    2023 arXiv

  31. [39]

    Training binary neural networks with real-to-binary convolutions

    Brais Martinez, Jing Yang, Adrian Bulat, and Georgios Tzimiropoulos. Training binary neural networks with real-to-binary convolutions. arXiv preprint arXiv:2003.11535, 2020

    2003 arXiv

  32. [40]

    Vidm: Video implicit diffusion models

    Kangfu Mei and Vishal Patel. Vidm: Video implicit diffusion models. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 37, pages 9117–9125, 2023

    2023

  33. [41]

    On distillation of guided diffusion models

    Chenlin Meng, Robin Rombach, Ruiqi Gao, Diederik Kingma, Stefano Ermon, Jonathan Ho, and Tim Salimans. On distillation of guided diffusion models. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 14297–14306, 2023

    2023

  34. [42]

    Symbolic music generation with diffusion models

    Gautam Mittal, Jesse Engel, Curtis Hawthorne, and Ian Simon. Symbolic music generation with diffusion models. arXiv preprint arXiv:2103.16091, 2021

    2021 arXiv

  35. [43]

    Permutation invariant graph generation via score-based generative modeling

    Chenhao Niu, Yang Song, Jiaming Song, Shengjia Zhao, Aditya Grover, and Stefano Ermon. Permutation invariant graph generation via score-based generative modeling. In International Conference on Artificial Intelligence and Statistics, pages 4474–4484. PMLR, 2020

    2020

  36. [44]

    Scalable diffusion models with transformers

    William Peebles and Saining Xie. Scalable diffusion models with transformers. In Proceedings of the IEEE/CVF International Conference on Computer Vision, pages 4195–4205, 2023

    2023

  37. [45]

    Grad- tts: A diffusion probabilistic model for text-to-speech

    Vadim Popov, Ivan V ovk, Vladimir Gogoryan, Tasnima Sadekova, and Mikhail Kudinov. Grad- tts: A diffusion probabilistic model for text-to-speech. In International Conference on Machine Learning, pages 8599–8608. PMLR, 2021

    2021

  38. [46]

    Forward and backward information retention for accurate binary neural networks

    Haotong Qin, Ruihao Gong, Xianglong Liu, Mingzhu Shen, Ziran Wei, Fengwei Yu, and Jingkuan Song. Forward and backward information retention for accurate binary neural networks. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , pages 2250–2259, 2020

    2020

  39. [47]

    Accurate lora-finetuning quantization of llms via information retention

    Haotong Qin, Xudong Ma, Xingyu Zheng, Xiaoyang Li, Yang Zhang, Shouda Liu, Jie Luo, Xi- anglong Liu, and Michele Magno. Accurate lora-finetuning quantization of llms via information retention. arXiv preprint arXiv:2402.05445, 2024

    2024 arXiv

  40. [48]

    Distribution-sensitive information retention for accurate binary neural network

    Haotong Qin, Xiangguo Zhang, Ruihao Gong, Yifu Ding, Yi Xu, and Xianglong Liu. Distribution-sensitive information retention for accurate binary neural network. International Journal of Computer Vision, 131(1):26–47, 2023

    2023

  41. [49]

    Xnor-net: Imagenet classification using binary convolutional neural networks

    Mohammad Rastegari, Vicente Ordonez, Joseph Redmon, and Ali Farhadi. Xnor-net: Imagenet classification using binary convolutional neural networks. In Proceedings of the European Conference on Computer Vision, pages 525–542. Springer, 2016

    2016

  42. [50]

    High-resolution image synthesis with latent diffusion models, 2021

    Robin Rombach, Andreas Blattmann, Dominik Lorenz, Patrick Esser, and Björn Ommer. High-resolution image synthesis with latent diffusion models, 2021

    2021

  43. [51]

    U-net: Convolutional networks for biomedical image segmentation

    Olaf Ronneberger, Philipp Fischer, and Thomas Brox. U-net: Convolutional networks for biomedical image segmentation. In Medical image computing and computer-assisted intervention–MICCAI 2015: 18th international conference, Munich, Germany, October 5-9, 2015, proceedings, part ...

    2015

  44. [52]

    Improved techniques for training gans

    Tim Salimans, Ian Goodfellow, Wojciech Zaremba, Vicki Cheung, Alec Radford, and Xi Chen. Improved techniques for training gans. Advances in neural information processing systems, 29, 2016

    2016

  45. [53]

    Progressive distillation for fast sampling of diffusion models

    Tim Salimans and Jonathan Ho. Progressive distillation for fast sampling of diffusion models. arXiv preprint arXiv:2202.00512, 2022. 13

    2022 arXiv

  46. [54]

    Post-training quantization on diffusion models

    Yuzhang Shang, Zhihang Yuan, Bin Xie, Bingzhe Wu, and Yan Yan. Post-training quantization on diffusion models. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 1972–1981, 2023

    1972

  47. [55]

    Temporal dynamic quantization for diffusion models

    Junhyuk So, Jungwon Lee, Daehyun Ahn, Hyungjun Kim, and Eunhyeok Park. Temporal dynamic quantization for diffusion models. Advances in Neural Information Processing Systems, 36, 2024

    2024

  48. [56]

    Denoising diffusion implicit models

    Jiaming Song, Chenlin Meng, and Stefano Ermon. Denoising diffusion implicit models. arXiv preprint arXiv:2010.02502, 2020

    2010 arXiv

  49. [57]

    Generative modeling by estimating gradients of the data distribution

    Yang Song and Stefano Ermon. Generative modeling by estimating gradients of the data distribution. Advances in neural information processing systems, 32, 2019

    2019

  50. [58]

    Score-based generative modeling through stochastic differential equations

    Yang Song, Jascha Sohl-Dickstein, Diederik P Kingma, Abhishek Kumar, Stefano Ermon, and Ben Poole. Score-based generative modeling through stochastic differential equations. arXiv preprint arXiv:2011.13456, 2020

    2011 arXiv

  51. [59]

    Recent advances in implicit representation-based 3d shape generation

    Jia-Mu Sun, Tong Wu, and Lin Gao. Recent advances in implicit representation-based 3d shape generation. Visual Intelligence, 2(1):9, 2024

    2024

  52. [60]

    Sparsity-inducing binarized neural networks

    Peisong Wang, Xiangyu He, Gang Li, Tianli Zhao, and Jian Cheng. Sparsity-inducing binarized neural networks. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 34, pages 12192–12199, 2020

    2020

  53. [61]

    Binary latent diffusion

    Ze Wang, Jiang Wang, Zicheng Liu, and Qiang Qiu. Binary latent diffusion. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 22576–22585, 2023

    2023

  54. [62]

    Estimator meets equilibrium perspective: A rectified straight through estimator for binary neural networks training

    Xiao-Ming Wu, Dian Zheng, Zuhao Liu, and Wei-Shi Zheng. Estimator meets equilibrium perspective: A rectified straight through estimator for binary neural networks training. In Proceedings of the IEEE/CVF International Conference on Computer Vision , pages 17055– 17064, 2023

    2023

  55. [63]

    Basic binary convolution unit for binarized image restoration network.arXiv preprint arXiv:2210.00405, 2022

    Bin Xia, Yulun Zhang, Yitong Wang, Yapeng Tian, Wenming Yang, Radu Timofte, and Luc Van Gool. Basic binary convolution unit for binarized image restoration network.arXiv preprint arXiv:2210.00405, 2022

    2022 arXiv

  56. [64]

    Robustmq: benchmarking robustness of quantized models

    Yisong Xiao, Aishan Liu, Tianyuan Zhang, Haotong Qin, Jinyang Guo, and Xianglong Liu. Robustmq: benchmarking robustness of quantized models. Visual Intelligence, 1(1):30, 2023

    2023

  57. [65]

    Learning frequency domain approximation for binary neural networks

    Yixing Xu, Kai Han, Chang Xu, Yehui Tang, Chunjing Xu, and Yunhe Wang. Learning frequency domain approximation for binary neural networks. Advances in Neural Information Processing Systems, 34:25553–25565, 2021

    2021

  58. [66]

    Hierarchical painter: Chinese landscape painting restoration with fine-grained styles

    Zhekai Xu, Haohong Shang, Shaoze Yang, Ruiqi Xu, Yichao Yan, Yixuan Li, Jiawei Huang, Howard C Yang, and Jianjun Zhou. Hierarchical painter: Chinese landscape painting restoration with fine-grained styles. Visual Intelligence, 1(1):19, 2023

    2023

  59. [67]

    Recu: Reviving the dead weights in binary neural networks

    Zihan Xu, Mingbao Lin, Jianzhuang Liu, Jie Chen, Ling Shao, Yue Gao, Yonghong Tian, and Rongrong Ji. Recu: Reviving the dead weights in binary neural networks. In Proceedings of the IEEE/CVF International Conference on Computer Vision, pages 5198–5208, 2021

    2021

  60. [68]

    Dialoguenerf: Towards realistic avatar face-to-face conversation video generation

    Yichao Yan, Zanwei Zhou, Zi Wang, Jingnan Gao, and Xiaokang Yang. Dialoguenerf: Towards realistic avatar face-to-face conversation video generation. Visual Intelligence, 2(1):24, 2024

    2024

  61. [69]

    Gwq: Group-wise quantization framework for neural networks

    Jiaming Yang, Chenwei Tang, Caiyang Yu, and Jiancheng Lv. Gwq: Group-wise quantization framework for neural networks. In Asian Conference on Machine Learning, pages 1526–1541. PMLR, 2024

    2024

  62. [70]

    Quantization networks

    Jiwei Yang, Xu Shen, Jun Xing, Xinmei Tian, Houqiang Li, Bing Deng, Jianqiang Huang, and Xian-sheng Hua. Quantization networks. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 7308–7316, 2019. 14

    2019

  63. [71]

    Full-precision free binary graph neural networks

    Kai-Lang Yao and Wu-Jun Li. Full-precision free binary graph neural networks. 2021

    2021

  64. [72]

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

    Fisher Yu, Ari Seff, Yinda Zhang, Shuran Song, Thomas Funkhouser, and Jianxiong 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

  65. [73]

    Improving deep metric learning via self-distillation and online batch diffusion process

    Zelong Zeng, Fan Yang, Hong Liu, and Shin’ichi Satoh. Improving deep metric learning via self-distillation and online batch diffusion process. Visual Intelligence, 2(1):18, 2024

    2024

  66. [74]

    Dabnn: A super fast inference framework for binary neural networks on arm devices

    Jianhao Zhang, Yingwei Pan, Ting Yao, He Zhao, and Tao Mei. Dabnn: A super fast inference framework for binary neural networks on arm devices. In Proceedings of the 27th ACM International Conference on Multimedia, pages 2272–2275, 2019

    2019

  67. [75]

    Flexible residual binarization for image super-resolution

    Yulun Zhang, Haotong Qin, Zixiang Zhao, Xianglong Liu, Martin Danelljan, and Fisher Yu. Flexible residual binarization for image super-resolution. In Ruslan Salakhutdinov, Zico Kolter, Katherine Heller, Adrian Weller, Nuria Oliver, Jonathan Scarlett, and Felix Berkenkamp, edit...

    2024

  68. [76]

    Dc-solver: Improving predictor-corrector diffusion sampler via dynamic compensation

    Wenliang Zhao, Haolin Wang, Jie Zhou, and Jiwen Lu. Dc-solver: Improving predictor-corrector diffusion sampler via dynamic compensation. arXiv preprint arXiv:2409.03755, 2024

    2024 arXiv

  69. [77]

    Binarydm: Towards accurate binarization of diffusion model

    Xingyu Zheng, Haotong Qin, Xudong Ma, Mingyuan Zhang, Haojie Hao, Jiakai Wang, Zixiang Zhao, Jinyang Guo, and Xianglong Liu. Binarydm: Towards accurate binarization of diffusion model. arXiv preprint arXiv:2404.05662, 2024

    2024 arXiv

  70. [78]

    Dorefa-net: Training low bitwidth convolutional neural networks with low bitwidth gradients.arXiv preprint arXiv:1606.06160, pages 1–13, 2016

    Shuchang Zhou, Yuxin Wu, Zekun Ni, Xinyu Zhou, He Wen, and Yuheng Zou. Dorefa-net: Training low bitwidth convolutional neural networks with low bitwidth gradients.arXiv preprint arXiv:1606.06160, pages 1–13, 2016. 15 A Experiment Settings We adopt several classic binarization ...

    2016 arXiv

  71. [79]

    Guidelines: • The answer NA means that the abstract and introduction do not include the claims made in the paper

    Claims Question: Do the main claims made in the abstract and introduction accurately reflect the paper’s contributions and scope? Answer: [Yes] Justification: We make the main claims made in the abstract and introduction accurately reflect the paper’s contributions and scope. ...

  72. [80]

    Limitations

    Limitations Question: Does the paper discuss the limitations of the work performed by the authors? Answer: [Yes] Justification: The paper discusses the limitations of the work in section4. Guidelines: • The answer NA means that the paper has no limitation while the answer No m...

  73. [81]

    Guidelines: • The answer NA means that the paper does not include theoretical results

    Theory Assumptions and Proofs Question: For each theoretical result, does the paper provide the full set of assumptions and a complete (and correct) proof? Answer: [NA] 21 Justification: The paper does not include theoretical results. Guidelines: • The answer NA means that the...

  74. [82]

    Guidelines: • The answer NA means that the paper does not include experiments

    Experimental Result Reproducibility Question: Does the paper fully disclose all the information needed to reproduce the main ex- perimental results of the paper to the extent that it affects the main claims and/or conclusions of the paper (regardless of whether the code and da...

  75. [83]

    Guidelines: • The answer NA means that paper does not include experiments requiring code

    Open access to data and code 22 Question: Does the paper provide open access to the data and code, with sufficient instruc- tions to faithfully reproduce the main experimental results, as described in supplemental material? Answer: [Yes] Justification: The paper provides open ...

  76. [84]

    Guidelines: • The answer NA means that the paper does not include experiments

    Experimental Setting/Details Question: Does the paper specify all the training and test details (e.g., data splits, hyper- parameters, how they were chosen, type of optimizer, etc.) necessary to understand the results? Answer: [Yes] Justification: The paper specifies all the d...

  77. [85]

    Guidelines: • The answer NA means that the paper does not include experiments

    Experiment Statistical Significance Question: Does the paper report error bars suitably and correctly defined or other appropriate information about the statistical significance of the experiments? Answer: [Yes] Justification: The paper ensure the reproducibility of the experi...

  78. [86]

    Guidelines: • The answer NA means that the paper does not include experiments

    Experiments Compute Resources Question: For each experiment, does the paper provide sufficient information on the com- puter resources (type of compute workers, memory, time of execution) needed to reproduce the experiments? Answer: [Yes] Justification: The paper provides suff...

  79. [87]

    Guidelines: • The answer NA means that the authors have not reviewed the NeurIPS Code of Ethics

    Code Of Ethics Question: Does the research conducted in the paper conform, in every respect, with the NeurIPS Code of Ethics https://neurips.cc/public/EthicsGuidelines? Answer: [Yes] Justification: The research conducted in the paper conform, in every respect, with the NeurIPS...

  80. [88]

    Guidelines: • The answer NA means that there is no societal impact of the work performed

    Broader Impacts Question: Does the paper discuss both potential positive societal impacts and negative societal impacts of the work performed? Answer: [NA] Justification: There is no societal impact of the work performed. Guidelines: • The answer NA means that there is no soci...

  81. [89]

    Guidelines: • The answer NA means that the paper poses no such risks

    Safeguards Question: Does the paper describe safeguards that have been put in place for responsible release of data or models that have a high risk for misuse (e.g., pretrained language models, image generators, or scraped datasets)? Answer: [NA] Justification: The paper poses...

  82. [90]

    Guidelines: • The answer NA means that the paper does not use existing assets

    Licenses for existing assets Question: Are the creators or original owners of assets (e.g., code, data, models), used in the paper, properly credited and are the license and terms of use explicitly mentioned and properly respected? Answer: [Yes] Justification: The paper cites ...

  83. [91]

    Guidelines: • The answer NA means that the paper does not release new assets

    New Assets Question: Are new assets introduced in the paper well documented and is the documentation provided alongside the assets? Answer: [Yes] Justification: The details of the new assets are introduced in the section 4 and the section A. Guidelines: • The answer NA means t...

  84. [92]

    Guidelines: • The answer NA means that the paper does not involve crowdsourcing nor research with human subjects

    Crowdsourcing and Research with Human Subjects Question: For crowdsourcing experiments and research with human subjects, does the paper include the full text of instructions given to participants and screenshots, if applicable, as well as details about compensation (if any)? A...

  85. [93]

    Guidelines: • The answer NA means that the paper does not involve crowdsourcing nor research with human subjects

    Institutional Review Board (IRB) Approvals or Equivalent for Research with Human Subjects Question: Does the paper describe potential risks incurred by study participants, whether such risks were disclosed to the subjects, and whether Institutional Review Board (IRB) approvals...

Pith tools

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