mlsanityData to 14 Oct 2026

IFHierBench: Hierarchical Instruction Following for Large Language Models

arXiv 2607.27912 ↗First posted 30 Jul 2026cs.AI cs.CLcited by 1

Not on the map. Why?

Abstract (arXiv)

Instruction-following ability is critical for deploying large language models in real-world applications, where downstream components depend on the output satisfying specific constraints. Modern deployments increasingly handle the full task in a single LLM call, with one prompt specifying a layered output whose overall artifact, structural sections, and nested fields must each satisfy concrete constraints. Existing instruction-following benchmarks treat the constraint set as a flat list applied uniformly to the response, so they cannot scope a check to a particular section of the output. We introduce IFHierBench, a hierarchical instruction-following benchmark of 600 prompts stratified across four constraint-tree depths and 35 distinct constraints, each prompt paired with a deterministic checker that verifies satisfaction at every scope. Evaluating seven leading proprietary and open-weight models, we find that even the strongest model only marginally exceeds 50% prompt-level accuracy and that accuracy degrades sharply as constraint depth grows. Reliably following nested constraints remains a substantial gap for current LLMs, motivating future training methods that consider constraint adherence at finer granularity to achieve better instruction-following ability.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 19 of its 37 references that are in the map. First posted on arXiv 30 Jul 2026.

Builds on

19 of 37 references.

References · 19

  1. 2022Training language models to follow instructions with human feedbackcited by 15,971
  2. 2019Plug and Play Language Models: A Simple Approach to Controlled Text Generationcited by 799
  3. 2019CTRL: A Conditional Transformer Language Model for Controllable Generationcited by 762
  4. 2022Decomposed Prompting: A Modular Approach for Solving Complex Taskscited by 558
  5. 2025GLM-4.5: Agentic, Reasoning, and Coding (ARC) Foundation Modelscited by 467
  6. 2020GeDi: Generative Discriminator Guided Sequence Generationcited by 378
  7. 2021FUDGE: Controlled Text Generation With Future Discriminatorscited by 376
  8. 2024MT-Bench-101: A Fine-Grained Benchmark for Evaluating Large Language Models in Multi-Turn Dialoguescited by 250
  9. 2017Lexically Constrained Decoding for Sequence Generation Using Grid Beam Searchcited by 237
  10. 2018Fast Lexically Constrained Decoding with Dynamic Beam Allocation for Neural Machine Translationcited by 182
  11. 2024Benchmarking Complex Instruction-Following with Multiple Constraints Compositioncited by 152
  12. 2020NeuroLogic Decoding: (Un)supervised Neural Text Generation with Predicate Logic Constraintscited by 149
7 more
  1. 2024ARGS: Alignment as Reward-Guided Searchcited by 103
  2. 2024CFBench: A Comprehensive Constraints-Following Benchmark for LLMscited by 67
  3. 2025StructFlowBench: A Structured Flow Benchmark for Multi-turn Instruction Followingcited by 29
  4. 2025From Prompts to Templates: A Systematic Prompt Template Analysis for Real-world LLMappscited by 21
  5. 2024LLM App Store Analysis: A Vision and Roadmapcited by 13
  6. 2024PromptSet: A Programmer's Prompting Datasetcited by 9
  7. 2025ECO Decoding: Entropy-Based Control for Controllability and Fluency in Controllable Dialogue Generationcited by 3

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.