ITNet: A Learnable Integral Transform That Subsumes Convolution, Attention, and Recurrence
Not on the map. Why?
Abstract (arXiv)
Convolutional networks, recurrent networks, and transformers each encode different inductive biases -- locality, sequential memory, and content-dependent pairwise interaction -- and have remained mathematically distinct since their inception. We show that this fragmentation reflects not a fundamental diversity in how signals should be processed, but rather incomplete views of a single underlying mathematical object: a learnable integral transform. We introduce the Integral Transform Network (ITNet), a unified architecture built around a learnable kernel that depends jointly on positions and features. This kernel is implemented as a small neural network, specifically an MLP, that models pairwise interactions, enabling the model to adapt its behavior from data. We show that convolution, self-attention (including multi-head), and autoregressive recurrence (including LSTM, GRU, S4, and Mamba) arise as special cases under appropriate parameterizations, and that ITNet is a universal approximator of continuous operators. To make this practical, we develop tiled kernel fusion, importance-weighted Monte Carlo integration, and learned low-rank factorization, enabling efficient and scalable computation. A single ITNet architecture with a shared operator and lightweight modality-specific encoders matches or exceeds specialized baselines on ImageNet-1K , GLUE, ModelNet40, VQA,v2 and NLVR2. The results demonstrate that a single learned interaction mechanism can recover the behavior of all three architectural families from data.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 15 of its 105 references that are in the map. First posted on arXiv 17 Jun 2026.
Builds on
15 of 105 references.
References · 15
- 2023GPT-4 Technical Reportcited by 18,396
- 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
- 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,372
- 2016Layer Normalizationcited by 5,669
- 2023Mamba: Linear-Time Sequence Modeling with Selective State Spacescited by 4,718
- 2016Gaussian Error Linear Units (GELUs)cited by 3,502
- 2020Longformer: The Long-Document Transformercited by 3,413
- 2020Fourier Neural Operator for Parametric Partial Differential Equationscited by 2,908
- 2021Efficiently Modeling Long Sequences with Structured State Spacescited by 2,465
- 2020DeBERTa: Decoding-enhanced BERT with Disentangled Attentioncited by 2,181
- 2024Transformers are SSMs: Generalized Models and Efficient Algorithms Through Structured State Space Dualitycited by 1,336
- 2016Training Deep Nets with Sublinear Memory Costcited by 848
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2025Can We Achieve Efficient Diffusion without Self-Attention? Distilling Self-Attention into Convolutions
- 2023Rethinking Attention: Exploring Shallow Feed-Forward Neural Networks as an Alternative to Attention Layers in Transformers
- 2024Interpreting Affine Recurrence Learning in GPT-style Transformers
- 2025Is Random Attention Sufficient for Sequence Modeling? Disentangling Trainable Components in the Transformer
- 2025Attention-Only Transformers via Unrolled Subspace Denoising
- 2026Not All Attention Is Equal: A Quantitative Survey of the EEI Trade-off
- 2022LLM.int8(): 8-bit Matrix Multiplication for Transformers at Scale
- 2025Sigmoid Self-Attention has Lower Sample Complexity than Softmax Self-Attention: A Mixture-of-Experts Perspective