NEWVectors or files. Pick a path.Start →
    Back to Videos

    Baidu's Unlimited-OCR: The Model Whose Memory Never Grows

    80
    Retrieval & Search Research
    Mixpeek Team
    July 20, 2026

    Summary

    Long-document OCR hits a memory wall: the KV cache grows with every token written, so pipelines chop PDFs into single pages and tables get cut at page breaks. Baidu's Unlimited-OCR (MIT, June 2026) replaces decoder attention with Reference Sliding Window Attention: each token attends to the document's visual tokens plus the last 128 outputs, making the cache a fixed-size queue. 40+ page PDFs parse in one forward pass, scoring 93.23 on OmniDocBench v1.5 vs DeepSeek-OCR's 87.01, about 12% faster, from a 3B MoE with 500M active. Paper: arxiv.org/abs/2606.23050

    ocrdocument-parsingkv-cacheattentionbaidulong-context

    About this video

    Long-document OCR hits a memory wall: the KV cache grows with every token written, so pipelines chop PDFs into single pages and tables get cut at page breaks. Baidu's Unlimited-OCR (MIT, June 2026) replaces decoder attention with Reference Sliding Window Attention: each token attends to the document's visual tokens plus the last 128 outputs, making the cache a fixed-size queue. 40+ page PDFs parse in one forward pass, scoring 93.23 on OmniDocBench v1.5 vs DeepSeek-OCR's 87.01, about 12% faster, from a 3B MoE with 500M active. Paper: arxiv.org/abs/2606.23050

    Frequently Asked Questions