A 689M-parameter open OCR model now reads 6.19 pages per second on one H100 and leads every open model under a billion parameters
AspireAI community · Hugging Face - Datalab
Surya OCR 2.5 is a 689M-parameter vision-language model that does layout analysis, OCR and table recognition in a single pass, and its model card reports 85.9 on OmniParseBench as the highest score among open models under one billion parameters, plus 83.7 percent on olmOCR-bench and 74.9 percent on an internal 91-language set. Throughput on one H100 is 6.19 pages per second at 96 DPI against 2.28 for Surya 2, with per-page output tokens cut to about a third, and a page at 192 DPI takes 6.8 seconds at the median against 12.0 seconds for Surya 2. The code is Apache 2.0 while the weights use a modified OpenRAIL-M license that is free for research, personal use and startups under 5M dollars in funding or revenue, so larger deployments need a commercial license, and the accuracy figures are the vendor's own on its own benchmark sets with row and column geometry requiring a separate Surya 2 checkpoint. The model can be run on CPU or Apple Silicon through llama.cpp, or on NVIDIA GPUs through vLLM, with a GGUF build published for llama.cpp.
Read the story and explore more from the AspireAI community.
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.