3 ms·
Are there any samplers that aren't basically greedy? I.e. actually searches the tree. I realize it's an absolutely insane branching factor and quite expensive t
by toxik 1y ago
Are there any samplers that aren't basically greedy? I.e. actually searches the tree. I realize it's an absolutely insane branching factor and quite expensive to expand nodes at that, but it always seemed odd to me that we don't actually search.
- Kubuxu 1y agoBeam Search sampling is sometimes getting used
- Der_Einzige 1y agoBesides beam search and it's variants? (there are many including the little known but awesomely powerful constrained beam search: https://huggingface.co/blog/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 https://arxiv.org/abs/2410.03968 This paper basically claims that non-heuristic methods (like beam search) are harmful compared to the heuristic ones.