Exponential square root graphical model
Model Families AIMech:ExponentialSquareRootGraphicalModel DRAFT
Aliases: Exponential SQR, Exponential square root Markov random field
A graphical probability model on nonnegative continuous variables with unary square-root terms and symmetric products of square roots, derived from an exponential base measure and restricted to parameters giving a finite joint integral.
Identity Notes & Concept Scope
Exponential SQR is the continuous exponential-base specialization of SQR, not the classical auto-exponential model with bilinear raw-variable interactions and exponential full conditionals. It is also distinct from Poisson SQR because it uses Lebesgue measure without factorial weights. The change of variables y_i=sqrt(x_i) introduces a product Jacobian, so the resulting law is not simply a truncated Gaussian on y. No normalized identity match was found across all 442 pinned AIO labels and all scoped synonyms and 409 preceding native IDs, names and aliases. Fixed-string full-checkout searches included ignored and hidden files in worktree and main, yielding 15 and 12 matched lines; all nine unique contents were read. They describe prior square-root/temporal-square-root leads and publication links, not existing records of these identities. Search preparation included the three preceding modified-count records before their merge; their bytes are retained unchanged. All 186 semantic label/synonym hits were read. Forty-six fully annotated exact CLASS nodes and outgoing edges were inspected: 45 byte-equivalent to prior inspected nodes and one freshly read. Sixty-four contextual YAMLs comprise 46 generated and 18 native records: 59 byte-verified after prior reading and five fully read during this preparation. The three-character SQR acronym was checked in normalized identities and omitted from broad text searches. Absence is bounded to the pinned snapshot, maintained corpus and inspected semantic neighborhood.
Claims & Grounded Evidence
1 Claim
Mechanism
#method
On X_i>=0 relative to product Lebesgue measure, define p(x)=Z^(-1)*exp[sum_i theta_i*sqrt(x_i)+sum_i Phi_ii*x_i+2*sum_(i<j) Phi_ij*sqrt(x_i*x_j)], with symmetric Phi and finite positive Z. The site conditional has kernel exp[Phi_ii*t+eta_i*sqrt(t)], t>=0, with eta_i=theta_i+2*sum_(j!=i) Phi_ij*sqrt(x_j). A sufficient regime for every finite theta is u^T Phi u<0 for every nonzero u>=0. Continuity on the compact nonnegative unit sphere then gives u^T Phi u<=-c*||u||^2 for some c>0. With u_i=sqrt(x_i), Young’s inequality bounds theta_i*u_i by epsilon*x_i+theta_i^2/(4*epsilon), where 0<epsilon<c; the joint kernel is dominated by an integrable constant times exp[-(c-epsilon)*sum_i x_i]. Whole-space negative definiteness is sufficient, not necessary. With theta=0 and diagonal negative Phi, the variables are independent exponentials of rates -Phi_ii. Flat quadratic boundary cases require separate linear-in-root tail analysis.
⚠️ Curated Limitations & Negative Results
- Strict negativity on nonnegative directions is sufficient, not an exhaustive characterization of boundary parameters. For example, in one dimension Phi=0 and theta<0 still gives a finite integral 2/theta^2. This example does not classify all multivariate boundary cases.
- An indefinite matrix can satisfy the restricted negative-quadratic condition. A positive-definite matrix cannot; the paper’s speculation to that effect is not adopted. Its condition includes coordinate axes and therefore requires negative diagonals in the strict regime.
- The displayed conditional-partition formula on PDF p. 7 fails its independent exponential special case: at eta1=-1 and eta2=0 it gives a partition of 1+sqrt(pi)/2, whereas the integral of exp(-t) on t>=0 is 1. The record retains the defining integral and the explicit valid tail argument rather than that printed closed form.
- Outside the independent special case, node conditionals need not be ordinary exponential distributions and their means are not generally reciprocals of simple linear rates. This model does not by itself define a temporal waiting-time process.
- The graph is finite and Phi is symmetric; an off-diagonal matrix entry contributes twice in the quadratic form. Separately estimated node regressions need not agree on one symmetric joint parameterization.
- The node conditionals usually have two sufficient statistics and differ from the original univariate base family. A base-family name is not a claim about every conditional or marginal distribution, and an edge parameter is not a universal marginal-correlation or causal-effect statement.
- The printed radial formulas omit the Jacobian needed to interpret x=z*v as a change of continuous coordinates. In p dimensions the L1-radius transformation contributes z^(p-1); a bare ray kernel is not generally the radius distribution. Discrete directions require a counting-measure treatment. The normalization arguments stated here use direct joint domination instead.
- The paper proposes nodewise l1-penalized fitting, numerical conditional partitions and annealed importance sampling. Model existence does not establish finite-data graph recovery, sampler mixing, numerical accuracy or optimizer convergence; no author code, empirical fitting or benchmark was reproduced.
- Reported synthetic and airport-delay experiments are contextual. The paper’s synthetic description prints a positive diagonal while calling the matrix negative definite, an inconsistent sign convention that must be resolved before reproducing that generator. Airport associations and fitted likelihoods do not establish causal effects or held-out predictive performance.
Artificial Intelligence Ontology (AIO) Grounding
Mapped AIO Classes
| AIO Target Class | Mapping Relation | Mapping Rationale |
|---|---|---|
AIO:Model
Model
|
broad_match | This concept denotes a specified family of joint probability distributions and therefore falls within the broader mathematical representation described by Model. Particular estimation algorithms and data applications do not define its identity. |
AIO:ProbabilisticGraphicalModel
Probabilistic Graphical Model
|
related_match | The construction encodes undirected probabilistic dependencies. The pinned AIO target is task-scoped, so related_match connects the model family to graphical modeling without asserting a model is-a task relation. |
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:e864091d4bed…
|
supplement
|
David I. Inouye, Pradeep Ravikumar, Inderjit S. Dhillon
|
primary paper
full_text
|
sha256:0e6e7115b6dc…
|
Curation Provenance
Curator: Codex
Method: ai_assisted
Model: GPT-6
Created: 2026-10-11T22:41:59Z
Updated: 2026-10-11T22:41:59Z