Agnostically learning Boolean functions with finite polynomial representation
From MaRDI portal
(Redirected from Publication:5136248)
Recommendations
Cites work
- scientific article; zbMATH DE number 5485565 (Why is no real title available?)
- A theory of the learnable
- Agnostically Learning Halfspaces
- An \(O(n^{\log \log n})\) learning algorithm for DNF under the uniform distribution
- Constant depth circuits, Fourier transform, and learnability
- Decision theoretic generalizations of the PAC model for neural net and other learning applications
- Learnability beyond AC 0
- Learning DNF in time
- Learning and lower bounds for AC\(^{0}\) with threshold gates
- Learning intersections and thresholds of halfspaces
- On PAC learning algorithms for rich Boolean function classes
- On the Fourier spectrum of monotone functions
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- On the degree of Boolean functions as real polynomials
- Toward efficient agnostic learning
- When do extra majority gates help? Polylog\((N)\) majority gates are equivalent to one
Cited in
(3)
This page was built for publication: Agnostically learning Boolean functions with finite polynomial representation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5136248)
