Learning juntas in the presence of noise
From MaRDI portal
Publication:2382279
DOI10.1016/J.TCS.2007.05.014zbMATH Open1124.68051OpenAlexW4212892348MaRDI QIDQ2382279FDOQ2382279
Authors: Jan Arpe, Rüdiger 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
Recommendations
- Theory and Applications of Models of Computation
- Parameterized learnability of juntas
- Learning under signal-to-noise ratio uncertainty
- Learning in presence of input noise using the stochastic EM algorithm
- Learning with noise in a linear perceptron
- Learning with noiseless information and payoff-relevant signals
- Sample-efficient strategies for learning in the presence of noise
- On the robustness of learning parity with noise
- scientific article; zbMATH DE number 1256729
Fourier analysisjuntaslearning in the presence of irrelevant informationlearning in the presence of noiselearning of Boolean functions
Cites Work
- Selection of relevant features and examples in machine learning
- Probability Inequalities for Sums of Bounded Random Variables
- Inequalities in Fourier analysis
- Title not available (Why is that?)
- Learning functions of \(k\) relevant variables
- Constant depth circuits, Fourier transform, and learnability
- A theory of the learnable
- Noise sensitivity of Boolean functions and applications to percolation
- Occam's razor
- Étude des coefficients de Fourier des fonctions de \(L^ p(G)\)
- Title not available (Why is that?)
- On the noise sensitivity of monotone functions
- On learning monotone DNF under product distributions
- Uniform-distribution attribute noise learnability
- Algorithmic Learning Theory
- Can PAC learning algorithms tolerate random attribute noise?
- Title not available (Why is that?)
Cited In (12)
- Improved time complexities for learning Boolean networks
- Parameterized learnability of juntas
- Application of a generalization of Russo's formula to learning from multiple random oracles
- Theory and Applications of Models of Computation
- Learning conjunctions with noise under product distributions
- On noise-tolerant learning of sparse parities and related problems
- Algorithmic Learning Theory
- Inferring Boolean functions via higher-order correlations
- Learning Boolean functions in \(AC^0\)on attribute and classification noise -- estimating an upper bound on attribute and classification noise
- Parameterized Learnability of k-Juntas and Related Problems
- Uniform-distribution attribute noise learnability
- A parallel stochastic algorithm for learning logic expressions under noise
This page was built for publication: Learning juntas in the presence of noise
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2382279)
