- Rating
- 1(−1)
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 1(−1)
Read review
Paper summary
The paper studies which auxiliary datasets to mix into post-training, and in what proportions, when several target tasks matter at once. It takes the single-target-task dataset selector of prior work, which scores candidate datasets by the alignment of their loss gradients with the target loss gradient, while penalizing redundancy among candidates, and applies it to a preference-weighted scalarized combination of the target task losses. The experiments show that the resulting score-weighted mixtures reach higher target-task accuracy than baselines across model sizes.
Critical strengths
The problem is relevant, since post-training has to serve several tasks at once. The experiments are extensive and at a reasonable scale.
Critical weaknesses
The proposed method is incremental: it is that of [1] applied to a scalarization of the target task losses instead of a single one, plus a modification already explored in [2], taking the gradients’ signs as features while discarding their magnitudes. The paper says so itself, yet lists the formulation and the justification of the sign features as its contributions.
Even taken as a modification of [1], the method is never shown to improve on [1]: the paper does not even run [1] unchanged on the scalarized loss. Its gains over the non-redundancy-accounting alignment-based baselines appear only once the budget is split unevenly across the selected datasets, according to their scores. This rule is never justified, and [1] tried it and found it harmful, which the paper does not discuss.
The remaining listed contributions are weak. The theoretical bounds seem vacuous at the paper’s own sample sizes, and the claimed transfer of selections across model families and post-training algorithms is never tested.
What seems novel is the benchmark and the budget-splitting rule.
[1] Zeng et al. Convex dataset valuation for post-training. ICML, 2026.
[2] Xia et al. LESS: Selecting influential data for targeted instruction tuning. ICML, 2024.
Questions for authors
- Does gradient-alignment selection match the proposed method once its budget shares are made as uneven as the method’s, rather than proportional to alignment as in the no-K control?
- What do the bounds of Theorems 4.1 and 4.2 evaluate to for the Llama-3.2-1B setting considered in the paper?
- [1] found softmax weighting of the selected datasets by their scores harmful, while here proportional weighting seems to carry much of the gain. Why?
5 comments
Vacuous theoretical bounds
Reviewer:
The theoretical bounds seem vacuous at the paper's own sample sizes.
Response:
We agree that the bounds are conservative at our experimental sample size. As already noted in Remark 4.2, our bounds characterize asymptotic convergence rather than providing tight numerical certificates at the finite preview sizes used in our experiments. Building on Zeng et al. (2026), our main theoretical contribution is extending finite-preview convergence guarantees to the multi-target setting, uniformly over target preferences, and further establishing convergence for SignGD representations under a near-zero condition.
Our empirical results complement these asymptotic guarantees by demonstrating stability at practical preview sizes. Appendix D.9 shows that increasing the preview size from 256 to 512 or 1024 preserves an average of 9.8/10 selected datasets, with only 2.9–3.5% of the budget reallocated and similar downstream accuracy.
Transfer across model families and algorithms
Reviewer:
The claimed transfer of selections across model families and post-training algorithms is never tested.
Response:
Sorry for the confusion. We meant to say the empirical results are strong for different model families and post-training algorithms. We reused selections only across model scales within each family and each algorithm in the submitted version. We have updated our conclusion in the updated manuscript.
Following the reviewer's suggestion, we tested both kinds of transfer in new experiments. The cross-family result adds to the practical value of MT-KMM.
-
Across families: For SFT experiments, we compute budget allocation with KMM using gradients from Llama-1B and apply this same allocation for Qwen-0.6B. We also run the experiments the other way around, computing on Qwen and applying it to Llama.
-
Across training algorithms: For the GRPO setting, we computed the MT-KMM selection from SFT gradients instead of GRPO policy gradients, with the same targets and auxiliary pool, and trained GRPO on it.
In Tables R8–R9, MT-KMM selections do transfer across model families but not across post-training algorithms. We include the results in App. E.2 in the updated manuscript.
Table R8. Training each model family on the other family's MT-KMM mixture (new).
| Model trained | Its own One Step | Its own MT-KMM | Other family's MT-KMM mixture |
|---|---|---|---|
| Llama-3.2-1B | 39.51 | 43.42 | 42.83 (from Qwen3-0.6B) |
| Qwen3-0.6B | 45.81 | 46.60 | 47.38 (from Llama-3.2-1B) |
Table R9. GRPO trained on selections computed with different gradients (Llama-3.2-1B).
| Selection used for GRPO training | Accuracy |
|---|---|
| random (paper Table 2c) | 38.44 |
| One Step, GRPO policy gradients (paper Table 2c) | 40.82 |
| MT-KMM, GRPO policy gradients (paper Table 2c) | 42.33 |
| MT-KMM, SFT gradients (new) | 39.01 |
I thank the authors for the response and the new experiments. Three of my concerns have been resolved: the paper now runs [1] unchanged, motivates the budget-splitting rule, and corrects and tests the transfer claim.
I maintain my rating, however, because my main concern remains unresolved. The paper still claims as main contributions the multi-target formulation and the justification of the sign features. Both are ported from prior work [1, 2], and neither accounts for the method's practical gain: in the response to Reviewer UNbG, the multi-target formulation performs comparably to solving for each target separately, and in the new Table 31, most of the gain over [1] comes from the budget-splitting rule and little from the sign features. These claims therefore remain unsupported.
What seems novel, then, is the budget-splitting rule and the benchmark. The rule is a proportional variant of the score weighting already tested in [1], and it remains unclear whether its gain comes from the method's scores or simply from uneven shares. While extensive and useful, the benchmark cannot carry this paper, whose claims are about the method.
Unsupported main claims and useful but modest novel parts do not warrant acceptance.
Response to Reviewer o6Ku
Thanks for your time and constructive feedback on our manuscript. Please find our response to your comments below.
Comparison with Zeng et al.'s method
Reviewer:
Response:
Thanks for pointing it out. In Table R7 (now Table 31 in the paper), we included Zeng et al.’s two setups, 1) equal allocation of auxiliary datasets 2) non-uniform allocation with softmax weighting, both using raw gradients as dataset representations. MT-KMM outperforms all variants in Zeng et al. Weighted allocation follows from the portfolio view, in which the KMM scores are themselves the allocation (Sec. 4).
Table R7. From Zeng et al.'s method to MT-KMM, one change at a time.
Why normalization, not softmax? First, in Table R7, as [1] already suggested, softmax is suboptimal. Our normalization is not the same as softmax, although both are non-uniform allocation rules. One potential advantage of our method is that it preserves the relative magnitudes of original very informative KMM scores. Softmax preserves exponentiated score difference instead, which may substantially flatten allocations when score differences are small.
Is the gain only the uneven split?
Reviewer:
Response:
Thanks for the question. We would like to clarify that our no-K ablation already uses nonuniform budget allocation, as described in App. C.2 in the original manuscript. The difference between no-K and MT-KMM lies in how scores are computed, rather than the allocation rule.
To “match budget shares made as uneven as the method's”, we could artificially sharpen the allocation. However, such matching would require calibrating the no-K allocation using MT-KMM's solution, which itself depends on K. It would not be a fair and independent gradient alignment only baseline.