Adversarial Estimation of Riesz Representers

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Chernozhukov, Victor, Newey, Whitney, Singh, Rahul, Syrgkanis, Vasilis
Natura: Preprint
Pubblicazione: 2020
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866929328084746240
author Chernozhukov, Victor
Newey, Whitney
Singh, Rahul
Syrgkanis, Vasilis
author_facet Chernozhukov, Victor
Newey, Whitney
Singh, Rahul
Syrgkanis, Vasilis
contents Many causal parameters are linear functionals of an underlying regression. The Riesz representer is a key component in the asymptotic variance of a semiparametrically estimated linear functional. We propose an adversarial framework to estimate the Riesz representer using general function spaces. We prove a nonasymptotic mean square rate in terms of an abstract quantity called the critical radius, then specialize it for neural networks, random forests, and reproducing kernel Hilbert spaces as leading cases. Our estimators are highly compatible with targeted and debiased machine learning with sample splitting; our guarantees directly verify general conditions for inference that allow mis-specification. We also use our guarantees to prove inference without sample splitting, based on stability or complexity. Our estimators achieve nominal coverage in highly nonlinear simulations where some previous methods break down. They shed new light on the heterogeneous effects of matching grants.
format Preprint
id arxiv_https___arxiv_org_abs_2101_00009
institution arXiv
publishDate 2020
record_format arxiv
spellingShingle Adversarial Estimation of Riesz Representers
Chernozhukov, Victor
Newey, Whitney
Singh, Rahul
Syrgkanis, Vasilis
Econometrics
Machine Learning
Many causal parameters are linear functionals of an underlying regression. The Riesz representer is a key component in the asymptotic variance of a semiparametrically estimated linear functional. We propose an adversarial framework to estimate the Riesz representer using general function spaces. We prove a nonasymptotic mean square rate in terms of an abstract quantity called the critical radius, then specialize it for neural networks, random forests, and reproducing kernel Hilbert spaces as leading cases. Our estimators are highly compatible with targeted and debiased machine learning with sample splitting; our guarantees directly verify general conditions for inference that allow mis-specification. We also use our guarantees to prove inference without sample splitting, based on stability or complexity. Our estimators achieve nominal coverage in highly nonlinear simulations where some previous methods break down. They shed new light on the heterogeneous effects of matching grants.
title Adversarial Estimation of Riesz Representers
topic Econometrics
Machine Learning
url https://arxiv.org/abs/2101.00009