Methods › General › Latent Variable Sampling › Polya-Gamma Augmentation
Data augmentation using Polya-Gamma latent variables.
Polya-Gamma Augmentation
Introduced by Nicholas G. Polson et al. in Bayesian inference for logistic models using Polya-Gamma latent variables
archive 2025-07-28 Description, source and code snippet are the archive's method entry.
This method applies Polya-Gamma latent variables as a way to obtain closed form expressions for full-conditionals of posterior distributions in sampling algorithms like MCMC.
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.
Near matches the lookup lists, each a different name: Gamma Migration; Dual Augmentation; Test Augmentation; meta-augmentation; Local Augmentation; Noise Augmentation; action augmentation; augmentation scheme.
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: 6 · with a code link: 5 · 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 6 tagged papers has a Syntology run on record
Page 1 of 1: papers 1 to 6 of 6, 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.
-
GP-Tree: A Gaussian Process Classifier for Few-Shot Incremental Learning 15 Feb 2021 · 1 repository · arXiv:2102.07868
-
Bayesian Few-Shot Classification with One-vs-Each Pólya-Gamma Augmented Gaussian Processes 20 Jul 2020 · 2 repositories · arXiv:2007.10417
-
Mutually Regressive Point Processes 1 Dec 2019 · 1 repository
-
PG-TS: Improved Thompson Sampling for Logistic Contextual Bandits 18 May 2018 · 0 repositories · arXiv:1805.07458
-
Efficient Gaussian Process Classification Using Polya-Gamma Data Augmentation 18 Feb 2018 · 3 repositories · arXiv:1802.06383
-
Bayesian inference for logistic models using Polya-Gamma latent variables 2 May 2012 · 2 repositories · arXiv:1205.0310
Tasks archive 2025-07-28
15 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.
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