Toward a Semiparametric Efficiency Theory under Equality Constraints in Nested Markov Models

• URL: http://arxiv.org/abs/2608.24602v1
• Date: Tue, 25 Aug 2026 14:23:40 GMT
• Title: Toward a Semiparametric Efficiency Theory under Equality Constraints in Nested Markov Models
• Abstract summary: Probabilistic models of Directed Acyclic Graphs (DAGs) with latent variables impose equality constraints on the observed data distribution.<n>We develop results toward establishing a semiparametric framework for statistical models defined by Verma constraints.
• Score: 6.460973247686546
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Probabilistic models of Directed Acyclic Graphs (DAGs) with latent variables impose equality constraints on the observed data distribution beyond ordinary conditional independencies. These so-called Verma constraints arise in nested Markov models associated with Acyclic Directed Mixed Graphs, the latent projection of latent-variable DAGs. While nested Markov models have been extensively studied from the perspectives of graphical representation and causal identification, their implications for semiparametric efficiency theory remain less understood. We develop results toward establishing a semiparametric framework for statistical models defined by Verma constraints. Our key observation is that nested Markov constraints admit weighted conditional-moment representations under post-fixing distributions induced by graphical fixing operations. We show that fixing induces weighted orthogonality relations in L2(P), thereby converting Verma constraints into explicit tangent-space restrictions. Building on this representation, we characterize the tangent-space orthocomplement for models defined by a single nested Markov constraint through residualized weighted moment functions. This geometric formulation yields Hilbert-space characterizations of semiparametric efficient influence functions and efficiency bounds via orthogonal projection and equivalent minimum-variance formulations. We further discuss extensions to models involving multiple nested Markov constraints, for which we characterize a subspace of the orthocomplement as sums of the corresponding weighted orthogonality relations, while leaving the complete tangent-space characterization open. More broadly, our results connect nested graphical structure with semiparametric Hilbert-space geometry and provide a foundation for a general efficiency theory for nested Markov models. We illustrate the framework through several latent-variable DAGs.

Related papers

• A Characterization of the Orthocomplement of the Tangent Space of Semiparametric Markov Models [6.03533724367194]
  We show how to characterize the class of influence functions for a target parameter.<n>For Markov models associated with undirected graphs, chain graphs, or acyclic directed mixed graphs, the complement has not been characterized.<n>We derive closed form expressions for the complement of the tangent space for general Markov models.
  arXiv  Detail & Related papers  (2026-07-26T03:33:14Z)
• Representational Capacity: Geometric Limits on Feature Representation in Transformer Language Models [51.56484100374058]
  We develop a framework for estimating how many near-orthogonal directions a model can support.<n>Applying this metric across dozens of open-source models reveals two classes: models with high $varepsilon$ whose embeddings lack near-orthogonal structure, and models with low $varepsilon$ that maintain it.
  arXiv  Detail & Related papers  (2026-06-01T18:28:56Z)
• SIGMA: Scalable Spectral Insights for LLM Collapse [51.863164847253366]
  We introduce SIGMA (Spectral Inequalities for Gram Matrix Analysis), a unified framework for model collapse.<n>By utilizing benchmarks that deriving and deterministic bounds on the matrix's spectrum, SIGMA provides a mathematically grounded metric to track the contraction of the representation space.<n>We demonstrate that SIGMA effectively captures the transition towards states, offering both theoretical insights into the mechanics of collapse.
  arXiv  Detail & Related papers  (2026-01-06T19:47:11Z)
• Flock: A Knowledge Graph Foundation Model via Learning on Random Walks [26.568227939080703]
  We study the problem of zero-shot link prediction on knowledge graphs (KGs)<n>We present Flock, a KGFM that iteratively samples random walks, encodes them into sequences via a recording protocol, embeds them with a sequence model, and aggregates representations of nodes and relations via learned pooling.<n>Flock perfectly solves our new diagnostic dataset Petals where current KGFMs fail, and achieves state-of-the-art performances on entity- and relation prediction tasks on 54 KGs from diverse domains.
  arXiv  Detail & Related papers  (2025-10-01T23:09:46Z)
• Nonparametric learning of heterogeneous graphical model on network-linked data [19.215806260939473]
  This paper proposes a nonparametric graphical model that accommodates heterogeneous graph structures without imposing any distributional assumptions.<n>It transforms the graph learning task into solving a finite-dimensional linear equation system by leveraging the properties of vector-valued kernel Hilbert space.<n>Its effectiveness is also demonstrated through a variety of simulated examples and a real application to the statistician coauthorship dataset.
  arXiv  Detail & Related papers  (2025-07-02T08:37:15Z)
• UniqueNESS: Graph Theory Approach to the Uniqueness of Non-Equilibrium Stationary States of the Lindblad Master Equation [0.0]
  dimensionality of kernels for Lindbladian superoperators is of physical interest in various scenarios out of equilibrium.<n>We show that known criteria established in the literature for unique fixpoints of the Lindblad master equation can be better treated in a graph-theoretic framework.
  arXiv  Detail & Related papers  (2025-04-16T21:59:05Z)
• Learning Graphical Factor Models with Riemannian Optimization [70.13748170371889]
  This paper proposes a flexible algorithmic framework for graph learning under low-rank structural constraints. The problem is expressed as penalized maximum likelihood estimation of an elliptical distribution. We leverage geometries of positive definite matrices and positive semi-definite matrices of fixed rank that are well suited to elliptical models.
  arXiv  Detail & Related papers  (2022-10-21T13:19:45Z)
• Score-based Generative Modeling of Graphs via the System of Stochastic Differential Equations [57.15855198512551]
  We propose a novel score-based generative model for graphs with a continuous-time framework. We show that our method is able to generate molecules that lie close to the training distribution yet do not violate the chemical valency rule.
  arXiv  Detail & Related papers  (2022-02-05T08:21:04Z)
• Joint Network Topology Inference via Structured Fusion Regularization [70.30364652829164]
  Joint network topology inference represents a canonical problem of learning multiple graph Laplacian matrices from heterogeneous graph signals. We propose a general graph estimator based on a novel structured fusion regularization. We show that the proposed graph estimator enjoys both high computational efficiency and rigorous theoretical guarantee.
  arXiv  Detail & Related papers  (2021-03-05T04:42:32Z)
• The multilayer random dot product graph [6.722870980553432]
  We present a comprehensive extension of the latent position network model known as the random dot product graph. We propose a method for jointly embedding submatrices into a suitable latent space. Empirical improvements in link prediction over single graph embeddings are exhibited in a cyber-security example.
  arXiv  Detail & Related papers  (2020-07-20T20:31:39Z)
• Multi-View Spectral Clustering Tailored Tensor Low-Rank Representation [105.33409035876691]
  This paper explores the problem of multi-view spectral clustering (MVSC) based on tensor low-rank modeling. We design a novel structured tensor low-rank norm tailored to MVSC. We show that the proposed method outperforms state-of-the-art methods to a significant extent.
  arXiv  Detail & Related papers  (2020-04-30T11:52:12Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.