为时序与时空数据提出依赖感知的自监督对比学习框架
A theoretical framework for self-supervised contrastive learning for continuous dependent data
- 设计硬/软相似度度量,捕捉连续依赖数据的语义邻近性
- 在UEA/UCR基准上准确率提升4.17%和2.08%,干旱分类ROC-AUC高7%
- 理论推导依赖感知损失函数,适合处理复杂时空模式
自监督学习(SSL)在计算机视觉等领域表现强大,但在具有复杂相关性的时序与时空数据中应用仍不充分。传统对比学习常假设样本间语义独立,这不适用于存在强依赖的数据。本文提出一种针对连续依赖数据的新型理论框架,允许最近邻样本在语义上也相近。我们定义了两种真实相似度度量——硬邻近与软邻近,并据此推导出可容纳两类邻近性的估计相似度矩阵,从而引入依赖感知的损失函数。所提方法Dependent TS2Vec在时序与时空下游任务中验证有效:在标准UEA和UCR基准上,分别实现4.17%和2.08%的准确率提升;在涉及复杂时空模式的干旱分类任务中,ROC-AUC提升7%。
原文摘要 · Abstract (English)
Self-supervised learning (SSL) has emerged as a powerful approach to learning representations, particularly in the field of computer vision. However, its application to dependent data, such as temporal and spatio-temporal domains, remains underexplored. Besides, traditional contrastive SSL methods often assume \emph{semantic independence between samples}, which does not hold for dependent data exhibiting complex correlations. We propose a novel theoretical framework for contrastive SSL tailored to \emph{continuous dependent data}, which allows the nearest samples to be semantically close to each other. In particular, we propose two possible \textit{ground truth similarity measures} between objects -- \emph{hard} and \emph{soft} closeness. Under it, we derive an analytical form for the \textit{estimated similarity matrix} that accommodates both types of closeness between samples, thereby introducing dependency-aware loss functions. We validate our approach, \emph{Dependent TS2Vec}, on temporal and spatio-temporal downstream problems. Given the dependency patterns presented in the data, our approach surpasses modern ones for dependent data, highlighting the effectiveness of our theoretically grounded loss functions for SSL in capturing spatio-temporal dependencies. Specifically, we outperform TS2Vec on the standard UEA and UCR benchmarks, with accuracy improvements of $4.17$\% and $2.08$\%, respectively. Furthermore, on the drought classification task, which involves complex spatio-temporal patterns, our method achieves a $7$\% higher ROC-AUC score.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。