Lepski's method compares estimators across an ordered bandwidth grid. It chooses the largest bandwidth whose confidence interval has nonempty intersection with every interval at a smaller bandwidth, thereby adapting to unknown smoothness while controlling excessive undersmoothing.

Ancestors (9)

  1. Kernel density estimation
  2. Kernel for density estimation
  3. Density estimation
  4. Nonparametric statistics
  5. Statistical inference
  6. Probability and statistics
  7. Area of mathematics
  8. Mathematics
  9. Home

Incoming links (1)

View article source

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version