Papers › Dependent Multinomial Models Made Easy: Stick Breaking with the Pólya-Gamma Augmentation

Dependent Multinomial Models Made Easy: Stick Breaking with the Pólya-Gamma Augmentation

18 Jun 2015arXiv:1506.05843archive 2025-07-28

Scott W. Linderman, Matthew J. Johnson, Ryan P. Adams

Many practical modeling problems involve discrete data that are best represented as draws from multinomial or categorical distributions. For example, nucleotides in a DNA sequence, children's names in a given state and year, and text documents are all commonly modeled with multinomial distributions. In all of these cases, we expect some form of dependency between the draws: the nucleotide at one position in the DNA strand may depend on the preceding nucleotides, children's names are highly correlated from year to year, and topics in text may be correlated and dynamic. These dependencies are not naturally captured by the typical Dirichlet-multinomial formulation. Here, we leverage a logistic stick-breaking representation and recent innovations in P\'olya-gamma augmentation to reformulate the multinomial distribution in terms of latent variables with jointly Gaussian likelihoods, enabling us to take advantage of a host of Bayesian inference techniques for Gaussian models with minimal overhead.

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="1506.05843")

Code

Syntology Ran 0 of 18 code samples harvested from 1 repository linked to this paper; 18 have no recorded run.

By repository: official repository: 18 samples from 1 repository, 0 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

HIPS/pgmult officialmentioned in papermentioned on GitHubMIT 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

18 samples harvested; 0 ran; 0 honoured the contract we drafted; 18 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.

18unverified

Licence: 0 of the 18 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 HIPS/pgmult. “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.

dpotrs HIPS/pgmult/pgmult/lda.py official repository unverified MIT (permissive) · bfdf3915c6140645 · report
filter_wordseq HIPS/pgmult/experiments/alice_lds.py official repository unverified MIT (permissive) · ffa8285abe4398ed · report
load HIPS/pgmult/experiments/alice_lds.py official repository unverified MIT (permissive) · 324f4b596bfebf51 · report
load_ldac_ctm_results HIPS/pgmult/pgmult/internals/ctm_wrapper.py official repository unverified MIT (permissive) · 5a894653419ef604 · report
load_mu_sigma HIPS/pgmult/pgmult/internals/ctm_wrapper.py official repository unverified MIT (permissive) · 2729a67a71e53396 · report
log_censored_dirichlet_density HIPS/pgmult/pgmult/internals/dirichlet.py official repository unverified MIT (permissive) · a81165b10b792246 · report
log_dirichlet_density HIPS/pgmult/pgmult/internals/dirichlet.py official repository unverified MIT (permissive) · 68990d73a38db2e0 · report
log_polya_gamma_density HIPS/pgmult/pgmult/utils.py official repository unverified MIT (permissive) · a74dfc9972ff1607 · report
logistic HIPS/pgmult/pgmult/utils.py official repository unverified MIT (permissive) · cf4bb5e9f8634ad2 · report
make_onehot_seq HIPS/pgmult/experiments/alice_lds.py official repository unverified MIT (permissive) · e4855bd5b78bd460 · report
mesh HIPS/pgmult/pgmult/internals/simplex.py official repository unverified MIT (permissive) · 2bc83dce3a7ce30e · report
meshnd HIPS/pgmult/pgmult/internals/simplex.py official repository unverified MIT (permissive) · bc6066b454265076 · report
nonlinear_meshnd HIPS/pgmult/pgmult/internals/simplex.py official repository unverified MIT (permissive) · e44ee64745989e0a · report
polya_gamma_density HIPS/pgmult/pgmult/utils.py official repository unverified MIT (permissive) · a18077e703e02044 · report
resample_logistic_documents HIPS/pgmult/pgmult/parallel.py official repository unverified MIT (permissive) · ca09b18d10fb5464 · report
resample_standard_documents HIPS/pgmult/pgmult/parallel.py official repository unverified MIT (permissive) · 421faa43f99df234 · report
sample_dirichlet HIPS/pgmult/pgmult/lda.py official repository unverified MIT (permissive) · 4e552abc7e8c8072 · report
solve_triangular HIPS/pgmult/pgmult/lda.py official repository unverified MIT (permissive) · 9215b1ce31f92b0b · report

Tasks

Bayesian Inference

1 archive task tag without a task page not shown.

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