Methods › Sequential › Recurrent Neural Networks › SNAIL

Simple Neural Attention Meta-Learner

SNAIL

11 papers tagged archive 2025-07-28

Introduced by Nikhil Mishra et al. in A Simple Neural Attentive Meta-Learner

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

The Simple Neural Attention Meta-Learner, or SNAIL, combines the benefits of temporal convolutions and attention to solve meta-learning tasks. They introduce positional dependence through temporal convolutions to make the model applicable to reinforcement tasks - where the observations, actions, and rewards are intrinsically sequential. They also introduce attention in order to provide pinpoint access over an infinitely large context. SNAIL is constructing by combining the two: we use temporal convolutions to produce the context over which we use a causal attention operation.

PaperSource

In Syntology about another paper, arXiv:2608.19201: no code under this exact name (no_code; paper_only). About another paper: this answer is about arXiv:2608.19201, while the archive credits arXiv:1707.03141, so it does not say whether this method has code.

Origin paper of this answer, arXiv:2608.19201 (its page on Syntology).

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: 11 · with a code link: 4 · where Syntology ran a sample: 0 (0 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: none of the 11 tagged papers has a Syntology run on record

Page 1 of 1: papers 1 to 11 of 11, 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

12 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
Meta-Learning2
Anomaly Detection1
Few-Shot Image Classification1
Few-Shot Learning1
Image Segmentation1
Metric Learning1
Navigate1
Reinforcement Learning1
Semantic Segmentation1
Sequential skip prediction1
Style Transfer1
feature selection1

Usage over time archive 2025-07-28

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

Recurrent Neural Networks

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