The DOI matches its Crossref record; 46 of the 46 references it cites were found in a registry or an index.
Optimal Transport for Domain Adaptation
Open accessAbstract
Domain adaptation is one of the most challenging tasks of modern data analytics. If the adaptation is done correctly, models built on a specific data representation become more robust when confronted to data depicting the same classes, but described by another observation system. Among the many strategies proposed, finding domain-invariant representations has shown excellent properties, in particular since it allows to train a unique classifier effective in all domains. In this paper, we propose a regularized unsupervised optimal transportation model to perform the alignment of the representations in the source and target domains. We learn a transportation plan matching both PDFs, which constrains labeled samples of the same class in the source domain to remain close during transport. This way, we exploit at the same time the labeled samples in the source and the distributions observed in both domains. Experiments on toy and challenging real visual adaptation examples show the interest of the method, that consistently outperforms state of the art approaches. In addition, numerical experiments show that our approach leads to better performances on domain invariant deep learning features and can be easily adapted to the semi-supervised case where few labeled samples are available in the target domain.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Pan, S. J., & Yang, Q. (2010) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2009.191 · Cited by 23,387
Network Flows: Theory, Algorithms, and Applications.
Smith, D. K., Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1994) · The Journal of the Operational Research Society · doi:10.2307/2583863 · Cited by 8,034
Domain Adaptation via Transfer Component Analysis
Pan, S. J., Tsang, I. W., Kwok, J. T., & Yang, Q. (2011) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2010.2091281 · Cited by 4,753
DeCAF: A Deep Convolutional Activation Feature for Generic Visual Recognition
Donahue, J., Jia, Y., Vinyals, O., Hoffman, J., Zhang, N., Tzeng, E., & Darrell, T. (2013) · arXiv · doi:10.48550/arxiv.1310.1531 · Cited by 4,019
Villani, C. (2009) · Grundlehren der mathematischen Wissenschaften · doi:10.1007/978-3-540-71050-9 · Cited by 3,669
Adapting visual category models to new domains
Saenko, K., Kulis, B., Fritz, M., & Darrell, T. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-15561-1_16 · Cited by 2,847
(2007) · CaltechAUTHORS (California Institute of Technology) · Cited by 2,274
Geodesic flow kernel for unsupervised domain adaptation
Gong, B., Shi, Y., Sha, F., & Grauman, K. (2012) · 2012 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2012.6247911 · Cited by 2,093
Transfer Feature Learning with Joint Distribution Adaptation
Long, M., Wang, J., Ding, G., Sun, J., & Yu, P. S. (2013) · 2013 IEEE International Conference on Computer Vision · doi:10.1109/iccv.2013.274 · Cited by 2,071
Parlar, M. (2000) · Interactive Operations Research with Maple · doi:10.1007/978-1-4612-1356-7_5 · Cited by 1,741
A metric for distributions with applications to image databases
Rubner, Y., Tomasi, C., & Guibas, L. J. (2002) · Sixth International Conference on Computer Vision (IEEE Cat. No.98CH36271) · doi:10.1109/iccv.1998.710701 · Cited by 1,726
A computational fluid mechanics solution to the Monge-Kantorovich mass transfer problem
Benamou, J.-D., & Brenier, Y. (2000) · Numerische Mathematik · doi:10.1007/s002110050002 · Cited by 1,609
Frustratingly Easy Domain Adaptation
Daumé, H. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0907.1815 · Cited by 1,383
Optimal Transport for Applied Mathematicians: Calculus of Variations, PDEs, and Modeling
Santambrogio, F. (2015) · Progress in Nonlinear Differential Equations and Their Applications · doi:10.1007/978-3-319-20828-2 · Cited by 1,339
Domain adaptation for object recognition: An unsupervised approach
Gopalan, R., Li, R., & Chellappa, R. (2011) · 2011 International Conference on Computer Vision · doi:10.1109/iccv.2011.6126344 · Cited by 1,053
Visual Domain Adaptation: A survey of recent advances
Patel, V. M., Gopalan, R., Li, R., & Chellappa, R. (2015) · IEEE Signal Processing Magazine · doi:10.1109/msp.2014.2347059 · Cited by 899
The geometry of optimal transportation
Gangbo, W., & McCann, R. J. (1996) · Acta Mathematica · doi:10.1007/bf02392620 · Cited by 813
On the Translocation of Masses
Kantorovich, L. V. (2006) · Journal of Mathematical Sciences · doi:10.1007/s10958-006-0049-2 · Cited by 744
Generalized Multiview Analysis: A discriminative latent space
Sharma, A., Kumar, A., Daume, H., & Jacobs, D. W. (2012) · 2012 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2012.6247923 · Cited by 714
What you saw is not what you get: Domain adaptation using asymmetric kernel transforms
Kulis, B., Saenko, K., & Darrell, T. (2011) · CVPR 2011 · doi:10.1109/cvpr.2011.5995702 · Cited by 688
Direct importance estimation with model selection and its application to covariate shift adaptation
Sugiyama, M., Nakajima, S., Kashima, H., von Bünau, P., & Kawanabe, M. (2009) · Cited by 679
Frustratingly Easy Domain Adaptation
Daum, H. (2007) · Cited by 601
Domain Adaptation Problems: A DASVM Classification Technique and a Circular Validation Strategy
Bruzzone, L., & Marconcini, M. (2010) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2009.57 · Cited by 591
Domain Adaptation: Learning Bounds and Algorithms
Mansour, Y., Mohri, M., & Rostamizadeh, A. (2009) · arXiv · doi:10.48550/arxiv.0902.3430 · Cited by 504
Wasserstein Barycenter and Its Application to Texture Mixing
Rabin, J., Peyré, G., Delon, J., & Bernot, M. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-24785-9_37 · Cited by 504
Bregman Divergence-Based Regularization for Transfer Subspace Learning
Si, S., Tao, D., & Geng, B. (2010) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2009.126 · Cited by 477
Sliced and Radon Wasserstein Barycenters of Measures
Bonneel, N., Rabin, J., Peyré, G., & Pfister, H. (2015) · Journal of Mathematical Imaging and Vision · doi:10.1007/s10851-014-0506-3 · Cited by 467
Fast Computation of Wasserstein Barycenters
Cuturi, M., & Arnaud Doucet, B. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1310.4375 · Cited by 420
Heterogeneous Domain Adaptation Using Manifold Alignment
Wang, C., & Mahadevan, S. (2011) · Cited by 400
Caetano, T. S., McAuley, J. J., Cheng, L., Le, Q. V., & Smola, A. J. (2009) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2009.28 · Cited by 383
The Sinkhorn–Knopp Algorithm: Convergence and Applications
Knight, P. A. (2008) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/060659624 · Cited by 372
Structural graph matching using the EM algorithm and singular value decomposition
Luo, B., & Hancock, E. R. (2001) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.954602 · Cited by 345
Robust visual domain adaptation with low-rank reconstruction
Jhuo, I.-H., Liu, D., Lee, D. T., & Chang, S.-F. (2012) · 2012 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2012.6247924 · Cited by 308
Semisupervised alignment of manifolds.
Ham, J., Lee, D. D., & Saul, L. K. (2005) · International Conference on Artificial Intelligence and Statistics · Cited by 252
Impossibility Theorems for Domain Adaptation
Ben-David, S., Lu, T., Luu, T. V., & Pál, D. (2010) · Cited by 200
Efficient Learning of Domain-invariant Image RepresentationsPreprint
Hoffman, J., Rodner, E., Donahue, J., Darrell, T., & Saenko, K. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1301.3224 · Cited by 198
Domain Adaptation with Regularized Optimal Transport
Courty, N., Flamary, R., & Tuia, D. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-44848-9_18 · Cited by 175
Self-citationManifold alignment without correspondence
Wang, C., & Mahadevan, S. (2009) · Cited by 159
Displacement interpolation using Lagrangian mass transport
Bonneel, N., van de Panne, M., Paris, S., et al. (2011) · ACM Transactions on Graphics · doi:10.1145/2070781.2024192 · Cited by 159
A generalized conditional gradient method and its connection to an iterative shrinkage method
Bredies, K., Lorenz, D. A., & Maaß, P. (2007) · Computational Optimization and Applications · doi:10.1007/s10589-007-9083-3 · Cited by 132
Graphical Models and Point Pattern Matching
Caetano, T. S., Caelli, T., Schuurmans, D., & Barone, D. A. C. (2006) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2006.207 · Cited by 130
A PAC-Bayesian Approach for Domain Adaptation with Specialization to Linear Classifiers
Germain, P., Habrard, A., Morvant, E., Germain, P., & Pac-bayesian, A. (2013) · Cited by 92
Kernel Manifold Alignment for Domain Adaptation
Tuia, D., & Camps‐Valls, G. (2016) · PLoS ONE · doi:10.1371/journal.pone.0148655 · Cited by 90
Self-citationWasserstein Propagation for Semi-Supervised Learning
Solomon, J., Rustamov, R. M., Guibas, L. J., & Butscher, A. (2014) · Cited by 84
Covariate Shift in Hilbert Space: A Solution via Sorrogate Kernels
Zhang, K., Zheng, V. W., Wang, Q., Kwok, J. T.-Y., Yang, Q., & Marsic, I. (2013) · Rare & Special e-Zone (The Hong Kong University of Science and Technology) · Cited by 57
Wang, C., Krafft, P. M., & Mahadevan, S. (2011) · CRC Press eBooks · doi:10.1201/b11431-6 · Cited by 57
Research works printed but not linked: 7
- 10.1007/978-3-642-38267-3_36 · doi:10.1007/978-3-642-38267-3_36
- zheng, 2012, A Grassmann manifold-based domain adaptation approach, Proc Int Conf Pattern Recognit, 2095
- carreira-perpinan, 2014, LASS: A simple assignment model with Laplacian smoothing, Proc 28th AAAI Conf Artif Intell, 1715
- cuturi, 2013, Sinkhorn distances: Lightspeed computation of optimal transportation, Proc Advances Neural Inf Process Syst, 2292
- cuturi, 2014, Ground metric learning, J Mach Learn Res, 15, 533
- bredies, 2005, Equivalence of a Generalized Conditional Gradient Method and the Method of Surrogate Functionals
- 10.1109/Multi-Temp.2015.7245773 · doi:10.1109/multi-temp.2015.7245773
Cited by
A review of classification algorithms for EEG-based brain–computer interfaces: A 10 year update
Lotte, F., Bougrain, L., Cichocki, A., Clerc, M., Congedo, M., Rakotomamonjy, A., & Yger, F. (2018) · Journal of Neural Engineering · doi:10.1088/1741-2552/aab2f2 · Cited by 2,239
Self-citationWasserstein Distance Guided Representation Learning for Domain Adaptation
Shen, J., Qu, Y., Zhang, W., & Yu, Y. (2018) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v32i1.11784 · Cited by 862
Computational Optimal Transport
Peyré, G., & Cuturi, M. (2019) · now publishers, Inc. eBooks · doi:10.1561/9781680835519 · Cited by 847
A Review of Domain Adaptation without Target Labels
Kouw, W. M., & Loog, M. (2021) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2019.2945942 · Cited by 613
Joint Geometrical and Statistical Alignment for Visual Domain Adaptation
Zhang, J., Li, W., & Ogunbona, P. (2017) · 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2017.547 · Cited by 598
Metadata
- Authors
- Courty, N., Flamary, R., Tuia, D., & Rakotomamonjy, A.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2017-09-01
- Volume
- 39
- Issue
- 9
- Pages
- 1853-1865
- ISSN
- 0162-8828 (ISSN-L)
- 2160-9292
- OpenAlex
- W1594039573
- Cited by
- 989
- References
- 46
- FWCI
- 44.81
- Type
- journal article
- Language
- en
- Open access
- green
- Funders
- Swiss National Science Foundation (PP00P2-150593)
- CNRS PEPS Fascido program
- Topase project
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.