























Abstract:Convolutional architectures have emerged as powerful alternatives to Transformers for sequence modeling. The primary advantage is that they offer improved theoretical sequence length complexity by leveraging the Fast Fourier Transform (FFT). However, this theoretical improvement does not always meaningfully land in practice. One critical obstacle is that applying standard FFTs is not amenable to the large-scale training pipeline wherein data is packed from different sources into a single sequence for hardware efficiency. Indeed, standard FFT algorithms are not easily amenable to document packing. Existing workarounds suffer from severe inefficiencies, crippling the practical performance of convolutional architectures. We close this gap with RubiConv, a novel algorithm for performing hardware-efficient, boundary-respecting convolutions on packed sequences. Extensive experiments show that RubiConv achieves significant speedups over both attention and standard FFT-based baselines. This work makes the theoretical efficiency of long convolutional models a practical reality for large-scale, real-world data packing.
| Comments: | 19 pages, 12 figures |
| Subjects: | Machine Learning (cs.LG) |
| Cite as: | arXiv:2605.08451 [cs.LG] |
| (or arXiv:2605.08451v1 [cs.LG] for this version) | |
| https://doi.org/10.48550/arXiv.2605.08451 arXiv-issued DOI via DataCite (pending registration) |
From: Annie Marsden [view email]
[v1]
Fri, 8 May 2026 20:17:12 UTC (1,900 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。