Learning sparse multivariate polynomials over a field with queries and counterexamples.
From MaRDI portal
Recommendations
Cited in
(20)- Efficiently testing sparse \(\text{GF}(2)\) polynomials
- Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in
- Exact learning from an honest teacher that answers membership queries
- Testing by implicit learning: a brief survey
- Learning arithmetic circuits via partial derivatives.
- Learning multivariate functions with low-dimensional structures using polynomial bases
- Learning read-constant polynomials of constant degree modulo composites
- The query complexity of finding local minima in the lattice
- 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 polynomial functions
- Almost optimal proper learning and testing polynomials
- Learning Read-Constant Polynomials of Constant Degree Modulo Composites
- Deciding multiaffinity of polynomials over a finite field
- Learning polynomials with queries: The highly noisy case
- Multiaffine polynomials over a finite field
- DNF are teachable in the average case
- On learning multivariate polynomials under the uniform distribution
- scientific article; zbMATH DE number 1696656 (Why is no real title available?)
- Cryptographic hardness for learning intersections of halfspaces
This page was built for publication: Learning sparse multivariate polynomials over a field with queries and counterexamples.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q960464)
