REVIEW 1 cited by
Debiased Machine Learning of Aggregated Intersection Bounds and Other Causal Parameters
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
This paper proposes a novel framework of aggregated intersection of regression functions, where the target parameter is obtained by averaging the minimum (or maximum) of a collection of regression functions over the covariate space. Such quantities include the lower and upper bounds on distributional effects (Frechet-Hoeffding, Makarov) and the optimal welfare in the statistical treatment choice problem. The proposed estimator -- the envelope score estimator -- is shown to have an oracle property, where the oracle knows the identity of the minimizer for each covariate value. I apply this result to the bounds in the Roy model and the Horowitz-Manski-Lee bounds with a discrete outcome. The proposed approach performs well empirically on the data from the Oregon Health Insurance Experiment.
Forward citations
Cited by 1 Pith paper
-
Partial identification via conditional linear programs: estimation and policy learning
Two debiased estimators, one based on linear programming solutions and one on entropic smoothing, provide asymptotic confidence intervals for covariate-dependent partial identification bounds and support policy learning.
Discussion (0). Continue with ORCID to comment.