Research map / Label-efficient and robust learning / Domain adaptation and generalization
Revisiting $(\epsilon, \gamma, \tau)$-similarity learning for domain adaptation
Sofiane Dhouib, Ievgen Redko
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (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 changed | Where | Measured | Effect |
|---|---|---|---|
| optimize the bound terms (reweight source samples) vs no adaptation, case T absolutely continuous w.r.t. S | bilinear similarity learning · synthetic rotated Gaussians | target goodness | Improved |
| compare the two assumption cases (T << S versus no absolute continuity) | bilinear similarity learning · synthetic rotated Gaussians | target goodness | Mixed |
| increase rotation angle of target cluster centers from 0 to 90 degrees | bilinear similarity learning · synthetic rotated Gaussians | L1 and chi-square divergence | Hurt |
Closest papers by meaning
- Unsupervised Domain Adaptation With Similarity Learning (CVPR 2018 · similarity 0.88)
- On $f$-Divergence Principled Domain Adaptation: An Improved Framework (NeurIPS 2024 · similarity 0.87)
- Bridging Theory and Algorithm for Domain Adaptation (ICML 2019 · similarity 0.87)
- Learning to Transfer with von Neumann Conditional Divergence (AAAI 2022 · similarity 0.87)
- Attracting and Dispersing: A Simple Approach for Source-free Domain Adaptation (NeurIPS 2022 · similarity 0.86)
- Category-Aware Active Domain Adaptation (ICML 2024 · similarity 0.85)
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.
