analiza aiqbench
This research introduces TACS, a novel data selection method that decouples reference state construction from candidate pool biases to improve efficiency in large-scale instruction tuning. By reusing a compact target-validation proxy across different pools, the approach reduces selection compute by up to 69% while maintaining competitive performance across vision and NLP benchmarks. The technique represents a significant optimization for training data curation pipelines without relying on heavy architectural changes.
Let the Target Select for Itself: Data Selection via Target-Aligned Paths
arXiv:2605.09404v2 Announce Type: replace Abstract: Targeted data selection seeks training examples from a candidate pool that improve downstream task performance. While trajectory-based selectors effectively guide this process, existing approaches typically construct reference states by warming up on the candidate pool itself, thereby inheriting pool-dependent distributional biases. To address this coupling, we introduce Target-Aligned Candidate Selection (TACS), which constructs a short, capacity-constrained reference path using a compact target-validation proxy. Candidates are ranked by their normalized loss reduction along this trajectory, requiring only forward passes and allowing the path to be reused across distinct pools for a fixed model-target pair. Empirically, TACS achieves competitive downstream performance across controlled logistic, vision, and NLP benchmarks, while slashing selection compute by up to 69% and candidate storage to less than 10 MB in large-scale instruction tuning.
Abstract:Targeted data selection seeks training examples from a candidate pool that improve downstream task performance. While trajectory-based selectors effectively guide this process, existing approaches typically construct reference states by warming up on the candidate pool itself, thereby inheriting pool-dependent distributional biases. To address this coupling, we introduce Target-Aligned Candidate Selection (TACS), which constructs a short, capacity-constrained reference path using a compact target-validation proxy. Candidates are ranked by their normalized loss reduction along this trajectory, requiring only forward passes and allowing the path to be reused across distinct pools for a fixed model-target pair. Empirically, TACS achieves competitive downstream performance across controlled logistic, vision, and NLP benchmarks, while slashing selection compute by up to 69% and candidate storage to less than 10 MB in large-scale instruction tuning.
Machine Learning (cs.LG); Computation and Language (cs.CL); Computer Vision and Pattern Recognition (cs.CV)
arXiv:2605.09404 [cs.LG]
(or arXiv:2605.09404v2 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2605.09404 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 228 cuvinte
Subiecte conexe
Benchmarking Kimi-K3 Across vLLM, SGLang, and ATOM on MI350X
AMD · 22 sept. 2026

[AINews] Meta Muse Wonder & Wonder Full: MSL’s Claude 5.5-tier Frontier Model
Latent Space · 13 oct. 2026

News
Quantum Computing Report · 7 iun. 2026

Why do models task game?
AI Alignment Forum · 6 aug. 2026