TAROT: Targeted Data Selection via Optimal Transport
Lan Feng, Fan Nie, Yuejiang Liu, Alexandre Alahi
摘要
We propose TAROT, a Targeted data selection framework grounded in Optimal Transport theory. Previous targeted data selection methods primarily use influence-based greedy heuristics to enhance domain-specific performance. These methods perform well on limited, unimodal data (i.e., data following a single pattern) but become less effective as target data increases in complexity. Specifically, in multimodal distributions, these heuristics fail to account for multiple inherent patterns, leading to suboptimal data selection. This work identifies two primary factors contributing to this limitation: (i) the disproportionate impact of dominant feature components in high-dimensional influence estimation, and (ii) the restrictive linear additive assumptions inherent in greedy selection strategies. To address these challenges, TAROT incorporates whitened feature distance to mitigate dominant feature bias, offering a more reliable measure of data influence. Building on this, TAROT uses whitened feature distance to quantify and minimize the optimal transport distance between the selected data and target domains. Notably, this minimization also facilitates the estimation of optimal selection ratios. We evaluate TAROT across multiple tasks, including semantic segmentation, motion prediction, and instruction tuning. Results consistently show that TAROT outperforms state-of-the-art methods, highlighting its versatility across various deep learning tasks. Code is available at: https: //github.com/vita-epfl/TAROT .
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper2
- Fast Data Attribution for Text-to-Image ModelsSheng-Yu Wang, Aaron Hertzmann, Alexei A. Efros, Richard Zhang 等NeurIPS 2025 · 被引用 7 次
- GORACS: Group-level Optimal Transport-guided Coreset Selection for LLM-based Recommender SystemsTiehua Mei, Hengrui Chen, Peng Yu, Jiaqing Liang 等KDD 2025 · 被引用 3 次
它引用的顶会 Paper21
- Chain-of-Thought Prompting Elicits Reasoning in Large Language ModelsJason Wei, Xuezhi Wang, Dale Schuurmans, Maarten Bosma 等NeurIPS 2022 · 被引用 22,562 次
- Measuring Massive Multitask Language UnderstandingDan Hendrycks, Collin Burns, Steven Basart, Andy Zou 等ICLR 2021 · 被引用 7,905 次
- The Flan Collection: Designing Data and Methods for Effective Instruction TuningShayne Longpre, Le Hou, Tu Vu, Albert Webson 等ICML 2023 · 被引用 908 次
- Segment Everything Everywhere All at OnceXueyan Zou, Jianwei Yang, Hao Zhang, Feng Li 等NeurIPS 2023 · 被引用 889 次
- Aligning AI With Shared Human ValuesDan Hendrycks, Collin Burns, Steven Basart, Andrew Critch 等ICLR 2021 · 被引用 878 次
相关 Paper
- TAROT: Task-Adaptive Refinement of LLM-prior Graphs for Few-shot Tabular LearningRuxue Shi, Yili Wang, Mengnan Du, Hangting Ye 等KDD 2026
- A Critical Look at Targeted Instruction Selection: Disentangling What Matters (and What Doesn’t)Nihal Nayak, Paula Rodriguez-Diaz, Neha Hulkund, Sara Beery 等ICML 2026 · 被引用 2 次
- TSDS: Data Selection for Task-Specific Model FinetuningZifan Liu, Amin Karbasi, Theodoros RekatsinasNeurIPS 2024 · 被引用 35 次
- Wasserstein Selective Transfer Learning for Cross-domain Text MiningLingyun Feng, Minghui Qiu, Yaliang Li, Haitao Zheng 等EMNLP 2021 · 被引用 5 次
- Probability-Polarized Optimal Transport for Unsupervised Domain AdaptationYan Wang, Chuan-Xian Ren, Yi-Ming Zhai, You-Wei Luo 等AAAI 2024 · 被引用 8 次
