PASK (Parser-Aware Structural KV Persistence), which turns parser-derived structure into layer-group-specific KV persistence decisions by using task-error sensitivity to set minimum protection floors and attention-output distortion to allocate residual KV capacity.
Abstract
Structured generation underpins large language model (LLM) agents that produce JSON, SQL, and function calls, where a single wrong field can cause the downstream action to fail. Constrained decoding already tracks parser transitions to enforce formal validity, and these transitions expose how generated tokens participate in schema-critical decisions such as required fields, arguments, and structural boundaries under the active grammar. Existing KV compression largely leaves this task-relevant structural signal unused. We introduce PASK (Parser-Aware Structural KV Persistence), which turns parser-derived structure into layer-group-specific KV persistence decisions. PASK addresses the mismatch between model-side KV sensitivity and task-level structured risk by using task-error sensitivity to set minimum protection floors and attention-output distortion to allocate residual KV capacity. An offline calibration stage compiles these signals into a persistence policy, leaving only lightweight structure-conditioned lookup online. At a targe total KV budget of 0.33, PASK outperforms the strongest compressed baseline by 17.39 percentage points on average across eight BFCL non-live and Live subcategories on Qwen3-4B. In end-to-end serving, PASK achieves up to 2.2x higher throughput and 3.3x lower TPOT, while using 0.53x the peak GPU memory of Full KV.
LLM-based code generation fails when correctness depends on execution-dependent coupling: the meaning of one routine is defined by the runtime behavior of another, a relationship that cannot be resolved from textual descriptions alone. This limitation, which we call static binding, is not confined to explicitly coupled...
Gnaneswar Villuri, Hashmath Shaik, Alex Doboli· 1 citation
GSA-Beam improves explicit state coverage and final structural diversity while preserving schema validity while preserving schema validity; across several LLM backbones, it reduces reference latency by 22.5% on average compared with standard constrained beam search.
Han-Tao Hua, Ji-Ming Su, Yi-Ping Yao et al.· Proceedings of the Thirty-Fi...· 0 citations
GNRS-Search is introduced, a framework that utilizes Markov Chain Monte Carlo sampling to optimize a discrete, five-slot And-Or Graph (AOG) and provides a foundational paradigm for deploying verifiable and compliance-ready personal agents within regulated environments.
Fan-Qi Kong, Huaxiao Yin, Ruijie Zhang et al.· 0 citations
A lightweight framework that dynamically terminates reasoning by estimating whether the generated prefix is sufficient for correct answering and derives robust training labels through repeated answer completions is presented, demonstrating an effective approach to more efficient LLM reasoning.
Keshu Fu, Ke-Qin Peng, Jun Bai et al.· arXiv.org· 0 citations
This work studies a production policy in which each ordered family is the conjunction of two regular-language predicates, and shows that the resulting monitor is release-boundary equivalent to an absorbing cumulative oracle for every policy in the declared grammar.
SemVerBench is introduced, the first benchmark of LLM version-constraint resolution semantics across three ecosystems (npm, PEP 440, Cargo), and six frontier models are evaluated: Opus significantly outperforms all other models, and Sonnet outperforms the OpenAI models (McNemar).
Qi-Bai Chen, Ze-Ming Liu· 1 citation
Related blog posts
MIT News · Artificial Intelligence· news.mit.eduOct 14, 2026
Learn how Google DeepMind and GovTech Singapore uses lightweight on-device Gemma models to intercept conversational scams in private chats with zero cloud data egress.
MIT News · Artificial Intelligence· news.mit.eduOct 13, 2026
Machine-learning networks can learn without detailed instructions from a designer. Those that do may offer insight into how the brain reorganizes itself during learning.
Microsoft Research Blog· microsoft.comOct 12, 2026
StudentSim is a research system for evaluating and improving AI tutoring tools before they are tested with learners. It models how individuals may engage with tutors, giving feedback to improve tutor performance across subjects like chess, writing, and mathematics. The post Simulating student learning for better AI tutoring appeared first on Microsoft Research.
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.