- Rating
- 3
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper proposes an adaptive coreset selection method that estimates sample utility using a model trained on the evolving subset. It begins with representative samples, then repeatedly excludes correctly classified candidates and selects the lowest-loss examples among those still misclassified. Experiments report improvements over existing coreset methods, and competitive performance against dataset distillation.
Critical strengths
- Consistent empirical improvements
- Ablations provide meaningful support for the proposed design
- The idea of evolving subsets is interesting
Critical weaknesses
- The wall-cock selection time is occluding that the MCSS is probably the slowest among core-set selection methods and also not generally faster than dataset distillation (for instance, RDED just selects 4 random images and pack them into one). A more nuanced claim would be appropriate.
- The authors acknowledge that DQAS already retrains its evaluator on the growing subset. Consequently, model-dependent selection itself is not new and the contribution is primarily the combination of representative initialization, filtering, and low-loss selection. The paper could establish more clearly what this combination teaches beyond a successful empirical recipe.
- Table 4 should also compare against random initialization.
Questions for authors
- Could the authors add other coreset selection methods for time comparison (i.e., using DeepCore library)? Also, RDED should be included as fast dataset distillation method.
- The paper discusses coverage-based coreset selection methods but never tests them, would it be possible to compare with such, for example SubZeroCore?
- Regarding Appendix D, could the authors provide a pairwise cosine similarity measure on the embeddings of the selected images to showcase their diversity claim?
- Did it occur to the authors to try the opposite direction, shrinking step-by-step the subset?