Noise-Tolerant Distribution-Free Learning of General Geometric Concepts

Noise-Tolerant Distribution-Free Learning of General Geometric Concepts (1996)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Nader H. Bshouty , Sally A. Goldman , H. David Mathias , Subhash Suri , Hisao Tamaki

Citations:

15 - 3 self

BibTeX

@MISC{Bshouty96noise-tolerantdistribution-free,
    author = {Nader H. Bshouty and Sally A. Goldman and H. David Mathias and Subhash Suri and Hisao Tamaki},
    title = {Noise-Tolerant Distribution-Free Learning of General Geometric Concepts},
    year = {1996}
}

Bookmark

OpenURL

Abstract

this paper. First, we give an algorithm to learn C

Citations

1515	A Theory of the Learnable - Valiant - 1984
1478	The probabilistic method - Spencer - 1992
816	On the uniform convergence of relative frequencies of events to their probabilities. Theory of Prob. and its - Vapnik, Chervonenkis - 1971
643	Algorithms in combinatorial geometry - Edelsbrunner - 1987
582	Queries and concept learning - Angluin - 1988
577	Approximation algorithms for combinatorial problems - Johnson - 1974
565	Learnability and the Vapnik Chervonenkis dimension - Blumer, Ehrenfeucht, et al. - 1989
248	Efficient noise-tolerant learning from statistical queries - Kearns - 1998
240	Epsilon-nets and simplex range queries - Haussler, Welzl - 1987
217	On the ratio of optimal integral and fractional covers - Lovasz - 1975
197	Learning from noisy examples - Angluin, Laird - 1988
180	A General Lower Bound on the Number of Examples Needed - Ehrenfeucht, Haussler, et al. - 1989
135	A greedy heuristic for the set covering problem - CHVATAL - 1979
133	Almost optimal set covers in finite VC-dimension - Bronnimann, Goodrich - 1995
114	Learning disjunctions of conjunctions - Valiant - 1985
59	Neural Net Algorithms that Learn in Polynomial Time from Examples and Queries - Baum - 1991
58	Learning decision trees from random examples - Ehrenfeucht, Haussler - 1989
48	Types of noise in data for concept learning - Sloan - 1988
42	Polygon retrieval - Willard - 1982
41	General bounds on statistical query learning and PAC learning with noise via hypothesis boosting - Aslam, Decatur - 1998
37	Statistical queries and faulty PAC oracles - Decatur - 1993
32	Efficient NC algorithms for set cover with applications to learning and geometry - Berger, Rompel, et al.
32	Training a 3-node neural net is NP-complete - Blum, Rivest - 1989
30	Specification and simulation of statistical query algorithms for efficiency and noise tolerance - Aslam, Decatur - 1995
27	Exact Learning of Discretized Geometric Concepts - Bshouty, Goldberg, et al. - 1994
27	Composite Geometric Concepts and Polynomial Predictability - Long, Warmuth - 1994
22	The perceptron algorithm is fast for nonmalicious distributions - Baum - 1997
22	Learning from a Consistently Ignorant Teacher - Frazier, Goldman, et al. - 1994
22	Generalizing the PAC model: Sample size bounds from metric dimension-based uniform convergence results - Haussler - 1989
21	On Learning a Union of Half Spaces - Baum - 1990
21	PAC Learning Intersections of Halfspaces With Membership Queries - Kwek, Pitt - 1998
16	The bounded injury priority method and learnability of unions of rectangles, Unpublished manuscript - Chen, Homer - 1994
9	Noise-Tolerant Parallel Learning of Geometric Concepts - Bshouty, Goldman, et al. - 1995
9	Learning of depth two neural networks with constant fan-in at the hidden nodes (extended abstract - Auer, Kwek, et al. - 1996
7	Learning unions of rectangles with membership and equivalence queries - Goldberg, Goldman, et al. - 1994
6	Exact learning of discretized concepts - Bshouty, Goldberg, et al. - 1994
4	On the ratio of optimal integral and fractional covers - asz - 1975
3	On-line prediction of depth two linear threshold circuits. Unpublished manuscript - Auer, Kwek, et al. - 1995
1	Almost optimal set covers in finite VC-dimenison - onnimann, H, et al. - 1994