Domain adaptation

<h2 id="classification-of-domain-adaptation-problems">Classification of domain adaptation problems</h2>
<p>Domain adaptation setups are classified in two different ways; according to the distribution shift between the domains, and according to the available data from the target domain.
</p>
<h3>Distribution shifts</h3>
<p>Common distribution shifts are classified as follows:<a class="footnote-ref" id="fnref:3" href="#fn:3"><sup>3</sup></a><a class="footnote-ref" id="fnref:4" href="#fn:4"><sup>4</sup></a>
</p>
<ul><li>Covariate Shift occurs when the input distributions of the source and destination change, but the relationship between inputs and labels remains unchanged. The above-mentioned spam filtering example typically falls in this category. Namely, the distributions (patterns) of emails may differ between the domains, but emails labeled as spam in the one domain should similarly be labeled in another.</li>
<li>Prior Shift (Label Shift) occurs when the label distribution differs between the source and target datasets, while the conditional distribution of features given labels remains the same.  An example is a classifier of hair color in images from Italy (source domain) and Norway (target domain).  The proportions of hair colors (labels) differ, but images within classes like blond and black-haired populations remain consistent across domains. A classifier for the Norway population can exploit this prior knowledge of class proportions to improve its estimates.</li>
<li>Concept Shift (Conditional Shift) refers to changes in the relationship between features and labels, even if the input distribution remains the same. For instance, in medical diagnosis, the same symptoms (inputs) may indicate entirely different diseases (labels) in different populations (domains).</li></ul>
<h3>Data available during training</h3>
<p>Domain adaptation problems typically assume that some data from the target domain is available during training.  Problems can be classified according to the type of this available data:<a class="footnote-ref" id="fnref:5" href="#fn:5"><sup>5</sup></a><a class="footnote-ref" id="fnref:6" href="#fn:6"><sup>6</sup></a>   
</p>
<ul><li>Unsupervised:  <a href="/facts/Unlabeled_data/o0doUSPA">Unlabeled data</a> from the target domain is available, but no labeled data.  In the above-mentioned example of spam filtering, this corresponds to the case where emails from the target domain (user) are available, but they are not labeled as spam.  Domain adaptation methods can benefit from such unlabeled data, by comparing its distribution (patterns) with the labeled source domain data.</li>
<li>Semi-supervised:   Most data that is available from the target domain is unlabelled, but some labeled data is also available.  In the above-mentioned case of spam filter design, this corresponds to the case that the target user has labeled some emails as being spam or not.</li>
<li>Supervised: All data that is available from the target domain is labeled.  In this case, domain adaptation reduces to refinement of the source domain predictor.  In the above-mentioned example classification of hair-color from images, this could correspond to the refinement of a network already trained on a large dataset of labeled images from Italy, using newly available labeled images from Norway.</li></ul>
<h2 id="formalization">Formalization</h2>
<p>Let 
  
    
      
        X
      
    
    {\displaystyle X}
  
 be the input space (or description space) and let 
  
    
      
        Y
      
    
    {\displaystyle Y}
  
 be the output space (or label space). The objective of a machine learning algorithm is to learn a mathematical model (a hypothesis) 
  
    
      
        h
        :
        X
        →
        Y
      
    
    {\displaystyle h:X\to Y}
  
 able to attach a label from 
  
    
      
        Y
      
    
    {\displaystyle Y}
  
 to an example from 
  
    
      
        X
      
    
    {\displaystyle X}
  
. This model is learned from a learning sample 
  
    
      
        S
        =
        {
        (
        
          x
          
            i
          
        
        ,
        
          y
          
            i
          
        
        )
        ∈
        (
        X
        ×
        Y
        )
        
          }
          
            i
            =
            1
          
          
            m
          
        
      
    
    {\displaystyle S=\{(x_{i},y_{i})\in (X\times Y)\}_{i=1}^{m}}
  
.
</p><p>Usually in <a href="/facts/Supervised_learning/JlNFNPFt">supervised learning</a> (without domain adaptation), we suppose that the examples 
  
    
      
        (
        
          x
          
            i
          
        
        ,
        
          y
          
            i
          
        
        )
        ∈
        S
      
    
    {\displaystyle (x_{i},y_{i})\in S}
  
 are drawn i.i.d. from a distribution 
  
    
      
        
          D
          
            S
          
        
      
    
    {\displaystyle D_{S}}
  
 of support 
  
    
      
        X
        ×
        Y
      
    
    {\displaystyle X\times Y}
  
 (unknown and fixed). The objective is then to learn 
  
    
      
        h
      
    
    {\displaystyle h}
  
 (from 
  
    
      
        S
      
    
    {\displaystyle S}
  
) such that it commits the least error possible for labelling new examples coming from the distribution 
  
    
      
        
          D
          
            S
          
        
      
    
    {\displaystyle D_{S}}
  
