用代码转移矩阵提升时间序列无监督域适应的伪标签质量
TransPL: VQ-Code Transition Matrices for Pseudo-Labeling of Time Series Unsupervised Domain Adaptation
- 通过向量量化后构建跨通道与时间的代码转移矩阵
- 在4个基准上提升准确率6.1%,F1值提升4.9%
- 适合需要可解释伪标签的工业时间序列场景
时间序列无监督域适应(UDA)仍是深度学习中的关键挑战,传统伪标签策略无法捕捉时序模式和域间通道变化,导致伪标签质量不佳。本文提出TransPL,通过向量量化(VQ)对时间序列片段生成代码,并构建源域的类别与通道级代码转移矩阵,利用贝叶斯规则进行目标域适配,基于通道加权的类别条件似然生成伪标签。该方法显式建模了时序转移与跨域通道偏移,适用于多种UDA场景(如弱监督UDA),并提供可解释的伪标签生成过程。在四个时间序列UDA基准上验证,其性能显著优于现有伪标签方法(准确率提升6.1%,F1提升4.9%),且学习到的代码转移矩阵可揭示域适应机制。
原文摘要 · Abstract (English)
Unsupervised domain adaptation (UDA) for time series data remains a critical challenge in deep learning, with traditional pseudo-labeling strategies failing to capture temporal patterns and channel-wise shifts between domains, producing sub-optimal pseudo-labels. As such, we introduce TransPL, a novel approach that addresses these limitations by modeling the joint distribution $P(\mathbf{X}, y)$ of the source domain through code transition matrices, where the codes are derived from vector quantization (VQ) of time series patches. Our method constructs class- and channel-wise code transition matrices from the source domain and employs Bayes' rule for target domain adaptation, generating pseudo-labels based on channel-wise weighted class-conditional likelihoods. TransPL offers three key advantages: explicit modeling of temporal transitions and channel-wise shifts between different domains, versatility towards different UDA scenarios (e.g., weakly-supervised UDA), and explainable pseudo-label generation. We validate TransPL's effectiveness through extensive analysis on four time series UDA benchmarks and confirm that it consistently outperforms state-of-the-art pseudo-labeling methods by a strong margin (6.1% accuracy improvement, 4.9% F1 improvement), while providing interpretable insights into the domain adaptation process through its learned code transition matrices.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。