mlsanityData to 7 Oct 2026

Pre-Inference Routing for Cost-Efficient Document Field Extraction

arXiv 2608.06607 ↗First posted 6 Aug 2026cs.CL cs.IR cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

Most document-extraction systems use a single model for all documents. This is simple but can be costly for easy cases and less effective for difficult ones. We examine whether we can predict a document's difficulty before extraction using inexpensive, document-based signals, and use this to choose between a cheaper and a stronger extractor. We find that routing only helps if two conditions hold: the cheaper model fails often enough to make routing worthwhile, and those failures can be predicted from visible features such as image quality and layout. We turn these into a practical test and apply it to five genres. When both conditions are met, the calibrated router reduces cost by 31-33% on receipts and 77% on degraded ad-buy forms while keeping quality within 0.02 F1 of always choosing the large model. Routing does not help if either condition is missing, as with clean digital invoices or nutrition labels that are already easy to read. A small labeled pilot can predict whether routing will work, and in the two cases where we ran it first, the prediction was correct. A simple bag-of-words router works about as well as engineered features, showing that the main limit is the genre, not the router design; we use interpretable features to help explain which genres can be routed. The router must be retrained for each dataset and does not transfer across datasets, even within the same genre. These results hold for two model pairs with cost differences of 5x and 3x.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 18 of its 27 references that are in the map. First posted on arXiv 6 Aug 2026.

Builds on

18 of 27 references.

References · 18

  1. 2017Selective Classification for Deep Neural Networkscited by 799
  2. 2023FrugalGPT: How to Use Large Language Models While Reducing Cost and Improving Performancecited by 791
  3. 2024RouteLLM: Learning to Route LLMs with Preference Datacited by 633
  4. 2022LayoutLMv3: Pre-training for Document AI with Unified Text and Image Maskingcited by 481
  5. 2024Hybrid LLM: Cost-Efficient and Quality-Aware Query Routingcited by 354
  6. 2019FUNSD: A Dataset for Form Understanding in Noisy Scanned Documentscited by 345
  7. 2021ICDAR2019 Competition on Scanned Receipt OCR and Information Extractioncited by 254
  8. 2017Predict Responsibly: Improving Fairness and Accuracy by Learning to Defercited by 228
  9. 2025BEST-Route: Adaptive LLM Routing with Test-Time Optimal Computecited by 63
  10. 2023DocILE Benchmark for Document Information Localization and Extractioncited by 58
  11. 2025MixLLM: Dynamic Routing in Mixed Large Language Modelscited by 56
  12. 2023Visual Information Extraction in the Wild: Practical Dataset and End-to-end Solutioncited by 54
6 more
  1. 2022VRDU: A Benchmark for Visually-rich Document Understandingcited by 35
  2. 2025CARROT: A Cost Aware Rate Optimal Routercited by 34
  3. 2025Route to Reason: Adaptive Routing for LLM and Reasoning Strategy Selectioncited by 23
  4. 2026Dynamic Model Routing and Cascading for Efficient LLM Inference: A Surveycited by 16
  5. 2026MMR-Bench: A Comprehensive Benchmark for Multimodal LLM Routingcited by 13
  6. 2025Cost-Aware Model Orchestration for LLM-based Systemscited by 1

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.