Composition-RL: Compose Your Verifiable Prompts for Reinforcement Learning of Large Language Models
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , , , , , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2026
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866914498659483648 |
|---|---|
| author | Xu, Xin Bai, Clive Yang, Kai Chen, Tianhao Chen, Yangkun Liu, Weijie Chen, Hao Wang, Yang Yang, Saiyong Yang, Can |
| author_facet | Xu, Xin Bai, Clive Yang, Kai Chen, Tianhao Chen, Yangkun Liu, Weijie Chen, Hao Wang, Yang Yang, Saiyong Yang, Can |
| contents | Large-scale verifiable prompts underpin the success of Reinforcement Learning with Verifiable Rewards (RLVR), but they contain many uninformative examples and are costly to expand further. Recent studies focus on better exploiting limited training data by prioritizing hard prompts whose rollout pass rate is 0. However, easy prompts with a pass rate of 1 also become increasingly prevalent as training progresses, thereby reducing the effective data size. To mitigate this, we propose Composition-RL, a simple yet useful approach for better utilizing limited verifiable prompts targeting pass-rate-1 prompts. More specifically, Composition-RL automatically composes multiple problems into a new verifiable question and uses these compositional prompts for RL training. Extensive experiments across model sizes from 4B to 30B show that Composition-RL consistently improves reasoning capability over RL trained on the original dataset. Performance can be further boosted with a curriculum variant of Composition-RL that gradually increases compositional depth over training. Additionally, Composition-RL enables more effective cross-domain RL by composing prompts drawn from different domains. Codes, datasets, and models are available at https://github.com/XinXU-USTC/Composition-RL. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_12036 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Composition-RL: Compose Your Verifiable Prompts for Reinforcement Learning of Large Language Models Xu, Xin Bai, Clive Yang, Kai Chen, Tianhao Chen, Yangkun Liu, Weijie Chen, Hao Wang, Yang Yang, Saiyong Yang, Can Computation and Language Large-scale verifiable prompts underpin the success of Reinforcement Learning with Verifiable Rewards (RLVR), but they contain many uninformative examples and are costly to expand further. Recent studies focus on better exploiting limited training data by prioritizing hard prompts whose rollout pass rate is 0. However, easy prompts with a pass rate of 1 also become increasingly prevalent as training progresses, thereby reducing the effective data size. To mitigate this, we propose Composition-RL, a simple yet useful approach for better utilizing limited verifiable prompts targeting pass-rate-1 prompts. More specifically, Composition-RL automatically composes multiple problems into a new verifiable question and uses these compositional prompts for RL training. Extensive experiments across model sizes from 4B to 30B show that Composition-RL consistently improves reasoning capability over RL trained on the original dataset. Performance can be further boosted with a curriculum variant of Composition-RL that gradually increases compositional depth over training. Additionally, Composition-RL enables more effective cross-domain RL by composing prompts drawn from different domains. Codes, datasets, and models are available at https://github.com/XinXU-USTC/Composition-RL. |
| title | Composition-RL: Compose Your Verifiable Prompts for Reinforcement Learning of Large Language Models |
| topic | Computation and Language |
| url | https://arxiv.org/abs/2602.12036 |