Bounds for the computational power and learning complexity of analog neural nets
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Generalized teaching dimensions and the query complexity of learning
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
PAC learning intersections of halfspaces with membership queries (extended abstract)
COLT '96 Proceedings of the ninth annual conference on Computational learning theory
Identification criteria and lower bounds for perceptron-like learning rules
Neural Computation
On PAC learning using Winnow, Perceptron, and a Perceptron-like algorithm
COLT '99 Proceedings of the twelfth annual conference on Computational learning theory
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Some Formal Analysis of Rocchio's Similarity-Based Relevance Feedback Algorithm
Information Retrieval
PAC Analogues of Perceptron and Winnow Via Boosting the Margin
Machine Learning
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
Some Dichotomy Theorems for Neural Learning Problems
The Journal of Machine Learning Research
Every Linear Threshold Function has a Low-Weight Approximator
Computational Complexity
On the complexity of Rocchio's similarity-based relevance feedback algorithm
Journal of the American Society for Information Science and Technology
Learning Halfspaces with Malicious Noise
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Learning Halfspaces with Malicious Noise
The Journal of Machine Learning Research
Pseudorandom generators for polynomial threshold functions
Proceedings of the forty-second ACM symposium on Theory of computing
Semantic communication for simple goals is equivalent to on-line learning
ALT'11 Proceedings of the 22nd international conference on Algorithmic learning theory
Bounded Independence Fools Halfspaces
SIAM Journal on Computing
On exact learning halfspaces with random consistent hypothesis oracle
ALT'06 Proceedings of the 17th international conference on Algorithmic Learning Theory
On the complexity of rocchio's similarity-based relevance feedback algorithm
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Dimension, halfspaces, and the density of hard sets
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Low-weight halfspaces for sparse boolean vectors
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.00 |