Cited 0 time in
Enhancing Generalization in Data-Free Quantization via Mixup-Class Prompting
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Park, Jiwoong | - |
| dc.contributor.author | Lee, Chaeun | - |
| dc.contributor.author | Choi, Yongseok | - |
| dc.contributor.author | Park, Sein | - |
| dc.contributor.author | Hong, Deokki | - |
| dc.contributor.author | Choi, Jungwook | - |
| dc.date.accessioned | 2026-04-21T05:00:10Z | - |
| dc.date.available | 2026-04-21T05:00:10Z | - |
| dc.date.issued | 2026-02 | - |
| dc.identifier.issn | 2473-9936 | - |
| dc.identifier.issn | 2473-9944 | - |
| dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/212278 | - |
| dc.description.abstract | Post-training quantization (PTQ) improves efficiency but struggles with limited calibration data, especially under privacy constraints. Data-free quantization (DFQ) mitigates this by generating synthetic images using generative models such as generative adversarial networks (GANs) and text-conditioned latent diffusion models (LDMs), while applying existing PTQ algorithms. However, the relationship between generated synthetic images and the generalizability of the quantized model during PTQ remains under-explored. Without investigating this relationship, synthetic images generated by previous prompt engineering methods based on single-class prompts suffer from issues such as polysemy, leading to performance degradation. We propose mixup-class prompt, a mixup-based text prompting strategy that fuses multiple class labels at the text prompt level to generate diverse, robust synthetic data. This approach enhances generalization, and improves optimization stability in PTQ. We provide quantitative insights through gradient norm and generalization error analysis. Experiments on convolutional neural networks (CNNs) and vision transformers (ViTs) show that our method consistently outperforms state-of-the-art DFQ methods like GenQ. Furthermore, it pushes the performance boundary in extremely low-bit scenarios, achieving new state-of-the-art accuracy in challenging 2-bit weight, 4-bit activation (W2A4) quantization. Our code is available at https://github.com/aiha-lab/Mixup-class-Prompting | - |
| dc.format.extent | 10 | - |
| dc.language | 영어 | - |
| dc.language.iso | ENG | - |
| dc.publisher | Institute of Electrical and Electronics Engineers Inc. | - |
| dc.title | Enhancing Generalization in Data-Free Quantization via Mixup-Class Prompting | - |
| dc.type | Article | - |
| dc.publisher.location | 미국 | - |
| dc.identifier.doi | 10.1109/ICCVW69036.2025.00422 | - |
| dc.identifier.scopusid | 2-s2.0-105035197045 | - |
| dc.identifier.bibliographicCitation | Proceedings - 2025 IEEE/CVF International Conference on Computer Vision Workshops, ICCV-W 2025, pp 4061 - 4070 | - |
| dc.citation.title | Proceedings - 2025 IEEE/CVF International Conference on Computer Vision Workshops, ICCV-W 2025 | - |
| dc.citation.startPage | 4061 | - |
| dc.citation.endPage | 4070 | - |
| dc.type.docType | Conference paper | - |
| dc.description.isOpenAccess | N | - |
| dc.description.journalRegisteredClass | scopus | - |
| dc.subject.keywordPlus | Convolutional neural networks | - |
| dc.subject.keywordPlus | Data privacy | - |
| dc.subject.keywordPlus | Generative adversarial networks | - |
| dc.subject.keywordAuthor | data-free quantization | - |
| dc.subject.keywordAuthor | mixup augmentation | - |
| dc.subject.keywordAuthor | prompt engineering | - |
| dc.subject.keywordAuthor | text-conditioned diffusion | - |
| dc.identifier.url | https://ieeexplore.ieee.org/document/11375332 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
222, Wangsimni-ro, Seongdong-gu, Seoul, 04763, Korea+82-2-2220-1366
COPYRIGHT © 2024 HANYANG UNIVERSITY.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.
