BlockLock: Reproducible LLM Inference with Fixed Batch Geometry
arXiv cs.AIen
arXiv:2611.06977v1 Announce Type: new Abstract: Reproducible LLM inference requires that a request produces the same output regardless of the other requests in the batch. Existing solutions pay for this in different ways: batch-invariant kernels constrain every operator, and isolating prefill with fixed-shape decode ({our CoRun-style baseline}) gives up shared prefill compute and pads decode. We present BlockLock, which keeps shared batched prefill and pins only the numerical path of the protected request: it fixes the geometry that the request sees, with {two modes: BlockLock-Rows uses fixed-width rows and retains batched decode of all requests; BlockLock-Pack uses terminal-anchored packing
This is a short summary published by AI Global Wire. The full article is owned and hosted by arXiv cs.AI — open it there to read it in full.
Read the full story at arXiv cs.AI- Forskning
Related AI news
- Align Before Aggregation: Basis-Consistent Federated LoRA under Heterogeneous RanksarXiv cs.AI · November 6, 2026
- KDASO: Knowledge-Data Dual-Driven Automated Skill Optimization for Liability Adjudication TasksarXiv cs.AI · November 6, 2026
- Adapting the Process of Adaptation: Darwinian, Lamarckian, and Agent-Directed Evolution in AIarXiv cs.AI · November 6, 2026
- SAVeR$^2$: Reasoning-based Safety Alignment for Large Reasoning Models via Verifiable RewardsarXiv cs.AI · November 6, 2026
- Graph learning-assisted logic-based Benders decomposition for distributionally robust in-station train rescheduling under disruptionsarXiv cs.AI · November 6, 2026
- Goal-Branching LaCAM: Temporary Goals as Search Branches in Dense Multi-Agent PathfindingarXiv cs.AI · November 6, 2026