Methods › General › Stochastic Optimization › FA

Feedback Alignment

FA

124 papers tagged archive 2025-07-28

Introduced by Timothy P. Lillicrap et al. in Random feedback weights support learning in deep neural networks

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

The archive carries no description for this method.

PaperSource

In Syntology about another paper, arXiv:2507.04511: harvested code stored, below machine verification (unverified_code; harvested), served level V1; retrieve with get_harvested_code_for_paper(arxiv_id='2507.04511'). Repositories: 2 listed of 2 in the graph, strongest link: official. The lookup matched a paper by its title, arXiv:2507.04511, not a method entry. About another paper: this answer is about arXiv:2507.04511, while the archive credits arXiv:1411.0247.

From the lookup's note on this name: The same name also belongs to “Fourier Augmentation (FA)”, a method in the paper “Towards Discriminative Representation Learning for Unsupervised Person Re-identification” (arXiv:2108.03439, 78 citations), which the lookup finds cited far more than the paper this answer is about (3 citations), so this answer may be about a different sense of the name. For arXiv:2108.03439: ask the lookup about it.

Origin paper of this answer, arXiv:2507.04511 (its page on this site · its page on Syntology): Syntology's run record for its harvested code, 5 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 3 where Syntology's instrument failed) · 4 unverified (of 9 harvested samples) · 9 pointer-only (licence). The instrument figure counts failures of Syntology's instrument, not of the code. Ran means executed on a synthesized input, not that the code is correct.

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.

What each level means, quoted from Syntology's server card: V0 “imports”; V1 “executes against a synthesized fixture and returns a value of the recorded type”; V2 “two implementations GENERATED from the paper's signature and spec agree numerically (1e-6) on fixture inputs” “neither of the two ever read the authors' own code, so V2 measures how unambiguously the paper specifies the method, not fidelity to the authors' implementation (measured 2026-09-11, commit 75eaa77: cross_checked_by is a second LLM on 2,628 of 2,831 served samples)”; V3 “paper-derived property tests pass on both of those same two generations.” The card adds: “No rung on this ladder compares the served code against the authors' implementation, so treat every level as evidence about runnability and internal agreement, not about matching the paper's results.” A level quoted in two parts is one definition the card writes as two clauses joined by a double hyphen, each clause quoted on its own (how these levels are quoted).

Papers archive 2025-07-28

archive papers tagged: 124 · with a code link: 37 · 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 124 tagged: 6 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument)

Page 1 of 2: papers 1 to 100 of 124, 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 125 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
Federated Learning10
Automatic Speech Recognition4
Data Augmentation4
Diffusion MRI4
Speech Recognition4
Survey4
speech-recognition4
Automatic Speech Recognition (ASR)3
Computational Efficiency3
Fundus to Angiography Generation3
Generative Adversarial Network3
ISAC3
Image Classification3
Language Modeling3
Language Modelling3
Object Detection3
Position3
object-detection3
Binary Classification2
Classification2

Usage over time archive 2025-07-28

Papers per year tagged with FA: 2014 to 2025, peak 30 30 0 2014: 1 paper 2014 2015: 0 papers 2015 2016: 2 papers 2016 2017: 2 papers 2017 2018: 2 papers 2018 2019: 3 papers 2019 2020: 22 papers 2020 2021: 12 papers 2021 2022: 21 papers 2022 2023: 16 papers 2023 2024: 30 papers 2024 2025: 13 papers 2025
Papers per year the archive tags with this method, by the paper's archive date (124 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

Stochastic Optimization

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