Searcharxiv⌕ Search

arXiv · 2611.00417

Vector incremental treatment effects

Abstract

Causal questions involving multiple binary treatments are poorly served by standard causal approaches. Potential outcomes grow exponentially with the number of treatments, many treatment combinations are rarely or never observed, and fixing everyone to one combination can require implausible positivity assumptions. We extend incremental propensity score interventions to vector-valued binary treatments, defining causal effects through counterfactual distributions that scale the odds of each treatment by a user-specified factor. Because marginal odds constraints do not uniquely determine the joint distribution, we define it as the minimum-divergence projection of the observed law onto the constrained set, for a user-specified separable divergence, preserving the observed conditional support. The resulting counterfactual mean outcome is identified under consistency and conditional mean exchangeability, without requiring every treatment combination to have positive conditional probability. For a class of smooth divergences, we derive the efficient influence function and construct cross-fitted one-step estimators that are consistent at the parametric rate and asymptotically normal when marginal treatment probabilities are exactly 0, exactly 1, or bounded away from those values. We relax this requirement by specifying a different estimand and deriving a corresponding estimator, which is asymptotically normal under a convergence-rate condition on the estimated active set. We also extend sensitivity analysis to address unmeasured confounding. Applying the framework to 159,466 New York Medicaid beneficiaries with serious mental illness, we estimate how healthcare costs would change under uniform improvements in the odds of six recommended quality-of-care processes. Increasing recommended care is associated with lower total, inpatient, and mental-health cost and higher outpatient cost.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Denis Agniel, Max Rubinstein, Larry Han, Anthony Yu, Molly T. Finnerty, Marcela V. Horvitz-Lennon, Sharon-Lise T. Normand. 2026-11-03. Vector incremental treatment effects. https://arxiv.org/abs/2611.00417

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Debiased Estimating Equation Method for Robust and Efficient Mendelian Randomization Using a Large Number of Correlated Weak and Invalid Instruments

Mendelian randomization (MR) is a widely used tool for causal inference in the presence of unmeasured confounders, which uses single nucleotide polymorphisms (SNPs) as instrumental variables to estimate causal effects. However, SNPs often have weak effects on complex traits, leading to bias in existing MR analyses when weak instruments are included. In addition, existing MR methods often restrict analysis to independent SNPs via linkage disequilibrium clumping and result in a loss of efficiency in estimating the causal effect due to discarding correlated SNPs. To address these issues, we propose the Debiased Estimating Equation Method (DEEM), a summary statistics-based MR approach that can incorporate a large number of correlated, weak-effect, and invalid SNPs. DEEM effectively eliminates the weak instrument bias and improves the statistical efficiency of the causal effect estimation by leveraging information from a large number of correlated SNPs. DEEM also allows for pleiotropic effects, adjusts for the winner's curse, and applies to both two-sample and one-sample MR analyses. Asymptotic analyses of the DEEM estimator demonstrate its attractive theoretical properties. Through extensive simulations and two real data examples, we demonstrate that DEEM significantly improves the efficiency and robustness of MR analysis compared with existing methods.

stat.ME↗

Latent Space Graph-fused LASSO for Clustering in Attributed Graphs

This manuscript studies latent space graph-fused LASSO methods for clustering graphs with multivariate nodal attributes. The framework includes node-specific priors of low-dimensional representations coupled with a neural decoder that bridges the observed attributes with the latent variables. Both structural and attribute information are incorporated for the clustering through a graph-fused LASSO regularization on prior nodal means. The optimization problem is solved via the alternating direction method of multipliers with Langevin dynamics for posterior inference. Simulations on grid and block graphs, together with applications to California county temperatures and Los Angeles traffic data, demonstrate the effectiveness of the proposed method.

stat.ME↗

Missing data and cluster graphs: cluster-level missingness vs variable-level missingness

Missing data is pervasive in many scientific domains such as public health, environmental science, and the social sciences. Recoverability from missing data is typically studied using fully specified variable-level missingness models despite that, in many applications, only coarse structural information is available, for instance when variables are grouped into clusters due to limited knowledge or interpretability reasons. In this paper, we investigate recoverability from such abstract representations. We introduce two classes of cluster-based missingness graphs: the m-C-DMG, which retains variable-specific missingness indicators, and the cm-C-DMG, which aggregates missingness mechanisms at the cluster level. We formalize the notion of compatibility between these abstract graphs and underlying variable-level missingness models, and study how this abstraction affects the recoverability of probabilistic and causal queries. In particular, we give graphical conditions of recovering the joint distribution as well as graphical conditions of recovering a macro causal effect.

stat.ME↗