AIMech AI

High-Dimensional Ising Model Selection via L1-Regularized Logistic Regression

Mathematical Methods AIMech:HighDimensionalIsingModelSelectionViaL1RegularizedLogisticRegression DRAFT
Aliases: High-Dimensional Ising Model Selection Using l_1-Regularized Logistic Regression (Ravikumar, Wainwright, & Lafferty 2010), High-Dimensional Graphical Model Selection Using l_1-Regularized Logistic Regression, Nodewise L1-Regularized Logistic Regression Pseudo-Likelihood for Ising Markov Random Field Structure Recovery
High-Dimensional Ising Model Selection via L1-Regularized Logistic Regression is a nodewise convex pseudo-likelihood graphical model structure learning method and primal-dual witness sparsistency framework introduced by Ravikumar, Wainwright, and Lafferty (2010, Annals of Statistics 38(3):1287-1319, arXiv:0804.4202v1, DOI:10.1214/09-AOS691) for recovering the signed edge set E*_{st} = sign(theta*_{st}) of a p-vertex binary Ising Markov random field P_{theta*}(x) = (1/Z(theta*)) exp(sum_{(s,t) in E} theta*_{st} x_s x_t) on {-1, +1}^p with maximum degree d without computing the #P-hard partition function Z(theta*). Exploiting the logistic conditional distribution P_{theta*}(x_r | x_{\r}) = 1 / (1 + exp(-2 x_r sum_{t in V \ r} theta*_{rt} x_t)) (Equation 4), the method solves for each node r in V the convex program min_{theta_{\r} in R^{p-1}} {ell(theta; {x^{(i)}}) + lambda_n ||theta_{\r}||_1} (Equations 5-7) and estimates the signed neighborhood N_hat_pm(r) = {sign(theta_hat_{ru}) u | u in V \ r, theta_hat_{ru} != 0} (Equation 8). Under dependency conditions Lambda_min(Q*_{SS}) >= C_min > 0, Lambda_max(E_{theta*}[X_{\r} X_{\r}^T]) <= D_max (Equation 12) and mutual incoherence |||Q*_{S^c S} (Q*_{SS})^{-1}|||_infty <= 1 - alpha (Equation 13) on the population Fisher information matrix Q*_r = E_{theta*}[eta(X; theta*) X_{\r} X_{\r}^T] with conditional variance weight eta(u; theta) = 4 exp(2 u_r sum_{t != r} theta_{rt} u_t) / (exp(2 u_r sum_{t != r} theta_{rt} u_t) + 1)^2 (Equations 9-11), Theorem 1 (Equations 15-16) proves simultaneous signed graph recovery across all p nodes with sample complexity n = Omega(d^3 log p) and theta*_min = Omega(1/d) for lambda_n = 2 sqrt((log p)/n), whereas Proposition 1 (Equation 26) proves that n = Omega(d^2 log p) and theta*_min = Omega(1/sqrt(d)) suffice when Assumptions A1-A2 hold directly on the sample Fisher matrix Q^n.
Identity Notes & Concept Scope Resolved against all 442 pinned AIO records and 628 maintained AIMech records. Distinct from AIMech:PrimalDualWitnessAndSharpThresholdsForHighDimensionalNoisyLassoSparsityRecovery (Wainwright 2009, IEEE Trans. Inf. Theory 55(5):2183-2202, which analyzes linear Lasso regression under Gaussian noise where the Hessian is constant, whereas nodewise Ising logistic regression has a parameter-dependent Fisher information matrix Q(theta) weighted by eta(X; theta) = sech^2(sum_{t != r} theta_{rt} X_t) and a non-zero quadratic Taylor remainder R^n controlled via Lemmas 3-4), from AIMech:DecomposableRegularizerAndRestrictedStrongConvexityMEstimatorFramework (Negahban et al. 2012, Statistical Science 27(4):538-557, which bounds l_2 parameter estimation error under Restricted Strong Convexity rather than exact signed graph recovery via population Fisher mutual incoherence), and from AIO:LogisticRegression and AIO:LassoRegression.

Claims & Grounded Evidence

3 Claims
Mechanism #nodewise-l1-logistic-pseudo-likelihood-and-primal-dual-witness-shared-sparsity
For a binary Ising Markov random field P_{theta*}(x) = (1/Z(theta*)) exp(sum_{(s,t) in E} theta*_{st} x_s x_t) on {-1, +1}^p (Equation 1), the conditional distribution of node X_r given X_{\r} takes the logistic form P_{theta*}(x_r | x_{\r}) = exp(2 x_r sum_{t in V \ r} theta*_{rt} x_t) / (exp(2 x_r sum_{t in V \ r} theta*_{rt} x_t) + 1) (Equation 4), yielding the rescaled negative conditional log-likelihood ell(theta; {x^{(i)}}) = (1/n) sum_{i=1}^n f(theta; x^{(i)}) - sum_{u in V \ r} theta_{ru} mu_hat_{ru} where f(theta; x) = log(exp(sum_{t in V \ r} theta_{rt} x_t) + exp(-sum_{t in V \ r} theta_{rt} x_t)) and mu_hat_{ru} = (1/n) sum_{i=1}^n x_r^{(i)} x_u^{(i)} (Equations 5-7). Constructing a primal-dual witness pair (theta_hat, z_hat) by setting theta_hat_S = argmin_{(theta_S, 0)} {ell(theta; {x^{(i)}}) + lambda_n ||theta_S||_1} (Equation 24), theta_hat_{S^c} = 0, z_hat_S = sign(theta_hat_S), and lambda_n z_hat_{S^c} = -[nabla ell(theta_hat)]_{S^c} from the KKT stationarity equation nabla ell(theta_hat) + lambda_n z_hat = 0 (Equation 20), Lemma 1 (Section 3.3, p. 10) proves via Lagrangian duality and complementary slackness on the conic sign representation lambda_n z_hat = sum_{v in {-1, +1}^{p-1}} alpha*_v v (Equation 22) that if ||z_hat_{S^c}||_infty < 1, every optimal solution theta_tilde satisfies theta_tilde_{S^c} = 0, and if [nabla^2 ell(theta_hat)]_{SS} > 0, theta_hat is the unique optimal solution.
Mechanism #sample-fisher-consistency-via-boundary-convexity-and-quadratic-taylor-remainder-control
Expanding the zero-subgradient KKT condition around theta* via the coordinate-wise mean-value theorem gives Q^n (theta_hat - theta*) = W^n - lambda_n z_hat + R^n (Equations 27-29), where W^n := -nabla ell(theta*; {x^{(i)}}), Q^n := (1/n) sum_{i=1}^n eta(x^{(i)}; theta*) x_{\r}^{(i)} (x_{\r}^{(i)})^T is the sample Fisher information matrix (Equation 17), and R^n_j = [nabla^2 ell(theta_bar^{(j)}) - nabla^2 ell(theta*)]_j^T (theta_hat - theta*). Under the sample Fisher good event M({x^{(i)}}) where Q^n satisfies Assumptions A1 and A2 (Equation 25): (1) Lemma 2 (p. 12, Equation 30; Appendix A.1, p. 20) applies the Azuma-Hoeffding inequality to bounded score increments |Z_u^{(i)}| <= 2 to bound P((2 - alpha)/lambda_n ||W^n||_infty >= alpha/4) = O(exp(-K n lambda_n^2 + log p)); (2) Lemma 3 (p. 12, Equation 31; Appendix A.2, pp. 20-22, Equations 50-54) proves strict positivity of G(u_S) on the sphere ||u_S||_2 = M lambda_n sqrt(d) with M = 5 / C_min whenever lambda_n d <= C_min^2 / (10 D_max), establishing ||theta_hat_S - theta*_S||_2 = O_p(sqrt(d) lambda_n); and (3) Lemma 4 (p. 12, Equation 32; Appendix A.3, pp. 22-23) uses |g'(t)| <= 1 for g(t) = 4 exp(2t) / (1 + exp(2t))^2 to bound ||R^n||_infty <= D_max ||theta_hat_S - theta*_S||_2^2 = O_p(d lambda_n^2), proving Proposition 1 (p. 11, Equation 26): n > L d^2 log p and theta*_min = Omega(1/sqrt(d)) suffice for ||z_hat_{S^c}||_infty <= 1 - alpha/2 < 1 and exact signed graph recovery.
Scope #population-to-sample-fisher-concentration-and-d3-log-p-sparsistency-scaling
When dependency (Assumption A1: Lambda_min(Q*_{SS}) >= C_min > 0, Lambda_max(E_{theta*}[X_{\r} X_{\r}^T]) <= D_max, Equation 12) and mutual incoherence (Assumption A2: |||Q*_{S^c S} (Q*_{SS})^{-1}|||_infty <= 1 - alpha, Equation 13) are imposed on the population Fisher information matrix Q* = E_{theta*}[eta(X; theta*) X_{\r} X_{\r}^T] (Equations 9-11), Lemma 5 (Section 5, p. 13, Equations 41a-41b) and Lemma 7 (p. 15, Equations 46a-46c; Appendix B, pp. 23-24) apply entrywise Hoeffding bounds |Z_{jk}^{(i)}| <= 4 (Equation 43) and the four-term decomposition Q^n_{S^c S} (Q^n_{SS})^{-1} = T_1 + T_2 + T_3 + T_4 (Equations 45a-45d) to control |||T_1|||_infty <= (1 - alpha) |||Q^n_{SS} - Q*_{SS}|||_infty sqrt(d) |||(Q^n_{SS})^{-1}|||_2 and |||T_2|||_infty <= (sqrt(d) / C_min) |||Q^n_{S^c S} - Q*_{S^c S}|||_infty at threshold delta = O(1/sqrt(d)), proving Lemma 6 (p. 14, Equation 42): P[|||Q^n_{S^c S} (Q^n_{SS})^{-1}|||_infty >= 1 - alpha/2] <= exp(-K n / d^3 + log p). Combining Lemma 6 with Proposition 1 and a union bound over all p nodes establishes Theorem 1 (Section 3.2, p. 8, Equations 15-16): if n > L d^3 log p and theta*_min = Omega(1/d), then for lambda_n = 2 sqrt((log p)/n), the probability of failing to recover the exact signed graph G(p, d) decays as O(exp(-K n / d^3 + 3 log p)) -> 0, with overall convex-programming computational complexity O(max{n, p} p^3).

