A Characterization of the Orthocomplement of the Tangent Space of Semiparametric Markov Models

2026-07-26 · Trung Phung, Ilya Shpitser arxiv

Graphical models are ubiquitous in social and empirical science as they are intuitive and easy to use. These models belong to the broader class of Markov models, defined using solely conditional independence (CI) restrictions. In order to estimate finite-dimensional target parameters in such models efficiently, semi-parametric theory provides a principled framework for constructing regular and asymptotically linear estimators via influence functions (IFs). These estimators are asymptotically normal and root-$n$ consistent. Characterizing the class of all influence functions for a target parameter is crucial for statistically efficient inference in these models. For models that are Markov relative to directed acyclic graphs (DAGs), the orthogonal complement of the tangent space is known, implying that for any target the class of all influence functions can be derived once an influence function is obtained. On the other hand, for Markov models not equivalent to a DAG model -- such as ordinary Markov models associated with undirected graphs, chain graphs, or acyclic directed mixed graphs -- the orthogonal complement has not been characterized, impeding semi-parametric inference in these models. We derive closed form expressions for the orthogonal complement of the tangent space for general Markov models and illustrate our results by characterizing the class of influence functions for the conditional mean parameter in several graphical models.

📄 PDF Abstract BibTeX arXiv:2607.23439

Code (0)

등록된 구현이 없습니다.

Causal Inference with the Napkin Graph

2025-12-22 · Anna Guo, Lin Liu, David Benkeser, Razieh Nabi arxiv

Unmeasured confounding can render identification strategies based on adjustment functionals invalid. We study the "Napkin" graph, a causal structure that encapsulates features of M-bias, instrumental variables, and class…

Causal Inference

LLM Evaluation as Tensor Completion: Low Rank Structure and Semiparametric Efficiency

2026-04-07 · Jiachun Li, David Simchi-Levi, Will Wei Sun arxiv

Large language model (LLM) evaluation platforms increasingly rely on pairwise human judgments. These data are noisy, sparse, and non-uniform, yet leaderboards are reported with limited uncertainty quantification. We stud…

Hidden Parameter Markov Decision Processes: A Semiparametric Regression Approach for Discovering Latent Task Parametrizations

2013-08-15 · Finale Doshi-Velez, George Konidaris

Control applications often feature tasks with similar, but not identical, dynamics. We introduce the Hidden Parameter Markov Decision Process (HiP-MDP), a framework that parametrizes a family of related dynamical systems…

regression

Automatic Double Reinforcement Learning in Semiparametric Markov Decision Processes with Applications to Long-Term Causal Inference

2025-01-12 · Lars van der Laan, David Hubbard, Allen Tran, Nathan Kallus 외

Estimating long-term causal effects from short-term data is essential for decision-making in healthcare, economics, and industry, where long-term follow-up is often infeasible. Markov Decision Processes (MDPs) offer a pr…

Causal Inference Dimensionality Reduction Domain Adaptation Model Selection

How well behaved is finite dimensional Diffusion Maps?

2024-12-05 · Wenyu Bo, Marina Meilă

Under a set of assumptions on a family of submanifolds $\subset {\mathbb R}^D$, we derive a series of geometric properties that remain valid after finite-dimensional and almost isometric Diffusion Maps (DM), including al…

valid