Communications of the ACM
A new polynomial-time algorithm for linear programming
Combinatorica
Linear function neurons: Structure and training
Biological Cybernetics
Computational limitations on learning from examples
Journal of the ACM (JACM)
Learnability and the Vapnik-Chervonenkis dimension
Journal of the ACM (JACM)
Mistake bounds and logarithmic linear-threshold learning algorithms
Mistake bounds and logarithmic linear-threshold learning algorithms
The perceptron algorithm is fast for nonmalicious distributions
Neural Computation
COLT '91 Proceedings of the fourth annual workshop on Computational learning theory
Redundant noisy attributes, attribute errors, and linear-threshold learning using winnow
COLT '91 Proceedings of the fourth annual workshop on Computational learning theory
Efficient noise-tolerant learning from statistical queries
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Circuit complexity and neural networks
Circuit complexity and neural networks
On the Size of Weights for Threshold Gates
SIAM Journal on Discrete Mathematics
Halfspace learning, linear programming, and nonmalicious distributions
Information Processing Letters
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
An introduction to computational learning theory
An introduction to computational learning theory
On specifying Boolean functions by labelled examples
Discrete Applied Mathematics
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
Large margin classification using the perceptron algorithm
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
Identification criteria and lower bounds for perceptron-like learning rules
Neural Computation
Machine Learning
Machine Learning
Machine Learning
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Learning noisy perceptrons by a perceptron in polynomial time
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
A polynomial-time algorithm for learning noisy linear threshold functions
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
EFFICIENT LEARNING WITH VIRTUAL THRESHOLD GATES
EFFICIENT LEARNING WITH VIRTUAL THRESHOLD GATES
On the sample complexity of PAC learning half-spaces against the uniform distribution
IEEE Transactions on Neural Networks
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
PAC Analogues of Perceptron and Winnow Via Boosting the Margin
Machine Learning
Experiments with Projection Learning
DS '02 Proceedings of the 5th International Conference on Discovery Science
Information Processing Letters
A new approximate maximal margin classification algorithm
The Journal of Machine Learning Research
Journal of Computer and System Sciences - STOC 2001
Learning intersections and thresholds of halfspaces
Journal of Computer and System Sciences - Special issue on FOCS 2002
Agnostically Learning Halfspaces
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Learning DNF from random walks
Journal of Computer and System Sciences - Special issue: Learning theory 2003
Noise Tolerant Variants of the Perceptron Algorithm
The Journal of Machine Learning Research
Analysis of perceptron-based active learning
COLT'05 Proceedings of the 18th annual conference on Learning Theory
Sublinear optimization for machine learning
Journal of the ACM (JACM)
| Hi-index | 0.00 |