Uniform-distribution attribute noise learnability
From MaRDI portal
Recommendations
- Can PAC learning algorithms tolerate random attribute noise?
- scientific article; zbMATH DE number 17552
- Algorithmic Learning Theory
- Learning Boolean functions in AC^0on attribute and classification noise -- estimating an upper bound on attribute and classification noise
- Learning juntas in the presence of noise
Cites work
Cited in
(7)- Uniform-Distribution Learnability of Noisy Linear Threshold Functions with Restricted Focus of Attention
- Learning DNF from random walks
- Non-interactive correlation distillation, inhomogeneous Markov chains, and the reverse Bonami-Beckner inequality
- Can PAC learning algorithms tolerate random attribute noise?
- Algorithmic Learning Theory
- Learning Boolean functions in AC^0on attribute and classification noise -- estimating an upper bound on attribute and classification noise
- Learning juntas in the presence of noise
This page was built for publication: Uniform-distribution attribute noise learnability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1877555)