Methods › General › Attention Mechanisms › Set Transformer

Set Transformer

20 papers tagged archive 2025-07-28

Introduced by Juho Lee et al. in Set Transformer: A Framework for Attention-based Permutation-Invariant Neural Networks

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

Many machine learning tasks such as multiple instance learning, 3D shape recognition, and few-shot image classification are defined on sets of instances. Since solutions to such problems do not depend on the order of elements of the set, models used to address them should be permutation invariant. We present an attention-based neural network module, the Set Transformer, specifically designed to model interactions among elements in the input set. The model consists of an encoder and a decoder, both of which rely on attention mechanisms. In an effort to reduce computational complexity, we introduce an attention scheme inspired by inducing point methods from sparse Gaussian process literature. It reduces the computation time of self-attention from quadratic to linear in the number of elements in the set. We show that our model is theoretically attractive and we evaluate it on a range of tasks, demonstrating the state-of-the-art performance compared to recent methods for set-structured data.

PaperSource

In Syntology the paper matched by title, the paper Syntology's graph keys as openreview_Hkgnii09Ym, held, no code (no_code; paper_only). The lookup matched a paper by its title, the paper Syntology's graph keys as openreview_Hkgnii09Ym, not a method entry. The archive credits no paper with an arXiv id for this method, so whether this answer (about the paper Syntology's graph keys as openreview_Hkgnii09Ym) is about this method is not checked; it does not say whether this method has code.

From the lookup's note on this name: The same name also belongs to the paper “Set Transformer: A Framework for Attention-based Permutation-Invariant Neural Networks” (arXiv:1810.00825, 266 citations), which the lookup finds cited far more than the paper this answer is about (citations not recorded), so this answer may be about a different sense of the name. For arXiv:1810.00825: its page on this site · ask the lookup about it.

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: 20 · with a code link: 14 · where Syntology ran a sample: 6 (6 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 (6 of 20 tagged: 6 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 20 of 20, 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

20 shown of 48 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
Node Classification3
Decoder2
Few-Shot Image Classification2
General Classification2
Graph Attention2
Graph Neural Network2
Image Classification2
Representation Learning2
3D Multi-Person Pose Estimation1
3D Multi-Person Pose Estimation (absolute)1
3D Multi-Person Pose Estimation (root-relative)1
3D Object Detection1
3D Pose Estimation1
3D Shape Recognition1
Action Recognition1
All1
Artificial Global Workspace1
Autonomous Driving1
Benchmarking1
Diversity1

Usage over time archive 2025-07-28

Papers per year tagged with Set Transformer: 2018 to 2025, peak 4 4 0 2018: 1 paper 2018 2019: 1 paper 2019 2020: 3 papers 2020 2021: 4 papers 2021 2022: 3 papers 2022 2023: 3 papers 2023 2024: 2 papers 2024 2025: 3 papers 2025
Papers per year the archive tags with this method, by the paper's archive date (20 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

Attention Mechanisms

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