不依赖数据增强,通过窗口内子结构对比学习鲁棒时序特征。
Divide and Contrast: Learning Robust Temporal Features without Augmentation

- 将时间窗口随机划分为重叠子块,对比内部结构而非单个时间点。
- 在6个真实世界数据集上达到顶尖分类与迁移性能,训练速度显著提升。
- 适合处理长序列且对标注数据少的场景,尤其适合时序建模研究者。
针对时序表征自监督学习中依赖标签数据、计算开销大或假设不成立的问题,本文提出无需数据增强和多轮编码的Di-COT框架。该方法在每个时间窗口内随机划分少量重叠子块,通过对比子块间信息来学习表征,有效减少时序转换中的误判。采用与批次大小和子块数相关的对比损失,使计算独立于序列长度,显著提升可扩展性。在六个大规模真实数据集及UCR、UEA基准测试中,Di-COT均实现领先分类、聚类、kNN和跨数据集迁移性能,同时大幅缩短训练时间。代码已开源。
原文摘要 · Abstract (English)
Self-supervised learning for time-series representation aims to reduce reliance on labeled data while maintaining strong downstream performance, yet many existing approaches incur high computational costs or rely on assumptions that do not hold across diverse temporal dynamics. In this work, we introduce Divide and Contrast (Di-COT), an unsupervised framework that avoids data augmentation and multiple encoder passes by contrasting informative substructures within a window rather than individual timesteps. Di-COT stochastically partitions each window into a small number of overlapping sub-blocks per iteration, enabling efficient and meaningful contrast while mitigating false positives during temporal transitions. To further improve scalability, we adopt a contrastive objective whose computation depends on the batch size and the number of sub-blocks, making loss computation independent of sequence length. Extensive experiments on six large-scale real-world datasets, as well as the UCR and UEA benchmarks, demonstrate that Di-COT learns semantically structured and transferable representations, achieving state-of-the-art performance on classification, clustering, $k$NN, and cross-dataset transfer, while substantially reducing training time. The source code is publicly available at https://github.com/sfi-norwai/Di-COT.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。