Simple Learning Algorithms for Decision Trees and Multivariate Polynomials
From MaRDI portal
Recommendations
- On learning multivariate polynomials under the uniform distribution
- Learning sparse multivariate polynomials over a field with queries and counterexamples.
- Learning Decision Trees Using the Fourier Spectrum
- On learning decision trees with large output domains
- Learning Monotone Decision Trees in Polynomial Time
Cited in
(10)- Luby-Veličković-Wigderson revisited: improved correlation bounds and pseudorandom generators for depth-two circuits
- Beyond the low-degree algorithm: mixtures of subcubes and their applications
- On learning multivariate polynomials under the uniform distribution
- Exact learning from an honest teacher that answers membership queries
- Learning sparse multivariate polynomials over a field with queries and counterexamples.
- DNF are teachable in the average case
- Efficiently testing sparse \(\text{GF}(2)\) polynomials
- Almost optimal proper learning and testing polynomials
- Learning arithmetic circuits via partial derivatives.
- Properly learning decision trees in almost polynomial time
This page was built for publication: Simple Learning Algorithms for Decision Trees and Multivariate Polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4785627)
