- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper studies subset selection under a shared budget when categories may overlap. It assigns each category a kernel on the same items and maximizes a soft minimum of normalized log-determinant scores, emphasizing the weakest category while encouraging feature diversity. The authors relax discrete selection to a Stiefel manifold problem, derive an adaptive nonlinear eigenvalue problem (NEPv), and round the resulting subspace to a subset. Experiments on OpenLogo and USPTO evaluate category-based selection.
Critical strengths
Relevant problem setting. Overlapping categories make independent per-category selection difficult under one shared budget. The common-index kernel formulation lets one selected item contribute to multiple categories.
Interpretable objective. The soft minimum adapts emphasis toward weaker category scores. The zero-ridge identity clarifies the tradeoff between category representation and feature diversity, while the paper correctly distinguishes that identity from the positive-ridge setting used in practice.
Useful spectral structure. The determinant-specific NEPv construction has rank at most , an explicit spectrum, and an exact small-matrix compression that avoids a full eigendecomposition.
Critical weaknesses
1.Narrow empirical scope. Both tasks use trademark data and primarily report . On USPTO, category recall exceeds the fixed-weight baseline by only 0.32 percentage points, while uniform sampling has slightly higher text-embedding cosine similarity.
2. Incomplete reproducibility details. The manuscript omits complete feature versions, selection parameters such as ridge and temperature, USPTO pool and test sizes, full training settings, and per-seed results.
Questions for authors
Main concerns:
1. Direct optimization baseline. How does FAIRNEPV compare with a discrete greedy algorithm that directly maximizes the proposed soft-min objective, preferably followed by the same one-swap refinement? This comparison would help establish the benefit of the NEPv solver beyond the objective itself.
2. Reproducibility. Could the authors provide the OpenLogo split identifiers and selected sample IDs, the USPTO test-pool size, and the complete selection and training configurations needed to reproduce the results?
3. Runtime and scalability. What are the wall-clock time and peak memory usage of FAIRNEPV, reported separately for the continuous solver and rounding? Please compare them with the proposed greedy baseline under the same selection budget and report how runtime scales with the candidate-pool size.
Minor concern:
-not using the official ICLR 2027 template
3 comments
This revised version has indeed improved readability and informativeness. However, I did not see any superiority over other baselines (see Table 1), and the code has not been released or included as supplementary material, so I will maintain my score.
Thank you so much for reading the revised paper carefully, and for your kind words about the improvements over its readability and informativeness.
Code. We sincerely apologize for not including the code with the revision; this was an oversight on our part. We have just now prepared an anonymized version and uploaded it as supplementary material. It contains the code for every downstream experiment (selectors, objective, data preparation from public sources, training and evaluation), the launch scripts, our experiment ledger, and the per-run outputs, including the selected indices of every run. Its README maps each table in the paper to the corresponding code and outputs. As a check, running it from a clean copy reproduces the stored results exactly, with the same selected images and the same accuracies.
Comparison with baselines (Table 1). Thank you for raising this; we would like to clarify further on what Table 1 shows. Our method is more accurate than every category-blind baseline (uniform, -center, shared-kernel DPP and fixed weight) in all six settings, and more accurate than the averaged-kernel selector on CIFAR-10-LT and CIFAR-100-LT. It is close to class-balanced sampling overall and, as Tables 2 and 10 show, more accurate on the rarest classes in most settings, for example 95.5% against 93.9% on CIFAR-10-LT at . We agree that it does not beat class-balanced sampling on overall accuracy, and the paper says so. Appendix D.9 adds that, when each class receives only a few items, the zero-padding end of the same objective (an additional, exploratory run) beats class-balanced sampling on GTSRB by about 3 points overall and 10–13 points on tail classes.
Thank you again for your valuable feedback, which has substantially improved the paper. Understandably the feedback window is closing, but we would be happy to answer any further questions.
Thank you for your careful and constructive review, and for the concrete experiments you suggested. We ran the direct greedy baseline you proposed, and it is now our method.
Q1: direct greedy. This was an excellent suggestion. Greedy maximization of the soft-min objective (Algorithm 1) beats the NEPv solver on the same objective and budget at every k on COCO, and swaps after rounding do not close the gap (Appendix C). The relaxation wins only with near-duplicate items shared by several categories, the regime Proposition 4 identifies, on synthetic instances (Table 5) and drone video (Table 8).
Q3: runtime and scalability. We measured all three quantities you asked about (wall-clock time, peak memory, and the split between the continuous solver and rounding), on the same CPU (AMD Ryzen 9 9950X, 12 threads) and the full COCO pool of 107,266 images (Appendix C.2, Table 3). Each cell gives time and peak memory added on top of the loaded features:
On pools of 13k, 27k, 54k and 107k images at k=200, greedy takes 1.1, 2.1, 4.4 and 8.6 seconds, linear in n as its O(nk(p+k+M)) cost predicts, and it is 60–90 times faster than the SCF solve throughout. Peak memory also grows linearly: 0.11–0.90 GB for greedy against 0.5–2.3 GB for the SCF solve. Greedy never forms an n×n matrix; most of its memory is a working copy of the feature matrix, and the algorithm itself needs only an n×k Cholesky factor.
W1: scope. We agree that the original evaluation was too narrow. It now spans long-tailed CIFAR-10/100 at three imbalance ratios, GTSRB, multi-label COCO, LVIS with 1,203 categories, near-duplicate pools and drone video, at several budgets, with linear probes and full fine-tuning (Section 6, Appendix D). Our method beats uniform sampling in every long-tailed setting and is more accurate than class-balanced sampling on the rarest classes in most settings (Tables 1–2).
W2/Q2: reproducibility. Appendix D now gives data sources with checksums, split seeds, pool and test sizes, the feature extractor, every selector's settings, training settings and the decision rule. Tables report means, standard deviations and per-comparison seed counts. We will release the code, split identifiers, selected indices and per-seed outputs.
Template. Thank you for noting this. The revised PDF uses the official ICLR 2027 style files.
We hope the new experiments and the direct comparison with greedy answer your questions, and we would be glad to provide further details where useful.