Add-One-In: Incremental Sample Selection for Large Language Models via a Choice-Based Greedy Paradigm
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , , , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866915547377041408 |
|---|---|
| author | Li, Zhuo Du, Yuhao Jiao, Xiaoqi Guo, Yiwen Feng, Yuege Wan, Xiang Gao, Anningzhe Hu, Jinpeng |
| author_facet | Li, Zhuo Du, Yuhao Jiao, Xiaoqi Guo, Yiwen Feng, Yuege Wan, Xiang Gao, Anningzhe Hu, Jinpeng |
| contents | Selecting high-quality and diverse training samples from extensive datasets plays a crucial role in reducing training overhead and enhancing the performance of Large Language Models (LLMs). However, existing studies fall short in assessing the overall value of selected data, focusing primarily on individual quality, and struggle to strike an effective balance between ensuring diversity and minimizing data point traversals. Therefore, this paper introduces a novel choice-based sample selection framework that shifts the focus from evaluating individual sample quality to comparing the contribution value of different samples when incorporated into the subset. Thanks to the advanced language understanding capabilities of LLMs, we utilize LLMs to evaluate the value of each option during the selection process. Furthermore, we design a greedy sampling process where samples are incrementally added to the subset, thereby improving efficiency by eliminating the need for exhaustive traversal of the entire dataset with the limited budget. Extensive experiments demonstrate that selected data from our method not only surpasses the performance of the full dataset but also achieves competitive results with recent powerful studies, while requiring fewer selections. Moreover, we validate our approach on a larger medical dataset, highlighting its practical applicability in real-world applications. Our code and data are available at https://github.com/BIRlz/comperative_sample_selection. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_02359 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Add-One-In: Incremental Sample Selection for Large Language Models via a Choice-Based Greedy Paradigm Li, Zhuo Du, Yuhao Jiao, Xiaoqi Guo, Yiwen Feng, Yuege Wan, Xiang Gao, Anningzhe Hu, Jinpeng Computation and Language Selecting high-quality and diverse training samples from extensive datasets plays a crucial role in reducing training overhead and enhancing the performance of Large Language Models (LLMs). However, existing studies fall short in assessing the overall value of selected data, focusing primarily on individual quality, and struggle to strike an effective balance between ensuring diversity and minimizing data point traversals. Therefore, this paper introduces a novel choice-based sample selection framework that shifts the focus from evaluating individual sample quality to comparing the contribution value of different samples when incorporated into the subset. Thanks to the advanced language understanding capabilities of LLMs, we utilize LLMs to evaluate the value of each option during the selection process. Furthermore, we design a greedy sampling process where samples are incrementally added to the subset, thereby improving efficiency by eliminating the need for exhaustive traversal of the entire dataset with the limited budget. Extensive experiments demonstrate that selected data from our method not only surpasses the performance of the full dataset but also achieves competitive results with recent powerful studies, while requiring fewer selections. Moreover, we validate our approach on a larger medical dataset, highlighting its practical applicability in real-world applications. Our code and data are available at https://github.com/BIRlz/comperative_sample_selection. |
| title | Add-One-In: Incremental Sample Selection for Large Language Models via a Choice-Based Greedy Paradigm |
| topic | Computation and Language |
| url | https://arxiv.org/abs/2503.02359 |