Fixed-length Poisson Markov random field
Model Families AIMech:FixedLengthPoissonMarkovRandomField DRAFT
Aliases: LPMRF, Fixed-length Poisson MRF
A finite-total count distribution whose probability on nonnegative integer vectors summing to a specified total is proportional to a Poisson factorial base measure times exponentiated linear and symmetric quadratic count potentials.
Identity Notes & Concept Scope
LPMRF retains raw-count quadratic potentials but restricts their support to a fixed total. This differs from a Cartesian cutoff in a truncated Poisson model, unbounded auto-Poisson fields, factorial-free quadratic models and root-statistic models. For positive interactions it can be defined directly on finite support without pretending to condition an already proper unbounded Poisson MRF. Its mixture and topic extensions are separate constructions. Multinomial counts at a fixed total are generally dependent even when token labels are conditionally independent. 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
For finite p, a nonnegative integer L and X_L={x in N0^p:sum_i x_i=L}, define p_L(x)=Z_L^(-1)*exp[theta^T x+x^T Phi x]/product_i x_i!, with finite real theta and symmetric Phi. Z_L is the finite sum over X_L and A_L=log Z_L. Off-diagonal matrix entries contribute twice. At Phi=0, Z_L=(sum_i exp(theta_i))^L/L! and p_L is Multinomial(L,softmax(theta)); at L=0 it is the point mass at zero. Adding a common constant to theta does not change the normalized law. An exchangeable sequence of L token labels with count vector x assigns each ordering probability p_L(x)/(L! / product_i x_i!), so token reassignment can sample the count law while preserving the total. Given all other count coordinates, one count coordinate is fixed by L; ordinary Poisson count full conditionals are not a property of this support.
⚠️ Curated Limitations & Negative Results
- The finite support, reference measure and total L are part of the identity. Positive quadratic coefficients need not imply positive marginal covariance under a fixed-sum constraint; for two coordinates covariance equals minus their variance.
- Usual nonedge/conditional-independence conclusions for positive Cartesian-support MRFs cannot be transferred mechanically to fixed-total counts. The name is retained from the source, while the actual support and potential are explicit.
- Parameters are not uniquely identified without conventions: common theta shifts, and some fixed-L changes to diagonal and off-diagonal terms, leave the same law. A reparameterization valid at one L need not preserve a shared-parameter model over varying totals.
- 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:ProbabilisticGraphicalModel
Probabilistic Graphical Model
|
related_match | The named construction uses graph-indexed probabilistic potentials. The AIO target is task-scoped, so this is a related modeling context rather than an assertion that a model family is a task. Fixed-sum support also requires explicit care with conditional-independence interpretations. |
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