Papers › The Concrete Distribution: A Continuous Relaxation of Discrete Random Variables

The Concrete Distribution: A Continuous Relaxation of Discrete Random Variables

2 Nov 2016arXiv:1611.00712archive 2025-07-28

Chris J. Maddison, andriy mnih, Yee Whye Teh

The reparameterization trick enables optimizing large scale stochastic computation graphs via gradient descent. The essence of the trick is to refactor each stochastic node into a differentiable function of its parameters and a random variable with fixed distribution. After refactoring, the gradients of the loss propagated by the chain rule through the graph are low variance unbiased estimators of the gradients of the expected loss. While many continuous random variables have such reparameterizations, discrete random variables lack useful reparameterizations due to the discontinuous nature of discrete states. In this work we introduce Concrete random variables---continuous relaxations of discrete random variables. The Concrete distribution is a new family of distributions with closed form densities and a simple reparameterization. Whenever a discrete stochastic node of a computation graph can be refactored into a one-hot bit representation that is treated continuously, Concrete stochastic nodes can be used with automatic differentiation to produce low-variance biased gradients of objectives (including objectives that depend on the log-probability of latent stochastic nodes) on the corresponding discrete graph. We demonstrate the effectiveness of Concrete relaxations on density estimation and structured prediction tasks using neural networks.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="1611.00712")

Code

Syntology Ran 3 of 5 code samples harvested from 2 repositories linked to this paper; 2 have no recorded run. Of those that ran: 3 ran with no contract checked.

By repository: community (archive-listed): 5 samples from 2 repositories, 3 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

aurelio-amerio/concretedropout mentioned on GitHubtf report
kampta/pytorch-distributions mentioned on GitHubpytorch report
leequant761/Gumbel-SSVAE mentioned on GitHubpytorch report
tensorflow/models mentioned on GitHubtf report
tensorflow/models mentioned on GitHubtf report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

5 samples harvested; 3 ran; 0 honoured the contract we drafted; 2 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

3ran
2unverified

Licence: 4 of the 5 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from 2 repositories linked to this paper, official or community; each sample names its own and says which. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

Classifier leequant761/Gumbel-SSVAE/models.py community (archive-listed) ran · metamorphic tier: invariant fingerprinted no licence file found · pointer only · cdc2a06469b6e130 · report
Decoder leequant761/Gumbel-SSVAE/models.py community (archive-listed) ran no licence file found · pointer only · 59cbe9a309055883 · report
Encoder leequant761/Gumbel-SSVAE/models.py community (archive-listed) ran · metamorphic tier: deterministic no licence file found · pointer only · 366f5ac5d303dbc7 · report
ConcreteDropout aurelio-amerio/concretedropout/src/ConcreteDropout/tensorflow.py community (archive-listed) unverified MIT (permissive) · f80f227eb698b316 · report
Model leequant761/Gumbel-SSVAE/models.py community (archive-listed) unverified no licence file found · pointer only · d68fa17739948be8 · report

Tasks

Density EstimationStructured Prediction

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

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