拆解时间序列特征,让模型更懂跨域迁移的真正知识。
From Entanglement to Alignment: Representation Space Decomposition for Unsupervised Time Series Domain Adaptation
- 将特征分解为可迁移与不可迁移部分,实现精准对齐。
- 在4个数据集上优于12种方法,35次表现最优。
- 适合处理分布不同但相似的时间序列数据迁移任务。
领域偏移是时间序列分析中的核心挑战,源域训练的模型在目标域常失效。现有无监督域适应(UDA)方法通常将特征视为整体进行对齐,忽略其内在构成。本文提出DARSD框架,从表征空间分解视角实现可解释的无监督域适应。核心思想是:有效迁移不仅需对齐,还需分离出可迁移知识。DARSD包含三部分:(I) 可学习的对抗性公共不变基,将原始特征投影至域不变子空间并保留语义;(II) 基于置信度动态分离目标特征的原型伪标签机制,防止误差累积;(III) 混合对比优化策略,同时强化聚类与一致性,缓解分布差距。在四个基准数据集(WISDM、HAR、HHAR、MFD)上的实验表明,DARSD优于12种已有算法,在53组测试中取得35次最优成绩,所有基准均排名第一。
原文摘要 · Abstract (English)
Domain shift poses a fundamental challenge in time series analysis, where models trained on source domain often fail dramatically when applied in target domain with different yet similar distributions. While current unsupervised domain adaptation (UDA) methods attempt to align cross-domain feature distributions, they typically treat features as indivisible entities, ignoring their intrinsic compositions that govern domain adaptation. We introduce DARSD, a novel UDA framework with theoretical explainability that explicitly realizes UDA tasks from the perspective of representation space decomposition. Our core insight is that effective domain adaptation requires not just alignment, but principled disentanglement of transferable knowledge from mixed representations. DARSD consists of three synergistic components: (I) An adversarial learnable common invariant basis that projects original features into a domain-invariant subspace while preserving semantic content; (II) A prototypical pseudo-labeling mechanism that dynamically separates target features based on confidence, hindering error accumulation; (III) A hybrid contrastive optimization strategy that simultaneously enforces feature clustering and consistency while mitigating emerging distribution gaps. Comprehensive experiments conducted on four benchmarks (WISDM, HAR, HHAR, and MFD) demonstrate DARSD's superiority against 12 UDA algorithms, achieving optimal performance in 35 out of 53 scenarios and ranking first across all benchmarks.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。