GO TO A SECTION

↑ ↓ to navigate · Enter to openExplore all sections →
FDEInterviews logo
RecentarXiv preprint

Kimi K2.5: Visual Agentic Intelligence

Moonshot trained an orchestrator to spawn and schedule parallel sub-agents. WideSearch time to a target score fell 3 to 4.5 times; total compute for the swarm is not reported.

Breakdown by FDE Interviews · 12 min read · Updated

About the original · 2026
AUTHORS
Kimi Team
FROM
Moonshot AI
PUBLISHED
Feb 2026 · arXiv preprint
CITED BY
452Semantic Scholar · Oct 2026
IN THIS BREAKDOWN · 10 SECTIONS

You can read 22% of this breakdown.

01

The paper in one minute

Kimi K2.5 is Moonshot AI's open-weight multimodal model, built on Kimi K2 (a mixture-of-experts model with 1.04 trillion total and 32 billion active parameters) by continued training on about 15 trillion mixed text and vision tokens. Most of the report is about training text and vision together. For anyone building agents, the important part is Agent Swarm.

Most agents call one tool at a time, so a task that needs 300 searches takes 300 steps, and one context window holds everything they return. Agent Swarm gives the model two extra tools. create_subagent defines a sub-agent with its own system prompt. assign_task sends it work. Several sub-agents run in parallel, each with its own context, and each returns a single message to the orchestrator.

The orchestrator learns when to do this through Parallel-Agent Reinforcement Learning (PARL). Only the orchestrator is trained; sub-agents are frozen copies of an earlier checkpoint whose outputs count as observations. That avoids the problem of deciding which agent deserves credit for a final answer. The reward is the task score plus two temporary bonuses: one for creating sub-agents, so training does not collapse into a single serial agent, and one for sub-agents finishing their assignments, so the orchestrator does not spawn agents that do nothing. Both bonuses decay to zero by the end of training.

Latency is measured in critical steps: the orchestrator's steps plus, for each batch of parallel sub-agents, the steps of the slowest one. Splitting work only helps if it shortens the longest branch.

On WideSearch, the swarm reached a given score 3 to 4.5 times faster than a single agent, and scored 79.0% item-F1 against 72.7%.

THE IDEA, VISUALLY
ONE TRAINED ORCHESTRATOR, FROZEN SUB-AGENTS Orchestrator (trained) create_subagent · assign_task researcher A own context researcher B own context verifier own context writer own context Sub-agents are frozen checkpoints; each returns one message. Only task-relevant results reach the orchestrator's context. PARL REWARD r = λ1·r_parallel + λ2·r_finish + r_perf r_parallel: stops collapse into one serial agent r_finish: stops spawning agents that do nothing λ1, λ2 annealed to zero by the end of training LATENCY = CRITICAL STEPS Σ over stages ( orchestrator steps + max sub-agent steps ) Splitting work only helps if it shortens the longest branch. Total work is not part of the measure. Base: Kimi K2 MoE, 1.04T parameters, 32B active. BROWSECOMP, AGAINST EACH BASELINE single, no context mgmt 60.6 single, discard-all 74.9 GPT-5.2 Pro 77.9 Agent Swarm 78.4 +17.8 vs no context management; +3.5 vs discard-all SINGLE AGENT → SWARM (TABLE 6) WideSearch item-F1 72.7 79.0 In-house Swarm Bench 41.6 58.3 TIME TO REACH A TARGET F1 (FIGURE 8) single agent: ~1.8x to over 7.0x baseline as the target rises from 30% to 70%; swarm: 0.6x to 1.6x 3.0x 30% 3.0x 40% 3.2x 50% 3.7x 60% 4.5x 70% time saved, by target item-F1 No total-token or cost figures are reported for the swarm; sub-agents get 100 tool calls each on BrowseComp.
Agent Swarm teaches one model, by reinforcement learning, when to split a task into parallel sub-agents with separate contexts. The paper measures latency as the longest branch; it reports no figure for the total work all branches do.
Research notes: the problem, approach and results
3x to 4.5x

