Highly Influenced

# Moment-Matching Polynomials

@article{Klivans2013MomentMatchingP, title={Moment-Matching Polynomials}, author={Adam R. Klivans and Raghu Meka}, journal={Electronic Colloquium on Computational Complexity (ECCC)}, year={2013}, volume={20}, pages={8} }

- Published 2013 in Electronic Colloquium on Computational Complexity

We give a new framework for proving the existence of low-degr e , polynomial approximators for Boolean functions with respect to broad classes o f non-product distributions. Our proofs use techniques related to the classical moment probl em and deviate significantly from known Fourier-based methods, which require the underlying d stribution to have some product structure. Our main application is the first polynomial-time algorithm for agnostically learning any function of a constant number of… CONTINUE READING

#### From This Paper

##### Figures, tables, results, connections, and topics extracted from this paper.

5 Extracted Citations

25 Extracted References

Similar Papers