- Rating
- 3(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
RAGE resamples source training windows for time series foundation model adaptation by matching local gradient shapes, reconstructed from sparse adaptive anchors, to target reference data.
Critical strengths
- The paper addresses a meaningful limitation of trajectory-level selection: averaging gradients can obscure locally useful training windows.
- The midpoint–slope representation captures local gradient variation using existing anchor gradients, without additional backward passes.
- Experiments across three foundation models and seven tasks, with matched training exposure and component ablations, support the benefit of local shape matching.
Critical weaknesses
- The ablations do not isolate adaptive anchor placement from uniform placement, leaving a central contribution insufficiently validated.
- The connection between normalized gradient-shape similarity and beneficial adaptation remains heuristic, particularly when gradients are computed only at the initial checkpoint.
- The practical advantage remains unclear because comparisons match training exposure rather than total computation and omit direct adaptation on the available target reference histories.
Questions for authors
- Does adaptive anchor placement outperform uniformly spaced anchors under the same gradient budget, and what does each refinement stage contribute?
- Why should matching gradient slopes across independently rescaled blocks predict useful training updates, and does this relationship persist during adaptation?
- How does RAGE compare with direct fine-tuning on the target reference histories, especially when those histories are short or contain regime changes?
- Does RAGE retain an advantage over random sampling when gradient preparation and post-training share the same total compute budget?
- Does the advantage over LESS-TS persist when optimizer-aware gradient features and multiple checkpoints, omitted in the current adaptation, are retained?
5 comments
Response to Reviewer EvBn (Continued: W3–W5)
Response to Reviewer EvBn (Continued: W3–W5)
This is a continuation of our previous response, addressing the remaining concerns W3–W5.
W3, Q3: Direct Fine-tuning on Reference Data
We thank the reviewer for suggesting a comparison with direct fine-tuning on the target reference data. This would be a valuable additional baseline for evaluating the practical value of reference-guided data selection.
RAGE uses target reference information to select training windows from a larger source pool, whereas direct training on the reference data adapts the model using limited target data. Both approaches have different advantages and merit direct comparison, particularly when reference histories are short or contain distribution shifts.
Additional Experiments: We plan to add a Ref-trained (RefT) baseline that directly fine-tunes on the target reference histories, while maintaining consistent model initialization and training budgets as much as possible. We will update the experimental results once completed to more clearly evaluate the performance and applicability of RAGE relative to direct target fine-tuning.
W4, Q4: End-to-End Compute Budget
We thank the reviewer for raising the important issue of fairness under an end-to-end compute budget. Including gradient-preparation costs in the total budget provides an additional perspective for evaluating the practical computational efficiency of data selection methods.
Explanation: The primary goal of our work is to compare the effectiveness of different resampling strategies under fixed post-training exposure, thereby isolating the effect of data allocation itself, rather than demonstrating that RAGE achieves higher efficiency under an equal end-to-end compute budget.
Meanwhile, we have separately reported the computational costs of gradient preparation, data selection, and training in Appendix I of the original manuscript, and explicitly stated that these results do not directly establish end-to-end training speedup.
Converting data-valuation costs into additional training budgets and comparing against random sampling under equal total computation would provide valuable complementary evidence. However, this requires a unified method for measuring computational costs and rerunning the corresponding experiments. Due to current computational-resource and revision-time constraints, we are temporarily unable to complete this full comparison.
Revision: We will more clearly distinguish between data-selection benefits under a fixed training budget and computational efficiency under a fixed end-to-end budget in the revised manuscript, and identify the latter as a direction for future research.
We thank the reviewer for helping us more accurately define the conclusions supported by our current experiments.
W5, Q5: Fairness of the LESS-TS Baseline
We thank the reviewer for highlighting the differences between our current LESS-TS implementation and the original LESS method. Our implementation is a time-series adaptation designed for a unified experimental setting, rather than a complete reproduction of the original LESS pipeline. In particular, optimizer-aware gradient features and multiple checkpoints are not included, and these differences may affect the comparison results.
Explanation: We initially adopted this simplified implementation mainly to maintain consistent training procedures and gradient-computation budgets across different time-series foundation models. However, fully transferring the original LESS pipeline to time-series models also involves optimizer-aware gradients, checkpoint selection, model training paradigms, and differences between the two data types in training-sample construction and evaluation. Therefore, how to construct a time-series adaptation that is strictly equivalent to the original LESS still requires further investigation.
Revision: In the revised manuscript, we will explicitly describe this baseline as a LESS-inspired gradient matching baseline and systematically revise the related naming, implementation details, and comparison conclusions. We will clearly identify its differences from the original LESS to avoid equating the performance of the current simplified implementation with that of the complete LESS method.
We sincerely appreciate the reviewer's rigorous attention to baseline fairness. This feedback helps us avoid overly strong comparative claims and more accurately define the scope of our current experiments.
Update on the Revised Manuscript
Update on the Revised Manuscript
We sincerely thank the reviewer again for the detailed and constructive feedback. We have uploaded a revised manuscript, with changes highlighted and annotated using the corresponding reviewer IDs to facilitate review. We would greatly appreciate it if you could take another look at the updated version.
We have responded to your concerns as follows:
W1, Q1 — Adaptive Anchor Placement (Sections 3.2, 4.2; Appendix B, Tables 6–7): We added controlled experiments comparing CRB with Uniform placement under identical gradient budgets and Shape+Linear scoring. CRB-Shape outperforms Uniform-Shape in 7/10 model–task comparisons and achieves a better overall average rank (1.8 vs. 3.0). Section 3.2 further clarifies the distinct roles of Coverage, Risk refinement, and Cancellation refinement. While we have not fully isolated the empirical contribution of each stage, doing so under strictly matched total gradient budgets would require additional controlled configurations and training runs beyond the current revision-time and computational resources.
W2, Q2 — Gradient-Shape Similarity (Section 3.3; Appendix C, Eqs. 9–12): We expanded the mathematical explanation of Shape Matching. Specifically, Eq. (10) shows that the integrated inner product of reconstructed gradient functions decomposes into midpoint alignment and signed slope alignment. Eq. (12) establishes that the normalized shape similarity corresponds exactly to their cosine similarity under the L2 inner product. This provides a mathematical interpretation of Shape Matching but not a guarantee of improved training updates.
Regarding checkpoint dependence, multi-checkpoint validation under our current experimental setting would require training and maintaining multiple model checkpoints, computing and storing gradient features for each, and substantially increasing the associated computational, storage, and indexing costs. A rigorous evaluation of this scale could not be completed within the rebuttal period. We therefore retain initial-checkpoint valuation as a deliberate efficiency trade-off and clarify its limitations.
W3, Q3 — Direct Reference Fine-tuning (Section 4.2; Appendix B, Tables 6–7): We added a RefT (Reference-trained) baseline that directly fine-tunes on the available target reference histories. CRB-Shape outperforms RefT in all 10 model–task comparisons, with an overall average rank of 1.8 versus 5.1. These results support the benefits of reference-guided source resampling in the evaluated settings. Dedicated analyses of short reference histories and regime changes remain outside the current experimental scope.
W3, Q4 — End-to-End Compute Budget (Section 4.2, Table 2; Appendix J): We further clarified the accounting of gradient preparation, selection, and post-training costs. We explicitly distinguish performance under matched training exposure from efficiency under matched total computation. Since a controlled equal-total-compute experiment has not been completed, we acknowledge this limitation and do not claim an end-to-end computational advantage.
Q5 — LESS Baseline Fairness (Section 4.1; Appendix I): We renamed the baseline LESS-GM (LESS-inspired Gradient Matching) and clarified its implementation and differences from the original LESS, particularly the omission of optimizer-aware gradient features and multiple checkpoints. Importantly, the forecasting models, time-series window construction, and data-resampling problem studied here differ substantially from the original setting of LESS. Consequently, there is no straightforward or established time-series counterpart that can be regarded as a faithful implementation of the original LESS pipeline. We therefore position LESS-GM as a simple gradient-matching baseline inspired by the core idea of LESS, rather than a direct adaptation or complete reproduction. We have revised the naming and comparison claims accordingly to avoid implying superiority over the full original method.
We sincerely appreciate your suggestions, which have helped us improve the theoretical explanations, experimental comparisons, and transparency of our work. We hope these revisions respond to your main concerns and would be grateful for your reconsideration.
Thank you again for your time and thoughtful feedback.
Response to Reviewer EvBn
Response to Reviewer EvBn
We sincerely thank the reviewer for the careful evaluation of our work and for recognizing the research problem, local gradient-shape representation, and cross-model experimental validation. We particularly appreciate the specific suggestions regarding methodological explanations, experimental fairness, and practical computational costs, which will help us further improve the rigor of the paper.
W1, Q1: Adaptive Anchor Placement and Ablation
We thank the reviewer for highlighting the value of a direct comparison between adaptive and uniform anchor placement, as well as more detailed validation of the contributions of individual CRB stages.
Methodological Explanation: CRB is designed to address the practical challenge of gradient reconstruction under a limited budget, where high-dimensional gradients at unobserved locations are difficult to predict accurately. Rather than requiring globally optimal reconstruction, CRB uses available gradient information to identify and reduce currently observable local reconstruction risks as much as possible.
Specifically, Coverage ensures basic coverage; Risk refinement prioritizes intervals with potentially larger reconstruction errors based on observed interpolation residuals; and Cancellation refinement focuses on intervals with opposing endpoint gradient directions, where local information may be obscured by averaging. These three stages target different risks rather than attempting to accurately predict all unknown gradients.
Revision: We are adding a direct comparison between Uniform and CRB under the same gradient budget, while keeping the remaining Shape+Linear settings fixed, to isolate the contribution of adaptive anchor placement. We will also further explain the design rationale of the three stages in the revised manuscript and clarify which stage-specific contributions have not yet been independently validated.
W2, Q2: Gradient-Shape Similarity and Checkpoint Dependence
We thank the reviewer for raising important questions regarding the theoretical basis of gradient-shape matching and the choice of checkpoint.
Explanation: Conventional gradient matching uses gradient inner products to approximate the effect of a single update on the target loss. RAGE extends this idea to locally reconstructed linear gradient functions, whose integrated inner product satisfies:
$ \int_{-1/2}^{1/2}g_s(u)^\top g_r(u),du=\bar g_s^\top\bar g_r+\frac{1}{12}d_s^\top d_r. $
The two terms measure the alignment of mean gradients and local gradient variations, respectively. Therefore, even when the mean gradients are identical, Shape Matching can still distinguish different local variations. Joint energy normalization further makes the similarity equivalent to the normalized inner product of the reconstructed gradient functions, providing a clear mathematical interpretation rather than a strict guarantee of training benefits.
Regarding the checkpoint, we use gradients at the initial checkpoint for one-time data valuation to avoid the additional cost of repeatedly computing gradients during training. While gradient relationships may change during adaptation, the use of initial gradients represents a deliberate trade-off within the current fixed-budget method.
Revision: We will add the above mathematical derivation to the revised manuscript, clarify the connection and distinction between Shape Matching and first-order gradient matching, and further explain the rationale and applicability of using the initial checkpoint.
We sincerely thank the reviewer for this suggestion, which helps us further improve the theoretical explanation of our method.