Learning juntas in the presence of noise

DOI10.1016/j.tcs.2007.05.014zbMath1124.68051OpenAlexW4212892348MaRDI QIDQ2382279

Jan Arpe, K. Ruediger Reischuk

Publication date: 28 September 2007

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

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

zbMATH Keywords

Fourier analysisjuntaslearning in the presence of irrelevant informationlearning in the presence of noiselearning of Boolean functions

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Related Items (3)

Improved time complexities for learning Boolean networks ⋮ Application of a Generalization of Russo's Formula to Learning from Multiple Random Oracles ⋮ Inferring Boolean functions via higher-order correlations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Occam's razor
• Selection of relevant features and examples in machine learning
• Inequalities in Fourier analysis
• Uniform-distribution attribute noise learnability
• On learning monotone DNF under product distributions
• Learning functions of \(k\) relevant variables
• Can PAC learning algorithms tolerate random attribute noise?
• Étude des coefficients de Fourier des fonctions de \(L^ p(G)\)
• Constant depth circuits, Fourier transform, and learnability
• A theory of the learnable
• On the noise sensitivity of monotone functions
• Probability Inequalities for Sums of Bounded Random Variables
• Algorithmic Learning Theory
• Noise sensitivity of Boolean functions and applications to percolation

This page was built for publication: Learning juntas in the presence of noise