Fixed-length Poisson MRF topic model
Model Families AIMech:FixedLengthPoissonMRFTopicModel DRAFT
Aliases: LPMRF topic model
A probabilistic topic model that allocates a document total among topics, draws an independent fixed-length Poisson-MRF count vector for each allocated topic total, and sums those latent vectors to produce the observed document counts.
Identity Notes & Concept Scope
This is the LPMRF topic hierarchy of Inouye et al. 2015, distinct from a single LPMRF, a mixture assigning one component per document, and an APM that averages topic canonical parameters before drawing a document. Conditional on topic allocations, its document law is a convolution of topic count distributions. Sparse additive categorical logits and latent binary Replicated Softmax architectures do not define this hierarchy. No normalized identity match was found across all 442 pinned AIO labels and all scoped synonyms and 415 preceding native IDs, names and aliases. Full-checkout fixed-string searches included ignored and hidden files in worktree and main, yielding six and three matched lines; all five unique contents were read and describe existing frontier references, not records of these identities. The three-character APM acronym was checked in normalized identities but omitted from broad text search; the longer LPMRF acronym was included. Preparation included the three final GRM records before their merge; their inspected bytes are unchanged. All 188 semantic label/synonym hits were read. Fifty-one fully annotated exact CLASS nodes and outgoing edges were inspected: 46 byte-verified against prior reading and five fully read here. Seventy-eight full contextual YAMLs comprise 51 generated and 27 native records: six were fully read during this preparation and 72 byte-verified after prior full reading. Absence is bounded to the pinned snapshot, maintained corpus and inspected semantic neighborhood.
Claims & Grounded Evidence
1 Claim
Mechanism
#method
With fixed topic parameters (theta_j,Phi_j), draw document weights w from Dirichlet(alpha) with positive alpha, a total L from the chosen length law (Poisson in the stated example), and topic totals m from Multinomial(L,w). Conditional on m, draw z_j independently from LPMRF(theta_j,Phi_j,total=m_j) and set x=sum_j z_j. Each z_j uses its own finite-total partition function; topic parameters may include the explicitly chosen length-dependent weighting. At m_j=0 the topic vector is zero. Given w and L, the document mass sums products of these normalized topic masses over compatible z allocations and weights each m allocation by its Multinomial(L,w) probability. It is not a single LPMRF evaluated at averaged canonical parameters. With every Phi_j=0, z_j is multinomial with probabilities softmax(theta_j), and the allocation hierarchy gives the familiar LDA conditional token construction for fixed topic probabilities. That reduction does not assert equality of arbitrary priors on the topic parameters or equivalence of the paper’s approximate fitting procedure to exact LDA inference.
⚠️ Curated Limitations & Negative Results
- The hierarchy defines the model; the alternating hard/MAP allocation and surrogate-parameter updates are approximations. They do not by themselves guarantee exact posterior inference, marginal likelihood or monotone ascent of the true likelihood.
- The displayed negative-log-posterior objective on p. 6 prints Pr rather than log Pr in its data term. Its topic-transfer expression adds a to the second total’s partition index even though that topic loses a counts; the required total is m_q-a. These displayed expressions are not copied as verified algorithms.
- Zero topic allocations, the chosen length distribution and the per-topic normalization must be handled explicitly. The proposed prior evaluated at topic proportions does not automatically supply the exact posterior implied by the generative hierarchy.
- Finite fixed-total support ensures normalization, but does not make partition computation or parameter estimation trivial. Adding a length distribution requires the correctly normalized conditional distribution at each total; one normalizer cannot be reused across lengths.
- The source reuses nodewise Poisson regression from an unbounded model as a surrogate estimator. A fixed-total count coordinate is deterministic given all other count coordinates, so this is not its exact count-coordinate pseudolikelihood. Graph-recovery guarantees for a different Cartesian-support model do not automatically transfer.
- For a general symmetric Phi, a token-label Gibbs update has log weight theta_s+2*(Phi*x_minus)_s+Phi_ss. The printed sampler omits Phi_ss and needs zero/equal diagonals or a specified reparameterization. The printed eigenvalue bound using L^2*lambda_max also needs lambda_max>=0; for arbitrary symmetric matrices a safe loose bound uses its nonnegative part. These are curator qualifications of displayed formulas, not reproduced code defects.
- The length-dependent interaction weighting and curve fitted above AIS estimates are modeling and numerical choices. A curve above finitely many estimated log partitions is not a certified upper bound on every exact partition value. No AIS convergence, likelihood accuracy or author implementation was validated.
- The reported topic-model perplexities use MAP latent assignments, as the source explicitly notes, rather than exact marginalization over all topic allocations. Qualitative word pairs and historical timing curves do not establish causal relations, generic superiority or current performance. No author fit or benchmark was reproduced.
Artificial Intelligence Ontology (AIO) Grounding
Mapped AIO Classes
| AIO Target Class | Mapping Relation | Mapping Rationale |
|---|---|---|
AIO:Model
Model
|
broad_match | This is a specified family of probability distributions, within the broader mathematical representations described by Model. Its fitting procedure or application does not replace its distributional identity. |
AIO:ProbabilisticTopicModel
Probabilistic Topic Model
|
related_match | The primary source explicitly defines a probabilistic topic-model construction for document counts. The pinned AIO topic-model target lies under MachineLearningTask, so related_match records that modeling context without treating a model family as a task or equating different topic constructions. |
Evidence Sources & Primary Literature
2 Sources| Source ID | Publication / Document | Type / Access | Reference & Checksum |
|---|---|---|---|
method-source
|
David I. Inouye, Pradeep Ravikumar, Inderjit S. Dhillon
|
primary paper
full_text
|
sha256:3b60adcf8ab2…
|
supplement
|
David I. Inouye, Pradeep Ravikumar, Inderjit S. Dhillon
|
primary paper
full_text
|
sha256:a76a21c13cce…
|
Curation Provenance
Curator: Codex
Method: ai_assisted
Model: GPT-6
Created: 2026-10-11T23:06:04Z
Updated: 2026-10-11T23:06:45Z
Source File:
data/curated/FixedLengthPoissonMRFTopicModel.yaml