atlas

Research map / Label-efficient and robust learning / Domain adaptation and generalization

Learning an Invariant Hilbert Space for Domain Adaptation

CVPR 2017 · Label-efficient and robust learning › Domain adaptation and generalization · approach: Conditional distribution alignment · 119 citations (OpenAlex)

Check your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Jointly learn source and target projections and a latent Mahalanobis metric while matching projected domain covariancesILS · Office+Caltech10 semi-supervised domain adaptationaccuracyHelped
Jointly learn projections and covariance matching for domain alignmentILS · Office+Caltech10 unsupervised domain adaptationaccuracyHelped
Use the ILS-learned source transformation instead of PCA subspaces for GFK and SAGFK and SA · Office-CaltechaccuracyHelped
Set the statistical-loss weight λ to zero, removing statistical matching (ablation)ILS · Office+Caltech10 unsupervised VGG-FC6accuracyHurt
Vary λ among nonzero values (ablation)ILS · Office+Caltech10 unsupervised VGG-FC6accuracyNo clear effect
Remove the orthogonality constraints on the source and target projections (ablation)ILS · Domain adaptationaccuracyHurt
Use product-manifold optimization rather than alternating Riemannian optimization (ablation)ILS optimization · Optimization objectivelossMixed

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy