~/talk

Chebyshev Polynomials, Moment Matching and Optimal Estimation of the Unseen

name:Yihong Wu
links:none on file
slides:none on file

This work gives an explicit linear estimator on fingerprint counts that uses Chebyshev polynomials (degree about log n) and Poissonization to reduce bias and achieve sublinear sampling: roughly K / log K samples with error dependence polylogarithmic (about log^2(1/epsilon)) instead of 1/epsilon^2. Duality to moment matching yields the matching lower bound, so the procedure is minimax-optimal up to constants; simple experiments (e.g., Shakespeare passages) match the theory.

AI-written summary · about

  1. 0:00Intro
  2. 0:26Problem setup
  3. 0:49Estimating the unseen
  4. 1:43Classical results
  5. 3:09Mathematical formulation
  6. 4:15Sample complexity
  7. 7:30Sufficient statistics
  8. 11:40Minimax risk
  9. 12:36Best polynomial approximation
  10. 13:19Moment matching
  11. 15:16Unbiased estimators?
  12. 16:23Linear estimators
  13. 18:03Chebyshev polynomial
  14. 18:31Final estimator
  15. 19:06Analysis
  16. 19:48Randomization
  17. 20:32Key construction: reduction to one dimension
  18. 21:48Optimize the lower bound
  19. 23:07Comparison
  20. 23:55Species problem
  21. 25:15Estimating entropy
  22. 25:26Concluding remarks
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.