Collapse, Not Complexity: Failure-Conditioned Decomposition Repair for End-to-End Document Parsing
Read the original on arXiv Computation and Language →The Flow has not summarised this story yet — read it at arXiv Computation and Language.
The Flow has not summarised this story yet — read it at arXiv Computation and Language.
arXiv:2605.19309v4 Announce Type: replace Abstract: Document Layout Analysis (DLA) pipelines provide structured page representations for retrieval-augmented generation, long-document question answeri...
arXiv:2605.26037v2 Announce Type: replace Abstract: We test the standard RLVR tool-use recipe -- GRPO on Qwen2.5-7B-Instruct -- on a deliberately minimal knowledge-graph tool API: four Freebase navig...
WeVisDoc is a two‑stage data‑centric framework designed to improve end‑to‑end document parsing. Stage I expands coverage by adding heterogeneous data and applying structure‑preserving degradation synthesis, while Stage II evaluates residual errors with a held‑out probe and uses those diagnostics to target data construction and token budget reallocation. The resulting WeVisDoc‑4B model achieves an overall score of 95.38 on OmniDocBench v1.6 and outperforms competing parsers across all evaluated settings, with Stage II delivering notable gains on degraded tracks.
arXiv:2609.26219v1 Announce Type: cross Abstract: Long-running LLM agent workflows often revise interior context spans while retaining long suffixes. Although suffix tokens remain unchanged, altered...
arXiv:2607. 16019v1 Announce Type: new Abstract: AI systems increasingly retrieve from records that revise themselves: issue threads, encyclopedic histories, policy logs, and long conversations.
arXiv:2607. 13124v1 Announce Type: cross Abstract: Structured pruning is a hardware-friendly way to compress LLMs, but it is mostly validated on multiple-choice recognition tasks, while the same compressed checkpoints can collapse on the free-form generation that deployment actually requires.