Training

  1. Start of training
  2. Pre-training, 8KKimi K3not stated8KNTPtext and visionMTPallMTP layer
  3. Pre-training, 64KKimi K3not stated64KNTPtext and visionMTPall
  4. Cooldown, 256KKimi K3not stated256KNTPall
  5. Cooldown, 1MKimi K3not stated1MNTPall
  6. Off this path: Draft model1 stage
  7. The frozen target and the time: not stated. Speculative decoding is used in RL rollouts
  8. Draft-model fine-tuningKimi K3not statednot statedLKdraftMTP → draft
  9. Draft model
  10. SFTKimi K3not statednot statedSFTnot statedMXFP4 experts
  11. Cold-start model
  12. RL: nine expertsKimi K3not stated1MRLKimi K2.5’s, near GRPOnot stated
  13. Nine experts
  14. Where the student starts: not stated
  15. Multi-teacher on-policy distillationKimi K3not statednot statedMOPD9 teachersnot stated
  16. Kimi K3
  • tokens, log scale
  • derived: computed from stated numbers
  • context length
  • all parameters train
  • a part trains
  • all but a part trains
  • NTPdashed: concluded, no source names it
  • not stated by the sources
  • the architecture changes
  • checkpoint
  • checkpoint, weights published
  • a join the sources leave unexplained

RL: nine experts

×

Stage · Kimi K3

Reinforcement learning trains one expert for each of three domains at each of three reasoning efforts.

Experts
3 domains × 3 efforts: 9 experts
Order over efforts
max first, then high and low
Budget rule
over budget: reward −1
Rewards
environment checks; a generative reward model
Context
1M

Not disclosed K, N, λ, τ, σ · Steps · Learning rate · Tokens

Why

One expert is trained for each broad domain at every reasoning effort, in place of a specialized model for each task. Kimi K3 report §4.1.2, p. 12

Pausing generation once a fraction of the rollouts completes lets optimization proceed without waiting for the slowest trajectories. Kimi K3 report §4.1.2, p. 13

All settings13
Experts
3 domains (general tasks, general agents, coding agents) × 3 reasoning efforts (low, high, max): 9 experts
Order over efforts
A max-budget expert first, with a large budget multiplier τ; then τ annealed to smaller values for the high- and low-effort experts
Budget rule
A trajectory whose tokens exceed τ·b₀(x), b₀ the budget estimated from the cold-start model, has its task reward replaced by −1
Rollouts
K completions for each of N prompts; generation pauses once a fraction λ of the trajectories completes, and paused rollouts resume first in the next iteration
Algorithm
Policy optimization “follows the algorithm in Kimi K2.5”, with a per-token regularization; this report does not write it. The Kimi K2.5 report does (eq. 1): the clipped token-level ratio to the old policy times the reward less the group’s mean, less τ times the squared log-ratio
Against GRPO
The advantage is the reward less the group’s mean, with no division by its deviation; the ratio to the old policy is clipped to [α, β] token by token, a mask on the gradient whatever the advantage’s sign; the holding term is τ times the squared log-ratio to the old policy, where GRPO has a KL term to a reference; the average is over the batch’s tokens
Context
1M: “each 1M-context Kimi K3 RL experiment”
Effort in the prompt
A thinking-effort option message, turned into a short instruction in context; the schema has four levels, of which the model supports a subset
Harnesses
Different harness configurations are constructed for different task groups during RL
Speculative decoding
Used in rollouts: it “further accelerates request turnover within relatively fixed tool-call intervals”
Compute
“Within a few hundred GPUs” for each RL experiment, rollout and training on the same devices
Rewards
Verifiable tasks: the environments’ checks, such as a verifier’s evaluation of the final state. Other tasks: an agentic generative reward model, a tournament of binary comparisons scored against a rubric the judge writes
Number format
Quantization-aware training: MoE expert weights in MXFP4, activations in MXFP8; the other parts in higher precision
Sources9