Skip to main content
Search

# Training Stability

5 related articles

Subscribe to updates
  1. Low-rank adaptation learns one matrix: SingLoRA beats LoRA and LoRA+ on LLaMA-7B at 60% of their parameter budget

    Low-rank adaptation (LoRA) writes the weight update as a product of two small matrices, but their norms often differ sharply during training, producing imbalanced gradient flow and unstable optimization. SingLoRA instead writes the update as a single low-rank matrix times its own transpose, removing inter-matrix scale conflicts by construction and roughly halving the trainable parameters. Fine-tuning LLaMA-7B on MNLI, SingLoRA reaches 91.3% accuracy against 89.1% for LoRA and 90.2% for LoRA+, while using only 60% of their parameter budget.

  2. stepfun.com

    Step 5 Preview bets on depth over width: 92 blocks, 1M-token context, million-level agent environments

    Step 5 Preview treats agentic workloads as the starting point for model design: it uses a narrow-but-deep stack of 92 transformer blocks, interleaves efficient and sparse full attention at 3:1, and extends the full-attention path to contexts up to 1M tokens with Sparse GQA. Its total parameter count is under one-quarter and its active count under one-third of trillion-scale models such as Qwen3.8-Max and Kimi K3, and it reports long-horizon agentic capability comparable to those counterparts. Agent-native data synthesis and long-rollout RL infrastructure accompany the model, yielding million-level verifiable environments.

  3. arXiv

    EasyPPO traces two critic failure modes in PPO and stays stable across three tasks, gaining 14.89%, 2.28% and 9.47% over PPO

    The work identifies two critic failure modes that destabilize PPO for LLM reinforcement learning — filtering truncated rollouts from both actor and critic shifts the policy objective to reward conditioned on completion, and heterogeneous return noise across prompts lets high-variance prompts dominate critic updates in finite batches — and introduces EasyPPO, which combines actor-only overlong filtering, noise-normalized critic regression weighting each prompt by the inverse standard deviation of its sampled returns, and moderately smaller critic mini-batches with gradient clipping, remaining stable across continuous-reward coding on FrontierCS, binary-reward mathematical reasoning on AIME24 and multi-turn search on Search-R1, with best validation scores improving over PPO by 14.89%, 2.

  4. arXiv

    ByteDance Seed and UW–Madison make full-pipeline FP8 RL work: tracing entropy surges to over-clipping and using Calibrated Clipping to match BF16 from 8B to 32B with up to 1.5x training throughput

    This work studies the training stability of full-pipeline FP8 reinforcement learning for LLMs, identifies that compounded FP8 quantization noise distorts the importance ratio so that negative-advantage tokens are over-clipped at the lower bound and their gradients are erroneously zeroed, and proposes Calibrated Clipping, which dynamically realigns clipping bounds by matching the lower-bound clipping quantile of a BF16 reference and rebalancing the upper bound, eliminating entropy surges and restoring near-BF16 performance across GRPO and DAPO, 8B to 32B models, and multiple FP8 scaling granularities, while reaching up to 1.5x the BF16 training throughput.

  5. arXiv

    StableVQ: Turning Vector-Quantized Tokenizer Training Stability from a Fragile Outcome into a Guaranteed Property

    The work proposes StableVQ, three parameter-free components — Dynamic STE, Region VQ Loss, and Decoupled Schedule — that disentangle Encoder–Decoder and Codebook training so each module can fulfill its own responsibility independently, consistently improving training stability, codebook utilization, and reconstruction quality on ImageNet across diverse codebook sizes and initialization settings.

You’re all caught up