Phase transition of the monotonicity assumption in learning local average treatment effects

03/24/2021
by   Yinchu Zhu, et al.
0

We consider the setting in which a strong binary instrument is available for a binary treatment. The traditional LATE approach assumes the monotonicity condition stating that there are no defiers (or compliers). Since this condition is not always obvious, we investigate the sensitivity and testability of this condition. In particular, we focus on the question: does a slight violation of monotonicity lead to a small problem or a big problem? We find a phase transition for the monotonicity condition. On one of the boundary of the phase transition, it is easy to learn the sign of LATE and on the other side of the boundary, it is impossible to learn the sign of LATE. Unfortunately, the impossible side of the phase transition includes data-generating processes under which the proportion of defiers tends to zero. This boundary of phase transition is explicitly characterized in the case of binary outcomes. Outside a special case, it is impossible to test whether the data-generating process is on the nice side of the boundary. However, in the special case that the non-compliance is almost one-sided, such a test is possible. We also provide simple alternatives to monotonicity.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/10/2020

A Phase Transition in Minesweeper

We study the average-case complexity of the classic Minesweeper game in ...
research
10/12/2011

Phase Transition for Random Quantified XOR-Formulas

The QXORSAT problem is the quantified version of the satisfiability prob...
research
06/21/2022

A sufficient and necessary condition for identification of binary choice models with fixed effects

We study the identification of binary choice models with fixed effects. ...
research
03/30/2021

LASSO risk and phase transition under dependence

We consider the problem of recovering a k-sparse signal _0∈ℝ^p from nois...
research
02/14/2012

Suboptimality Bounds for Stochastic Shortest Path Problems

We consider how to use the Bellman residual of the dynamic programming o...
research
07/05/2022

Riemann Solvers for Phase Transition in a Compressible Sharp-Interface Method

In this paper, we consider Riemann solvers with phase transition effects...
research
06/16/2023

Training shallow ReLU networks on noisy data using hinge loss: when do we overfit and is it benign?

We study benign overfitting in two-layer ReLU networks trained using gra...

Please sign up or login with your details

Forgot password? Click here to reset