Two extensions of RLOO are introduced that target a zero-gradient pathology and are implemented as a small subclass of the project’s existing RLOO trainer; all other components are inherited unchanged so curves are directly comparable across runs.
Online Self-Weighted Fine-Tuning is proposed, a simple method that augments SFT with online, trajectory-level weighting and offers a favorable compute-performance trade-off as a practical approach for fine-tuning small-to-medium LLMs on binary-verifiable reasoning tasks with only 2 online rollouts.
Hai-Quan Wen, Yi-Wei He, Bei Peng et al.· 0 citations
The dominance of Neural Networks (NNs) in RL is partially due to their incremental learning capability, which naturally suits the online, non-stationary nature of self-play training. However, gradient-boosted trees like LightGBM are widely recognised as the state of the art for tabular data in supervised learning, ofte...
David Milec, Spyridon Samothrakis, Michael Fairbank et al.· IEEE Transactions on Games· 0 citations
The sample efficiency and scalability of RL post-training for video MLLMs and introduces OraRL, a decoupled advantage estimator that scales with model size and data, surpassing its backbone from 0.8B to 9B and GRPO up to 100k prompts.
Yun-Heng Li, Guo-Hong Mu, Hao Li et al.· 1 citation
GFlowRL, a streamlined GFlowNet-style RL algorithm that removes the auxiliary partition network entirely while preserving the reward-distribution-matching objective, is proposed, and is the first GFlowNet-style RL algorithm to scale stably across both dense and sparse architectures.
Xiaodong Liu, Michael Xu, Jack W. Stokes et al.· arXiv.org· 0 citations
RSTG (Recovering Learning Signals via Adaptive Teacher Guidance), which applies distillation selectively and precisely where it matters most, and substantially outperforms naive GRPO+OPD.
Zhuo-Wen Han, Jinwei Xiao, Zhengxi Lu et al.· 4 citations
AdaKP is an online selector that re-chooses each problem's KP subset over the course of RL training, an entropy proxy that scores a KP by the reduction in next-token entropy it induces in a single inexpensive forward pass, with a provable bound on its truncation bias.