论文检索

样本个体数为一时的实验设计AI 解读

N-of-1 trials, or time-series experiments, are widely used in clinical research and online platforms. Yet the theoretically optimal design for estimating many treatment effects remains unclear. We propose a simple Markovian framework for experimental design in which the treatment assignment process is governed by possibly time-varying transition matrices. This formulation encompasses many existing N-of-1 designs and provides a principled way to control temporal dependence in…

通过秩黏性非参数点识别处理效应分布AI 解读

Treatment effect distributions are not identified without restrictions on the joint distribution of potential outcomes. Existing approaches either impose rank preservation -- a strong assumption -- or derive partial identification bounds that are often wide. We show that a single scalar parameter, rank stickiness, suffices for nonparametric point identification while permitting rank violations. The identified joint distribution -- the coupling that maximizes average rank…

随机实验协变量平衡的高斯化设计优化AI 解读

Achieving covariate balance in randomized experiments enhances the precision of treatment effect estimation. However, existing methods often require heuristic adjustments based on domain knowledge and are primarily developed for binary treatments. This paper presents Gaussianized Design Optimization, a novel framework for optimally balancing covariates in experimental design. The core idea is to Gaussianize the treatment assignments: we model treatments as transformations of…

样本量为一时的随机化推断AI 解读

N-of-1 experiments, where a unit serves as its own control and treatment in different time windows, have been used in certain medical contexts for decades. However, due to effects that accumulate over long time windows and interventions that have complex evolution, a lack of robust inference tools has limited the widespread applicability of such N-of-1 designs. This work combines techniques from experiment design in causal inference and system identification from control…

用于插补与个体化推断的凸化匹配方法AI 解读

We introduce a new convexified matching method for missing value imputation and individualized inference inspired by computational optimal transport. Our method integrates favorable features from mainstream imputation approaches: optimal matching, regression imputation, and synthetic control. We impute counterfactual outcomes based on convex combinations of observed outcomes, defined based on an optimal coupling between the treated and control data sets. The optimal coupling…