Methods › General › Gated Linear Networks › GLN

Gated Linear Network

GLN

8 papers tagged archive 2025-07-28

Introduced by Joel Veness et al. in Gated Linear Networks

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

A Gated Linear Network, or GLN, is a type of backpropagation-free neural architecture. What distinguishes GLNs from contemporary neural networks is the distributed and local nature of their credit assignment mechanism; each neuron directly predicts the target, forgoing the ability to learn feature representations in favor of rapid online learning. Individual neurons can model nonlinear functions via the use of data-dependent gating in conjunction with online convex optimization.

GLNs are feedforward networks composed of many layers of gated geometric mixing neurons as shown in the Figure . Each neuron in a given layer outputs a gated geometric mixture of the predictions from the previous layer, with the final layer consisting of just a single neuron. In a supervised learning setting, a GLN is trained on (side information, base predictions, label) triplets (zₜ, pₜ, xₜ)_(t=1,2,3, …) derived from input-label pairs (zₜ, xₜ). There are two types of input to neurons in the network: the first is the side information zₜ, which can be thought of as the input features; the second is the input to the neuron, which will be the predictions output by the previous layer, or in the case of layer 0 , some (optionally) provided base predictions pₜ that typically will be a function of zₜ . Each neuron will also take in a constant bias prediction, which helps empirically and is essential for universality guarantees.

Weights are learnt in a Gated Linear Network using Online Gradient Descent (OGD) locally at each neuron. They key observation is that as each neuron (i, k) in layers i>0 is itself a gated geometric mixture, all of these neurons can be thought of as individually predicting the target. Given side information z , each neuron (i, k) suffers a loss convex in its active weights u:=w_(i k c_(i k)(z)) of ℓₜ(u):=-log(GEOᵤ(xₜ ; pᵢ₋₁))

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.

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: 8 · with a code link: 5 · 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 8 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 8 of 8, 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

13 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
Graph Learning2
Multi-Armed Bandits2
Combinatorial Optimization1
Denoising1
Density Estimation1
Gait Recognition1
Image Classification1
Indoor Localization1
Node Classification1
Prediction1
Retrosynthesis1
Visual Place Recognition1
regression1

Usage over time archive 2025-07-28

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

Gated Linear 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