- Rating
- 2
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
In order to account for the varying sampling density within one sample, the paper proposes ScaleIMTS, which mainly includes scale expert router, event patch encoder, and prior refinement module. Experiements on forecasting and classification tasks demonstrate its competitve performance.
Critical strengths
- The experimental comparisons are up-to-date and comprehensive.
Critical weaknesses
- "Scale" is used interchangably with "sampling density" in this paper, which makes it really unprofessional and weird. For example, the claim from line 14 "existing methods lack explicit local scale adaptation", should use "lack explicit sampling density considerations". Moreover, the claim is weak. For a non-multi-scale method, there's no "scale" concept in its network. Also, why "lack explicit local scale adaptation" will "overlook this local scale heterogeneity"? Even without any patch or multi-scale techniques, classic methods like Raindrop[1] already leverage the sampling density information in their learning.
- Model structure is redundant, and Figure 2 is horrible. Why would we need both a scale MoE branch and a patch encoder branch in parallel, now that they both encodes IMTS data? Why not sequential or merged as one? Why different experts are essentially of the same MLP structure instead of being truely scale-specific? Is prior refinement module a trick-only module?
[1] X. Zhang, M. Zeman, T. Tsiligkaridis, and M. Zitnik, “Graph-Guided Network for Irregularly Sampled Multivariate Time Series,” presented at the International Conference on Learning Representations, 2022.
Questions for authors
See weaknesses.
Dear Reviewer 3h5E,
Thank you for the constructive review. We have clarified the terminology and contribution, explained the complementary roles of the model components, and added a controlled analysis of expert specialization.
Q1: Justification of “Scale” claims
We define local temporal scale as the effective temporal granularity within variable v and window W, measured by the mean inter-observation interval Δv,W. Sampling density describes observation frequency. The concepts are related—denser observations imply shorter intervals and finer observed granularity—but are not interchangeable. “Scale” describes the sampling pattern, not an assumed multi-scale architecture in every baseline.
Raindrop already models irregularity: it builds sample-specific sensor graphs and uses observation and time information to capture sample- and time-varying sensor dependencies, then aggregates observation representations over time. ScaleIMTS complements this by summarizing timestamps within each variable-specific segment and using these statistics to route frozen Timer representations among short-, mid-, and long-context experts. Its Event Patch Encoder represents each event by its value, timestamp, and preceding interval, and models temporal patterns across patches and cross-variable interactions within patches. ScaleIMTS thus explicitly adapts pretrained temporal representations to local interval changes.
Q2: Figure issue and clarification of the MoE branch
The Scale Expert Router and Event Patch Encoder process complementary representations. The router partitions frozen Timer tokens into segments and applies corrections conditioned on local timestamp statistics. The patch encoder processes raw events to represent asynchronous local dynamics and patch-specific cross-variable interactions. Its global irregular context informs the router, while its variable-level features condition prior refinement.
The three experts have independent parameters and distinct inputs despite sharing a two-layer MLP form: the short expert uses the last valid token, the mid expert uses within-segment variation, and the long expert uses the first token and element-wise maximum. The router mixes their corrections using segment statistics and context.
We tested specialization by disabling each expert at test time, renormalizing the remaining routing weights, and grouping samples by training-set interval tertiles. Entries show metric changes from the full model; bold indicates the largest degradation in each group.
Across all four datasets, removing the expert matched to an interval group produces that group’s largest metric change, showing distinct expert contributions across local sampling regimes.
Prior Refinement uses an MLP conditioned on the Event Patch feature and target-time query to generate per-variable affine scale and shift parameters for the scale-adapted prior. On P19, the full model obtains 93.4 AUROC/68.2 AUPRC, versus 90.8/65.4 with Additive Update and 90.7/63.1 with Concat Fusion; removing Event Patch lowers AUPRC to 64.4. These ablations show the value of query-conditioned refinement and event features.