Tree Search Distillation for Language Models Using PPO
at2005
42 points
1 comment
March 15, 2026
Related Discussions
Found 5 related stories in 661.9ms across 14,015 title embeddings via pgvector HNSW
- Knowledge Distillation of Black-Box Large Language Models (2024) babelfish · 76 pts · June 28, 2026 · 51% similar
- Show HN: I built a tiny LLM to demystify how language models work armanified · 249 pts · April 06, 2026 · 48% similar
- CS336: Language Modeling from Scratch kristianpaul · 417 pts · June 01, 2026 · 47% similar
- Language model teams as distributed systems jryio · 87 pts · March 16, 2026 · 47% similar
- Trees to Flows and Back: Unifying Decision Trees and Diffusion Models rsn243 · 44 pts · June 06, 2026 · 47% similar
Discussion Highlights (1 comments)
supermdguy
> One might note that MCTS uses more inference compute on a per-sample basis than GRPO: of course it performs better This part confused me, it sounded like they were only doing the MCTS at train time, and then using GRPO to distill the MCTS policy into the model weights. So wouldn’t the model still have the same inference cost?