🚀NEW COURSEVibe Coding AI Apps with Claude Code 🤖✨Enroll now
Agents · Reasoning

Branch-Solve-Merge (BSM)

Free while signed in. Answers cite the passages they came from.

First page
Branch-Solve-Merge (BSM)
The curator’s take

BSM decomposes LLM tasks into parallel sub-tasks via three LLM-programmed modules: branch, solve, and merge.

Key points
01

Three-module architecture: A branch module proposes a decomposition into parallel sub-tasks, a solve module independently answers each, and a merge module fuses results into a final response.

02

Prompt-parameterized: All three modules are the same base LLM with different prompts, so BSM works with any base model without fine-tuning.

03

Evaluation quality gains: Improves evaluation correctness and consistency for multiple LLMs, particularly on tasks where a flat prompt leaves too much implicit.

04

General pattern: Generalizes the "decompose then solve" pattern from math/CoT to arbitrary tasks, anticipating more structured agent decomposition patterns.

Every Monday
Get next week’s papers.

The same picks and the same summaries, in your inbox. Free, and 176 issues deep.

Subscribe on Substack