Are Large-scale Soft Labels Necessary for Large-scale Dataset Distillation?

In ImageNet-condensation, the storage for auxiliary soft labels exceeds that of the condensed dataset by over 30 times. However, are large-scale soft labels necessary for large-scale dataset distillation? In this paper, we first discover that the high within-class similarity in condensed datasets necessitates the use of large-scale soft labels. This high within-class similarity can be attributed to the fact that previous methods use samples from different classes to construct a single batch for batch normalization (BN) matching. To reduce the within-class similarity, we introduce class-wise supervision during the image synthesizing process by batching the samples within classes, instead of across classes. As a result, we can increase within-class diversity and reduce the size of required soft labels. A key benefit of improved image diversity is that soft label compression can be achieved through simple random pruning, eliminating the need for complex rule-based strategies. Experiments validate our discoveries. For example, when condensing ImageNet-1K to 200 images per class, our approach compresses the required soft labels from 113 GB to 2.8 GB (40x compression) with a 2.6% performance gain. Code is available at: https://github.com/he-y/soft-label-pruning-for-dataset-distillation

Paper

Similar papers

Peer review

Reviewer FdYh7/10 · confidence 4/52024-07-05

Summary

This paper addresses the challenge of large-scale dataset distillation, specifically focusing on reducing the storage requirements for auxiliary soft labels in ImageNet-level condensation. The authors propose Label Pruning for Large-scale Distillation (LPLD), which aims to achieve state-of-the-art performance while significantly reducing the storage needed for soft labels. The main contributions include: 1. Identifying that high within-class similarity in condensed datasets necessitates large-scale soft labels. 2. Introducing class-wise supervision during image synthesis to increase within-class diversity. 3. Demonstrating that simple random pruning of soft labels is effective when data diversity is improved. 4. Achieving SOTA performance with significantly reduced label storage, validated across various networks and datasets.

Strengths

1. The paper addresses an often overlooked problem in dataset distillation: the large storage requirements for auxiliary data. Their class-wise supervision approach offers a novel solution to this issue. 2. The analysis is thorough, using feature cosine similarity and MMD to demonstrate increased diversity in synthetic data. Experiments across Tiny-ImageNet, ImageNet-1K, and ImageNet-21K show the method's effectiveness on various datasets. 3. The paper is well-organized and written. The authors clearly explain their motivations, provide detailed methodology, and offer comprehensive analysis of their results. Their figures and tables effectively illustrate key points. 4. By significantly reducing storage needs (40x compression of soft labels) while maintaining or improving performance, this work makes dataset distillation more practical for large-scale applications.

Weaknesses

Limited theoretical analysis: While the paper provides comprehensive empirical evidence, a more rigorous theoretical analysis could strengthen it. I know this is a common challenge in dataset distillation research. However, the detailed empirical study presented here lays valuable groundwork for potential future theoretical analyses in this direction, particularly regarding the relationship between class-wise supervision and increased diversity.

Questions

1. How sensitive is the method to the choice of hyperparameters, particularly in the label pruning process? Is there a way to automatically determine the optimal pruning rate? 2. Have you explored the potential of combining your class-wise supervision approach with other dataset distillation techniques? Could this lead to further improvements? 3. How does the performance of your method scale with the number of classes? Is there a point where the benefits of class-wise supervision diminish? 4. Have you investigated the impact of your method on the training time of the distilled dataset compared to previous approaches? 5. In Table 6(c), why the performance on Swin-V2-Tiny is the worst even if the architecture has the largest size (28.4M)?

Rating

7

Confidence

4

Soundness

3

Presentation

4

Contribution

3

Limitations

Yes. Limitations are provided in Appendix E.5.

Reviewer 8MXG5/10 · confidence 4/52024-07-08

Summary

The paper focuses on reducing the size of soft-label storage in large-scale dataset condensation. The authors discussed why the labels are large-scaled and then proposed to prune the labels by increasing the diversity of synthetic images. Extensive experiments are conducted to validate the effectiveness of the proposed method.

Strengths

1. The paper tackles the problem of large storage space consumed by soft-labels, and discover that this is attributed to the lack of image diversity within classes. 2. Extensive experiments demonstrate the effectiveness of the proposed method, achieving comparable or even better performance than previous methods with reduced label storage.

