- Rating
- 2
- Confidence
- 3
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
This work proposes CoreDNA, a label-free, training-free, and task-agnostic coreset selection method. CoreDNA uses a pretrained vision foundation model to extract neuron activation distributions and measures the differences between individual images and the full dataset. It then constructs compact representations from activation statistics and selects representative subsets by balancing data diversity and distribution coverage. The method can also incorporate additional information, such as temporal and motion features, to reduce redundancy in sequential data. Experiments across image classification, semantic segmentation, depth estimation, autonomous driving, and robotic manipulation demonstrate that CoreDNA achieves competitive performance against existing coreset selection methods across diverse tasks while remaining computationally efficient.
Critical strengths
- The proposed method is simple and novel. It leverages neuron activation distributions from a pretrained vision model for data selection without requiring labels or additional model training, and uses compact feature representations for efficient selection.
- The experiments cover a wide range of tasks, including image classification, semantic segmentation, depth estimation, autonomous driving, and robotic manipulation, with extensive comparisons and ablation studies.
Critical weaknesses
- The performance improvements over existing methods are limited and inconsistent. For example, CoreDNA underperforms existing unsupervised methods or even random sampling in some settings on CIFAR10 and Cityscapes-DVPS.
- As the paper emphasizes the computational efficiency of CoreDNA, it lacks systematic comparisons with existing methods in terms of end-to-end runtime and computational cost.
Questions for authors
- What factors affect CoreDNA's performance across different settings?
- Could the authors provide comparisons of end-to-end runtime and computational cost with existing methods to better demonstrate CoreDNA's efficiency?
2 comments
Response to Author Rebuttal
Thanks for the clarifications and computational cost comparisons. However, my main concern remains the limited and inconsistent performance improvements over existing methods, which have not been fully addressed. Therefore, I will maintain my original score.
We thank reviewer y81V for highlighting the novelty of our approach and acknowledging the wide range of tasks. We address the critical weaknesses and questions below.
(W1) Performance over Baselines
We agree with the reviewer that CoreDNA does not win in every setting, and we do not claim to. We further agree that gains over baselines are not uniform. In the revised manuscript we will add the further discussion below on how random selection is hard to beat across the field, and state clearly where CoreDNA helps and where it does not.
Beating random selection reliably is hard for the whole field. Recent coreset methods are often at or below random in some settings, particularly at high retention rates, where the choice of method matters less, i.e. every baseline is within a point or two of random at α=0.7 (Cityscapes, PascalVOC, Cityscapes-DVPS, SemanticKITTI-DVPS). Further, training-based methods such as AUM, EL2N, and Forgetting fall below random at low ratios. In that landscape, our goal is a general method that performs consistently across 39 settings without per-dataset or per-task tuning, while maintaining performance of its respective predecessor.
CoreDNA makes progress in this setting. It matches or outperforms the strongest baselines in most settings, it holds up on PascalVOC and transfers to action domains, as shown on NAVSIM and LIBERO-10, and it does so at considerably lower cost, as we show in our compute comparison. The cases where CoreDNA is only up-to par, have identifiable reasons:
(Q1) Factors that affect performance
We thank the reviewer for this question, which led us to state explicitly when our method helps most. We will add a discussion of the factors that affect CoreDNA’s performance (dataset type, task, downstream model, and retention ratio) to the revised manuscript and below.
Dataset type
Curated datasets (CIFAR10, PascalVOC, Cityscapes) leave less redundancy to exploit than non-curated, sequential ones (Cityscapes-DVPS, SemanticKITTI-DVPS), where consecutive frames are highly uniform and near-full performance is reachable with very few samples. CoreDNA’s advantage is largest on the latter, consistent with its design. Where hard samples sit relative to μ₁₂ also varies across datasets (high tail on Cityscapes, low tail on PascalVOC, weak relation on CIFAR10), and we cannot yet predict this direction from unlabeled data.
Task, model, and retention ratio
Training-based selection isn’t always better, and which approach works depends on the task. Classification and segmentation on object-centric benchmarks (CIFAR10, PascalVOC) favor training-dynamics methods (AUM, EL2N, Forgetting), while dense driving-scene prediction (SemanticKITTI-DVPS, Cityscapes-DVPS) favors training-free embedding methods, where CoreDNA is most competitive, with FreeSel often the strongest baseline. Pretrained downstream models, such as the depth network, need less data to adapt, which shrinks differences between methods. Finally, the retention ratio changes the ranking: at high ratios all methods converge toward random selection, while at low ratios they separate clearly.
(Q2) End-to-end runtime and Computational Cost
We thank the reviewer for raising computational cost to emphasize the practical use of our method. We will add the following compute comparison to the revised manuscript, which shows that CoreDNA has the lowest end-to-end cost among the training-free methods we compare.
CoreDNA has the lowest end-to-end cost in both the small and the large selection regime: CoreDNAs total calculations cost is about 3$\times$ lower than ZCore (1.76 vs. 5.19 PFLOPs) and 2.4$\times$ lower than FreeSel at α=0.1 (1.76 vs. 4.15 PFLOPs). Our cost is dominated by the backbone, and the selection step itself is negligible. ZCore is more expensive in both the descriptor (about 3$\times$) and the selection step. FreeSel has the cheapest backbone (ViT-S instead of ViT-B), but it does not scale: its selection cost grows with the retention ratio and dominates at α=0.5, where its total is 10.8$\times$ ours (18.9 vs. 1.76 PFLOPs). To align with FreeSel, we are evaluateing whether a ViT-S backbone gives comparable selection quality. We will post the results of these runs here once they are complete and include them in the revised manuscript. We will also report measured wall-clock runtimes to this comparison once they complete.