Saved in:
| Main Authors: | , , , , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2601.20687 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917228200329216 |
|---|---|
| author | Kou, Zhiqiang Chen, Junyang Cai, Xin-Qiang Xia, Xiaobo Xie, Ming-Kun Wu, Dong-Dong Liu, Biao Jia, Yuheng Geng, Xin Sugiyama, Masashi Chua, Tat-Seng |
| author_facet | Kou, Zhiqiang Chen, Junyang Cai, Xin-Qiang Xia, Xiaobo Xie, Ming-Kun Wu, Dong-Dong Liu, Biao Jia, Yuheng Geng, Xin Sugiyama, Masashi Chua, Tat-Seng |
| contents | Due to constraints on privacy, cost, and latency, on-premise deployment of small models is increasingly common. However, most practical pipelines stop at supervised fine-tuning (SFT) and fail to reach the reinforcement learning (RL) alignment stage. The main reason is that RL alignment typically requires either expensive human preference annotation or heavy reliance on high-quality reward models with large-scale API usage and ongoing engineering maintenance, both of which are ill-suited to on-premise settings. To bridge this gap, we propose a positive-unlabeled (PU) RL distillation method for on-premise small-model deployment. Without human-labeled preferences or a reward model, our method distills the teacher's preference-optimization capability from black-box generations into a locally trainable student. For each prompt, we query the teacher once to obtain an anchor response, locally sample multiple student candidates, and perform anchor-conditioned self-ranking to induce pairwise or listwise preferences, enabling a fully local training loop via direct preference optimization or group relative policy optimization. Theoretical analysis justifies that the induced preference signal by our method is order-consistent and concentrates on near-optimal candidates, supporting its stability for preference optimization. Experiments demonstrate that our method achieves consistently strong performance under a low-cost setting. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_20687 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Positive-Unlabeled Reinforcement Learning Distillation for On-Premise Small Models Kou, Zhiqiang Chen, Junyang Cai, Xin-Qiang Xia, Xiaobo Xie, Ming-Kun Wu, Dong-Dong Liu, Biao Jia, Yuheng Geng, Xin Sugiyama, Masashi Chua, Tat-Seng Machine Learning Due to constraints on privacy, cost, and latency, on-premise deployment of small models is increasingly common. However, most practical pipelines stop at supervised fine-tuning (SFT) and fail to reach the reinforcement learning (RL) alignment stage. The main reason is that RL alignment typically requires either expensive human preference annotation or heavy reliance on high-quality reward models with large-scale API usage and ongoing engineering maintenance, both of which are ill-suited to on-premise settings. To bridge this gap, we propose a positive-unlabeled (PU) RL distillation method for on-premise small-model deployment. Without human-labeled preferences or a reward model, our method distills the teacher's preference-optimization capability from black-box generations into a locally trainable student. For each prompt, we query the teacher once to obtain an anchor response, locally sample multiple student candidates, and perform anchor-conditioned self-ranking to induce pairwise or listwise preferences, enabling a fully local training loop via direct preference optimization or group relative policy optimization. Theoretical analysis justifies that the induced preference signal by our method is order-consistent and concentrates on near-optimal candidates, supporting its stability for preference optimization. Experiments demonstrate that our method achieves consistently strong performance under a low-cost setting. |
| title | Positive-Unlabeled Reinforcement Learning Distillation for On-Premise Small Models |
| topic | Machine Learning |
| url | https://arxiv.org/abs/2601.20687 |