.
</p><p>The main difference between supervised learning and domain adaptation is that in the latter situation we study two different (but related) distributions 
  
    
      
        
          D
          
            S
          
        
      
    
    {\displaystyle D_{S}}
  
 and 
  
    
      
        
          D
          
            T
          
        
      
    
    {\displaystyle D_{T}}
  
 on 
  
    
      
        X
        ×
        Y
      
    
    {\displaystyle X\times Y}
  
. The domain adaptation task then consists of the transfer of knowledge from the source domain 
  
    
      
        
          D
          
            S
          
        
      
    
    {\displaystyle D_{S}}
  
 to the target one 
  
    
      
        
          D
          
            T
          
        
      
    
    {\displaystyle D_{T}}
  
. The goal is then to learn 
  
    
      
        h
      
    
    {\displaystyle h}
  
 (from labeled or unlabelled samples coming from the two domains) such that it commits as little error as possible on the target domain 
  
    
      
        
          D
          
            T
          
        
      
    
    {\displaystyle D_{T}}
  
.
</p><p>The major issue is the following: if a model is learned from a source domain, what is its capacity to correctly label data coming from the target domain?
</p>
<h2 id="four-algorithmic-principles">Four algorithmic principles</h2>
<h3>Reweighting algorithms</h3>
<p>The objective is to reweight the source labeled sample such that it "looks like" the target sample (in terms of the error measure considered).<a class="footnote-ref" id="fnref:7" href="#fn:7"><sup>7</sup></a><a class="footnote-ref" id="fnref:8" href="#fn:8"><sup>8</sup></a>
</p>
<h3>Iterative algorithms</h3>
<p>A method for adapting consists in iteratively "auto-labeling" the target examples.<a class="footnote-ref" id="fnref:9" href="#fn:9"><sup>9</sup></a> The principle is simple:
</p>
<ol><li>a model 
  
    
      
        h
      
    
    {\displaystyle h}
  
 is learned from the labeled examples;</li>
<li>
  
    
      
        h
      
    
    {\displaystyle h}
  
 automatically labels some target examples;</li>
<li>a new model is learned from the new labeled examples.</li></ol>
<p>Note that there exist other iterative approaches, but they usually need target labeled examples.<a class="footnote-ref" id="fnref:10" href="#fn:10"><sup>10</sup></a><a class="footnote-ref" id="fnref:11" href="#fn:11"><sup>11</sup></a>
</p>
<h3>Search of a common representation space</h3>
<p>The goal is to find or construct a common representation space for the two domains. The objective is to obtain a space in which the domains are close to each other while keeping good performances on the source labeling task.
This can be achieved through the use of <a href="/facts/Adversarial_machine_learning/4An4fgUc">Adversarial machine learning</a> techniques where feature representations from samples in different domains are encouraged to be indistinguishable.<a class="footnote-ref" id="fnref:12" href="#fn:12"><sup>12</sup></a><a class="footnote-ref" id="fnref:13" href="#fn:13"><sup>13</sup></a>
</p>
<h3>Hierarchical Bayesian Model</h3>
<p>The goal is to construct a <a href="/facts/Bayesian_hierarchical_model/Ry31vq6T">Bayesian hierarchical model</a> 
  
    
      
        p
        (
        n
        )
      
    
    {\displaystyle p(n)}
  
, which is essentially a factorization model for counts 
  
    
      
        n
      
    
    {\displaystyle n}
  
, to derive domain-dependent latent representations allowing both domain-specific and globally shared latent factors.<a class="footnote-ref" id="fnref:14" href="#fn:14"><sup>14</sup></a>
</p>
<h2 id="softwares">Softwares</h2>
<p>Several compilations of domain adaptation and transfer learning algorithms have been implemented over the past decades:
</p>
<ul><li>SKADA<a class="footnote-ref" id="fnref:15" href="#fn:15"><sup>15</sup></a> (Python)</li>
<li>ADAPT<a class="footnote-ref" id="fnref:16" href="#fn:16"><sup>16</sup></a> (Python)</li>
<li>TLlib <a class="footnote-ref" id="fnref:17" href="#fn:17"><sup>17</sup></a> (Python)</li>
<li>Domain-Adaptation-Toolbox <a class="footnote-ref" id="fnref:18" href="#fn:18"><sup>18</sup></a> (MATLAB)</li></ul>

<h2 id="references">References</h2>

