# Optimize the Cob, Then the Kernel: Optimizing Beam Search for Generative Recommendation Inference

> Source: <https://arxiv.org/abs/2611.23339>
> Published: 2026-11-19 05:00:00+00:00

**Recommendation:** For beam-search generative recommendation on Ascend NPUs, batch beams via Tree Attention with pre-generated partial-attention masks and static KV cache before writing custom kernels; the source measured up to 25x lower latency than vLLM.
More in the playbook "Inference and self-hosting": <https://wpnews.pro/playbooks/inference-serving>

arXiv:2611.23339v1 Announce Type: new 
Abstract: Generative recommendation (GR) inference differs substantially from conventional LLM serving, featuring long input sequences, wide beam search, and only a few fixed output tokens. Existing LLM serving engines such as vLLM process beams as batched independent sequences, causing redundant KV cache accesses over the shared prompt prefix. Furthermore, vLLM executes each beam search generation step as a separate engine invocation, incurring host-side beam processing overhead between decoding steps and substantial runtime KV block management in PagedAttention. Using Tree Attention, we concatenate beams along the sequence dimension to eliminate redundant KV accesses, and further optimize execution through pre-generated partial-attention masks, static KV cache allocation, loop-unrolled generation dispatch, TorchAir graph compilation, automatic operator fusion, and vocabulary-constrained decoding. Without the use of custom kernels, our approach reduces end-to-end latency by up to 25x over vLLM on Ascend NPUs, and achieves generation latency comparable to a SOTA solution using custom kernels, showing that the generation pipeline should be optimized holistically before resorting to custom kernel development.
