~/talk

Lucky Talk: Chebyshev Polynomials, Moment Matching and Optimal Estimation of the Unseen

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

Claims that support-size can be estimated with sublinear samples in K and only polylogarithmic accuracy dependence, using a linear estimator that is a weighted sum of the fingerprint (histogram of histogram). Design uses Chebyshev polynomial coefficients (degree L ≈ log N, e.g., degree ~11 for 1,000,000 items with 200,000 samples), Poissonization for analysis, and thresholding for heavy hitters. A matching lower bound builds indistinguishable mixtures by moment matching (random U taking few values), so the estimator is essentially optimal.

AI-written summary · about

  1. 0:00Introduction and setup
  2. 1:22Statistical fundamental limits
  3. 3:31Overview of estimation methods
  4. 7:32Linear estimator design
  5. 12:18Concrete example and application
  6. 14:13Limitations of heavy hitters
  7. 15:51Lower bound and bad instances
~/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.