2007
DOI: 10.1007/s00440-007-0087-9
|View full text |Cite
|
Sign up to set email alerts
|

Uniform central limit theorems for kernel density estimators

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

2
100
0

Year Published

2008
2008
2017
2017

Publication Types

Select...
6

Relationship

2
4

Authors

Journals

citations
Cited by 57 publications
(102 citation statements)
references
References 28 publications
2
100
0
Order By: Relevance
“…Under the conditions in (4.8), it can be shown that h * * ≃ (n/ log n) −1/(2s+d) , which is the optimal bandwidth for the estimation of p in sup-norm, also satisfies (4.5) and, therefore, (4.6) and (4.7) hold for h = h * * . (ii) The condition on r in (4.8) coincides with the one obtained for {1 (−∞,t] : t ∈ R} in Bickel and Ritov [6] and bounded variation and Lipschitz classes with d = 1 in Giné and Nickl [15], see Remarks 7 and 8. This condition shows that for the kernel density estimator with bandwidth h * to be optimal in the weak topology (assuming ω * ≤ 1, ω K < 1 and K satisfying the conditions in Theorem 3.2), the order of the kernel has to be chosen higher by d 2 than the usual (the usual being estimating p using the kernel density estimator in L 1 -norm).…”
supporting
confidence: 61%
See 1 more Smart Citation
“…Under the conditions in (4.8), it can be shown that h * * ≃ (n/ log n) −1/(2s+d) , which is the optimal bandwidth for the estimation of p in sup-norm, also satisfies (4.5) and, therefore, (4.6) and (4.7) hold for h = h * * . (ii) The condition on r in (4.8) coincides with the one obtained for {1 (−∞,t] : t ∈ R} in Bickel and Ritov [6] and bounded variation and Lipschitz classes with d = 1 in Giné and Nickl [15], see Remarks 7 and 8. This condition shows that for the kernel density estimator with bandwidth h * to be optimal in the weak topology (assuming ω * ≤ 1, ω K < 1 and K satisfying the conditions in Theorem 3.2), the order of the kernel has to be chosen higher by d 2 than the usual (the usual being estimating p using the kernel density estimator in L 1 -norm).…”
supporting
confidence: 61%
“…→ f dP as n → ∞, written as P n P. In fact, if nothing is known about P, then P n is probably the most appropriate estimator to use as it is asymptotically efficient and minimax in the sense of van der Vaart [37], Theorem 25.21, Several recent works (Bickel and Ritov [6], Nickl [26], Giné and Nickl [15,[17][18][19]) have shown that many popular density estimators on X = R, such as maximum likelihood estimator, kernel density estimator and wavelet estimator satisfy (1.2) if F is P-Donskerthe Donsker classes that were considered in these works are: functions of bounded variation, {1 (−∞,t] : t ∈ R}, Hölder, Lipschitz and Sobolev classes on R. In other words, these…”
Section: Introductionmentioning
confidence: 99%
“…The proof is based on ideas from the theory of smoothed empirical processes (in particular from Giné and Nickl, 2008). The main mathematical challenges consist in dealing with envelopes of the empirical process that can be as large as 1/ √ ∆ → ∞ in the high-frequency setting, and in accommodating the presence of an n-dependent Fourier multiplier m that needs to be general enough to allow for m = FK h /ϕ ∆ .…”
Section: Numerical Examplementioning
confidence: 99%
“…We will rely on the following auxiliary result, which is a modification of Theorem 3 in Giné and Nickl (2008), which in itself goes back to fundamental ideas in Giné and Zinn (1984). It is designed to allow for maximally growing envelopes of the empirical process, which is crucial in our setting to allow for minimal conditions on ∆.…”
Section: Asymptotic Equicontinuity Of the 'Critical Term'mentioning
confidence: 99%
See 1 more Smart Citation