aspireai.
PUBLIC EDITION

FlexReader picks its own decoding stride per input, running up to six times faster than autoregressive scene-text decoding

AspireAI community · arXiv (cs.LG, cs.CV)
Scene text recognition models are usually tied to the decoding strategy their training used, which limits how they can be deployed across different datasets. FlexReader adds a Sub-string Perception module that perceives the target sub-string from visual features, followed by parallel decoding blocks that decode each character of the sub-string independently, so a single model can decode with arbitrary strides. Adaptive Prefix Decoding then selects the stride at each step based on the model's confidence in the decoded characters, identifying a decoding path per input rather than a fixed one. The authors report robust recognition across benchmarks featuring long text, curved text and occlusions, consistently better accuracy than existing decoding strategies, and up to a sixfold decoding speedup over autoregressive decoding.
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.