paper-with-me

홈 › Papers

Scaling State-Space Models from Lines to Paragraphs: An Ablation of Mamba-based OCR

2026-06-22 · Merveilles Agbeti-Messan, Pierrick Tranouez, Stéphane Nicolas, Clément Chatelain, Thierry Paquet arxiv

End-to-end OCR increasingly relies on autoregressive sequence models, where the quadratic cost of Transformer attention limits efficient transcription of long, paragraph-level text. State-Space Models (SSMs) such as Mamba offer linear-time decoding and have recently been shown to match Transformer accuracy on printed historical lines, but their behavior as sequences grow from short lines to full paragraphs, and their generalization to handwriting, remain poorly understood. We study how a Mamba-based OCR recognizer scales from lines to paragraphs. We first conduct a systematic exploration of its four core hyperparameters (decoder depth, state dimension, expansion factor, and connector depth) on synthetic paragraphs from 100 to 1,000 characters, identifying the recurrent state dimension and the expansion factor as the dominant levers for long-sequence accuracy. We then compare the recognizer against a Transformer baseline trained under an identical protocol. On clean synthetic paragraphs, both models stay below 1% CER at every length while the SSM runs 1.4 to 4.5 times faster, the speedup growing with sequence length. On real handwriting, however, the SSM lags clearly behind: it reaches 8.2% CER on IAM lines and 10.0% on IAM paragraphs, against 4.2% and 3.5% for the Transformer baseline. Through controlled experiments we show that a substantial part of this gap stems from data scarcity rather than from an intrinsic architectural limit: the autoregressive SSM decoder is markedly data-hungry on long sequences. Our study clarifies when SSMs are a practical choice for large-scale document transcription and when they are not.

📄 PDF Abstract BibTeX arXiv:2606.23524

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

SummAE: Zero-Shot Abstractive Text Summarization using Length-Agnostic Auto-Encoders

2019-10-02 · Peter J. Liu, Yu-An Chung, Jie Ren

We propose an end-to-end neural model for zero-shot abstractive text summarization of paragraphs, and introduce a benchmark task, ROCSumm, based on ROCStories, a subset for which we collected human summaries. In this tas…

Abstractive Text SummarizationDenoisingSentenceText Summarization

Document Reconstruction Unlocks Scalable Long-Context RLVR

2026-02-09 · Yao Xiao, Lei Wang, Yue Deng, Guanzheng Chen 외 arxiv

Reinforcement Learning with Verifiable Rewards~(RLVR) has become a prominent paradigm to enhance the capabilities (i.e.\ long-context) of Large Language Models~(LLMs). However, it often relies on gold-standard answers or…

Reinforcement Learning

Fourier-Enhanced Recurrent Neural Networks for Electrical Load Time Series Downscaling

2025-11-27 · Qi Chen, Mihai Anitescu arxiv

We present a Fourier-enhanced recurrent neural network (RNN) for downscaling electrical loads. The model combines (i) a recurrent backbone driven by low-resolution inputs, (ii) explicit Fourier seasonal embeddings fused …

Gated Recursive and Sequential Deep Hierarchical Encoding for Detecting Incongruent News Articles

2022-01-16 · ACL ARR January 2022 1 · Anonymous

With the increase in misinformation across digital platforms, incongruent news detection is becoming an important research problem. Earlier, researchers have exploited various feature engineering approaches and deep lea…

ArticlesFeature EngineeringMisinformation

Vocabulary Matters: A Simple yet Effective Approach to Paragraph-level Question Generation

2020-12-01 · Asian Chapter of the Association for Computational Linguistics 2020 · Vishwajeet Kumar, Manish Joshi, Ganesh Ramakrishnan, Yuan-Fang Li

Question generation (QG) has recently attracted considerable attention. Most of the current neural models take as input only one or two sentences, and perform poorly when multiple sentences or complete paragraphs are giv…

Question GenerationQuestion-Generation