A simple adaptive estimator of the integrated square of a density
Evarist Gin\'e, Richard Nickl

TL;DR
This paper introduces a simple, adaptive kernel-based estimator for the integrated square of a density, which is efficient for smooth densities and rate-optimal for less smooth ones, without prior smoothness knowledge.
Contribution
It proposes a data-driven bandwidth selection rule that makes the estimator both rate-adaptive and asymptotically efficient depending on the density's smoothness.
Findings
Estimator is asymptotically efficient for b1 > 1/4.
Estimator is rate-optimal for b1 a0a0 1/4.
Bandwidth selection rule is data-driven and does not require prior knowledge of b1.
Abstract
Given an i.i.d. sample with common bounded density belonging to a Sobolev space of order over the real line, estimation of the quadratic functional is considered. It is shown that the simplest kernel-based plug-in estimator \[\frac{2}{n(n-1)h_n}\sum_{1\leq i<j\leq n}K\biggl(\frac{X_i-X_j}{h_n}\biggr)\] is asymptotically efficient if and rate-optimal if . A data-driven rule to choose the bandwidth is then proposed, which does not depend on prior knowledge of , so that the corresponding estimator is rate-adaptive for and asymptotically efficient if .
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.
