aspireai.
PUBLIC EDITION

OpenBMB open-sourced a document parser that also grades its own work

AspireAI community · OpenBMB (GitHub)
The MiniCPM-OCR family pairs two small models. MiniCPM-OCR 1.0, at 1.3B, is the first OCR-specific model in the MiniCPM-V/o line and parses Chinese and English documents into text, tables, formulas, charts and seals, handling scans, photographs, curved pages and recaptured documents. MiniCPM-OCR Jev, at 2B, is the part worth watching: give it one region image plus a candidate OCR result and it returns a 0-to-1 score for how likely that result is to be correct, so a pipeline can auto-accept confident regions, send shaky ones to a human and pick the best output when several parsers disagree. On JevOCRBench, Jev scores 93.6 AUROC, above JEV-35B-A3B at 90.1 and close to Qwen3.5-397B-A17B at 93.8, and it holds between 91.9 and 93.4 when grading output from four different parsers. The parser reports 93.68 on Real5-OmniDocBench at about 1.2 pages per second. Apache 2.0, with vLLM, SGLang, llama.cpp and Ollama from day one. The honest limit: every benchmark number here is OpenBMB's own, and no independent team has reproduced them yet. https://github.com/OpenBMB/MiniCPM-OCR
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.