Loading…

Instance Correlation Graph for Unsupervised Domain Adaptation

In recent years, deep neural networks have emerged as a dominant machine learning tool for a wide variety of application fields. Due to the expensive cost of manual labeling efforts, it is important to transfer knowledge from a label-rich source domain to an unlabeled target domain. The core problem...

Full description

Saved in:
Bibliographic Details
Published in:ACM transactions on multimedia computing communications and applications 2022-02, Vol.18 (1s), p.1-23
Main Authors: Wu, Lei, Ling, Hefei, Shi, Yuxuan, Zhang, Baiyan
Format: Article
Language:English
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c155t-264e8f7cf066f5ff621641f9eb429801a89affa804e22b188808ab85cd3296993
cites cdi_FETCH-LOGICAL-c155t-264e8f7cf066f5ff621641f9eb429801a89affa804e22b188808ab85cd3296993
container_end_page 23
container_issue 1s
container_start_page 1
container_title ACM transactions on multimedia computing communications and applications
container_volume 18
creator Wu, Lei
Ling, Hefei
Shi, Yuxuan
Zhang, Baiyan
description In recent years, deep neural networks have emerged as a dominant machine learning tool for a wide variety of application fields. Due to the expensive cost of manual labeling efforts, it is important to transfer knowledge from a label-rich source domain to an unlabeled target domain. The core problem is how to learn a domain-invariant representation to address the domain shift challenge, in which the training and test samples come from different distributions. First, considering the geometry of space probability distributions, we introduce an effective Hellinger Distance to match the source and target distributions on statistical manifold. Second, the data samples are not isolated individuals, and they are interrelated. The correlation information of data samples should not be neglected for domain adaptation. Distinguished from previous works, we pay attention to the correlation distributions over data samples. We design elaborately a Residual Graph Convolutional Network to construct the Instance Correlation Graph (ICG). The correlation information of data samples is exploited to reduce the domain shift. Therefore, a novel Instance Correlation Graph for Unsupervised Domain Adaptation is proposed, which is trained end-to-end by jointly optimizing three types of losses, i.e., Supervised Classification loss for source domain, Centroid Alignment loss to measure the centroid difference between source and target domain, ICG Alignment loss to match Instance Correlation Graph over two related domains. Extensive experiments are conducted on several hard transfer tasks to learn domain-invariant representations on three benchmarks: Office-31, Office-Home, and VisDA2017. Compared with other state-of-the-art techniques, our method achieves superior performance.
doi_str_mv 10.1145/3486251
format article
fullrecord <record><control><sourceid>crossref</sourceid><recordid>TN_cdi_crossref_primary_10_1145_3486251</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>10_1145_3486251</sourcerecordid><originalsourceid>FETCH-LOGICAL-c155t-264e8f7cf066f5ff621641f9eb429801a89affa804e22b188808ab85cd3296993</originalsourceid><addsrcrecordid>eNo9j01PwzAQRC0EEqUg_oJvnAJex97aBw5VoKVSJS70HG0crwhqk8gOSPx7vipOM4fRGz0hrkHdAhh7VxqH2sKJmIG1UKBDe_rf7eJcXOT8plSJ1uBM3G_6PFEfoqyGlOKepm7o5TrR-Cp5SHLX5_cxpo8ux1Y-DAfqerlsaZx-h5fijGmf49Ux52K3enypnort83pTLbdF-P6dCo0mOl4EVohsmVEDGmAfG6O9U0DOEzM5ZaLWDTjnlKPG2dCW2qP35Vzc_HFDGnJOkesxdQdKnzWo-se6PlqXXxT1SKw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Instance Correlation Graph for Unsupervised Domain Adaptation</title><source>Association for Computing Machinery:Jisc Collections:ACM OPEN Journals 2023-2025 (reading list)</source><creator>Wu, Lei ; Ling, Hefei ; Shi, Yuxuan ; Zhang, Baiyan</creator><creatorcontrib>Wu, Lei ; Ling, Hefei ; Shi, Yuxuan ; Zhang, Baiyan</creatorcontrib><description>In recent years, deep neural networks have emerged as a dominant machine learning tool for a wide variety of application fields. Due to the expensive cost of manual labeling efforts, it is important to transfer knowledge from a label-rich source domain to an unlabeled target domain. The core problem is how to learn a domain-invariant representation to address the domain shift challenge, in which the training and test samples come from different distributions. First, considering the geometry of space probability distributions, we introduce an effective Hellinger Distance to match the source and target distributions on statistical manifold. Second, the data samples are not isolated individuals, and they are interrelated. The correlation information of data samples should not be neglected for domain adaptation. Distinguished from previous works, we pay attention to the correlation distributions over data samples. We design elaborately a Residual Graph Convolutional Network to construct the Instance Correlation Graph (ICG). The correlation information of data samples is exploited to reduce the domain shift. Therefore, a novel Instance Correlation Graph for Unsupervised Domain Adaptation is proposed, which is trained end-to-end by jointly optimizing three types of losses, i.e., Supervised Classification loss for source domain, Centroid Alignment loss to measure the centroid difference between source and target domain, ICG Alignment loss to match Instance Correlation Graph over two related domains. Extensive experiments are conducted on several hard transfer tasks to learn domain-invariant representations on three benchmarks: Office-31, Office-Home, and VisDA2017. Compared with other state-of-the-art techniques, our method achieves superior performance.</description><identifier>ISSN: 1551-6857</identifier><identifier>EISSN: 1551-6865</identifier><identifier>DOI: 10.1145/3486251</identifier><language>eng</language><ispartof>ACM transactions on multimedia computing communications and applications, 2022-02, Vol.18 (1s), p.1-23</ispartof><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c155t-264e8f7cf066f5ff621641f9eb429801a89affa804e22b188808ab85cd3296993</citedby><cites>FETCH-LOGICAL-c155t-264e8f7cf066f5ff621641f9eb429801a89affa804e22b188808ab85cd3296993</cites><orcidid>0000-0001-7924-9498</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids></links><search><creatorcontrib>Wu, Lei</creatorcontrib><creatorcontrib>Ling, Hefei</creatorcontrib><creatorcontrib>Shi, Yuxuan</creatorcontrib><creatorcontrib>Zhang, Baiyan</creatorcontrib><title>Instance Correlation Graph for Unsupervised Domain Adaptation</title><title>ACM transactions on multimedia computing communications and applications</title><description>In recent years, deep neural networks have emerged as a dominant machine learning tool for a wide variety of application fields. Due to the expensive cost of manual labeling efforts, it is important to transfer knowledge from a label-rich source domain to an unlabeled target domain. The core problem is how to learn a domain-invariant representation to address the domain shift challenge, in which the training and test samples come from different distributions. First, considering the geometry of space probability distributions, we introduce an effective Hellinger Distance to match the source and target distributions on statistical manifold. Second, the data samples are not isolated individuals, and they are interrelated. The correlation information of data samples should not be neglected for domain adaptation. Distinguished from previous works, we pay attention to the correlation distributions over data samples. We design elaborately a Residual Graph Convolutional Network to construct the Instance Correlation Graph (ICG). The correlation information of data samples is exploited to reduce the domain shift. Therefore, a novel Instance Correlation Graph for Unsupervised Domain Adaptation is proposed, which is trained end-to-end by jointly optimizing three types of losses, i.e., Supervised Classification loss for source domain, Centroid Alignment loss to measure the centroid difference between source and target domain, ICG Alignment loss to match Instance Correlation Graph over two related domains. Extensive experiments are conducted on several hard transfer tasks to learn domain-invariant representations on three benchmarks: Office-31, Office-Home, and VisDA2017. Compared with other state-of-the-art techniques, our method achieves superior performance.</description><issn>1551-6857</issn><issn>1551-6865</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><recordid>eNo9j01PwzAQRC0EEqUg_oJvnAJex97aBw5VoKVSJS70HG0crwhqk8gOSPx7vipOM4fRGz0hrkHdAhh7VxqH2sKJmIG1UKBDe_rf7eJcXOT8plSJ1uBM3G_6PFEfoqyGlOKepm7o5TrR-Cp5SHLX5_cxpo8ux1Y-DAfqerlsaZx-h5fijGmf49Ux52K3enypnort83pTLbdF-P6dCo0mOl4EVohsmVEDGmAfG6O9U0DOEzM5ZaLWDTjnlKPG2dCW2qP35Vzc_HFDGnJOkesxdQdKnzWo-se6PlqXXxT1SKw</recordid><startdate>20220228</startdate><enddate>20220228</enddate><creator>Wu, Lei</creator><creator>Ling, Hefei</creator><creator>Shi, Yuxuan</creator><creator>Zhang, Baiyan</creator><scope>AAYXX</scope><scope>CITATION</scope><orcidid>https://orcid.org/0000-0001-7924-9498</orcidid></search><sort><creationdate>20220228</creationdate><title>Instance Correlation Graph for Unsupervised Domain Adaptation</title><author>Wu, Lei ; Ling, Hefei ; Shi, Yuxuan ; Zhang, Baiyan</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c155t-264e8f7cf066f5ff621641f9eb429801a89affa804e22b188808ab85cd3296993</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Wu, Lei</creatorcontrib><creatorcontrib>Ling, Hefei</creatorcontrib><creatorcontrib>Shi, Yuxuan</creatorcontrib><creatorcontrib>Zhang, Baiyan</creatorcontrib><collection>CrossRef</collection><jtitle>ACM transactions on multimedia computing communications and applications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Wu, Lei</au><au>Ling, Hefei</au><au>Shi, Yuxuan</au><au>Zhang, Baiyan</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Instance Correlation Graph for Unsupervised Domain Adaptation</atitle><jtitle>ACM transactions on multimedia computing communications and applications</jtitle><date>2022-02-28</date><risdate>2022</risdate><volume>18</volume><issue>1s</issue><spage>1</spage><epage>23</epage><pages>1-23</pages><issn>1551-6857</issn><eissn>1551-6865</eissn><abstract>In recent years, deep neural networks have emerged as a dominant machine learning tool for a wide variety of application fields. Due to the expensive cost of manual labeling efforts, it is important to transfer knowledge from a label-rich source domain to an unlabeled target domain. The core problem is how to learn a domain-invariant representation to address the domain shift challenge, in which the training and test samples come from different distributions. First, considering the geometry of space probability distributions, we introduce an effective Hellinger Distance to match the source and target distributions on statistical manifold. Second, the data samples are not isolated individuals, and they are interrelated. The correlation information of data samples should not be neglected for domain adaptation. Distinguished from previous works, we pay attention to the correlation distributions over data samples. We design elaborately a Residual Graph Convolutional Network to construct the Instance Correlation Graph (ICG). The correlation information of data samples is exploited to reduce the domain shift. Therefore, a novel Instance Correlation Graph for Unsupervised Domain Adaptation is proposed, which is trained end-to-end by jointly optimizing three types of losses, i.e., Supervised Classification loss for source domain, Centroid Alignment loss to measure the centroid difference between source and target domain, ICG Alignment loss to match Instance Correlation Graph over two related domains. Extensive experiments are conducted on several hard transfer tasks to learn domain-invariant representations on three benchmarks: Office-31, Office-Home, and VisDA2017. Compared with other state-of-the-art techniques, our method achieves superior performance.</abstract><doi>10.1145/3486251</doi><tpages>23</tpages><orcidid>https://orcid.org/0000-0001-7924-9498</orcidid></addata></record>
fulltext fulltext
identifier ISSN: 1551-6857
ispartof ACM transactions on multimedia computing communications and applications, 2022-02, Vol.18 (1s), p.1-23
issn 1551-6857
1551-6865
language eng
recordid cdi_crossref_primary_10_1145_3486251
source Association for Computing Machinery:Jisc Collections:ACM OPEN Journals 2023-2025 (reading list)
title Instance Correlation Graph for Unsupervised Domain Adaptation
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-02T19%3A14%3A23IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-crossref&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Instance%20Correlation%20Graph%20for%20Unsupervised%20Domain%20Adaptation&rft.jtitle=ACM%20transactions%20on%20multimedia%20computing%20communications%20and%20applications&rft.au=Wu,%20Lei&rft.date=2022-02-28&rft.volume=18&rft.issue=1s&rft.spage=1&rft.epage=23&rft.pages=1-23&rft.issn=1551-6857&rft.eissn=1551-6865&rft_id=info:doi/10.1145/3486251&rft_dat=%3Ccrossref%3E10_1145_3486251%3C/crossref%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c155t-264e8f7cf066f5ff621641f9eb429801a89affa804e22b188808ab85cd3296993%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true