arXiv:2609.23742v1 Announce Type: new
Abstract: Small open-source large language models (LLMs) in the 0.6B-4B parameter range are increasingly deployed for structured output generation (JSON, functio...
By Akash Chavan
arXiv:2608.21074v1 Announce Type: cross
Abstract: Large language models (LLMs) are increasingly used in research workflows and software development pipelines, yet their output remains sensitive to in...
By Erik Thureck, Robert K\"uhnen, Tim Jacobowitz
The paper investigates how the wording of schema‑key tokens can serve as an implicit instruction channel in constrained decoding for structured generation. By treating structured generation as a multi‑channel instruction problem, the authors analyze when an instructional advantage is preserved after grammar projection and conduct experiments on GSM8K and Math500 across seven language models. Results show that changing only the schema‑key wording can significantly alter accuracy, with both positive and negative effects, and that prompt‑level and schema‑level instructions interact non‑additively.
By Yifan Le
arXiv:2609.13415v1 Announce Type: new
Abstract: Specifications face a basic tradeoff: leave details out, and important questions go unanswered; record every detail separately, and the specification b...
By Atticus Cull, Justin McCarthy
arXiv:2606. 04535v1 Announce Type: cross Abstract: Diffusion large language models (dLLMs) offer bidirectional attention and parallel generation, enabling them to exploit global context and naturally support format-constrained tasks like parseable JSON or reasoning templates.
By Boyan Han, Yiwei Wang, Yi Song, Yujun Cai, Chi Zhang
The paper introduces PASK (Parser-Aware Structural KV Persistence), a method that leverages parser transitions to inform key‑value (KV) persistence decisions in structured generation tasks. By aligning KV compression with task‑level structured risk, PASK sets protection floors based on error sensitivity and allocates remaining KV capacity using attention‑output distortion, producing a lightweight, structure‑conditioned lookup policy. In experiments on Qwen3‑4B, PASK achieves a 17.39‑point accuracy gain over the best compressed baseline, while delivering up to 2.2× higher throughput, 3.3× lower TPOT, and 0.53× the peak GPU memory of full KV.
By Linze Wu, Xinrui Chen