dorsal/arxiv
View SchemaFocalOrder: Focal Preference Optimization for Reading Order Detection
| Authors | Fuyuan Liu, Dianyu Yu, He Ren, Nayu Liu, Xiaomian Kang, Delai Qiu, Fa Zhang, Genpeng Zhen, Shengping Liu, Jiaen Liang, Wei Huang, Yining Wang, Junnan Zhu |
|---|---|
| Categories | |
| ArXiv ID | 2601.07483vv1 |
| URL | https://arxiv.org/abs/2601.07483 |
| License | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ |
Abstract
Reading order detection is the foundation of document understanding. Most existing methods rely on uniform supervision, implicitly assuming a constant difficulty distribution across layout regions. In this work, we challenge this assumption by revealing a critical flaw: \textbf{Positional Disparity}, a phenomenon where models demonstrate mastery over the deterministic start and end regions but suffer a performance collapse in the complex intermediate sections. This degradation arises because standard training allows the massive volume of easy patterns to drown out the learning signals from difficult layouts. To address this, we propose \textbf{FocalOrder}, a framework driven by \textbf{Focal Preference Optimization (FPO)}. Specifically, FocalOrder employs adaptive difficulty discovery with exponential moving average mechanism to dynamically pinpoint hard-to-learn transitions, while introducing a difficulty-calibrated pairwise ranking objective to enforce global logical consistency. Extensive experiments demonstrate that FocalOrder establishes new state-of-the-art results on OmniDocBench v1.0 and Comp-HRDoc. Our compact model not only outperforms competitive specialized baselines but also significantly surpasses large-scale general VLMs. These results demonstrate that aligning the optimization with intrinsic structural ambiguity of documents is critical for mastering complex document structures.
{
"annotation_id": "9de0265f-b981-44e5-9013-22afe6c6f470",
"date_created": "2026-02-17T05:53:12.072000Z",
"date_modified": "2026-02-17T05:53:12.072000Z",
"file_hash": "9bcfd821d2bbcf4433292d8024710942ae4d467ea7bbd9e7eff0a0be093ebde2",
"private": false,
"record": {
"abstract": "Reading order detection is the foundation of document understanding. Most existing methods rely on uniform supervision, implicitly assuming a constant difficulty distribution across layout regions. In this work, we challenge this assumption by revealing a critical flaw: \\textbf{Positional Disparity}, a phenomenon where models demonstrate mastery over the deterministic start and end regions but suffer a performance collapse in the complex intermediate sections. This degradation arises because standard training allows the massive volume of easy patterns to drown out the learning signals from difficult layouts. To address this, we propose \\textbf{FocalOrder}, a framework driven by \\textbf{Focal Preference Optimization (FPO)}. Specifically, FocalOrder employs adaptive difficulty discovery with exponential moving average mechanism to dynamically pinpoint hard-to-learn transitions, while introducing a difficulty-calibrated pairwise ranking objective to enforce global logical consistency. Extensive experiments demonstrate that FocalOrder establishes new state-of-the-art results on OmniDocBench v1.0 and Comp-HRDoc. Our compact model not only outperforms competitive specialized baselines but also significantly surpasses large-scale general VLMs. These results demonstrate that aligning the optimization with intrinsic structural ambiguity of documents is critical for mastering complex document structures.",
"arxiv_id": "2601.07483",
"authors": [
"Fuyuan Liu",
"Dianyu Yu",
"He Ren",
"Nayu Liu",
"Xiaomian Kang",
"Delai Qiu",
"Fa Zhang",
"Genpeng Zhen",
"Shengping Liu",
"Jiaen Liang",
"Wei Huang",
"Yining Wang",
"Junnan Zhu"
],
"categories": [
"cs.CV"
],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"title": "FocalOrder: Focal Preference Optimization for Reading Order Detection",
"url": "https://arxiv.org/abs/2601.07483",
"version": "v1"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "73d36ae2-5c1e-4bde-8b9d-c8d42f749f27",
"id": "arXiv Dataset",
"type": "Model",
"variant": "snapshot-2026-01-17",
"version": "0.1.0"
},
"user_id": 1000002
}