On learning multivariate polynomials under the uniform distribution
From MaRDI portal
(Redirected from Publication:290214)
Recommendations
Cites work
- Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields
- Interpolating polynomials from their values
- Interpolation and Approximation of Sparse Multivariate Polynomials over $GF(2)$
- Learning Boolean functions in an infinite attribute space
- Learning sparse multivariate polynomials over a field with queries and counterexamples.
- On zero-testing and interpolation of \(k\)-sparse multivariate polynomials over finite fields
- Queries and concept learning
- Randomized Interpolation and Approximation of Sparse Polynomials
Cited in
(10)- Efficiently testing sparse \(\text{GF}(2)\) polynomials
- Learning from rounded-off data.
- Learning multivariate functions with low-dimensional structures using polynomial bases
- Polynomial Learning of Distribution Families
- Simple Learning Algorithms for Decision Trees and Multivariate Polynomials
- Luby-Veličković-Wigderson revisited: improved correlation bounds and pseudorandom generators for depth-two circuits
- Learning sparse multivariate polynomials over a field with queries and counterexamples.
- Almost optimal proper learning and testing polynomials
- Learning polynomials with queries: The highly noisy case
- scientific article; zbMATH DE number 1696656 (Why is no real title available?)
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)
