On learning multivariate polynomials under the uniform distribution
From MaRDI portal
Publication:290214
DOI10.1016/S0020-0190(97)00021-5zbMATH Open1337.68143MaRDI QIDQ290214FDOQ290214
Authors: Nader H. Bshouty
Publication date: 1 June 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Recommendations
Cites Work
- Queries and concept learning
- Randomized Interpolation and Approximation of Sparse Polynomials
- Interpolating polynomials from their values
- On zero-testing and interpolation of \(k\)-sparse multivariate polynomials over finite fields
- Learning Boolean functions in an infinite attribute space
- Interpolation and Approximation of Sparse Multivariate Polynomials over $GF(2)$
- Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields
- Learning sparse multivariate polynomials over a field with queries and counterexamples.
Cited In (10)
- Learning multivariate functions with low-dimensional structures using polynomial bases
- Learning from rounded-off data.
- Learning sparse multivariate polynomials over a field with queries and counterexamples.
- Polynomial Learning of Distribution Families
- Simple Learning Algorithms for Decision Trees and Multivariate Polynomials
- Learning polynomials with queries: The highly noisy case
- Title not available (Why is that?)
- Title not available (Why is that?)
- Efficiently testing sparse \(\text{GF}(2)\) polynomials
- Almost optimal proper learning and testing polynomials
This page was built for publication: On learning multivariate polynomials under the uniform distribution
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q290214)