less wall-clock time to reach a target item-F1 on WideSearch, swarm against single agent

78.4% vs 74.9%

BrowseComp, Agent Swarm against the single agent with discard-all context management; 60.6% without it

100

tool calls each sub-agent may make on BrowseComp, under an orchestrator limited to 15 steps

THE PROBLEM

Agents that call tools one after another take longer as tasks grow, and a single context fills up on broad tasks such as checking forty companies or reading a hundred documents. Hand-written parallel workflows are brittle, and training several agents together has unclear credit assignment.

THE IDEA

Give the model two tools, create_subagent and assign_task, and train only the orchestrator with RL (PARL); sub-agents are frozen checkpoints whose results come back as observations. Reward the task outcome, plus temporary bonuses for creating sub-agents and for sub-agents finishing their work, and constrain episodes by critical steps, the longest parallel branch, rather than total steps.

THE RESULT

BrowseComp rose to 78.4% from 60.6% for the single agent without context management (74.9% with discard-all context management). WideSearch item-F1 rose from 72.7% to 79.0%, and the time to reach a target score fell 3 to 4.5 times. The underlying K2.5 model, a 1.04-trillion-parameter MoE with 32B active, is released.

02

Why it matters to an FDE

Customer research tasks are often wide: pull the latest filings for 40 suppliers, check 200 contracts for a clause, compare pricing across 30 competitors. A single agent does them one at a time and runs out of context partway through. Agent Swarm is a lab's worked answer: decompose, run in parallel with separate contexts, merge summaries.

Three things transfer even if you never use Kimi.

Separate contexts are context management. Each sub-agent sees only its share; the orchestrator sees only results. The paper frames this as sharding context rather than truncating it, and on BrowseComp it beat the same model using discard-all context management.

Measure latency as the longest branch. Critical steps make the trade-off explicit: eight sub-agents where one handles every item is no faster than one agent.

Guard against fake parallelism. The finish-rate bonus exists because the orchestrator learned to spawn agents that did nothing, which inflated a parallelism score without helping.

What the paper does not tell you is the bill. It reports time saved and accuracy gained, but no total tokens, tool calls or cost for the swarm. Each BrowseComp sub-agent may make up to 100 tool calls. Faster wall-clock time can mean much more total work. Before recommending a swarm, measure total tokens per completed task next to latency.

Read the 17.8-point BrowseComp gain against its baseline: the single agent had no context management and failed whenever its context overflowed. With discard-all context management it scored 74.9%, so the swarm's edge there is 3.5 points.

THE FULL BREAKDOWN

Understand the mechanism. Try it on a real problem.

Unlock this breakdown and 149 more papers.

Premium opens every paper in full, plus every answer, concept, course and guide on the site. One payment for six months of access.

6 months · One payment · No auto-renewal

Get Premium · ₹2,000 / $25
  • ◇1 architecture diagram
  • </>1 runnable code experiment
  • ▦2 results tables
  • ?5 interview questions with answers
  1. 03Key takeaways

    How the swarm is built and trained, what it achieved, what it costs, and three misreadings

    Free account
  2. 04How it works

    The swarm's tools, PARL training, critical steps, training prompts and the base model

    Premium
  3. 05The numbers that matter

    Swarm results, time savings by target, budgets, and the base model's headline benchmarks

    Premium
  4. 06Try it yourself

    Re-baseline the swarm's gains, then simulate latency, total work and context for a wide task

    Premium
  5. 07Where it breaks

    Missing cost data, generous budgets, task selection, an in-house benchmark and small slips

    Premium
  6. 08Using it on a deployment

    Fitting parallel sub-agents to a customer task, with budgets, merging and cost tracking

    Premium
  7. 09Interview angles

    Five questions this paper prepares you for, with answer hints

    Premium
Back to the paper library →