Collapse, Not Complexity: Failure-Conditioned Decomposition Repair for End-to-End Document Parsing

📅 2026-09-20
📈 Citations: 0
Influential: 0
📄 PDF
🤖 AI Summary
研究通过检测并分解文档页面中的崩溃部分,再重新解析各区域来修复端到端文档解析中的失败问题,而非依赖复杂度或推理模式。
📝 Abstract
End-to-end document parsers increasingly offer an optional reasoning mode for complex pages. On a 180-page entropy-stratified discovery sample with one frozen 4B checkpoint, complexity is the wrong decision variable. Reasoning lowers mean quality by 2.21 Overall at 1.54x tokens; a preregistered input-only model cannot predict its signed benefit (held-out AUROC 0.47, indistinguishable from chance). The benefit concentrates on pages whose ordinary pass has already collapsed, and they do not look complex: shared collapses have lower layout entropy than healthy ones yet consume 19x the tokens as degenerate repetition that doubling the budget does not cure. Switching modes rarely repairs them: 83% recur under reasoning. We instead detect collapse from the ordinary-pass trace, decompose the page by projection, and re-parse each region. Repair gains 1.40 Overall (95% CI [0.68, 2.16]) at 1.13x tokens, replicates across three checkpoints, and, with all parameters frozen, gains 2.41 (CI [1.64, 3.46]) on the remaining 1,175 benchmark pages.
Problem

Research questions and friction points this paper is trying to address.

document parsing
end-to-end
reasoning mode
collapse
complexity
Innovation

Methods, ideas, or system contributions that make the work stand out.

Failure-Conditioned Decomposition
Document Parsing
Collapse Detection
Re-parsing
🔎 Similar Papers
2024-06-07Annual Meeting of the Association for Computational LinguisticsCitations: 6
X
Xingyu Lin
Software Engineering Institute, East China Normal University
D
Dehui Du
Software Engineering Institute, East China Normal University