ReadingResearchRadarInvestment framework
Sign in / Sign up
← Back to reading
NewsTopic · RL信噪比效率论2 min read·2026-10-16

Beren: Why Low-Information RL Outperforms Pretraining in LLMs via Signal-to-Noise Ratio

Addressing the puzzle that Reinforcement Learning (RL) appears informationally inefficient compared to pretraining yet achieves rapid gains, researcher Beren proposes an explanation based on Signal-to-Noise Ratio (SNR) and bias-variance tradeoffs. The article argues that while RL provides fewer bits per sample, these bits are purely signal focused on task success, whereas pretraining's dense token-level loss contains significant noise irrelevant to the final objective. This framework explains RL's high sample efficiency and its extreme sensitivity to numerical precision and policy staleness in LLM contexts.

ImportanceStructuralEvidenceE3 inspectableWrite-upQuick

2026-10-16 13:03 GMT+8

In Large Language Model (LLM) training, a persistent paradox has puzzled researchers: theoretically, Reinforcement Learning (RL) seems extremely inefficient because it yields only a single scalar reward per rollout, whereas pretraining computes loss for every token, providing massive amounts of information. Yet empirically, RL often takes a model from barely capable to near-perfect performance in just hundreds or even tens of steps, far outpacing pretraining in sample efficiency. In a recent post, researcher Beren offers a resolution to this contradiction through the lens of Signal-to-Noise Ratio (SNR) and the bias-variance tradeoff.

Beren's central thesis distinguishes between the quantity of information and its quality. He argues that while pretraining delivers a firehose of bits, most of these gradients are noise relative to the specific downstream task, as they focus on predicting the next token rather than achieving task success. In contrast, RL's few bits are pure signal, directly targeting whether the task was completed successfully. Thus, RL's efficiency stems not from information volume but from its high SNR, which filters out irrelevant distractions and concentrates optimization pressure on the actual goal.

Sign in / Sign up
ReadingResearchRadarInvestment framework

This perspective also clarifies why iterative Supervised Fine-Tuning (SFT) cannot replace RL. Although SFT uses the model's own traces and provides token-level loss, it retains the Next Token Prediction (NTP) objective. Consequently, SFT gradients remain diluted by noise related to syntax, style, and other incidental features. Only when the loss function is strictly scoped to task outcome does the model rapidly converge to the parameter region that solves the task.

Furthermore, Beren uses this theory to explain the divergence between LLM RL and traditional RL (e.g., Atari). Traditional RL learns from scratch, facing severe exploration challenges and data scarcity, necessitating complex mechanisms like value functions and replay buffers to manage variance. LLM RL, however, fine-tunes a base model already highly optimized by pretraining. At this stage, parameters are exquisitely sensitive to bias; minor numerical inconsistencies or policy staleness disrupt the delicate balance, causing collapse. Therefore, LLM RL bypasses the need for extensive exploration but demands strict On-Policy adherence to minimize bias.

Finally, the article connects these insights to the 'Bitter Lesson.' As scale increases, our ability to handle variance improves, making bias increasingly harmful. The success of LLM RL suggests that with a strong base model, increasing SNR to precisely adjust behavior is more effective than merely adding information density. This implies that AI training design should prioritize the purity of the objective function and the specificity of gradient signals over simple data accumulation.

Sources

  • 原始出处lesswrong.com↗
Topic

RL信噪比效率论

针对“强化学习(RL)在信息论上极低效”的质疑,研究者Beren提出基于信噪比(SNR)和偏差-方差权衡的解释框架。尽管RL每个样本提供的比特数远少于预训练,但其信号完全聚焦于任务成败,而预训练的逐词预测包含大量与最终任务无关的噪声。这一机…

3 steps1 piecesUpdated 2026-10-16 19:40

How it got here

  1. 2026-10-16Beren发布文章《How can LLM RL Work Despite Information-Theoretic Inefficiency》,提出SNR视角解释RL高效性,指出RL信号虽稀疏但噪声低,且对on-policy状态高度敏感。
  2. 2025-06-09Zhang等人提出SPEED-RL算法,理论证明中间难度提示词能最大化梯度估计器的SNR,实验显示该方法可加速RL训练2至6倍而不降低准确率。
  3. 2026-05-05Wen等人提出MoLS方法,分析发现LLM不同模块存在梯度噪声失衡,通过估算模块级SNR自动缩放Adam更新率,提升收敛速度和泛化能力。

What is still unsettled

  • 如何量化预训练中“与任务无关噪声”的具体比例,以精确对比RL与预训练的SNR差异?
  • 在大规模分布式训练中,trainer与rollouter之间的微小数值差异如何通过SNR机制导致训练崩溃?
  • 除了中间难度采样,是否有其他动态调整数据分布的方法能进一步提升RL阶段的梯度SNR?
Read the full topic →
Continue researching →