Learning Boolean functions in AC^0on attribute and classification noise -- estimating an upper bound on attribute and classification noise

DOI10.1016/J.TCS.2011.04.047zbMATH Open1221.68108OpenAlexW2015853503MaRDI QIDQ638534FDOQ638534

Authors: Akinobu Miyata, Jun Tarui, Etsuji Tomita 

Publication date: 12 September 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.04.047

Recommendations

• Algorithmic Learning Theory
• Uniform-distribution attribute noise learnability
• Theory and Applications of Models of Computation
• Learning juntas in the presence of noise
• Constant depth circuits, Fourier transform, and learnability

zbMATH Keywords

learningBoolean functions\(AC^{0}\)attribute noiseclassification noise

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Computational learning theory (68Q32)

Cites Work

• Probability Inequalities for Sums of Bounded Random Variables
• Constant depth circuits, Fourier transform, and learnability
• A theory of the learnable
• Title not available (Why is that?)
• Uniform-distribution attribute noise learnability
• Algorithmic Learning Theory

Cited In (2)

• Algorithmic Learning Theory
• Uniform-distribution attribute noise learnability

This page was built for publication: Learning Boolean functions in \(AC^0\)on attribute and classification noise -- estimating an upper bound on attribute and classification noise

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q638534)