Orchid: Flexible and Data-Dependent Convolution for Sequence Modeling
Not on the map. Why?
Abstract (arXiv)
In the rapidly evolving field of deep learning, the demand for models that are both expressive and computationally efficient has never been more critical. This paper introduces Orchid, a novel architecture designed to address the quadratic complexity of traditional attention mechanisms without compromising the ability to capture long-range dependencies and in-context learning. At the core of this architecture lies a new data-dependent global convolution layer, which contextually adapts its kernel conditioned on input sequence using a dedicated conditioning neural network. We design two simple conditioning networks that maintain shift equivariance in our data-dependent convolution operation. The dynamic nature of the proposed convolution kernel grants Orchid high expressivity while maintaining quasilinear scalability for long sequences. We evaluate the proposed model across multiple domains, including language modeling and image classification, to highlight its performance and generality. Our experiments demonstrate that this architecture not only outperforms traditional attention-based architectures such as BERT and Vision Transformers with smaller model sizes, but also extends the feasible sequence length beyond the limitations of the dense attention layers. This achievement represents a significant step towards more efficient and scalable deep learning models for sequence modeling. The code is available at https://github.com/Karami-m/orchid.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 58 of its 78 references that are in the map. First posted on arXiv 28 Feb 2024.
Builds on
58 of 78 references.
References · 58
- 2017Attention Is All You Needcited by 59,932
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
- 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
- 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,854
- 2023Mamba: Linear-Time Sequence Modeling with Selective State Spacescited by 4,616
- 2022FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awarenesscited by 3,611
- 2020Longformer: The Long-Document Transformercited by 3,362
- 2020Fourier Neural Operator for Parametric Partial Differential Equationscited by 2,806
- 2021Efficiently Modeling Long Sequences with Structured State Spacescited by 2,424
- 2020Transformers are RNNs: Fast Autoregressive Transformers with Linear Attentioncited by 1,979
38 more
- 2020Big Bird: Transformers for Longer Sequencescited by 1,673
- 2020Reformer: The Efficient Transformercited by 1,658
- 2020Rethinking Attention with Performerscited by 1,584
- 2019Generating Long Sequences with Sparse Transformerscited by 1,523
- 2020Linformer: Self-Attention with Linear Complexitycited by 1,462
- 2021Geometric Deep Learning: Grids, Groups, Graphs, Geodesics, and Gaugescited by 1,131
- 2021Tokens-to-Token ViT: Training Vision Transformers from Scratch on ImageNetcited by 1,096
- 2022In-context Learning and Induction Headscited by 930
- 2019SpanBERT: Improving Pre-training by Representing and Predicting Spanscited by 832
- 2020Efficient Transformers: A Surveycited by 784
- 2018Image Transformercited by 770
- 2018Tensor field networks: Rotation- and translation-equivariant neural networks for 3D point cloudscited by 735
- 2022What Can Transformers Learn In-Context? A Case Study of Simple Function Classescited by 700
- 2019Is BERT Really Robust? A Strong Baseline for Natural Language Attack on Text Classification and Entailmentcited by 663
- 2020A Generalization of Transformer Networks to Graphscited by 653
- 2021Combining Recurrent, Convolutional, and Continuous-time Models with Linear State-Space Layerscited by 607
- 2021How to train your ViT? Data, Augmentation, and Regularization in Vision Transformerscited by 562
- 2022Hungry Hungry Hippos: Towards Language Modeling with State Space Modelscited by 495
- 2021Linear Transformers Are Secretly Fast Weight Programmerscited by 471
- 2020Efficient Content-Based Sparse Attention with Routing Transformerscited by 469
- 2023Resurrecting Recurrent Neural Networks for Long Sequencescited by 397
- 2023Hyena Hierarchy: Towards Larger Convolutional Language Modelscited by 388
- 2019Dynamic Convolution: Attention over Convolution Kernelscited by 355
- 2021Random Feature Attentioncited by 350
- 2022Long Range Language Modeling via Gated State Spacescited by 265
- 2020Sparse Sinkhorn Attentioncited by 250
- 2021Adaptive Fourier Neural Operators: Efficient Token Mixers for Transformerscited by 237
- 2019Pay Less Attention with Lightweight and Dynamic Convolutionscited by 211
- 2019Blockwise Self-Attention for Long Document Understandingcited by 158
- 2021Scatterbrain: Unifying Sparse and Low-rank Attention Approximationcited by 128
- 2021CKConv: Continuous Kernel Convolution For Sequential Datacited by 117
- 2021An Attention Free Transformercited by 111
- 2021Long-Short Transformer: Efficient Transformers for Language and Visioncited by 102
- 2022Monarch: Expressive Structured Matrices for Efficient and Accurate Trainingcited by 100
- 2022Better plain ViT baselines for ImageNet-1kcited by 97
- 2020ConvBERT: Improving BERT with Span-based Dynamic Convolutioncited by 88
- 2022What Makes Convolutional Models Great on Long Sequence Modeling?cited by 86
- 2021How to Train BERT with an Academic Budgetcited by 80
50 most cited of 58 All 58 (JSON)
Built on by
Citing papers per year: 2024: 3; 2025: 3.
6 papers.
- 2024MambaMixer: Efficient Selective State Space Models with Dual Token and Channel Selectioncited by 40
- 2025Lattice: Learning to Efficiently Compress the Memorycited by 18
- 2024Best of Both Worlds: Advantages of Hybrid Graph Sequence Modelscited by 6
- 2024Flash Inference: Near Linear Time Inference for Long Convolution Sequence Models and Beyondcited by 3
- 2025Trellis: Learning to Compress Key-Value Memory in Attention Modelscited by 3
- 2025MS-SSM: A Multi-Scale State Space Model for Efficient Sequence Modelingcited by 2
- 2025Trellis: Learning to Compress Key-Value Memory in Attention Models29 Dec 2025
- 2025MS-SSM: A Multi-Scale State Space Model for Efficient Sequence Modeling29 Dec 2025
- 2025Lattice: Learning to Efficiently Compress the Memory8 Apr 2025
- 2024Best of Both Worlds: Advantages of Hybrid Graph Sequence Models23 Nov 2024
- 2024Flash Inference: Near Linear Time Inference for Long Convolution Sequence Models and Beyond16 Oct 2024
- 2024MambaMixer: Efficient Selective State Space Models with Dual Token and Channel Selection29 Mar 2024