- Rating
- 2(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper proposes ReGIFT, a dynamic data selection method for instruction fine-tuning. At each selection refresh, ReGIFT samples a small uniform probe from the training pool and computes layer-wise PCA directions from last-minus-first hidden-state differences. Candidate examples are then scored by projecting their mean hidden representations onto these directions. The resulting normalized alignment score multiplicatively adjusts a loss-entropy-based carrier score, and the top 10% of the training pool is selected for subsequent fine-tuning. The method does not require a separately curated reference set, external judge, or learned selection policy.
Critical strengths
1.ReGIFT reuses candidate forward passes needed for loss and entropy computation and adds probe extraction, PCA, pooling, and projection rather than training a separate selection policy. This makes the method practically simpler than approaches such as Data Agent.
2.In the main experiment, ReGIFT improves the eight-task average from 38.64 for Carrier-Only to 40.70 and improves every displayed task relative to Carrier-Only. Therefore, the complete scoring rule does appear to change the selected data in a potentially useful way.
Critical weaknesses
-
The geometric signal is almost fully predictable from sequence length (–), making the unique value of the proposed geometry unclear.
-
The main results use only one random seed, and ReGIFT's is tuned while the baselines receive no analogous tuning, weakening the reliability and fairness of the comparison.
Questions for authors
1.Does ReGIFT still outperform a variant with a fixed geometric reference?
2.Can the authors provide multi-seed results for the main comparison?
- Was selected on a separate validation set?
3 comments
You solved most of my problems, so I raised my score.
Thank you for your thoughtful feedback
Dear Reviewer,
Thank you so much for your thoughtful review and for taking the time to reconsider our work. Your questions and insights helped us strengthen the paper, and we have learned a great deal from this exchange. We will carry these lessons into our future research and strive to contribute to the community with the same constructive spirit. Thank you again for your time and support!
Reference refreshing, direct length controls, and repeated-run evidence
We implemented Frozen, Carrier+Length, and Longest to address your concerns about reference refreshing and length dependence. Thank you for helping us sharpen the experimental design.
Q1 & W1: Testing reference refreshing and direct length replacement.
Table 11B compares these controls with the main ReGIFT implementation under shared training and evaluation settings.
Across three runs per method, ReGIFT has the highest mean performance. AVG4 averages MMLU, SVAMP, MBPP pass@1, and TyDiQA pooled F1.
These results support refreshing the reference as the model learns and retaining alignment rather than replacing it with either tested direct length rule. In particular, Carrier+Length preserves the adaptive carrier, so its comparison tests length replacement without also removing the carrier.
The separate supplementary ReGIFT-M controls (Table 11A) show that a length predictor trained on refreshed alignment achieves a slightly higher mean and lower SD than the original alignment. This limits a length-independent interpretation of that signal; Table 11B instead tests direct length rules without those geometric targets.
Q2 & W2: Repeated runs and reported variability.
We report three runs per method in each of the following performance comparisons, with the training seeds and sample standard deviations made explicit:
Table 1 additionally tracks reference movement under two learning-rate schedules with three seeds (42/43/44), reporting medians. Figures 1(b), 4, and 5 show the corresponding selection and reference diagnostics with individual seeds or across-seed ranges. Thus each repeated comparison uses at least three runs, with sample SDs for performance and the stated summaries for diagnostics. The main eight-task comparison against Data Agent and Full FT remains single-run; the repeated downstream evidence addresses the length and reference controls above.
Validation question & W2: Weight sensitivity and a configurable scoring rule.
Every tested positive weight improves all four tasks over CO (Figure 3): the benefit is not confined to the selected value. We also retain λ=1 without further search in all five transfer settings, where ReGIFT exceeds Data Agent and Full FT in reported AVG4 (Appendix D).
We selected λ=1 by the highest reported AVG4 in the sweep, without a separate validation set; baselines received no analogous sweep. At this value, the multiplier has the simple range [1,2], limiting the geometric bonus to the carrier score. This gives a clear interpretation of the chosen setting, but does not make it universally optimal.
The algorithm already exposes λ as a parameter:
si(t)=Ri(t)(1+λ×aligni(t)),λ≥0.
Our bounded-adjustment analysis applies to any nonnegative weight: the multiplier lies in [1,1+λ], preserving carrier preferences whenever Ri>(1+λ)Rk (Appendix B.1). The preferred weight may change with the model, dataset, or objective. Future work can therefore select it on validation data under a common tuning budget while retaining the reference construction and this theoretical property.
Revision locations: Section 3.4; Appendices C.1 and E.3–E.4 (control protocols); Tables 1, 11–12 and Appendix F (repeated evidence); Appendix E.1/Figure 3 and Appendix D (weight sweep and transfers); Appendix B.1 (general weight analysis).