@lateinteraction: very cool work !!

X AI KOLs Timeline News

Summary

Guowei Xu discusses limitations of Best-of-N and tree search methods for LLMs on hard reasoning problems, noting sparse verification signals and that candidates remain within the model's distribution.

very cool work !!
Original Article
View Cached Full Text

Cached at: 05/30/26, 06:43 PM

very cool work !!

Guowei Xu (@Kevin_GuoweiXu): 🚀 How should LLMs sample on hard reasoning problems during post-training and inference where direct rollouts rarely produce a correct answer?

Best-of-N (e.g., GRPO) and tree search share two limitations: 🔻 Verification signals are sparse 🔻 Candidates stay within the model’s

Similar Articles

Refining Over Resampling: Test-Time Self-Correction for LLM Reasoning

arXiv cs.AI

A new verifier-free breadth-depth refinement framework improves LLM reasoning at test time by sampling multiple rollouts, iteratively refining each via self-critique, and aggregating with majority voting. It consistently outperforms greedy decoding, majority voting, and verifier-based selection across several math benchmarks and open-weight models.