Translational Equivariance in Kernelizable Attention
원문 초록
While Transformer architectures have show remarkable success, they are bound to the computation of all pairwise interactions of input element and thus suffer from limited scalability. Recent work has been successful by avoiding the computation of the complete attention matrix, yet leads to problems down the line. The absence of an explicit attention matrix makes the inclusion of inductive biases relying on relative interactions between elements more challenging. An extremely powerful inductive bias is translational equivariance, which has been conjectured to be responsible for much of the success of Convolutional Neural Networks on image recognition tasks. In this work we show how translational equivariance can be implemented in efficient Transformers based on kernelizable attention - Performers. Our experiments highlight that the devised approach significantly improves robustness of Performers to shifts of input images compared to their naive application. This represents an important step on the path of replacing Convolutional Neural Networks with more expressive Transformer architectures and will help to improve sample efficiency and robustness in this realm.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Learning Robust Stereo Matching in the Wild with Selective Mixture-of-Experts
AGTCNet: A Graph-Temporal Approach for Principled Motor Imagery EEG Classification
Segment This Thing: Foveated Tokenization for Efficient Point-Prompted Segmentation
Parameter-free approximate equivariance for tasks with finite group symmetry
Positional Encoding meets Persistent Homology on Graphs
Information Locality as an Inductive Bias for Neural Language Models
토론
이 논문과 연결된 포럼 글이 아직 없습니다.