PAC learning with nasty noise.
type: Item
instance of: scholarly article
title: PAC learning with nasty noise.
zbMATH Open document ID: 1061.68081
DOI: 10.1016/S0304-3975(01)00403-0
author: Nader H. Bshouty
author: Nadav Eiron
author: Eyal Kushilevitz
published in: Theoretical Computer Science
publication date: 2003-01-21T00:00:00Z
Mathematics Subject Classification ID: 68Q32
Mathematics Subject Classification ID: 68T05
zbMATH DE Number: 1857054
zbMATH Keywords: PAC learning
zbMATH Keywords: Learning with noise
zbMATH Keywords: Nasty noise
MaRDI profile type: Publication
cites work: Combinatorial variability of Vapnik-Chervonenkis classes with applications to sample compression schemes
cites work: Q4526997
cites work: Learning with unreliable boundary queries
cites work: Weakly learning DNF and characterizing statistical query learning using Fourier analysis
cites work: Learnability and the Vapnik-Chervonenkis dimension
cites work: Q4542579
cites work: Q4228465
cites work: Sample-efficient strategies for learning in the presence of noise
cites work: Probability Inequalities for Sums of Bounded Random Variables
cites work: Efficient noise-tolerant learning from statistical queries
cites work: Learning in the Presence of Malicious Errors
cites work: Toward efficient agnostic learning
cites work: On the density of families of sets
cites work: Sharper bounds for Gaussian and empirical processes
cites work: A theory of the learnable
cites work: On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
description: scientific article; zbMATH DE number 1857054