Refined Coreset Selection: Towards Minimal Coreset Size under Model Performance Constraints
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2023
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866911786032168960 |
|---|---|
| author | Xia, Xiaobo Liu, Jiale Zhang, Shaokun Wu, Qingyun Wei, Hongxin Liu, Tongliang |
| author_facet | Xia, Xiaobo Liu, Jiale Zhang, Shaokun Wu, Qingyun Wei, Hongxin Liu, Tongliang |
| contents | Coreset selection is powerful in reducing computational costs and accelerating data processing for deep learning algorithms. It strives to identify a small subset from large-scale data, so that training only on the subset practically performs on par with full data. Practitioners regularly desire to identify the smallest possible coreset in realistic scenes while maintaining comparable model performance, to minimize costs and maximize acceleration. Motivated by this desideratum, for the first time, we pose the problem of refined coreset selection, in which the minimal coreset size under model performance constraints is explored. Moreover, to address this problem, we propose an innovative method, which maintains optimization priority order over the model performance and coreset size, and efficiently optimizes them in the coreset selection procedure. Theoretically, we provide the convergence guarantee of the proposed method. Empirically, extensive experiments confirm its superiority compared with previous strategies, often yielding better model performance with smaller coreset sizes. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2311_08675 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Refined Coreset Selection: Towards Minimal Coreset Size under Model Performance Constraints Xia, Xiaobo Liu, Jiale Zhang, Shaokun Wu, Qingyun Wei, Hongxin Liu, Tongliang Machine Learning Coreset selection is powerful in reducing computational costs and accelerating data processing for deep learning algorithms. It strives to identify a small subset from large-scale data, so that training only on the subset practically performs on par with full data. Practitioners regularly desire to identify the smallest possible coreset in realistic scenes while maintaining comparable model performance, to minimize costs and maximize acceleration. Motivated by this desideratum, for the first time, we pose the problem of refined coreset selection, in which the minimal coreset size under model performance constraints is explored. Moreover, to address this problem, we propose an innovative method, which maintains optimization priority order over the model performance and coreset size, and efficiently optimizes them in the coreset selection procedure. Theoretically, we provide the convergence guarantee of the proposed method. Empirically, extensive experiments confirm its superiority compared with previous strategies, often yielding better model performance with smaller coreset sizes. |
| title | Refined Coreset Selection: Towards Minimal Coreset Size under Model Performance Constraints |
| topic | Machine Learning |
| url | https://arxiv.org/abs/2311.08675 |