Uniform-distribution attribute noise learnability

DOI10.1016/S0890-5401(03)00135-4MaRDI QIDQ1877555zbMATH OpenFDO

Authors Nader H. Bshouty, Jeffrey Jackson, C. Tamon

Publication date 19 August 2004

Published in Information and Computation (Search for Journal in Brave)

zbMATH Keywords

Fourier analysisComputational learning theoryLearning with noise

Mathematics Subject Classification ID

Computational learning theory (68Q32)

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

• scientific article; zbMATH DE number 2080649 (Why is no real title available?)
• Can PAC learning algorithms tolerate random attribute noise?
• Constant depth circuits, Fourier transform, and learnability
• Noise sensitivity of Boolean functions and applications to percolation

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)