Methods › Natural Language Processing › Language Models › Feedback Transformer

Feedback Transformer

2 papers tagged archive 2025-07-28

Introduced by Angela Fan et al. in Addressing Some Limitations of Transformers with Feedback Memory

archive 2025-07-28 Description, source and code snippet are the archive's method entry.

A Feedback Transformer is a type of sequential transformer that exposes all previous representations to all future representations, meaning the lowest representation of the current timestep is formed from the highest-level abstract representation of the past. This feedback nature allows this architecture to perform recursive computation, building stronger representations iteratively upon previous states. To achieve this, the self-attention mechanism of the standard Transformer is modified so it attends to higher level representations rather than lower ones.

PaperSource

In Syntology name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.

Near matches the lookup lists, each a different name: LIFT (Latent Information Feedback Transformer); Transformer; T2A-FeedBack; G-Transformer; L-Transformer; UQ-Transformer; Transformer-XL; RQ-Transformer.

Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.

Papers archive 2025-07-28

archive papers tagged: 2 · with a code link: 2 · where Syntology ran a sample: 1 (1 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology

Show: all tagged papersonly where code ran (1 of 2 tagged: 1 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument)

Page 1 of 1: papers 1 to 2 of 2, newest first by the archive's date (ties by slug), in archive order.

Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.

Tasks archive 2025-07-28

6 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.

TaskPapers
Language Modeling1
Language Modelling1
Machine Translation1
Point Cloud Registration1
Reinforcement Learning1
Translation1

Usage over time archive 2025-07-28

Papers per year tagged with Feedback Transformer: 2020 to 2024, peak 1 1 0 2020: 1 paper 2020 2021: 0 papers 2021 2022: 0 papers 2022 2023: 0 papers 2023 2024: 1 paper 2024
Papers per year the archive tags with this method, by the paper's archive date (2 dated). Bars are counts, not a trend claim.

Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).

Categories archive 2025-07-28

Language ModelsAutoregressive TransformersTransformers

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections