Auto-exponential Markov random field
Model Families AIMech:AutoExponentialMarkovRandomField DRAFT
Aliases: Auto-exponential model, Auto-exponential scheme
A finite pairwise Markov-field model for nonnegative continuous site values with exponential full conditionals whose rates are positive baseline terms plus nonnegative symmetric linear neighbor interactions.
Identity Notes & Concept Scope
The record uses the classical positive-baseline auto-exponential construction. Exponential refers to the site conditional probability law, not a generic exponential-family graphical model, an exponential activation or exponential smoothing over time. The rate-interaction sign convention is explicit: nonnegative gamma increases conditional rates and decreases conditional means. These gamma coefficients enter the joint log density with a minus sign, unlike the beta sign used in the auto-Poisson natural parameter. Gamma-shaped conditionals and alternative boundary parameter regimes need separate assessments. Interacting marginal distributions need not themselves be exponential. No normalized identity match was found across all 442 pinned AIO labels and all scoped synonyms and 403 preceding native IDs, names and aliases. Fixed-string full-checkout searches included ignored and hidden files in worktree and main, yielding 37 and 37 matched lines; all 20 unique contents were read. Hits are citations, contextual statements and discovery leads rather than records of these identities. All 185 semantic label/synonym hits were read. Forty-three fully annotated exact CLASS nodes and outgoing edges were inspected: 38 byte-equivalent to prior inspected nodes and five freshly read. Fifty-four contextual YAMLs comprise 43 generated and 11 native records: 46 byte-verified after prior reading and eight freshly read. Absence is bounded to the pinned snapshot, maintained corpus and inspected semantic neighborhood.
Claims & Grounded Evidence
1 Claim
Mechanism
#method
On a finite graph with X_i>=0, choose alpha_i>0 and symmetric gamma_ij=gamma_ji>=0, with gamma_ij=0 on nonedges. The full-conditional density is r_i*exp(-r_i*x_i), where r_i=alpha_i+sum_(j!=i) gamma_ij*x_j and the conditional mean is 1/r_i. Combining this conditional form with the source pairwise representation gives p(x)=Z^(-1)*exp[-sum_i alpha_i*x_i-sum_(i<j) gamma_ij*x_i*x_j]. Each edge is counted once. The nonnegative interaction penalty bounds the unnormalized joint density by the product of integrable exp(-alpha_i*x_i) terms, establishing a finite positive Z in this regime. Increasing a neighbor value cannot increase the site conditional mean with other neighbors fixed. Zero interactions reduce the law to independent exponentials.
⚠️ Curated Limitations & Negative Results
- The stated positive-baseline, nonnegative-rate-interaction regime is the source-supported construction. It is not asserted to classify every zero-baseline boundary case or every transformed, truncated or gamma-conditional variant.
- Reversing the rate-interaction sign can make a conditional rate nonpositive somewhere on the unbounded support and invalidate its exponential density. Sign restrictions cannot be transferred unchanged between rate and log-density parameterizations.
- The full conditional is memoryless as a univariate exponential law at fixed neighbors; this does not supply a temporal evolution model or imply an exponential marginal law after averaging over neighbors.
- The paper explicitly questions the practical interpretability of this construction and supplies no detailed auto-exponential empirical example. The mathematical model is not a validated mechanism of spatial competition or universal positive-data predictor.
- The graph, site supports and any conditioning boundary values must be specified. The construction assumes compatible positive full conditionals on the stated Cartesian support; arbitrary separately fitted regressions or asymmetric neighbor coefficients do not automatically define a joint model.
- The finite fixed-site model does not by itself specify a random-location point process, temporal causal mechanism, hidden observation layer or infinite-lattice existence theorem. Conditional association does not establish causation.
- A closed-form site conditional does not make the joint partition function, maximum-likelihood fit or uncertainty calculation trivial. Estimation, sampling and model diagnostics require their own procedures. No author implementation, empirical 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 | The finite joint probability family is a mathematical representation within the broader Model class. Its defining support and compatible full conditionals do not require a particular regression task or neural architecture. |
AIO:ProbabilisticGraphicalModel
Probabilistic Graphical Model
|
related_match | The field represents undirected graphical conditional dependence. The pinned AIO target is task-scoped, so related_match connects the model family to that graphical-modeling task without asserting model is-a task. |
Evidence Sources & Primary Literature
1 Source| Source ID | Publication / Document | Type / Access | Reference & Checksum |
|---|---|---|---|
method-source
|
Julian Besag
|
primary paper
full_text
|
ID: doi:10.1111/j.2517-6161.1974.tb00999.x
sha256:796199ef5d87…
|
Curation Provenance
Curator: Codex
Method: ai_assisted
Model: GPT-6
Created: 2026-10-11T22:15:55Z
Updated: 2026-10-11T22:15:55Z
Source File:
data/curated/AutoExponentialMarkovRandomField.yaml