Formal Language Recognition by Hard Attention Transformers: Perspectives from Circuit Complexity
원문 초록
This paper analyzes three formal models of Transformer encoders that differ in the form of their self-attention mechanism: unique hard attention (UHAT); generalized unique hard attention (GUHAT), which generalizes UHAT; and averaging hard attention (AHAT). We show that UHAT and GUHAT Transformers, viewed as string acceptors, can only recognize formal languages in the complexity class AC$^0$, the class of languages recognizable by families of Boolean circuits of constant depth and polynomial size. This upper bound subsumes Hahn's (2020) results that GUHAT cannot recognize the DYCK languages or the PARITY language, since those languages are outside AC$^0$ (Furst et al., 1984). In contrast, the non-AC$^0$ languages MAJORITY and DYCK-1 are recognizable by AHAT networks, implying that AHAT can recognize languages that UHAT and GUHAT cannot.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Center-guided Classifier for Semantic Segmentation of Remote Sensing Images
Hard-Attention Gates with Gradient Routing for Endoscopic Image Computing
TRIP: Trainable Region-of-Interest Prediction for Hardware-Efficient Neuromorphic Processing on Event-based Vision
Recurrent Alignment with Hard Attention for Hierarchical Text Rating
Mutual Distillation Learning For Person Re-Identification
Vamos: Versatile Action Models for Video Understanding
토론
이 논문과 연결된 포럼 글이 아직 없습니다.