AIAny
AI Model2026
Icon for item

Unlimited OCR Works

Performs one-shot, long-horizon OCR and document parsing by using Reference Sliding Window Attention (R-SWA) to keep the decoder KV cache constant, enabling single-pass multi-page transcription; code, model weights and an accompanying arXiv report are provided.

Introduction

Long-form document transcription becomes impractical with standard decoder attention because the KV cache and attention cost grow with output length. Unlimited OCR explores a different trade-off: replace full decoder attention with Reference Sliding Window Attention (R-SWA), which always attends to visual/reference tokens while limiting output-side attention to a short causal window. That keeps the KV cache size effectively constant and preserves visual token fidelity, enabling one-shot, multi-page parsing in a single forward pass with near-constant inference latency.

Key Capabilities
  • Reference Sliding Window Attention: for each output token the model attends to all visual/reference tokens plus a fixed-size causal window (default width 128) over recent outputs. This design prevents progressive blurring of visual features while avoiding ever-growing KV state.
  • Long-horizon single-pass parsing: supports very long outputs (standard max_length up to 32K), allowing dozens of pages to be transcribed in one forward pass instead of iterative chunking.
  • Empirical gains: demonstrates substantial throughput and accuracy improvements in document OCR benchmarks (reported ~93% end-to-end on OmniDocBench v1.5 and further gains on v1.6) and measured higher TPS vs the DeepSeek-OCR baseline.
  • Practical deployment: published model, code, and recipes for frameworks like Hugging Face Transformers and vLLM; includes support for multi-page/PDF inference workflows.
Who It's For and Trade-offs

Great fit if you need to transcribe long multi-page documents in a single pass, want stable inference latency as output length grows, or are integrating OCR into pipelines where memory and KV-cache growth are bottlenecks. Look elsewhere if your primary need is best-in-class single-page recognition in highly constrained resource environments (smaller models may be cheaper), or if you require architectures that update visual reference tokens recurrently (R-SWA intentionally avoids recurrent visual state updates to preserve fidelity).

Information

  • Websitehuggingface.co
  • OrganizationsBaidu Inc.
  • AuthorsYouyang Yin, Huanhuan Liu, YY, Qunyi Xie, Chaorun Liu, Shiqi Yang, Shaohua Wang, Zhanlong Liu, Hao Zou, Jinyue Chen …
  • Published date2026/06/19

Categories

More Items

Hugging Face
AI Model2026

Compresses Qwen3.8-27B into a 12.3 GB sensitivity-aware mixed-precision quantized checkpoint for long-horizon agent workloads; preserves BF16 fidelity (+0.02% PPL, 93.2% token Top‑1 agreement), supports 262K context and vLLM serving, text-only and Apache‑2.0 licensed.

Hugging Face
AI Model2026

Turns a context, a question, and 2–20 candidate answers into a single chosen option for classification, routing, ordered scores, and Boolean decisions. Built on mmBERT-small with a 144.3M-parameter decision head, runs on CPU with up to 8,192 combined tokens; FP32 weights occupy 550.5 MiB and are Apache‑2.0 licensed.

Hugging Face
AI Model2026

Performs schema-driven, low-latency classification and structured decision-making over English text. Supports multi-head scoring, constrained joint decoding with confidence/feasibility metadata, span extraction, and local CPU/GPU deployment via the gliner2 runtime.