Lucky Talk: Chebyshev Polynomials, Moment Matching and Optimal Estimation of the Unseen
summary
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
chapters (7)
- 0:00Introduction and setup
- 1:22Statistical fundamental limits
- 3:31Overview of estimation methods
- 7:32Linear estimator design
- 12:18Concrete example and application
- 14:13Limitations of heavy hitters
- 15:51Lower bound and bad instances
related talks
45mEfficient Profile Maximum Likelihood for Universal Symmetric Property Estimation
01h 11mPedagogical Talk: Failure of Low-Degree Polynomials
11mSharp Threshold for the Planted Matching Problem
29mComputational Barriers to Estimation from Low-Degree Polynomials
14mEfficient Universal Estimators For Symmetric Property Estimation
48mComputational-Statistical Tradeoffs in Robust High-Dimensional Estimation
01h 02mImportance Sampling in High Dimensions via Hashing
44mSomething for Almost Nothing: Advances in Sub-Linear Time Algorithms
