Learning Sparse Polynomial Functions

@inproceedings{Andoni2014LearningSP,
  title={Learning Sparse Polynomial Functions},
  author={Alexandr Andoni and Rina Panigrahy and Gregory Valiant and Li Zhang},
  booktitle={SODA},
  year={2014}
}
We study the question of learning a sparse multivariate polynomial over the real domain. In particular, for some unknown polynomial f(~x) of degree-d and k monomials, we show how to reconstruct f , within error , given only a set of examples x̄i drawn uniformly from the n-dimensional cube (or an n-dimensional Gaussian distribution), together with evaluations f(x̄i) on them. The result holds even in the “noisy setting”, where we have only values f(x̄i) + g where g is noise (say, modeled as a… CONTINUE READING
Highly Cited
This paper has 17 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 31 references

Finding Correlations in Subquadratic Time, with Applications to Learning Parities and Juntas

2012 IEEE 53rd Annual Symposium on Foundations of Computer Science • 2012

Public-key cryptosystem from different assumptions

Benny Applebaum, Boaz Barak, Avi Wigderson
In Proceedings of the Symposium on Theory of Computing (STOC), • 2010

Agnostic Learning of Monomials by Halfspaces Is Hard

2009 50th Annual IEEE Symposium on Foundations of Computer Science • 2009

Learning and Smoothed Analysis

2009 50th Annual IEEE Symposium on Foundations of Computer Science • 2009

Learning Geometric Concepts via Gaussian Surface Area

2008 49th Annual IEEE Symposium on Foundations of Computer Science • 2008

Similar Papers

Loading similar papers…