Weaknesses

The motivation of the work is well-grounded. I don’t observe major drawbacks but do have some minor concerns towards its technical contributions. 1. The proposed method seems to be a class-wise version of SRe^2L, with a soft label-reuse mechanism during training. Thus the technical contributions seem to be weak. 2. How is Equation (8) used in the proposed method? Or is it just a theoretical result? 3. I have doubts on the computational cost (memory and time) of the proposed method (not storage), doing class-wise optimization may increase the distillation time, especially on ImageNet. 4. How is the random label pruning done? E.g. Is the same number of soft-labels removed for each epoch? 5. Proposition 2 is quite confusing, is “higher MMD” a typo?

Questions

Please see Weaknesses.

Rating

5

Confidence

4

Soundness

2

Presentation

3

Contribution

2

Limitations

Yes, the limitations are addressed.

Reviewer S5vb5/10 · confidence 3/52024-07-12

Summary

This paper discovers that the conventional method generates images with high similarity. To solve this, the authors introduce class-wise supervision during the image-synthesizing process by batching the samples within classes. Thanks to the increase in diversity, the soft labels can be pruned to reduce the storage size. Extensive experiments are performed on ImageNet with different compression ratios of labels to validate the effectiveness of the method.

Strengths

1. Improving the diversity in condensed images is crucial for obtaining high performance. 2. Label pruning is necessary to reduce the storage size for soft labels.

Weaknesses

1. There are confusing sentences. The authors mention that ”The high similarity of images within the same class requires extensive data augmentation to provide different supervision” and then “To address this issue, we propose Label Pruning for Large-scale Distillation”. How does label pruning address the issue? I see that increasing the diversity of synthetic samples does improve the performance and label pruning is proposed to reduce the storage size. These are not highly related. 2. The authors should compare the performance of the proposed Label pruning with other compression methods (e.g., Marginal Smoothing/Re-Norm with Top-K, using different K when targeting at 10x/20x…) proposed in FKD. Without comparing these methods, it is unclear whether the proposed approach is better than previous pruning methods. FKD: A Fast Knowledge Distillation Framework for Visual Recognition, Zhiqiang Shen et al

Questions

See weaknesses

Rating

5

Confidence

3

Soundness

2

Presentation

2

Contribution

2

Limitations

N/A

Authorsrebuttal2024-08-07

The reasons why label quantization in FKD is orthogonal to our method

Thank you for bringing up the questions related to FKD. We would like to emphasize that label quantization mentioned in FKD is orthogonal to our method for the following reasons: 1. **We consider more** **components** **as shown in Table B.** There are **six** **components** related to soft labels. FKD only compresses the prediction logits (component 6), while our method addresses all six components. 2. **We have different compression targets, as shown in Table D**: Even for the overlapping storage component (component 6: prediction logits), our compression target differs from FKD's. The total stored prediction logits can be approximated by the `number_of_condensed_images × number_of_augmentations × dimension_of_logits`. - FKD's **Label Quantization** focuses on compressing the `dimension_of_logits`. - Our **Label Pruning** method focuses on compressing the `number_of_augmentations`. **Table** **B**: Different storage components between FKD and ours. FKD, originally for **model** distillation, requires storage only for components 1, 2, 6. Adapting it to **dataset** distillation requires additional storage for components 3, 4, 5. | | FKD | Ours | |---|---|---| | 1. coordinates of crops | ❌ | ✔ | | 2. flip status | ❌ | ✔ | | 3. index of cutmix images | ❌ | ✔ | | 4. strength of cutmix | ❌ | ✔ | | 5. coordinates of cutmix bounding box | ❌ | ✔ | | 6. prediction logits | ✔ | ✔ | **Table D:** Breakdown explanation for component 6 (prediction logits) storage between FKD’s label quantization and our label pruning. The number of condensed images is computed by `N = IPC x number_of_classes`. FKD's compression target is `dimension_of_logits`, while our target is `number_of_augmentations`. | | Number of condensed images | Number of augmentations per image | Dimension of logits per augmentation | Total storage for prediction logits | | ------------------------- | ------------------------ | ------------------------------- | ------------------------------- | ----------------------------------- | | Baseline (no compression) | N | 300 | 1,000 | N $\times$ 300 $\times$ 1000 | | Label Quantization (FKD) | N | 300 | 10 | N $\times$ 300 $\times$ 10 | | Label Pruning (Ours) | N | 3 | 1,000 | N $\times$ 3 $\times$ 1000 |

