Accelerating Constrained Decoding with Token Space Compression 事件

Accelerating Constrained Decoding with Token Space Compression arXiv:2605.29986v1 Announce Type: new Abstract: To guarantee that an LLM's outputs conform to a specified structure, context-free grammar (CFG) decoding engines force the selection of next tokens that produce strings that conform to a given CFG. While current CFG-constrained decoding engines are highly optimized, the inherent costs arising from the massive per-step search space -- i.e. the entire token vocabulary -- result in intrac