Skip to content
JevDirectory.org
PatternsBeam search

Parallel beam search

Keep the top-k branches at each taxonomy level instead of only the winner, so a wrong first choice can still be recovered.

Category
Patterns
Also known as
Beam search
Related terms
3
Directory entries
1
Docs
docs.typesafe.ai
Added
2026-09-24

Definition

Beam search over Choice probabilities asks one question per surviving node at each level and keeps the best few paths, pruning the rest. It uses the probability distribution the answer already returns as the ranking signal.

It is the mitigation for greedy hierarchical classification: committing to the single top choice at level one turns a 0.7 into a hard decision, while a beam keeps a runner-up alive until the evidence separates.

Tagspatternsclassification

From the directory

Classify documents through deep patent, retail product, biomedical, and source-code hierarchies using parallel beam search over Choice probabilities.
Cookbooks & DemosDocs#official#cookbook#classification
Official

From the community

Posts from builders shipping with Jev right now.

Follow @typesafeai

Jev plays Tetris: 134 lines in two minutes

Support answers in a Mac app

A local Jev build with room to get faster

jev-review: a local-first score loop for coding agents

built `jev-review` @typesafeai it's an experimental, local-first MCP plugin that gives coding agents a score quality feedback loop across different metrics. agents call jev while they work, get scored, make improvements, and repeat the loop try below 👇

Diogo Almeida
Diogo Almeida
TypeSafe AI
@CompleteSkeptic

After co-inventing ChatGPT, I kept asking myself: why have superhuman chat models not led to AGI? I’ve spent the last 2 years in stealth building a new way to train models (RLCD), and a new type of frontier AI model that we are releasing today: Jev • 20-200x faster • 40-400x

Reply

The X algorithm, rebuilt with Jev

Hard-coded rules moved to Jev