arXiv:2504.09814cs.CV2025-04被引 4

轻量模型也能高效做无监督域适应,提升分割精度。

DUDA: Distilled Unsupervised Domain Adaptation for Lightweight Semantic Segmentation

  • 用知识蒸馏+EMA,让小模型学大模型的伪标签
  • 在四个基准上超越现有轻量模型,甚至超过大模型表现
  • 适合资源受限场景下的高效语义分割应用

无监督域适应(UDA)对新领域实现语义分割至关重要,无需昂贵的像素级标注。当前最先进的方法主要采用架构相同的教师-学生网络进行自训练,依赖指数移动平均(EMA)更新。然而,这类方法在轻量模型上性能显著下降,因架构僵化导致伪标签质量差。为此,我们提出一种新型框架DUDA,将EMA自训练与知识蒸馏(KD)结合。通过引入辅助学生网络,弥合重型与轻型模型间的架构差距,以提升伪标签质量。DUDA采用创新策略:从大到小渐进式蒸馏、优先关注适应较差类别的不一致性损失,以及多教师学习。在四个主流UDA基准上的大量实验表明,DUDA在轻量模型上达到最先进性能,常优于其他方法中的重型模型。

原文摘要 · Abstract (English)

Unsupervised Domain Adaptation (UDA) is essential for enabling semantic segmentation in new domains without requiring costly pixel-wise annotations. State-of-the-art (SOTA) UDA methods primarily use self-training with architecturally identical teacher and student networks, relying on Exponential Moving Average (EMA) updates. However, these approaches face substantial performance degradation with lightweight models due to inherent architectural inflexibility leading to low-quality pseudo-labels. To address this, we propose Distilled Unsupervised Domain Adaptation (DUDA), a novel framework that combines EMA-based self-training with knowledge distillation (KD). Our method employs an auxiliary student network to bridge the architectural gap between heavyweight and lightweight models for EMA-based updates, resulting in improved pseudo-label quality. DUDA employs a strategic fusion of UDA and KD, incorporating innovative elements such as gradual distillation from large to small networks, inconsistency loss prioritizing poorly adapted classes, and learning with multiple teachers. Extensive experiments across four UDA benchmarks demonstrate DUDA's superiority in achieving SOTA performance with lightweight models, often surpassing the performance of heavyweight models from other approaches.

无监督域适应知识蒸馏轻量分割自训练

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。