Targeted data selection via whitened feature distance and optimal transport minimization consistently outperforms influence-based greedy heuristics across vision and language tasks.
Details for Algorithms We present the detailed data selection algorithm described in Section 3.3 in Algorithms 1 and 2 D
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
TAROT: Targeted Data Selection via Optimal Transport
Targeted data selection via whitened feature distance and optimal transport minimization consistently outperforms influence-based greedy heuristics across vision and language tasks.