Sharper Bounds for Chebyshev Moment Matching with Applications to Differential Privacy and Beyond
<|reference_start|>Sharper Bounds for Chebyshev Moment Matching with Applications to Differential Privacy and Beyond: We study the problem of approximately recovering a probability distribution given noisy measurements of its Chebyshev polynomial moments. We sharpen prior work, proving that accurate recovery in the Wasserstein distance is possible with more noise than previously known.   As a main application, our result yields a simple "linear query" algorithm for constructing a differentially private synthetic data distribution with Wasserstein-1 error $\tilde{O}(1/n)$ based on a dataset of $n$ points in $[-1,1]$. This bound is optimal up to log factors and matches a recent breakthrough of Boedihardjo, Strohmer, and Vershynin [Probab. Theory. Rel., 2024], which uses a more complex "superregular random walk" method to beat an $O(1/\sqrt{n})$ accuracy barrier inherent to earlier approaches.   We illustrate a second application of our new moment-based recovery bound in numerical linear algebra: by improving an approach of Braverman, Krishnan, and Musco [STOC 2022], our result yields a faster algorithm for estimating the spectral density of a symmetric matrix up to small error in the Wasserstein distance.<|reference_end|>
@article{musco2024sharper,
    title={Sharper Bounds for Chebyshev Moment Matching with Applications to
  Differential Privacy and Beyond},
    author={Cameron Musco and Christopher Musco and Lucas Rosenblatt and Apoorv
  Vikram Singh},
    journal={arXiv preprint arXiv:2408.12385},
    year={2024},
    archivePrefix={arXiv},
    eprint={2408.12385},
    primaryClass={cs.DS cs.LG}
}