惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

V
V2EX
P
Proofpoint News Feed
D
DataBreaches.Net
C
Check Point Blog
L
LangChain Blog
量子位
美团技术团队
Vercel News
Vercel News
人人都是产品经理
人人都是产品经理
N
Netflix TechBlog - Medium
V
Visual Studio Blog
Microsoft Security Blog
Microsoft Security Blog
博客园 - 【当耐特】
MongoDB | Blog
MongoDB | Blog
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
Last Week in AI
Last Week in AI
The GitHub Blog
The GitHub Blog
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
U
Unit 42
腾讯CDC
M
MIT News - Artificial intelligence
Microsoft Azure Blog
Microsoft Azure Blog
Blog — PlanetScale
Blog — PlanetScale

math.ST updates on arXiv.org

What is Learnable in Valiant's Theory of the Learnable? Learning Perturbations to Extrapolate Your LLM Byzantine-Robust Distributed Sparse Learning Revisited The Sample Complexity of Multiple Change Point Identification under Bandit Feedback A proximal gradient algorithm for composite log-concave sampling Model-based Bootstrap of Controlled Markov Chains Approximation of Maximally Monotone Operators : A Graph Convergence Perspective Posterior Contraction Rates for Sparse Kolmogorov-Arnold Networks in Anisotropic Besov Spaces MIST: Reliable Streaming Decision Trees for Online Class-Incremental Learning via McDiarmid Bound A Spectral Framework for Closed-Form Relative Density Estimation Fast Rates for Offline Contextual Bandits with Forward-KL Regularization under Single-Policy Concentrability Higher-Order Equilibrium Tracking for EM-Compressible Online Estimation Scaling Limits of Long-Context Transformers A Note on Non-Negative $L_1$-Approximating Polynomials Susceptibilities and Patterning: A Primer on Linear Response in Bayesian Learning Linear Response Estimators for Singular Statistical Models Statistical inference with belief functions: A survey Robust stochastic first order methods in heavy-tailed noise via medoid mini-batch gradient sampling Every Feedforward Neural Network Definable in an o-Minimal Structure Has Finite Sample Complexity Adaptive auditing of AI systems with anytime-valid guarantees Locally Near Optimal Piecewise Linear Regression in High Dimensions via Difference of Max-Affine Functions Risk-Controlled Post-Processing of Decision Policies Covariate Balancing and Riesz Regression Should Be Guided by the Neyman Orthogonal Score in Debiased Machine Learning A Unified Pair-GRPO Family: From Implicit to Explicit Preference Constraints for Stable and General RL Alignment Time-Inhomogeneous Preconditioned Langevin Dynamics A Fine-Grained Understanding of Uniform Convergence for Halfspaces CITE: Anytime-Valid Statistical Inference in LLM Self-Consistency Ratio-based Loss Functions Optimal Confidence Band for Kernel Gradient Flow Estimator A renormalization-group inspired lattice-based framework for piecewise generalized linear models
Propensity score methodology in the presence of network e...
Panos Toulis, Alexander Volfovsky, Edoardo M. Airoldi · 2018-01-23 · via math.ST updates on arXiv.org

In experimental design and causal inference, it may happen that the treatment is not defined on individual experimental units, but rather on pairs or, more generally, on groups of units. For example, teachers may choose pairs of students who do not know each other to teach a new curriculum; regulators might allow or disallow merging of firms, and biologists may introduce or inhibit interactions between genes or proteins. In this paper, we formalize this experimental setting, and we refer to the individual treatments in such setting as entangled treatments. We then consider the special case where individual treatments depend on a common population quantity, and develop theory and methodology to deal with this case. In our target applications, the common population quantity is a network, and the individual treatments are defined as functions of the change in the network between two specific time points. Our focus is on estimating the causal effect of entangled treatments in observational studies where entangled treatments are endogenous and cannot be directly manipulated. When treatment cannot be manipulated, be it entangled or not, it is necessary to account for the treatment assignment mechanism to avoid selection bias, commonly through a propensity score methodology. In this paper, we quantify the extent to which classical propensity score methodology ignores treatment entanglement, and characterize the bias in the estimated causal effects. To characterize such bias we introduce a novel similarity function between propensity score models, and a practical approximation of it, which we use to quantify model misspecification of propensity scores due to entanglement. One solution to avoid the bias in the presence of entangled treatments is to model the change in the network, directly, and calculate an individual unit's propensity score by averaging treatment assignments over this change.