Wider or Deeper? Scaling LLM Inference-Time Compute with Adaptive Branching Tree Search · HackerPapers discussionshttps://hackerpaper.kaipfister.de/p/2503.04412/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMTWider or Deeper? Scaling LLM Inference-Time Compute with Adaptive Branching Tree Search — mentioned by bob1029https://news.ycombinator.com/item?id=48907710urn:hackerpapers:mention:2503.04412:48907710Tue, 14 Jul 2026 14:42:37 GMT<p>https://arxiv.org/abs/2503.04412</p><p><a href="https://hackerpaper.kaipfister.de/p/2503.04412/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.AIWider or Deeper? Scaling LLM Inference-Time Compute with Adaptive Branching Tree Search — HN submissionhttps://news.ycombinator.com/item?id=44439235urn:hackerpapers:submission:2503.04412:44439235Wed, 02 Jul 2025 00:30:12 GMT<p>Wider or Deeper? Scaling LLM Inference-Time Compute with Adaptive Tree Search</p><p></p><p>3 points; 0 discussion replies on HN. <a href="https://hackerpaper.kaipfister.de/p/2503.04412/">Paper and source history</a>. A submission is not an endorsement.</p>cs.AI