Methods › General › Gated Linear Networks › G-GLN
Gaussian Gated Linear Network
G-GLN
Introduced by David Budden et al. in Gaussian Gated Linear Networks
archive 2025-07-28 Description, source and code snippet are the archive's method entry.
Gaussian Gated Linear Network, or G-GLN, is a multi-variate extension to the recently proposed GLN family of deep neural networks by reformulating the GLN neuron as a gated product of Gaussians. This Gaussian Gated Linear Network (G-GLN) formulation exploits the fact that exponential family densities are closed under multiplication, a property that has seen much use in Gaussian Process and related literature. Similar to the Bernoulli GLN, every neuron in the G-GLN directly predicts the target distribution.
Precisely, a G-GLN is a feed-forward network of data-dependent distributions. Each neuron calculates the sufficient statistics (μ, σ₂) for its associated PDF using its active weights, given those emitted by neurons in the preceding layer. It consists of consists of L+1 layers indexed by i ∈{0, …, L} with Kᵢ neurons in each layer. The weight space for a neuron in layer i is denoted by 𝒲ᵢ; the subscript is needed since the dimension of the weight space depends on Kᵢ₋₁. Each neuron/distribution is indexed by its position in the network when laid out on a grid; for example, f_(i k) refers to the family of PDFs defined by the k th neuron in the i th layer. Similarly, c_(i k) refers to the context function associated with each neuron in layers i ≥1, and μ_(i k) and σ_(i k)² (or Σ_(i k) in the multivariate case) referring to the sufficient statistics for each Gaussian PDF.
There are two types of input to neurons in the network. The first is the side information, which can be thought of as the input features, and is used to determine the weights used by each neuron via half-space gating. The second is the input to the neuron, which is the PDFs output by the previous layer, or in the case of layer 0, some provided base models. To apply a G-GLN in a supervised learning setting, we need to map the sequence of input-label pairs (xₜ, yₜ) for t=1,2, … onto a sequence of (side information, base Gaussian PDFs, label) triplets (zₜ,f_(0 i)ᵢ, yₜ). The side information zₜ is set to the (potentially normalized) input features xₜ. The Gaussian PDFs for layer 0 will generally include the necessary base Gaussian PDFs to span the target range, and optionally some base prediction PDFs that capture domain-specific knowledge.
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: 1 · with a code link: 1 · 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 1 tagged papers has a Syntology run on record
Page 1 of 1: paper 1 of 1, 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.
-
Gaussian Gated Linear Networks 10 Jun 2020 · 3 repositories · arXiv:2006.05964
Tasks archive 2025-07-28
4 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.
| Task | Papers |
|---|---|
| Denoising | 1 |
| Density Estimation | 1 |
| Multi-Armed Bandits | 1 |
| regression | 1 |
Usage over time archive 2025-07-28
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
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