pith. sign in

arxiv: 1711.10696 · v1 · pith:RVW3TMCDnew · submitted 2017-11-29 · 🧮 math.ST · stat.TH

Detailed proof of Nazarov's inequality

classification 🧮 math.ST stat.TH
keywords detailedinequalitynazarovproofannalschernozhukovchetverikovkato
0
0 comments X
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.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Gaussian Approximation for Asynchronous Q-learning

    stat.ML 2026-04 unverdicted novelty 7.0

    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.

  2. Order-Explicit Linearization of High-Dimensional $U$-Statistics

    econ.EM 2024-05 unverdicted novelty 7.0

    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...

  3. Detection and inference of changes in high-dimensional linear regression with non-sparse structures

    stat.ME 2024-02 unverdicted novelty 6.0

    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...