arXiv: cs.AI preprintsInternational20 November 2026
Optimize the Cob, Then the Kernel: Optimizing Beam Search for Generative Recommendation Inference
This is an official announcement record
Firsthand records what arXiv: cs.AI preprints announced and links to the original. The wording below is theirs, not ours.
arXiv:2611.23339v1 Announce Type: cross 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 Paged
Read the official announcement
Opens arxiv.org
More from arXiv: cs.AI preprints
- Human-AI Mutualism Is Unstable under Capability Asymmetry20 November 2026
- Training Language Models for Introspective Oversight20 November 2026
- Where the Tokens Go: Heat, Entropy and Error in Agentic Coding20 November 2026
- HardwareDx: A Foundational Graph Model System for Datacenter Machine Repairs20 November 2026
- RFBench: A Simulator-Grounded Multimodal Benchmark for Passive RF Layout Design and Understanding20 November 2026
This content is for informational purposes only and is not professional advice. Specifications, prices, plan tiers, and features change frequently and may differ from what is shown here; verify current details on the manufacturer's or company's official page before purchasing. Ratings are based on analysis of published documentation, not independent lab testing.