Paper recorded by Signals 4 on 2026-09-23 in cs.CL. Abstract reproduced from arXiv; link to the original below.
Published 2026-09-23 on arXiv · recorded by Signals 4 on 2026-09-24
Category: cs.CL · 自然语言处理 · first seen 2026-09-24
Language modeling using Transformers has become commonplace despite their fixed computational depth and quadratic runtime with respect to input tokens. Recurrent models on the other hand offer linear depth but no parallel execution. In this work, we extend balanced-tree recursive operators from sequence encoding to autoregressive prediction, enabling all prefix representations to be computed with