atlas

Research map / Learning theory and algorithms / Sample complexity

Uniform Convergence Rate of the Kernel Density Estimator Adaptive to Intrinsic Volume Dimension

ICML 2019 · Learning theory and algorithms › Sample complexity · approach: Density and property estimation · 13 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use volume dimension to characterize small-ball probability decay instead of relying on ambient or support dimensionKDE uniform convergence over bandwidths h >= l_n · Arbitrary probability distributions on R^dsupremum-norm deviation rateHelped
Allow weaker kernel regularity and integrability conditionsKDE uniform convergence · Arbitrary probability distributions on R^dapplicability of uniform convergence boundsHelped
Extend the volume-dimension analysis to kernel derivativesHigher-order derivatives of the KDE · Uniform convergence over bandwidths h >= l_nsupremum-norm deviation boundHelped

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy