- Rating
- 1
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
The paper proposes Temporal Hide&Seek (T-HiSe), which extends Hide&Seek to instance-wise selection of time–feature cells in time series. A Transformer Hide network outputs a continuous mask over all cells of the input window. An LSTM Seek network predicts from a mixed window, in which hidden cells are blended with feature trajectories copied from earlier training windows. Both networks are trained jointly with an annealed sparsity penalty.
Critical strengths
- The synthetic benchmarks provide exact ground-truth supports, including context-dependent supports that switch between windows.
- The benchmark generation is transparent. The data-generating processes were fixed before model tuning, and code is provided for all experiments.
Critical weaknesses
- The problem definition and terminology are ambiguous. It is unclear what “this” refers to in the second paragraph of the introduction. “Cell” is used without definition until it appears as a time-feature pair in the contributions. The stated goal mixes explaining an existing predictor with selecting features by jointly training a selector and a predictor. “Relevant” is not defined with respect to either the label or the predictor.
- The claim that time series are harder than tabular data is weakly supported. Of the three properties, window-dependent supports and cells that cannot be judged in isolation apply equally to instance-wise selection on tabular data. The only time-series-specific difficulty is that replacement values break autocorrelation. No evidence shows that existing methods actually fail.
- The problem is hard to regard as unsolved. The introduction does not discuss time-series methods that already learn time–feature masks with temporal perturbations, such as DynaMask, ExtrMask, and ContraLSP. The contribution is therefore limited.
- The link between the challenges and the solution is weak. Any selector that reads the full input already accounts for context, so the Transformer is an architecture choice rather than a new solution. Replacing hidden cells with trajectories from earlier windows creates discontinuities at the boundaries with retained values and breaks cross-feature correlations.
- In joint training, the predictor adapts to the replaced inputs, which weakens the OOD motivation itself. Meanwhile, the known key problem of joint training, namely the selector encoding the prediction in the selection (Jethani et al., 2021), is handled only by two informal safeguards: Seek does not see the mask, and hidden cells are filled with real data. No test is included that could detect such encoding.
- There is no ablation. It is impossible to tell which of the Transformer Hide network, trajectory-based donor replacement, or annealing produces the gain over Hide&Seek.
- The baseline comparison is unfair. DynaMask is run without temporal regularization, WinIT’s learned generator is replaced with marginal sampling, and L2X and INVASE use zero replacement. Hide&Seek uses different epoch and settings, and LIME, TimeSHAP, and WinIT explain only 200 windows. ExtrMask (Enguehard, 2023) is cited but not compared. The choice of is not justified.
- The synthetic data favor the proposed method. Because the features are independent AR(1) processes, independent per-feature donor replacement is exactly in-distribution. Support positions are also fixed relative to the window end. This advantage is not guaranteed on real data with correlated features.
- On real data, T-HiSe is compared only against random selection, not against other explainers. On EEG, a logistic model on amplitude alone outperforms T-HiSe, and the correlation between the mask and is only 0.28. The added value of the explanation is unclear.
Questions for authors
See the weaknesses.
We thank the reviewer for the careful review. We agree with the main points and have revised the paper accordingly.
Thank you again for the helpful feedback.