Authorsrebuttal2024-08-12

Grateful for any feedback

Dear Reviewer S5vb, We greatly appreciate the time and effort you've invested in reviewing our work. As we are now two days away from the discussion deadline, we wanted to reach out regarding our rebuttal, which we submitted earlier. If possible, we would be grateful for any feedback you might be able to provide, as this would give us the opportunity to engage in a productive discussion before the deadline. We're eager to address any remaining questions or concerns you may have about our paper. We understand that you likely have a busy schedule, and we truly appreciate your valuable insights and expertise in this process. Thank you for your time and consideration.

Authorsrebuttal2024-08-13

Grateful for any feedback

Dear Reviewer S5vb, I apologize for reaching out again after my previous message. With the discussion deadline now just one day away, I wanted to very gently follow up on our earlier correspondence regarding our paper and rebuttal. We completely understand if you haven't had the opportunity to review our rebuttal yet, given the many demands on your time. However, if you have had the chance to look it over, we would be immensely grateful for any feedback you could provide. Your insights, no matter how concise, would be valuable in helping us engage in a constructive discussion before the deadline closes. We are sincerely thankful for your continued involvement in this process, and we respect your time and professional commitments. Thank you for your understanding and consideration.

Reviewer S5vb2024-08-13

Thanks for providing additional experiments using label quantization proposed in FKD. Most of my concerns have been addressed. Thus, I increase the score.

Authorsrebuttal2024-08-13

Thank you for raising the score

Thank you for your prompt response and for reviewing our additional experiments. We're delighted that our efforts have addressed most of your concerns and appreciate your decision to increase the score. Your feedback has been invaluable in improving our work. If you have any further questions, please don't hesitate to ask. Thank you again for your time and expertise.

Reviewer FdYh2024-08-10

After rebuttal

Thanks for providing the detailed rebuttal. All of my concerns have been properly addressed. In addition, I have also read the other reviews’ comments and corresponding rebuttals. These efforts are appreciated. After careful consideration, I believe this is a high-quality paper that merits acceptance. The proposed soft label compression technique is valuable and contributes significantly to the field. I will adjust my score accordingly once the discussions between other reviewers and the authors have concluded.

Authorsrebuttal2024-08-13

Thank you for your positive feedback

Thank you sincerely for your positive feedback on our rebuttal. We find it very encouraging that our paper is considered high-quality and that our soft label compression technique is recognized as a significant contribution to the field. As we are approaching the discussion deadline, we wanted to provide a brief update: one reviewer has already raised their score after reading the rebuttal, while another has not yet responded. Given your intention to adjust the score and your positive assessment, we were wondering if you might consider updating your score at this time. Your support could be crucial in the final evaluation of our paper. We deeply appreciate your time and expertise throughout this review process. Thank you again for your thoughtful consideration.

Reviewer FdYh2024-08-13

Thanks for your follow-up. After careful consideration, I have decided to raise my score and strongly support the acceptance of this paper. I believe this work is significant to the field.

Authorsrebuttal2024-08-13

Thank you for your strong support. We greatly appreciate your recognition of our work's significance to the field. Your opinion is extremely important to us, and we are deeply grateful.

Reviewer 8MXG2024-08-10

Thank you for the response

Thank you for the detailed response and my concerns are addressed. I now vote for acceptance of this paper. However, I strongly recommend the authors to include the discussions on time cost and detailed pruning process into the main paper/appendix. These will be insightful for the community.

Authorsrebuttal2024-08-11

Thank you for the acceptance

We are deeply grateful for your acceptance of our paper and truly appreciate your insightful feedback. Your comment that our discussion "will be insightful for the community" is particularly encouraging to us. We are committed to improving our manuscript based on your thoughtful suggestions.

Program Chairsdecision2024-09-25

Decision

Accept (poster)

© 2026 NYSGPT2525 LLC