Long-Document QA with Chain-of-Structured-Thought and Fine-Tuned SLMs

Zhuowen Liang, Xiaotian Lin, Zhengxuan Zhang, Yuyu Luo, Haixun Wang +1 more
3/31/2026
cs.CLcs.AIcs.LG

No official code found. Best implementation: SetonLiang/LiteCoST (7 stars, last commit 2026-02-12).

Abstract

Large language models (LLMs) are widely applied to data analytics over documents, yet direct reasoning over long, noisy documents remains brittle and error-prone. Hence, we study document question answering (QA) that consolidates dispersed evidence into a structured output (e.g., a table, graph, or chunks) to support reliable, verifiable QA. We propose a two-pillar framework, LiteCoST, to achieve both high accuracy and low latency with small language models (SLMs). Pillar 1: Chain-of-Structured-Thought (CoST). We introduce a CoST template, a schema-aware instruction that guides a strong LLM to produce both a step-wise CoST trace and the corresponding structured output. The process induces a minimal structure, normalizes entities/units, aligns records, serializes the output, and verifies/refines it, yielding auditable supervision. Pillar 2: SLM fine-tuning. The compact models are trained on LLM-generated CoST data in two stages: Supervised Fine-Tuning for structural alignment, followed by Group Relative Policy Optimization (GRPO) incorporating triple rewards for answer/format quality and process consistency. By distilling structure-first behavior into SLMs, this approach achieves LLM-comparable quality on multi-domain long-document QA using 3B/7B SLMs, while delivering 2-4x lower latency than GPT-4o and DeepSeek-R1 (671B). The code is available at https://github.com/HKUSTDial/LiteCoST.

View on arXivView PDF

Code Implementations(1)

🔥[ICLR'26] Long-Document QA with Chain-of-Structured-Thought and Fine-Tuned SLMs

70Shell, PythonMay 19, 20258 months ago

Similar Papers

Cite this paper

@article{liang2026longdocument,
  title  = {Long-Document QA with Chain-of-Structured-Thought and Fine-Tuned SLMs},
  author = {Zhuowen Liang and Xiaotian Lin and Zhengxuan Zhang and Yuyu Luo and Haixun Wang and Nan Tang},
  year   = {2026},
  eprint = {2603.29232},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2603.29232v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2603.29232.svg)](https://codeofpaper.com/paper/2603.29232)

Discussion