- Rating
- 3(+1)
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper presents K-ICL, a kernel-guided instance-wise contrastive learning framework for time series representation learning. Unlike conventional contrastive learning methods that primarily rely on augmented views of the same instance as positive pairs and treat other instances as negatives, K-ICL uses kernel similarity to guide the probabilistic selection of positive and negative samples. Specifically, samples with higher kernel similarity are more likely to be selected as positives, while those with lower similarity are more likely to be selected as negatives. The authors evaluate K-ICL on multiple time series datasets under both class-balanced and class-imbalanced settings, reporting improvements over existing baselines in clustering and classification-related metrics. They further investigate different kernel functions, sampling strategies, and temperature settings.
Critical strengths
S1. Evaluates the method under both balanced and imbalanced settings.
S2. Includes ablation studies on kernel functions and sampling strategies.
Critical weaknesses
W1. The reliability of kernel similarity as a proxy for semantic similarity is insufficiently investigated. The central assumption of K-ICL is that kernel similarity can provide useful guidance for identifying semantically related instances. However, similarity in the signal space does not necessarily imply semantic or class similarity, particularly for time series with substantial intra-class variations or inter-class similarities. The choice of kernel may also affect how well this assumption holds across different datasets and tasks. Although the paper evaluates different kernel functions, it does not sufficiently investigate the conditions under which kernel similarity reliably reflects semantic relationships. A more comprehensive analysis would help establish the validity and limitations of the central assumption underlying K-ICL.
W2. Probabilistic pair selection may introduce inconsistent training signals across iterations. K-ICL samples positive and negative pairs probabilistically according to kernel similarity. While this design avoids relying on hard thresholds, it also means that the same pair of instances may be selected as a positive pair in one iteration and as a negative pair in another. Such relationship reversals could introduce conflicting gradients and additional optimization noise, especially for pairs whose kernel similarities yield comparable probabilities of being selected as positives or negatives. The current experiments do not sufficiently characterize the extent of this instability or establish whether probabilistic sampling offers a consistent advantage over deterministic alternatives. Although the comparison with ranking-based and threshold-based strategies is useful, a more direct investigation of pair-selection consistency and training stability would strengthen the justification for this design choice.
W3. The manuscript contains several avoidable proofreading and presentation errors. The paper does not appear to have been thoroughly proofread. For example, the caption of Figure 1 describes the two parts of the figure as “Top” and “Bottom,” whereas the actual panels are arranged horizontally, from left to right. Moreover, the figure itself appears to label the proposed method as “KTCL” instead of “K-ICL.” There are also grammatical and spelling errors in the conclusion, including “the learned represenation” and “Future work also aim at”.
Questions for authors
Q1. How reliable is kernel similarity as a proxy for semantic similarity under different augmentation strategies?
Q2. How frequently do pair relationships reverse across training iterations, and do these reversals affect optimization stability?
Q3. What is the specific benefit of probabilistic sampling over deterministic pair selection?
Thanks for your review. We address your concerns and questions in the answers below. We made several changes in the manuscript, highlighted in blue in the revised version.
W1 / Q1: kernel similarity as semantic proxy. This is measured directly in the paper: pair precision and recall (Table 1) quantify how well kernel similarity reflects class membership, since if it were a poor proxy, high-similarity pairs would often be different-class and positive precision would be low. We now state this explicitly in Sec. 4.2. Its dependence on the kernel is analyzed in the kernel ablation (Table 8): the assumption holds strongly for alignment-aware kernels (GAK, DTW) and degrades for Euclidean. We do not assume signal similarity guarantees class agreement. It can fail under high intra-class variation or inter-class similarity, which is why Sec. 3.3 / App. B make the guarantee conditional on similarity-score separation, with an overlap-aware extension.
The paper thus provides empirical evidence of both the usefulness and the limitations of the proxy on the evaluated datasets.
W2 / Q2, Q3: sampling consistency and stability. We measured this directly in two new experiments (App. A.7, Figs. 6-7):
Resampling fixed batches 2,000 times; only 1-3% of pairs ever reverse, concentrated on ambiguous mid-similarity pairs, which are mostly not selected. The most similar 10% reverse in under 0.12% of cases, and the anchor's own view stays positive 98.7-99.9% of the time. Since the kernel is computed on the inputs, these probabilities are fixed by the data and do not drift during training.
At fixed weights, resampling only the pairs perturbs the gradient far less than resampling a full mini-batch step, so pair sampling adds less noise than the stochasticity CL already tolerates. For ambiguous pairs no correct hard label exists in our unsupervised setting, so soft exposure is preferable to a possibly wrong hard assignment (as in hard vs soft pseudo-labeling). This is consistent with our sampling-rule ablation (Table 5), where probabilistic sampling is the most robust.
W3: proofreading. Fixed.