<ol>
<li id="fn:1"><p>Crammer, Koby; Kearns, Michael; Wortman, Jeniifer (2008). "Learning from Multiple Sources" (PDF). Journal of Machine Learning Research. 9: 1757–1774. <a href="http://www.jmlr.org/papers/volume9/crammer08a/crammer08a.pdf" target="_blank">http://www.jmlr.org/papers/volume9/crammer08a/crammer08a.pdf</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></p></li>
<li id="fn:2"><p>Sun, Shiliang; Shi, Honglei; Wu, Yuanbin (July 2015). "A survey of multi-source domain adaptation". Information Fusion. 24: 84–92. doi:10.1016/j.inffus.2014.12.003. S2CID 18385140. <a href="/wiki/Doi_(identifier)" target="_blank">/wiki/Doi_(identifier)</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></p></li>
<li id="fn:3"><p>Kouw, Wouter M.; Loog, Marco (2019-01-14), An introduction to domain adaptation and transfer learning, doi:10.48550/arXiv.1812.11806, retrieved 2024-12-22 <a href="https://arxiv.org/abs/1812.11806" target="_blank">https://arxiv.org/abs/1812.11806</a> <a href="#fnref:3" class="footnote-back-ref">↩</a></p></li>
<li id="fn:4"><p>Farahani, Abolfazl; Voghoei, Sahar; Rasheed, Khaled; Arabnia, Hamid R. (2020-10-07), A Brief Review of Domain Adaptation, doi:10.48550/arXiv.2010.03978, retrieved 2024-12-23 <a href="https://arxiv.org/abs/2010.03978" target="_blank">https://arxiv.org/abs/2010.03978</a> <a href="#fnref:4" class="footnote-back-ref">↩</a></p></li>
<li id="fn:5"><p>Stanford Online (2023-04-11). Stanford CS330 Deep Multi-Task & Meta Learning - Domain Adaptation l 2022 I Lecture 13. Retrieved 2024-12-23 – via YouTube. <a href="https://www.youtube.com/watch?v=Uk6MU_PLDMs" target="_blank">https://www.youtube.com/watch?v=Uk6MU_PLDMs</a> <a href="#fnref:5" class="footnote-back-ref">↩</a></p></li>
<li id="fn:6"><p>Farahani, Abolfazl; Voghoei, Sahar; Rasheed, Khaled; Arabnia, Hamid R. (2020-10-07), A Brief Review of Domain Adaptation, doi:10.48550/arXiv.2010.03978, retrieved 2024-12-23 <a href="https://arxiv.org/abs/2010.03978" target="_blank">https://arxiv.org/abs/2010.03978</a> <a href="#fnref:6" class="footnote-back-ref">↩</a></p></li>
<li id="fn:7"><p>Huang, Jiayuan; Smola, Alexander J.; Gretton, Arthur; Borgwardt, Karster M.; Schölkopf, Bernhard (2006). "Correcting Sample Selection Bias by Unlabeled Data" (PDF). Conference on Neural Information Processing Systems (NIPS). pp. 601–608. <a href="http://papers.nips.cc/paper/3075-correcting-sample-selection-bias-by-unlabeled-data.pdf" target="_blank">http://papers.nips.cc/paper/3075-correcting-sample-selection-bias-by-unlabeled-data.pdf</a> <a href="#fnref:7" class="footnote-back-ref">↩</a></p></li>
<li id="fn:8"><p>Shimodaira, Hidetoshi (2000). "Improving predictive inference under covariate shift by weighting the log-likelihood function". Journal of Statistical Planning and Inference. 90 (2): 227–244. doi:10.1016/S0378-3758(00)00115-4. S2CID 9238949. <a href="https://www.researchgate.net/publication/230710850" target="_blank">https://www.researchgate.net/publication/230710850</a> <a href="#fnref:8" class="footnote-back-ref">↩</a></p></li>
<li id="fn:9"><p>Gallego, A.J.; Calvo-Zaragoza, J.; Fisher, R.B. (2020). "Incremental Unsupervised Domain-Adversarial Training of Neural Networks" (PDF). IEEE Transactions on Neural Networks and Learning Systems. PP (11): 4864–4878. doi:10.1109/TNNLS.2020.3025954. hdl:20.500.11820/72ba0443-8a7d-4cdd-8212-38682d4f0730. PMID 33027004. S2CID 210164756. <a href="https://www.pure.ed.ac.uk/ws/files/172035660/Incremental_Unsupervised_GALLEGO_DOA18092020_AFV.pdf" target="_blank">https://www.pure.ed.ac.uk/ws/files/172035660/Incremental_Unsupervised_GALLEGO_DOA18092020_AFV.pdf</a> <a href="#fnref:9" class="footnote-back-ref">↩</a></p></li>
<li id="fn:10"><p>Arief-Ang, I.B.; Salim, F.D.; Hamilton, M. (2017-11-08). DA-HOC: semi-supervised domain adaptation for room occupancy prediction using CO2 sensor data. 4th ACM International Conference on Systems for Energy-Efficient Built Environments (BuildSys). Delft, Netherlands. pp. 1–10. doi:10.1145/3137133.3137146. ISBN 978-1-4503-5544-5. <a href="978-1-4503-5544-5" target="_blank">978-1-4503-5544-5</a> <a href="#fnref:10" class="footnote-back-ref">↩</a></p></li>
<li id="fn:11"><p>Arief-Ang, I.B.; Hamilton, M.; Salim, F.D. (2018-12-01). "A Scalable Room Occupancy Prediction with Transferable Time Series Decomposition of CO2 Sensor Data". ACM Transactions on Sensor Networks. 14 (3–4): 21:1–21:28. doi:10.1145/3217214. S2CID 54066723. <a href="/wiki/Doi_(identifier)" target="_blank">/wiki/Doi_(identifier)</a> <a href="#fnref:11" class="footnote-back-ref">↩</a></p></li>
<li id="fn:12"><p>Ganin, Yaroslav; Ustinova, Evgeniya; Ajakan, Hana; Germain, Pascal; Larochelle, Hugo; Laviolette, François; Marchand, Mario; Lempitsky, Victor (2016). "Domain-Adversarial Training of Neural Networks" (PDF). Journal of Machine Learning Research. 17: 1–35. <a href="http://jmlr.org/papers/volume17/15-239/15-239.pdf" target="_blank">http://jmlr.org/papers/volume17/15-239/15-239.pdf</a> <a href="#fnref:12" class="footnote-back-ref">↩</a></p></li>
<li id="fn:13"><p>Hajiramezanali, Ehsan; Siamak Zamani Dadaneh; Karbalayghareh, Alireza; Zhou, Mingyuan; Qian, Xiaoning (2017). "Addressing Appearance Change in Outdoor Robotics with Adversarial Domain Adaptation". arXiv:1703.01461 [cs.RO]. <a href="/wiki/ArXiv_(identifier)" target="_blank">/wiki/ArXiv_(identifier)</a> <a href="#fnref:13" class="footnote-back-ref">↩</a></p></li>
<li id="fn:14"><p>Hajiramezanali, Ehsan; Siamak Zamani Dadaneh; Karbalayghareh, Alireza; Zhou, Mingyuan; Qian, Xiaoning (2018). "Bayesian multi-domain learning for cancer subtype discovery from next-generation sequencing count data". arXiv:1810.09433 [stat.ML]. <a href="/wiki/ArXiv_(identifier)" target="_blank">/wiki/ArXiv_(identifier)</a> <a href="#fnref:14" class="footnote-back-ref">↩</a></p></li>
<li id="fn:15"><p>Gnassounou, Théo and Kachaiev, Oleksii and Flamary, Rémi and Collas, Antoine and Lalou, Yanis and de Mathelin, Antoine and Gramfort, Alexandre and Bueno, Ruben and Michel, Florent and Mellot, Apolline and Loison, Virginie and Odonnat, Ambroise and Moreau, Thomas (2024) "SKADA : Scikit Adaptation" <a href="https://github.com/scikit-adaptation/skada" target="_blank">https://github.com/scikit-adaptation/skada</a> <a href="#fnref:15" class="footnote-back-ref">↩</a></p></li>
<li id="fn:16"><p>de Mathelin, Antoine and Deheeger, François and Richard, Guillaume and Mougeot, Mathilde and Vayatis, Nicolas (2020) "ADAPT: Awesome Domain Adaptation Python Toolbox" <a href="https://github.com/adapt-python/adapt" target="_blank">https://github.com/adapt-python/adapt</a> <a href="#fnref:16" class="footnote-back-ref">↩</a></p></li>
<li id="fn:17"><p>Mingsheng Long Junguang Jiang, Bo Fu. (2020) "Transfer-learning-library" <a href="https://github.com/thuml/Transfer-Learning-Library" target="_blank">https://github.com/thuml/Transfer-Learning-Library</a> <a href="#fnref:17" class="footnote-back-ref">↩</a></p></li>
<li id="fn:18"><p>Ke Yan. (2016) "Domain adaptation toolbox" <a href="https://github.com/viggin/domain-adaptation-toolbox" target="_blank">https://github.com/viggin/domain-adaptation-toolbox</a> <a href="#fnref:18" class="footnote-back-ref">↩</a></p></li>
</ol>

Domain adaptation open-in-new

Domain adaptation