aspireai.
PUBLIC EDITION

Baidu open-sourced Unlimited OCR 2, which compresses a document you can never finish reading into a fixed window of 512 tokens

AspireAI community · Baidu Inc. (Hugging Face / GitHub)
*Baidu open-sourced Unlimited OCR 2, and its trick is compressing a document you can never finish reading down to a fixed window of 512 tokens.* The new Sparse Reference Sliding Window Attention keeps text-to-image attention on a constant-size set of references, so decoding latency and memory stay flat however long the document gets. *The first version shipped in June.* This one adds unlimited-horizon parsing, with the model card claiming state-of-the-art results on MPDocBench and the hundred-page MarathonDocBench. The weights are on Hugging Face under MIT, about 6.7 GB across two shards, and the GitHub repo is already at 28,600 stars. The honest limit: those benchmarks are the authors' own, and "unlimited" still means a bounded context holding a fixed reference set. https://huggingface.co/baidu/Unlimited-OCR-2
Read the story and explore more from the AspireAI community.
Discover more stories
Stay curious.
THE BIG PICTURE
A FRESH PERSPECTIVE
Research
One distance function matched sparse-autoencoder features across layers and compressed feature circuits into supernodes
Two sparse-autoencoder analyses have resisted scaling: matching semantically similar features across layers, and compressing large feature circuits into interpretable supernodes. This paper argues both are the same underlying problem, estimating semantic distances between SAE features that sit on different activation manifolds. Its representation treats each feature not as a single decoder vector but as an activation-weighted distribution over the hidden states expressing it, projects those distributions into a shared reference space, and compares them with Wasserstein distance. The representation is proved invariant to activation rescaling and stable under perturbation, and recovers true matches under finite-sample margin conditions. Empirically it outperformed decoder-vector and LLM-based baselines and captured subtle functional distinctions between related features, and it compressed large feature circuits into interpretable supernodes automatically. The limitation is that this is interpretability tooling: the paper demonstrates better feature matching and circuit compression, not that downstream interpretability claims become more accurate.
Swipe into something new
01 / 1729
The conversation continues
Explore Builds — projects by Kiran Adimatyam ↗
A fresh perspective changes everything.
ASPIREAI — STAY CURIOUS.