- Rating
- 4(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper proposes Adaptive Data-Dependent Pruning (ADDP), a training framework for irregular multivariate time-series forecasting. ADDP includes patch scoring, the size of a shared core retained across two training views, and the temperature of a smooth worst-view objective. Conservative and aggressive views share the same forecasting backbone, while inference uses the complete observed history in a single pass.
Critical strengths
-
Clear motivation. Historical observations can contain redundant segments, and the same pruning rule may not work well for every sample. Using a history-dependent signal to adjust pruning is a reasonable way to address this problem.
-
Clear presentation and visualization. The figures and tables make the ADDP pipeline easy to follow and clearly present the component analyses, helping readers understand the shared signal and how it guides the three decisions in ADDP.
-
Solid experiments. The paper evaluates ADDP on four common datasets and compares it with a broad range of baselines. The backbone comparisons, component ablations, and sensitivity analyses provide useful support for the reported improvements.
Critical weaknesses
-
It is unclear how some "learnable calibrators" actually learn. The paper says these calibrators are updated through the training objective, but does not explain how gradients pass through these decisions.
-
The data splits need more detail. For Activity, four-second windows are generated with a 500 ms stride, so neighboring windows overlap substantially. It is important to clarify how these windows are separated into training, validation, and test sets before drawing conclusions from the reported improvements.
Questions for authors
- How are the calibrators updated? Could the authors explain how the patch-scoring and shared-core calibrators are updated during training?
5 comments
Continued from previous comment
In this run, the scoring and shared-core calibrators received gradients in 99.25% and 100% of training batches, respectively. By epoch 49, the recency weight had increased from 0.3057 to 3.5411, and the mean fraction of patches shared by the two views had moved from 42.63% to 44.19%. These results show that the continuous gradient paths are active in training and that both patch scoring and the shared-core ratio change over the course of training. We will specify the full training objective in §§3.6–3.8 and show which loss updates each parameter group in the pseudocode in Appendix A.
W2. How were the overlapping Activity windows split, and what happens when recording IDs are kept in separate splits?
The original experiment generated windows before randomly splitting them, so overlapping windows from the same recording could appear in different splits.
We split the data by recording ID and retrained both methods. The 25 recording IDs (A01–E05) represent five people with five recordings each. We assigned 15 recording IDs to training, 5 to validation, and 5 to testing before generating windows. All windows from a given recording stay in the same split. Different recordings from the same person can appear in different splits. We computed normalization statistics using only historical observations from the training recordings. Both methods used the same recording-ID split, training budget, and evaluation procedure.
| Activity recording-ID split | Test MSE ↓ |
|---|---|
| Backbone | 0.0025566 |
| Backbone + ADDP | 0.0023427 |
On the held-out recordings, ADDP reduced test MSE from 0.0025566 to 0.0023427, an 8.37% reduction. The revised “Dataset Tasks” subsection describes the original window-level split, the recording-ID assignments, the window generation order, and the normalization protocol. “Activity Evaluation with Held-Out Recordings” reports the paired results. The code is available in the anonymous ADDP repository.
Finally, thank you once again for the patient and thorough reading of our paper and recognizing its strengths. Your thoughtful questions and suggestions helped us improve the manuscript. We would be happy to continue the discussion if you have any further questions!
Thank you for the detailed response and for rerunning the Activity experiment. The explanation of the score margin loss and the shared-core regularizer clarifies how the two calibrators are updated despite the discrete selection steps. The gradient measurements also address my question about whether these parameters receive updates in practice. The new experiment with disjoint recording IDs addresses my concern about overlapping windows across splits. It is reassuring that ADDP still improves over the backbone under this split. Please include the full training objective and the recording-level split protocol in the revised paper. The response addresses my main concerns. I remain in favor of acceptance.
Response to Reviewer tTEx
Response to Reviewer tTEx
Thank you for highlighting the clear motivation, the presentation of the ADDP pipeline, and the breadth of our experimental evaluation. In response to your questions about calibrator updates and the Activity data split, we recorded gradients during training and retrained both methods on an Activity split with disjoint recording IDs.
W1 & Q1. How do the scoring and shared-core calibrators learn with hard ranking and rounding?
A single optimizer updates the forecasting backbone and all three calibrators in the same training run. The scoring calibrator receives gradients through continuous patch scores, and the shared-core calibrator receives gradients through the shared-core ratio before rounding. Sections 3.6–3.8 already define the continuous mappings for all three calibrators. In the forward pass, ADDP uses hard ranking and top-k selection to choose patches and rounding to determine the size of the shared core. Gradients stop at these discrete operations. The table below shows which loss updates each parameter group.
The full training objective is
=\mathcal L_{\mathrm{pred}} +\lambda_s\mathcal L_{\mathrm{score}} +\lambda_c\mathcal L_{\mathrm{core}}.$$ **Scoring calibrator.** Section 3.6 already defines the softmax weights for the two scoring channels and the recency weight $\lambda_u=\operatorname{softplus}(a_u)$. Once the forward pass identifies the kept and dropped patches, the score margin loss uses the continuous scores of the two groups directly. $$\mathcal L_{\mathrm{score}} =\left[m+\bar s_{\mathrm{drop}}-\bar s_{\mathrm{keep}}\right]_+.$$ If the average score of the kept patches falls short of the required margin above the average score of the dropped patches, this loss updates the scoring weights through the continuous scores of both groups. Hard ranking determines group membership, and the margin loss adjusts the scores. **Shared-core calibrator.** Section 3.7 already defines the continuous shared-core ratio. $$\rho(\gamma) =\rho_{\min}+(\rho_{\max}-\rho_{\min}) \operatorname{sigmoid}\!\left(a_c-\operatorname{softplus}(b_c)\gamma\right).$$ The forward pass uses this ratio to determine how many patches the two views share. The shared-core regularizer acts directly on $\rho(\gamma)$ before rounding. This gives $a_c,b_c$ a gradient and discourages extreme shared-core ratios. **Temperature calibrator.** Section 3.8 already defines how to combine the losses from the two views. For a sample with forecasting losses $\ell_1$ and $\ell_2$, the combined loss is $$\tau(\gamma)\log\!\left[ \frac{\exp(\ell_1/\tau(\gamma))+\exp(\ell_2/\tau(\gamma))}{2} \right].$$ A lower temperature gives more weight to the view with the higher loss. Because $\tau(\gamma)$ enters this calculation directly, the main forecasting loss can update the temperature parameters. **Gradients and changes during training.** We recorded the fraction of training batches with nonzero gradients for each calibrator on Activity. | Activity calibrator | Gradient source | Training batches with nonzero gradients | |---|---|---:| | Scoring calibrator | Score margin loss | 99.25% | | Shared-core calibrator | Shared-core regularizer | 100% | | Temperature calibrator | Main forecasting loss | 99.89%–100% | | Activity calibration quantity | Epoch 1 | Epoch 49 | |---|---:|---:| | Weight on within-patch variation in the high-roughness channel | 0.6400 | 0.8632 | | Weight on patch-mean deviation in the low-roughness channel | 0.4316 | 0.6861 | | Recency weight $\lambda_u$ | 0.3057 | 3.5411 | | Mean shared-core ratio $\rho$ | 0.4263 | 0.4419 | | Mean loss temperature $\tau$ | 1.4747 | 2.2747 | --- Due to the character limit, please see the remaining questions in the following comment.