Learning in the Presence of Malicious Errors
Data up to Jan 2025
Total Citations Per Year
Abstract
References (13)
A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
1952 • 3,575 citations
A theory of the learnable
1984 • 2,968 citations
A Greedy Heuristic for the Set-Covering Problem
1979 • 2,542 citations
On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
1971 • 2,313 citations
Approximation algorithms for combinatorial problems
1974 • 2,224 citations
Learnability and the Vapnik-Chervonenkis dimension
1989 • 1,855 citations
On the ratio of optimal integral and fractional covers
1975 • 1,124 citations
Occam's Razor
1987 • 1,044 citations
Untitled
1987 • 790 citations
Untitled
1988 • 681 citations
Fast probabilistic algorithms for hamiltonian circuits and matchings
1979 • 607 citations
A general lower bound on the number of examples needed for learning
1989 • 435 citations
Learning from Good and Bad Data
1988 • 132 citations