Distribution-matching embedding for visual domain adaptation

MaRDI QIDQ3188041zbMATH OpenFDO

Authors Mahsa Baktashmotlagh, Mehrtash Harandi, Mathieu Salzmann

Publication date 16 August 2016

Full work available at URL http://jmlr.csail.mit.edu/papers/v17/15-207.html

zbMATH Keywords

distribution matchingdomain adaptationdomain-invariant representationsHellinger distancemaximum mean discrepancy

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Knowledge representation (68T30) Machine vision and scene understanding (68T45)

Recommendations

• Learning kernels for unsupervised domain adaptation with applications to visual object recognition
• Asymmetric and category invariant feature transformations for domain adaptation
• Robust unsupervised domain adaptation for neural networks via moment alignment
• Domain-adversarial training of neural networks
• Domain adaptation learning based on maximum distribution weighted mean discrepancy

Cited in

(7)

• Unsupervised group matching with application to cross-lingual topic matching without alignment information
• Robust adaptation regularization based on within-class scatter for domain adaptation
• Robust unsupervised domain adaptation for neural networks via moment alignment
• An Embarrassingly Simple Approach to Visual Domain Adaptation
• scientific article; zbMATH DE number 7626776 (Why is no real title available?)
• Learning kernels for unsupervised domain adaptation with applications to visual object recognition
• Asymmetric and category invariant feature transformations for domain adaptation

This page was built for publication: Distribution-matching embedding for visual domain adaptation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3188041)