Unsupervised Domain Adaptation Via Data Pruning

Andrea Napoli, Paul White
9/18/2024
cs.LG

No confident code implementation found for this paper.

Abstract

The removal of carefully-selected examples from training data has recently emerged as an effective way of improving the robustness of machine learning models. However, the best way to select these examples remains an open question. In this paper, we consider the problem from the perspective of unsupervised domain adaptation (UDA). We propose AdaPrune, a method for UDA whereby training examples are removed to attempt to align the training distribution to that of the target data. By adopting the maximum mean discrepancy (MMD) as the criterion for alignment, the problem can be neatly formulated and solved as an integer quadratic program. We evaluate our approach on a real-world domain shift task of bioacoustic event detection. As a method for UDA, we show that AdaPrune outperforms related techniques, and is complementary to other UDA algorithms such as CORAL. Our analysis of the relationship between the MMD and model accuracy, along with t-SNE plots, validate the proposed method as a principled and well-founded way of performing data pruning.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{napoli2024unsupervised,
  title  = {Unsupervised Domain Adaptation Via Data Pruning},
  author = {Andrea Napoli and Paul White},
  year   = {2024},
  eprint = {2409.12076},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2409.12076v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2409.12076.svg)](https://codeofpaper.com/paper/2409.12076)

Discussion