Communications of the ACM
Computational limitations on learning from examples
Journal of the ACM (JACM)
Learnability and the Vapnik-Chervonenkis dimension
Journal of the ACM (JACM)
On learning a union of half spaces
Journal of Complexity
Training a 3-node neural network in NP-complete
Advances in neural information processing systems 1
Polynomial time algorithms for learning neural nets
COLT '90 Proceedings of the third annual workshop on Computational learning theory
Prediction-preserving reducibility
Journal of Computer and System Sciences - 3rd Annual Conference on Structure in Complexity Theory, June 14–17, 1988
A polynomial time algorithm that learns two hidden unit nets
Neural Computation
Fast identification of geometric objects with membership queries
COLT '91 Proceedings of the fourth annual workshop on Computational learning theory
Toward efficient agnostic learning
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
On the necessity of Occam algorithms
Theoretical Computer Science
On-line learning of rectangles in noisy environments
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
Geometrical concept learning and convex polytopes
COLT '94 Proceedings of the seventh annual conference on Computational learning theory
How fast can a threshold gate learn?
Proceedings of a workshop on Computational learning theory and natural learning systems (vol. 1) : constraints and prospects: constraints and prospects
On-Line Learning of Rectangles and Unions of Rectangles
Machine Learning - Special issue on computational learning theory, COLT'92
Learning with unreliable boundary queries
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
Concept learning with geometric hypotheses
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
More or less efficient agnostic learning of convex polygons
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
Noise-tolerant parallel learning of geometric concepts
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
Noise-tolerant distribution-free learning of general geometric concepts
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Learning of depth two neural networks with constant fan-in at the hidden nodes (extended abstract)
COLT '96 Proceedings of the ninth annual conference on Computational learning theory
Complexity theoretic hardness results for query learning
Computational Complexity
Machine Learning
Noise-tolerant distribution-free learning of general geometric concepts
Journal of the ACM (JACM)
| Hi-index | 0.00 |