Detailed proof of Nazarov's inequality
read the original abstract
The purpose of this note is to provide a detailed proof of Nazarov's inequality stated in Lemma A.1 in Chernozhukov, Chetverikov, and Kato (2017, Annals of Probability).
This paper has not been read by Pith yet.
Forward citations
Cited by 3 Pith papers
-
Gaussian Approximation for Asynchronous Q-learning
Derived rates of order up to n^{-1/6} log^4(n S A) for the high-dimensional CLT of averaged asynchronous Q-learning iterates, plus a general martingale-difference CLT.
-
Order-Explicit Linearization of High-Dimensional $U$-Statistics
Derives an order-explicit large deviation bound for high-dimensional U-statistics from their Hájek projections, yielding new concentration results and consistency for resampling-based confidence intervals around subsa...
-
Detection and inference of changes in high-dimensional linear regression with non-sparse structures
Sparsity of regression parameters or differential parameters is not necessary for consistent multiple change point detection in high-dimensional linear regression; a covariance discrepancy scan is statistically and co...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.