Chebyshev Polynomials, Moment Matching and Optimal Estimation of the Unseen
summary
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
chapters (22)
- 0:00Intro
- 0:26Problem setup
- 0:49Estimating the unseen
- 1:43Classical results
- 3:09Mathematical formulation
- 4:15Sample complexity
- 7:30Sufficient statistics
- 11:40Minimax risk
- 12:36Best polynomial approximation
- 13:19Moment matching
- 15:16Unbiased estimators?
- 16:23Linear estimators
- 18:03Chebyshev polynomial
- 18:31Final estimator
- 19:06Analysis
- 19:48Randomization
- 20:32Key construction: reduction to one dimension
- 21:48Optimize the lower bound
- 23:07Comparison
- 23:55Species problem
- 25:15Estimating entropy
- 25:26Concluding remarks
related talks
11mSharp Threshold for the Planted Matching Problem
45mEfficient Profile Maximum Likelihood for Universal Symmetric Property Estimation
29mComputational Barriers to Estimation from Low-Degree Polynomials
48mExact Minimax Estimation for Phase Synchronization
48mComputational-Statistical Tradeoffs in Robust High-Dimensional Estimation
30mSparse Polynomial Interpolation: Compressed Sensing, Super-resolution, or Prony?
14mEfficient Universal Estimators For Symmetric Property Estimation
35mTesting Positive Semidefiniteness and Eigenvalue Approximation
