A maximal inequality for local empirical processes under weak dependence
Luis Alvarez, Cristine Pinto

TL;DR
This paper develops a maximal inequality for local empirical processes under weak dependence, providing nonasymptotic bounds that improve understanding of estimation errors in dependent data scenarios.
Contribution
It introduces a new maximal inequality for local empirical processes under strong mixing conditions, accommodating complex function classes and applying to kernel density estimation.
Findings
Bounds control estimation error uniformly over function class, point, and bandwidth
Results apply to function classes with increasing complexity with sample size
Kernel density estimators under weak dependence achieve near-iid rates
Abstract
We introduce a maximal inequality for a local empirical process under strongly mixing data. Local empirical processes are defined as the (local) averages , where belongs to a class of functions, and is a bandwidth. Our nonasymptotic bounds control estimation error uniformly over the function class, evaluation point and bandwidth . They are also general enough to accomodate function classes whose complexity increases with . As an application, we apply our bounds to function classes that exhibit polynomial decay in their uniform covering numbers. When specialized to the problem of kernel density estimation, our bounds reveal that, under weak dependence with exponential decay, these estimators achieve the same (up to a logarithmic factor) sharp uniform-in-bandwidth rates derived…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStatistical Methods and Inference · Markov Chains and Monte Carlo Methods
