- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes GCcore, which uses pathology foundation-model embeddings to select representative subsets of unlabeled data for efficient annotation and downstream learning through deterministic, hyperparameter-free greedy maximization of global coverage.
Critical strengths
1.The paper addresses an important annotation-efficiency problem in computational pathology, with broad evaluation across datasets, organs, and task families, including segmentation. The study focuses on practical annotation budgets of tens to hundreds of samples.
2.For fixed embeddings and distances, GCcore offers a simple, deterministic procedure without clustering or weighting hyperparameters, with consistently competitive empirical performance. The results also suggest robustness to encoder choice and class imbalance.
Critical weaknesses
1.GCcore’s objective is equivalent to classical facility location, while its approximation guarantee and acceleration follow established results. The claimed methodological novelty is therefore overstated, and the manuscript does not clearly acknowledge this equivalence.
2.Averaging baseline performance over an author-chosen configuration grid makes the reported rankings dependent on that grid and does not sufficiently establish practical superiority. These averages need not reflect performance under reasonable default settings.
Questions for authors
What new methodological contribution does this work provide beyond the established selection framework?
2 comments
Thank you for the authors' response. I decide to keep my original score.
Authors' Responses
Dear Reviewer cNHS,
We sincerely appreciate your recognition of our work and your constructive comments. We hope the revisions address your concerns, and we would be grateful if you would consider them in your final assessment. If any concerns remain, please let us know, and we will be glad to address them.
Weakness-1: Equivalence to classical facility location and methodological novelty.
Thank you for pointing this out. We agree with this comment and acknowledge that the original manuscript did not state the equivalence clearly enough. We have revised the manuscript to state it explicitly (Section 3, new paragraph “Relation to facility location”). We have also narrowed our claims to what is new throughout the Abstract and Sections 1, 3, and 5. The revised content is highlighted in green.
Weakness-2: Author-chosen hyperparameter configurations of baselines may not reflect performance under reasonable default settings.
Thank you for this comment. To ensure a fair comparison, we did not choose the baseline configurations arbitrarily. For each baseline, the five hyperparameter values are sampled within the range reported to be robust in the original paper, where such a range is given, and otherwise around the reported default value (Section 4.1, paragraph “Baselines”). In both cases, the default value is included. For example, InfoMax (Tan et al., 2025) was reported to be robust to its pairwise weight over α∈[0.3,4], so we used α∈0.3,1,2,3,4. Averaging over these values therefore reflects the performance a practitioner can expect when following the original authors' recommendations without labeled data for tuning, which is the setting of label-free coreset selection. A detailed explanation is provided in Appendix F.1, ”Hyperparameter settings of baselines.”
Questions for Authors: What new methodological contribution does this work provide beyond the established selection framework?
Thank you for the question. As stated in the new paragraph “Relation to facility location” in Section 3, our methodological contribution is to show that this classical objective arises from, and is equivalent to, a radius-free measure of dataset coverage, providing a new, intuitive interpretation of the objective. Starting from the fraction p(r;T) of the dataset lying within radius r of the coreset, we integrate over all radii to remove the dependence on an arbitrary, scale-specific r. Using the tail-integral identity (Eqs. 5-7), we prove that the resulting measure, GC(T), equals the normalized facility location function F(T)/(Nrmax). To our knowledge, this interpretation has not been made explicit before. It has two practical consequences. First, it justifies the objective in directly interpretable terms: maximizing F is equivalent to maximizing coverage averaged over every radius scale, rather than at a single hand-tuned radius. Second, it provides a normalized score GC∈[0,1] that can be compared across FMs, datasets, and budgets. Combined with the label-free, FM-based pipeline, this makes GCcore, to our knowledge, the first application of this coverage-maximizing framework to annotation-efficient computational pathology.
Thank you for reading.