Search arXiv⌕ Search

arXiv · 2611.00607

Sharp Design-based Inference for Quantiles of Individual Treatment Effects

Abstract

Understanding the distribution of individual treatment effects (ITEs) is a central problem in causal inference. In general, however, this distribution is only partially identifiable from observed data because it depends on the unidentifiable joint distribution of the two potential outcomes. In this paper, we develop design-based inference for the distribution of ITEs whose validity relies solely on the randomization of treatment assignment, treating the potential outcomes as arbitrary fixed constants. Building on recent randomization tests for ITE quantiles, we propose tests based on either a rank-based Kolmogorov--Smirnov (KS) statistic or the usual KS statistic, with the latter being more conservative in the presence of ties. We show that, under certain regularity conditions, the confidence bounds obtained by test inversion are asymptotically no worse than the sharp bounds on ITE quantiles given the marginal distributions of the potential outcomes. We further derive a closed-form expression for the confidence bounds from the KS-based randomization test and show that they can be equivalently constructed by combining sharp bounds on ITE quantiles with uncertainty of empirical marginal distributions. This equivalence connects randomization-based inference with partial identification and clarifies the special role of the KS statistic in achieving sharp inference. Under additional distributional assumptions, we characterize the power of the proposed randomization tests under local alternatives. Finally, we discuss how to incorporate covariates to further sharpen inference. We illustrate the properties of the proposed methods using both simulations and a real-data application.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jiangchuan Du, Xinran Li. 2026-10-31. Sharp Design-based Inference for Quantiles of Individual Treatment Effects. https://arxiv.org/abs/2611.00607

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↗