Inference on Time Series Nonparametric Conditional Moment Restrictions Using General Sieves
Not on the map. Why?
Abstract (arXiv)
General nonlinear sieve learnings are classes of nonlinear sieves that can approximate nonlinear functions of high dimensional variables much more flexibly than various linear sieves (or series). This paper considers general nonlinear sieve quasi-likelihood ratio (GN-QLR) based inference on expectation functionals of time series data, where the functionals of interest are based on some nonparametric function that satisfy conditional moment restrictions and are learned using multilayer neural networks. While the asymptotic normality of the estimated functionals depends on some unknown Riesz representer of the functional space, we show that the optimally weighted GN-QLR statistic is asymptotically Chi-square distributed, regardless whether the expectation functional is regular (root-n estimable) or not. This holds when the data are weakly dependent beta-mixing condition. We apply our method to the off-policy evaluation in reinforcement learning, by formulating the Bellman equation into the conditional moment restriction framework, so that we can make inference about the state-specific value functional using the proposed GN-QLR method with time series data. In addition, estimating the averaged partial means and averaged partial derivatives of nonparametric instrumental variables and quantile IV models are also presented as leading examples. Finally, a Monte Carlo study shows the finite sample performance of the procedure
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 17 of its 46 references that are in the map. First posted on arXiv 31 Dec 2022.
Builds on
17 of 46 references.
References · 17
- 2017Nonparametric regression using deep neural networks with ReLU activation functioncited by 431
- 2016Safe, Multi-Agent, Reinforcement Learning for Autonomous Drivingcited by 301
- 2019A Theory of Regularized Markov Decision Processescited by 279
- 2019A Theoretical Analysis of Deep Q-Learningcited by 212
- 2016Why does deep and cheap learning work so well?cited by 100
- 2020Minimax Estimation of Conditional Moment Modelscited by 83
- 2020Statistical Inference of the Value Function for Reinforcement Learning in Infinite Horizon Settingscited by 65
- 2020Neural Network Approximation: Three Hidden Layers Are Enoughcited by 63
- 2017The power of deeper networks for expressing natural functionscited by 35
- 2020Adversarial Estimation of Riesz Representerscited by 34
- 2022On Well-posedness and Minimax Optimal Rates of Nonparametric Q-function Estimation in Off-policy Evaluationcited by 33
- 2021On the Approximation Power of Two-Layer Networks of Random ReLUscited by 29
5 more
- 2021Optimal policy evaluation using kernel-based temporal difference methodscited by 24
- 2016Learning Functions: When Is Deep Better Than Shallowcited by 19
- 2021An L2 Analysis of Reinforcement Learning in High Dimensions with Kernel and Neural Network Approximationcited by 13
- 2021Deep Learning Statistical Arbitragecited by 11
- 2021Efficient Estimation in NPIV Models: A Comparison of Various Neural Networks-Based Estimatorscited by 5
Built on by
Citing papers per year: 2023: 1.
1 paper.