Is tree search superseded?

tree search (KV-cache compression): cited as a baseline — critiqued by newer work, not yet beaten on a benchmark here. 1 paper(s) critique it, 0 beat it on benchmarks — #222 of 234 most-superseded. Sub-problem: cluster led by Best-of-N. Newer alternatives in the same sub-problem include Latent Phase-Shift Rollback.

KV-cache compression

tree search

Superseded baseline#222 of 234 most-superseded

Cited as a baseline — critiqued by newer work, not yet beaten on a benchmark here

1 papers critique it · 0 beat it on benchmarks

What papers say

Verbatim critique sentences, each from a paper that cites tree search as a baseline.

Inference-time methods either ignore the model's internal state entirely (Best-of-N) or require many additional forward passes (tree search, self-consistency)

— Latent Phase-Shift Rollback: Inference-Time Error Correction via Residual Stream Monitoring and KV-Cache Steering

What to use instead

Recent methods in the same sub-problem, not yet superseded in the knowledge base — arXiv benchmark leaders, not vetted production recommendations.

Latent Phase-Shift RollbackLatent Phase-Shift Rollback: Inference-Time Error Correction via Residual Stream Monitoring and KV-Cache Steering
Apr 20, 2026