PAC learning with nasty noise

[1]  R. Schapire,et al.  Toward efficient agnostic learning , 1992, COLT '92.

[2]  Nicolò Cesa-Bianchi,et al.  Sample-efficient strategies for learning in the presence of noise , 1999, JACM.

[3]  Shai Ben-David,et al.  Combinatorial Variability of Vapnik-chervonenkis Classes with Applications to Sample Compression Schemes , 1998, Discret. Appl. Math..

[4]  Nader H. Bshouty,et al.  A new composition theorem for learning algorithms , 1998, STOC '98.

[5]  Scott E. Decatur PAC Learning with Constant-Partition Classification Noise and Applications to Decision Tree Induction , 1997, ICML.

[6]  Shai Ben-David,et al.  A composition theorem for learning algorithms with applications to geometric concept classes , 1997, STOC '97.

[7]  Nicolò Cesa-Bianchi,et al.  Randomized Hypotheses and Minimum Disagreement Hypotheses for Learning with Noise , 1997, EuroCOLT.

[8]  Thomas G. Dietterich What is machine learning? , 2020, Archives of Disease in Childhood.

[9]  Hans Ulrich Simon,et al.  Noise-tolerant learning near the information-theoretic bound , 1996, STOC '96.

[10]  Subhash Suri,et al.  Noise-tolerant distribution-free learning of general geometric concepts , 1996, STOC '96.

[11]  Rosario Gennaro,et al.  On learning from noisy and incomplete examples , 1995, COLT '95.

[12]  Donna K. Slonim,et al.  Learning with unreliable boundary queries , 1995, COLT '95.

[13]  Scott E. Decatur Learning in Hybrid Noise Environments Using Statistical Queries , 1995, AISTATS.

[14]  Yishay Mansour,et al.  Weakly learning DNF and characterizing statistical query learning using Fourier analysis , 1994, STOC '94.

[15]  N. Fisher,et al.  Probability Inequalities for Sums of Bounded Random Variables , 1994 .

[16]  M. Talagrand Sharper Bounds for Gaussian and Empirical Processes , 1994 .

[17]  Javed A. Aslam,et al.  General bounds on statistical query learning and PAC learning with noise via hypothesis boosting , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[18]  Michael Kearns,et al.  Efficient noise-tolerant learning from statistical queries , 1993, STOC.

[19]  Robert E. Schapire,et al.  Design and analysis of efficient learning algorithms , 1992, ACM Doctoral dissertation award ; 1991.

[20]  David Haussler,et al.  Learnability and the Vapnik-Chervonenkis dimension , 1989, JACM.

[21]  Ming Li,et al.  Learning in the presence of malicious errors , 1993, STOC '88.

[22]  Leslie G. Valiant,et al.  Learning Disjunction of Conjunctions , 1985, IJCAI.

[23]  Leslie G. Valiant,et al.  A theory of the learnable , 1984, STOC '84.

[24]  Norbert Sauer,et al.  On the Density of Families of Sets , 1972, J. Comb. Theory, Ser. A.

[25]  Vladimir Vapnik,et al.  Chervonenkis: On the uniform convergence of relative frequencies of events to their probabilities , 1971 .

[26]  S. M. Samuels,et al.  Monotone Convergence of Binomial Probabilities and a Generalization of Ramanujan's Equation , 1968 .