Decoding Game: On Minimax Optimality of Heuristic Text Generation Strategies · HackerPapers discussionshttps://hackerpaper.kaipfister.de/p/2410.03968/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMTDecoding Game: On Minimax Optimality of Heuristic Text Generation Strategies — mentioned by Der_Einzigehttps://news.ycombinator.com/item?id=43890210urn:hackerpapers:mention:2410.03968:43890210Sun, 04 May 2025 22:38:32 GMT<p>Besides beam search and it&#x27;s variants? (there are many including the little known but awesomely powerful constrained beam search: https://huggingface.co/blog/constrained-beam-search) Does MBR (minimal bayes risk) sampling count? Also there was this paper at ICLR which is relevant to this question: https://arxiv.org/abs/2410.03968 This paper basically claims that non-heuristic methods (like beam search) are harmful compared to the heuristic ones.</p><p><a href="https://hackerpaper.kaipfister.de/p/2410.03968/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.LG