LASER: Stratified Selective Sampling for Instruction Tuning with Dedicated Scoring Strategy
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909803705532416 |
|---|---|
| author | Mirza, Paramita Weber, Lucas Küch, Fabian |
| author_facet | Mirza, Paramita Weber, Lucas Küch, Fabian |
| contents | Recent work shows that post-training datasets for LLMs can be substantially downsampled without noticeably deteriorating performance. However, data selection often incurs high computational costs or is limited to narrow domains. In this paper, we demonstrate that data selection can be both -- efficient and universal -- by using a multi-step pipeline in which we efficiently bin data points into groups, estimate quality using specialized models, and score difficulty with a robust, lightweight method. Task-based categorization allows us to control the composition of our final data -- crucial for finetuning multi-purpose models. To guarantee diversity, we improve upon previous work using embedding models and a clustering algorithm. This integrated strategy enables high-performance fine-tuning with minimal overhead. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_22157 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | LASER: Stratified Selective Sampling for Instruction Tuning with Dedicated Scoring Strategy Mirza, Paramita Weber, Lucas Küch, Fabian Computation and Language Recent work shows that post-training datasets for LLMs can be substantially downsampled without noticeably deteriorating performance. However, data selection often incurs high computational costs or is limited to narrow domains. In this paper, we demonstrate that data selection can be both -- efficient and universal -- by using a multi-step pipeline in which we efficiently bin data points into groups, estimate quality using specialized models, and score difficulty with a robust, lightweight method. Task-based categorization allows us to control the composition of our final data -- crucial for finetuning multi-purpose models. To guarantee diversity, we improve upon previous work using embedding models and a clustering algorithm. This integrated strategy enables high-performance fine-tuning with minimal overhead. |
| title | LASER: Stratified Selective Sampling for Instruction Tuning with Dedicated Scoring Strategy |
| topic | Computation and Language |
| url | https://arxiv.org/abs/2505.22157 |