Papers with Qwen3-8B-Base
Do Not Step Into the Same River Twice: Learning to Reason from Trial and Error (2026.acl-long)
Copied to clipboard
| Challenge: | Existing approaches to RLVR train LMs based on their own on-policy responses and are constrained by the initial capability of LM. |
| Approach: | They propose an approach that hints LMs with their self-made mistakes without external guidance. |
| Outcome: | The proposed approach outperforms the normal group relative policy optimization and requires no external guidance. |
Reinforcement Learning on Pre-Training Data (2026.acl-long)
Copied to clipboard
Siheng Li, Kejiao Li, Zenan Xu, Guanhua Huang, Kun Li, Haoyuan Wu, null Wujiajia, Zihao Zheng, Chenchen Zhang, Kun Shi, Xue Gong, Qi Yi, Ruibin Xiong, Tingqiang Xu, Yuhao Jiang, Jianfeng Yan, Yuyuan Zeng, Guanghui Xu, Jinbao Xue, Zhijiang xu, Zheng Fang, Shuai LI, Qibin Liu, Xiaoxue Li, Zhuoyu Li, Yangyu Tao, Fei Gao, Cheng Jiang, Bochao Wang, Kai Liu, Jianchen Zhu, Wai Lam, Bo Zhou, Di Wang
| Challenge: | Recent progress in large language models is driven by scaling of training compute through pre-training with nexttoken prediction (NTP) or post-training (RL) Pre-training using NTP enables models to acquire extensive knowledge and skills from general data, but it suffers from data inefficiency and catastrophic forgetting in continual learning settings. |
| Approach: | They propose to scale training compute through pre-training with next-token prediction (NTP) or post-training by scaling reinforcement learning (RL) to improve learning from general data. |
| Outcome: | Experiments on multiple benchmarks and models show that the proposed approach improves continual pre-training and provides a strong foundation for post-training on Qwen3-8B-Base. |
WIST: Web-Grounded Iterative Self-Play Tree for Domain-Targeted Reasoning Improvement (2026.acl-long)
Copied to clipboard
| Challenge: | Existing methods for self-improvement of large language models with verifiable rewards (RLVR) can drift over iterations, while corpus-grounded approaches rely on curated data environments. |
| Approach: | They propose a Web-grounded Iterative Self-play Tree framework for domain-targeted reasoning improvement that learns directly from the open-web without requiring any pre-arranged domain corpus. |
| Outcome: | The proposed framework outperforms both purely endogenous self-evolution and corpus-grounded self-play baselines and is domain-steerable. |