Full Name
Apoorv Vikram Singh
Primary Department, Unit, or Institute
Computer Science
University/Company
NYU
Talk Title
Sharper Bounds For Chebyshev Moment Matching With Applications
Abstract
I will present the problem of approximately recovering a probability distribution given noisy
measurements of its Chebyshev polynomial moments. I will present the proof that accurate recovery in the Wasserstein distance is possible with more noise than previously known. I will also present some interesting applications of this in eigenvalue estimation, and differential privacy.
measurements of its Chebyshev polynomial moments. I will present the proof that accurate recovery in the Wasserstein distance is possible with more noise than previously known. I will also present some interesting applications of this in eigenvalue estimation, and differential privacy.
