Simple learning algorithms using divide and conquer
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 819814 (Why is no real title available?)
- scientific article; zbMATH DE number 1398080 (Why is no real title available?)
- A theory of the learnable
- Asking questions to minimize errors
- Cryptographic limitations on learning Boolean formulae and finite automata
- Efficient noise-tolerant learning from statistical queries
- Exact learning Boolean functions via the monotone theory
- Fast learning of \(k\)-term DNF formulas with queries.
- Interpolation and Approximation of Sparse Multivariate Polynomials over $GF(2)$
- Learning Decision Trees Using the Fourier Spectrum
- Learning read-once formulas with queries
- Weakly learning DNF and characterizing statistical query learning using Fourier analysis
Cited in
(8)- The query complexity of finding local minima in the lattice
- Exact learning of DNF formulas using DNF hypotheses
- Learning attribute-efficiently with corrupt oracles
- SAT-based invariant inference and its relation to concept learning
- Learning with errors in answers to membership queries
- Exact learning from an honest teacher that answers membership queries
- On approximating weighted sums with exponentially many terms
- Efficiently testing sparse \(\text{GF}(2)\) polynomials
This page was built for publication: Simple learning algorithms using divide and conquer
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1355381)
