Skip to main content

Target to Source Coordinate-Wise Adaptation of Pre-trained Models

  • Conference paper
  • First Online:
Machine Learning and Knowledge Discovery in Databases (ECML PKDD 2020)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 12457))

  • 1881 Accesses

Abstract

Domain adaptation aims to alleviate the gap between source and target data drawn from different distributions. Most of the related works seek either for a latent space where source and target data share the same distribution, or for a transformation of the source distribution to match the target one. In this paper, we introduce an original scenario where the former trained source model is directly reused on target data, requiring only finding a transformation from the target domain to the source domain. As a first approach to tackle this problem, we propose a greedy coordinate-wise transformation leveraging on optimal transport. Beyond being fully independent of the model initially learned on the source data, the achieved transformation has the following three assets: scalability, interpretability and feature-type free (continuous and/or categorical). Our procedure is numerically evaluated on various real datasets, including domain adaptation benchmarks and also a challenging fraud detection dataset with very imbalanced classes. Interestingly, we observe that transforming a small subset of the target features leads to accuracies competitive with “classical” domain adaptation methods.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    In the experiment section, we consider few target labels in order to perform model selection.

  2. 2.

    The number of transactions in fraud detection datasets as the ones used in the experiments of Sect. 4 is around ten million.

  3. 3.

    See Sects. 3.3 and 3.4 for details.

  4. 4.

    The supplementary material, the code and data for the first two tasks are available on Github: https://github.com/marrvolo/CDA. Due to confidential reasons, the real-life fraud dataset is not shared.

  5. 5.

    https://www.kaggle.com/c/ieee-fraud-detection.

  6. 6.

    See supplementary material for the results in the 400 dimensional dataset.

  7. 7.

    See supplementary material for the results on Model3 and Model4.

References

  1. Altschuler, J., Niles-Weed, J., Rigollet, P.: Near-linear time approximation algorithms for optimal transport via sinkhorn iteration. In: NeurIPS (2017)

    Google Scholar 

  2. Chen, M., Xu, Z.E., Weinberger, K.Q., Sha, F.: Marginalized denoising autoencoders for domain adaptation. In: ICML (2012)

    Google Scholar 

  3. Courty, N., Flamary, R., Habrard, A., Rakotomamonjy, A.: Joint distribution optimal transportation for domain adaptation. In: NeurIPS (2017)

    Google Scholar 

  4. Courty, N., Flamary, R., Tuia, D., Rakotomamonjy, A.: Optimal transport for domain adaptation. IEEE Trans. Pattern Anal. Mach. Intell. 39(9), 1853–1865 (2016)

    Article  Google Scholar 

  5. Cuturi, M.: Sinkhorn distances: lightspeed computation of optimal transport. In: NIPS (2013)

    Google Scholar 

  6. Ganin, Y., et al.: Domain-adversarial training of neural networks. JMLR 17(1), 1–35 (2016)

    MathSciNet  MATH  Google Scholar 

  7. Jones, K.S.: A statistical interpretation of term specificity and its application in retrieval. J. Doc. (1972)

    Google Scholar 

  8. Kantorovitch, L.: On the translocation of masses. Manag. Sci. 5(1), 1–4 (1958)

    Google Scholar 

  9. Long, M., Cao, Y., Wang, J., Jordan, M.I.: Learning transferable features with deep adaptation networks. In: ICML (2015)

    Google Scholar 

  10. Monge, G.: Mémoire sur la théorie des déblais et des remblais. Histoire de l’Académie Royale des Sciences de Paris (1781)

    Google Scholar 

  11. Pan, S.J., Tsang, I.W., Kwok, J.T., Yang, Q.: Domain adaptation via transfer component analysis. IEEE Trans. Neural Networks 22(2), 199–210 (2010)

    Article  Google Scholar 

  12. Peyré, G., Cuturi, M.: Computational optimal transport. Found. Trends Mach. Learn. 11(5–6), 355–607 (2019)

    Article  Google Scholar 

  13. Shimodaira, H.: Improving predictive inference under covariate shift by weighting the log-likelihood function. J. Stat. Plann. Inference 90(2), 227–244 (2000)

    Article  MathSciNet  Google Scholar 

  14. Sugiyama, M., Nakajima, S., Kashima, H., Buenau, P.V., Kawanabe, M.: Direct importance estimation with model selection and its application to covariate shift adaptation. In: NIPS (2008)

    Google Scholar 

  15. Sun, B., Feng, J., Saenko, K.: Correlation alignment for unsupervised domain adaptation. In: Csurka, G. (ed.) Domain Adaptation in Computer Vision Applications. ACVPR, pp. 153–171. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-58347-1_8

    Chapter  Google Scholar 

Download references

Acknowledgements

This work was partially supported by the Canada CIFAR AI Chair Program.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Luxin Zhang .

Editor information

Editors and Affiliations

1 Electronic supplementary material

Below is the link to the electronic supplementary material.

Supplementary material 1 (pdf 1249 KB)

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Zhang, L., Germain, P., Kessaci, Y., Biernacki, C. (2021). Target to Source Coordinate-Wise Adaptation of Pre-trained Models. In: Hutter, F., Kersting, K., Lijffijt, J., Valera, I. (eds) Machine Learning and Knowledge Discovery in Databases. ECML PKDD 2020. Lecture Notes in Computer Science(), vol 12457. Springer, Cham. https://doi.org/10.1007/978-3-030-67658-2_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-67658-2_22

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-67657-5

  • Online ISBN: 978-3-030-67658-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics