LGAIOct 2, 2025

Learning Time-Series Representations by Hierarchical Uniformity-Tolerance Latent Balancing

arXiv:2510.01658v11 citationsh-index: 20Trans. Mach. Learn. Res.
Originality Incremental advance
AI Analysis

This work addresses representation learning for time-series data, which is incremental as it builds on contrastive methods with hierarchical and tolerance-balancing improvements.

The paper tackled the problem of learning time-series representations by balancing uniformity and tolerance in embeddings, resulting in outperforming prior methods on classification tasks and achieving competitive results for anomaly detection.

We propose TimeHUT, a novel method for learning time-series representations by hierarchical uniformity-tolerance balancing of contrastive representations. Our method uses two distinct losses to learn strong representations with the aim of striking an effective balance between uniformity and tolerance in the embedding space. First, TimeHUT uses a hierarchical setup to learn both instance-wise and temporal information from input time-series. Next, we integrate a temperature scheduler within the vanilla contrastive loss to balance the uniformity and tolerance characteristics of the embeddings. Additionally, a hierarchical angular margin loss enforces instance-wise and temporal contrast losses, creating geometric margins between positive and negative pairs of temporal sequences. This approach improves the coherence of positive pairs and their separation from the negatives, enhancing the capture of temporal dependencies within a time-series sample. We evaluate our approach on a wide range of tasks, namely 128 UCR and 30 UAE datasets for univariate and multivariate classification, as well as Yahoo and KPI datasets for anomaly detection. The results demonstrate that TimeHUT outperforms prior methods by considerable margins on classification, while obtaining competitive results for anomaly detection. Finally, detailed sensitivity and ablation studies are performed to evaluate different components and hyperparameters of our method.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes