<p>Source-free unsupervised domain adaptation (SFDA), which needs only pre-trained source model and unlabeled target data (<InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10115_2025_2385_Article_IEq1.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="22" /> </InlineMediaObject> <EquationSource Format="TEX">\({D}_{t}\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>D</mi> <mi>t</mi> </msub> </math></EquationSource> </InlineEquation>), has attracted lots of interests recently.Query Compared with unsupervised domain adaptation, SFDA is more practical since it can be applied to scenarios that lack of source data (<InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10115_2025_2385_Article_IEq2.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="23" /> </InlineMediaObject> <EquationSource Format="TEX">\({D}_{s}\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>D</mi> <mi>s</mi> </msub> </math></EquationSource> </InlineEquation>) due to data privacy. Although remarkable progresses have been made in the field of SFDA, it still remains challenge since most of the existing methods do not fully exploit the internal structure information of the <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10115_2025_2385_Article_IEq1.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="22" /> </InlineMediaObject> <EquationSource Format="TEX">\({D}_{t}\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>D</mi> <mi>t</mi> </msub> </math></EquationSource> </InlineEquation>. To bridge the gap, we propose prototype generative model leveraging inherent data structure mined by graph neural networks and forge a source-free domain adaptation method accordingly. Our method consists of two stages: (1) data mining and prototype generation and (2) domain adaptation. In stage one, we firstly use graph convolutional network and graph autoencoder to model the data relations of the <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10115_2025_2385_Article_IEq1.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="22" /> </InlineMediaObject> <EquationSource Format="TEX">\({D}_{t}\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>D</mi> <mi>t</mi> </msub> </math></EquationSource> </InlineEquation>, extract features and label the target features in a self-supervised way; then, we generate source-like avatar conditioned on features of the <InlineEquation ID="IEq5"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10115_2025_2385_Article_IEq1.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="22" /> </InlineMediaObject> <EquationSource Format="TEX">\({D}_{t}\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>D</mi> <mi>t</mi> </msub> </math></EquationSource> </InlineEquation>, labels and noise. In the second stage, a category-level alignment between the source prototypes and the <InlineEquation ID="IEq6"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10115_2025_2385_Article_IEq1.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="22" /> </InlineMediaObject> <EquationSource Format="TEX">\({D}_{t}\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>D</mi> <mi>t</mi> </msub> </math></EquationSource> </InlineEquation> is conducted based on contrastive learning strategy. Extensive experiments on Office-31, Office-Home and VisDA-2017 datasets prove the effectiveness and superiority of our method. Average accuracy rates of 90.7%, 76.1% and 87.4% are achieved, thereby leading to superior performance compared with the state-of-the-art methods.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Contrastive prototype source-free adaptation boosted by inherent data structure

  • Longxia Guo,
  • Yundong Li

摘要

Source-free unsupervised domain adaptation (SFDA), which needs only pre-trained source model and unlabeled target data ( \({D}_{t}\) D t ), has attracted lots of interests recently.Query Compared with unsupervised domain adaptation, SFDA is more practical since it can be applied to scenarios that lack of source data ( \({D}_{s}\) D s ) due to data privacy. Although remarkable progresses have been made in the field of SFDA, it still remains challenge since most of the existing methods do not fully exploit the internal structure information of the \({D}_{t}\) D t . To bridge the gap, we propose prototype generative model leveraging inherent data structure mined by graph neural networks and forge a source-free domain adaptation method accordingly. Our method consists of two stages: (1) data mining and prototype generation and (2) domain adaptation. In stage one, we firstly use graph convolutional network and graph autoencoder to model the data relations of the \({D}_{t}\) D t , extract features and label the target features in a self-supervised way; then, we generate source-like avatar conditioned on features of the \({D}_{t}\) D t , labels and noise. In the second stage, a category-level alignment between the source prototypes and the \({D}_{t}\) D t is conducted based on contrastive learning strategy. Extensive experiments on Office-31, Office-Home and VisDA-2017 datasets prove the effectiveness and superiority of our method. Average accuracy rates of 90.7%, 76.1% and 87.4% are achieved, thereby leading to superior performance compared with the state-of-the-art methods.