Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2510.03515 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911191200169984 |
|---|---|
| author | Huang, Lianghuan Anupam, Sagnik Lee, Insup Li, Shuo Bastani, Osbert |
| author_facet | Huang, Lianghuan Anupam, Sagnik Lee, Insup Li, Shuo Bastani, Osbert |
| contents | Reinforcement learning (RL) has emerged as a promising strategy for finetuning small language models (SLMs) to solve targeted tasks such as math and coding. However, RL algorithms tend to be resource-intensive, taking a significant amount of time to train. We propose RAPID, a novel RL algorithm that can substantially reduce the running time of RL. Our key insight is that RL tends to be costly due to the need to perform both inference and backpropagation during training. To maximize use of computational resources, our algorithm performs inference in large batches, and then performs off-policy policy gradient updates in mini-batches. For off-policy updates, we incorporate group advantage estimation into the policy gradient algorithm, and derive an importance weighted estimator to correct for the bias arising from off-policy learning. Our experiments demonstrate that our algorithm can reduce running time by 11%-34% on three benchmarks compared to state-of-the-art RL algorithms while maintaining similar or better accuracy. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_03515 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | RAPID: An Efficient Reinforcement Learning Algorithm for Small Language Models Huang, Lianghuan Anupam, Sagnik Lee, Insup Li, Shuo Bastani, Osbert Machine Learning Reinforcement learning (RL) has emerged as a promising strategy for finetuning small language models (SLMs) to solve targeted tasks such as math and coding. However, RL algorithms tend to be resource-intensive, taking a significant amount of time to train. We propose RAPID, a novel RL algorithm that can substantially reduce the running time of RL. Our key insight is that RL tends to be costly due to the need to perform both inference and backpropagation during training. To maximize use of computational resources, our algorithm performs inference in large batches, and then performs off-policy policy gradient updates in mini-batches. For off-policy updates, we incorporate group advantage estimation into the policy gradient algorithm, and derive an importance weighted estimator to correct for the bias arising from off-policy learning. Our experiments demonstrate that our algorithm can reduce running time by 11%-34% on three benchmarks compared to state-of-the-art RL algorithms while maintaining similar or better accuracy. |
| title | RAPID: An Efficient Reinforcement Learning Algorithm for Small Language Models |
| topic | Machine Learning |
| url | https://arxiv.org/abs/2510.03515 |