arXiv Computation and Language

Constrained Decoding Eliminates Structural Failures in Small LLMs but Reveals a Scale-Dependent Semantic Gap

arXiv AI
Oct 9

Structure Tax: How Structured Output affects LLMs Performance

The paper investigates the so‑called ‘structure tax’ that is often attributed to constraining large language model outputs to structured formats like JSON or XML. By evaluating various models, datasets, and schema designs, the authors find that the accuracy loss depends more on how the schema is organized than on the presence of structure itself. Specifically, reasoning‑first field ordering can match or surpass free‑form accuracy, whereas answer‑first ordering leads to significant drops, especially in smaller models. The study also shows that well‑designed schemas improve confidence calibration and the separability of correct versus incorrect representations in transformer layers.

By Vineet Kumar, Kanishka, Bhuvanesh Mandora
arXiv Computation and Language
5d ago

SERIAL-7: Deriving, Realizing, and Preserving Machine-Verifiable Outputs Across Representations

SERIAL-7 is a Korean‑English benchmark that evaluates large language models on their ability to generate machine‑verifiable structured outputs across seven representations. It introduces an executable verification framework that separates semantic derivation (Derive), constrained artifact generation (Realize), and cross‑representation preservation (Preserve), using 177 validated artifacts and 43 atomic representation constraints. The benchmark shows that reliable structured generation requires explicit, executable verification of how artifacts are realized and preserved, as evidenced by varying compliance rates across ten models.

By Youngkyung Seo, MiHyeon Kim, Jisoo Lee, Hwijung Ryu
arXiv AI
Oct 23

Metamodel-Guided LLM Decoding for Consistent DSL Generation

The paper introduces MeMoDecode, a decoding framework that enforces both concrete and abstract syntax as well as well‑formedness constraints for domain‑specific languages (DSLs) during large language model generation. By mapping generated text to partial metamodel instances and retrying from the last consistent snapshot, MeMoDecode guarantees consistency without sacrificing alignment metrics. Experiments on four DSLs and six open‑weight LLMs show a 23% average improvement over unconstrained decoding and an 8% improvement over grammar‑constrained decoding, with modest runtime overhead.

By Boqi Chen, Aren A. Babikian, Jos\'e Antonio Hern\'andez L\'opez
arXiv Computation and Language
Sep 1

How Order-Sensitive Are LLMs? OrderProbe for Deterministic Structural Reconstruction

arXiv:2601.08626v4 Announce Type: replace Abstract: Large language models (LLMs) excel at semantic understanding, yet their ability to reconstruct internal structure from scrambled inputs remains und...

By Zhaolu Kang, Yingjie He, Kehan Jiang, Leqi Zheng, Jiachen Qian, Qianyuan Zhang, Chunlei Meng, Yujie Feng, Yuan Wang, Stephen Dou, Aming Wu, Pengxiang Zhao, Jiaxin Liu, Guansu Wang, Zeyu Zhang, Lei Wang, Qishi Zhan, Xiaomin He, Meisheng Zhang, Jianyuan Ni, Richeng Xuan
arXiv AI
Oct 27

Constrained Decoding: Harmful or Beneficial? Revisiting Its Impact on LLM Performance

The paper investigates whether constrained decoding harms or helps large language model (LLM) performance. It introduces a taxonomy of three constraint types—format, validity, and reasoning—and shows that suitable constraints can preserve or even improve performance by eliminating invalid paths. Experiments across multiple model families reveal that perceived performance drops are mainly due to non-equivalent prompting and output formats, while validity constraints boost reliability and reasoning constraints can enhance accuracy when they guide beneficial reasoning trajectories.

By Ngoc Trinh Hung Nguyen, Alonso Silva, Armen Aghasaryan, Mehwish Alam
arXiv Machine Learning
Oct 23

Brittlebench: Quantifying LLM robustness via prompt sensitivity

The paper introduces Brittlebench, a framework and evaluation pipeline that measures how sensitive large language models (LLMs) are to prompt variations. By applying semantics‑preserving perturbations to popular benchmarks, the authors show that model performance can drop by up to 12% and that such perturbations can change model rankings in 63% of cases. The study finds that these input variations can explain up to half of the performance variance for a given model, underscoring the importance of robust evaluation methods.

By Angelika Romanou, Mark Ibrahim, Candace Ross, Kerem Oktar, Chantal Shaib, Samuel J. Bell, Anaelia Ovalle, Antoine Bosselut, Jesse Dodge, Koustuv Sinha, Adina Williams