⚠️ Curated Limitations & Negative Results

Artificial Intelligence Ontology (AIO) Grounding

Mapped AIO Classes
AIO Target Class Mapping Relation Mapping Rationale
AIO:LogisticRegression
Logistic Regression
broad_match AIO:LogisticRegression represents logistic regression broadly, whereas this concept specifically captures nodewise L1-regularized logistic conditional pseudo-likelihood estimation for high-dimensional binary Ising graphical model selection.
AIO:LassoRegression
Lasso Regression
related_match AIO:LassoRegression represents L1-penalized linear regression, whose primal-dual witness and mutual incoherence framework is generalized here to L1-regularized logistic regression with a parameter-dependent Fisher information matrix.

Evidence Sources & Primary Literature

3 Sources
Source ID Publication / Document Type / Access Reference & Checksum
rwl2010-ising-logistic-pdf
Pradeep Ravikumar, Martin J. Wainwright, John D. Lafferty
primary paper
full_text
ID: https://doi.org/10.1214/09-AOS691
sha256:bfcfa14813f1…
rwl2010-ising-logistic-abs
Pradeep Ravikumar, Martin J. Wainwright, John D. Lafferty
primary paper
abstract_only
ID: https://doi.org/10.48550/arXiv.0804.4202
sha256:2335b62f2187…
rwl2010-ising-logistic-cr
Pradeep Ravikumar, Martin J. Wainwright, John D. Lafferty
primary paper
abstract_only
ID: https://doi.org/10.1214/09-AOS691
sha256:2fe1f15bb23b…

Ontology & Grounding Topology

Open in interactive network graph →
CONCEPT KIND Mathematical Methods AIMech:HighDimensionalIsingModelSelectionViaL1RegularizedLogisticRegression High-Dimensional Ising... 3 claims · 3 sources AIO GROUNDING AIO:LogisticRegression (2)

Curation Provenance

Curator: Antigravity
Method: ai_assisted
Model: Gemini 3
Created: 2026-10-18T21:56:00Z
Updated: 2026-10-18T21:56:00Z
Source File: data/curated/HighDimensionalIsingModelSelectionViaL1RegularizedLogisticRegression.yaml · Schema: curated_concept.yaml

Explore across X-Mech

Related computational & biological Mechs: Embedding Map Network Graph ProteinTraitsMech (ESM-2 pLM) DUFMech (Domain pLM) TraitMech CultureMech All 14 X-Mech Repositories