paper-with-me

Papers

Pushdown Layers: Encoding Recursive Structure in Transformer Language Models

2023-10-29 · Shikhar Murty, Pratyusha Sharma, Jacob Andreas, Christopher D. Manning

Recursion is a prominent feature of human language, and fundamentally challenging for self-attention due to the lack of an explicit recursive-state tracking mechanism. Consequently, Transformer language models poorly capture long-tail recursive structure and exhibit sample-inefficient syntactic generalization. This work introduces Pushdown Layers, a new self-attention layer that models recursive state via a stack tape that tracks estimated depths of every token in an incremental parse of the observed prefix. Transformer LMs with Pushdown Layers are syntactic language models that autoregressively and synchronously update this stack tape as they predict new tokens, in turn using the stack tape to softly modulate attention over tokens -- for instance, learning to "skip" over closed constituents. When trained on a corpus of strings annotated with silver constituency parses, Transformers equipped with Pushdown Layers achieve dramatically better and 3-5x more sample-efficient syntactic generalization, while maintaining similar perplexities. Pushdown Layers are a drop-in replacement for standard self-attention. We illustrate this by finetuning GPT2-medium with Pushdown Layers on an automatically parsed WikiText-103, leading to improvements on several GLUE text classification tasks.

📄 PDF Abstract BibTeX arXiv:2310.19089

Code (1)

murtyshikhar/pushdown-layers 공식 구현 pytorch

Tasks

text-classificationText Classification

Methods 이 논문이 사용한 방법론

Multi-Head Attention 설명 없음
Attention 설명 없음
Linear Layer A Linear Layer is a projection $\mathbf{XW + b}$.
Layer Normalization Unlike batch normalization, Layer Normalization directly estimates the normalization statistics from the summed inputs…
Label Smoothing Label Smoothing is a regularization technique that introduces noise for the labels. This accounts for the fact that datasets may have mistakes in them, so maximizing the…
Residual Connection 설명 없음
BPE Byte Pair Encoding, or BPE, is a subword segmentation algorithm that encodes rare and unknown words as sequences of subword units. The intuition is that various word…
Softmax The Softmax output function transforms a previous layer's output into a vector of probabilities. It is commonly used for multiclass classification. Given an input vector $x$…

Similar Papers 제목 키워드 기반

Recursive Reinforcement Learning

2022-06-23 · Ernst Moritz Hahn, Mateo Perez, Sven Schewe, Fabio Somenzi 외

Recursion is the fundamental paradigm to finitely describe potentially infinite objects. As state-of-the-art reinforcement learning (RL) algorithms cannot directly reason about recursion, they must rely on the practition…

IngenuityQ-Learningreinforcement-learningReinforcement Learning+1

Freely Long-Thinking Transformer (FraiLT)

2024-01-21 · Akbay Tabak

Freely Long-Thinking Transformer (FraiLT) is an improved transformer model designed to enhance processing capabilities without scaling up size. It utilizes a recursive approach, iterating over a subset of layers multiple…

Explorability in Pushdown Automata

2025-11-06 · Ayaan Bedi, Karoliina Lehtinen arxiv

We study explorability, a measure of nondeterminism in pushdown automata, which generalises history-determinism. An automaton is k-explorable if, while reading the input, it suffices to follow k concurrent runs, built st…

An expressivity analysis of hierarchical modelling in deep transformers via bounded-depth grammars

2026-06-16 · Vinoth Nandakumar, Qiang Qu, Pramod Thebe, Sakshi Khachariya 외 arxiv

Deep neural networks are widely believed to derive their expressive power from their ability to form \textbf{hierarchical representations}, capturing progressively more abstract and compositional features across layers. …

Augmenting Transformers with Recursively Composed Multi-grained Representations

2023-09-28 · Xiang Hu, Qingyang Zhu, Kewei Tu, Wei Wu

We present ReCAT, a recursive composition augmented Transformer that is able to explicitly model hierarchical syntactic structures of raw texts without relying on gold trees during both learning and inference. Existing r…

Constituency Grammar InductionNatural Language InferenceSemantic Role LabelingSentence