Method Drift›KV-cache compression
Superseded baseline#222 of 234 most-superseded
tree search
KV-cache compression
superseded — cited as a baseline and beaten by newer methods
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
Newer alternatives
Recent methods in the same sub-problem, not yet superseded in the knowledge base.