- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper investigates whether fixed patching makes time-series foundation models more sensitive to input perturbations at patch ends. It first examines loss gradients on clean inputs, then changes tokenizer alignment and patch length to test whether sensitivity peaks move with patch positions. BoundaryWarp uses this observation to introduce a boundary prior into monotone, displacement-bounded temporal resampling, increasing forecasting error while preserving temporal order and endpoints. Experiments on Chronos-Bolt, Moirai, and TimesFM across four datasets compare random warps, boundary-unaware optimized warps, and BoundaryWarp. The results support a relationship between sensitivity and tokenizer position and show that optimized temporal warps can increase error, although the extra gain from the boundary prior varies across models.
Critical strengths
-
The alignment experiment tests a falsifiable prediction. The descriptive pooled alignment profiles track the predicted tokenizer-relative phase, and the patch-length intervention provides complementary evidence. Series-balanced exact peaks agree in 43 of 48 configurations, while the stricter joint direct-peak criterion supports 26 of 48. The internal-boundary, recency-detrended, and content-matched comparisons help distinguish the observed pattern from the recency and local-content explanations tested in the paper. This finding is the main reason I support acceptance.
-
The matched controls separate optimization from the boundary prior. Optimized Warp shares the objective, parameterization, optimizer, and budget with BoundaryWarp and differs only in the prior. This separates the benefit of optimizing a warp from the extra benefit of knowing the patch grid, and it lets the paper report that the prior gives a recurring rather than universal gain.
Critical weaknesses
-
The link from value sensitivity to time-warp vulnerability is assumed. Equation (2) measures sensitivity to observed values, while the attack in Section 3.3 changes sampling times. A sub-sample warp changes the value at a position roughly by the local slope times the displacement, so vulnerability depends on the signal’s local variation as well as on s_t. The paper does not show that high s_t predicts where optimized warps place displacement or how much error they add. The “exploiting” part of the contribution therefore rests on the prior’s added effect.
-
That added effect is uneven. In Table 1, the gain of BoundaryWarp over Optimized Warp is 2.31, 1.25, and 1.65 points, and the TimesFM interval includes zero; 20 of 36 settings remain significant after Holm correction. Under output-only access in Section 4.3, boundary-weighted SPSA does not beat uniform SPSA in any setting. The evidence therefore supports tokenizer-relative sensitivity more strongly than an attack that needs the true grid, which limits my enthusiasm for the method.
Questions for authors
- Without the prior, where does Optimized Warp place its displacement? If it already concentrates near patch boundaries, the prior mainly speeds up a ten-step search; if not, the sensitivity analysis and the attack may be exploiting different things.
- Does the gain over Optimized Warp in Table 1 come with larger realized displacement or roughness, given that the prior reweights intervals before the L∞ rescaling?
- Correct and shifted boundary priors (e.g., shifted by half a patch) compared at the same optimization budget and similar realized displacement. If the shifted prior performs as well, the gain does not depend on knowing the true boundary locations.
- Per-window rank correlation between attack gain and s_t at the displaced positions, alone and weighted by the local slope.
Thanks for your response.
Thanks for the responses. I maintain my score. However, the quality of the text and fighures need to be improved. For example, Figure 1 need to be polished; Table 1 is hard to understand.