On the complexity of learning for a spiking neuron (extended abstract)
COLT '97 Proceedings of the tenth annual conference on Computational learning theory
Learning probabilistically consistent linear threshold functions
COLT '97 Proceedings of the tenth annual conference on Computational learning theory
Automatic Construction of Decision Trees from Data: A Multi-Disciplinary Survey
Data Mining and Knowledge Discovery
Hardness results for neural network approximation problems
Theoretical Computer Science
Training a single sigmoidal neuron is hard
Neural Computation
ICANN '02 Proceedings of the International Conference on Artificial Neural Networks
Hardness Results for Neural Network Approximation Problems
EuroCOLT '99 Proceedings of the 4th European Conference on Computational Learning Theory
On Approximate Learning by Multi-layered Feedforward Circuits
ALT '00 Proceedings of the 11th International Conference on Algorithmic Learning Theory
Minimizing the Quadratic Training Error of a Sigmoid Neuron Is Hard
ALT '01 Proceedings of the 12th International Conference on Algorithmic Learning Theory
Maximizing Agreements and CoAgnostic Learning
ALT '02 Proceedings of the 13th International Conference on Algorithmic Learning Theory
Bounds for the Minimum Disagreement Problem with Applications to Learning Theory
COLT '02 Proceedings of the 15th Annual Conference on Computational Learning Theory
Optimizing search engines using clickthrough data
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
On the difficulty of approximately maximizing agreements
Journal of Computer and System Sciences
Online learning of linear classifiers
Advanced lectures on machine learning
Pseudorandom functions in TC0 and cryptographic limitations to proving lower bounds
Computational Complexity
Leveraging the margin more carefully
ICML '04 Proceedings of the twenty-first international conference on Machine learning
Some Dichotomy Theorems for Neural Learning Problems
The Journal of Machine Learning Research
On Robustness Properties of Convex Risk Minimization Methods for Pattern Recognition
The Journal of Machine Learning Research
Some connections between learning and optimization
Discrete Applied Mathematics - Discrete mathematics & data mining (DM & DM)
Loading Deep Networks Is Hard: The Pyramidal Case
Neural Computation
On the Nonlearnability of a Single Spiking Neuron
Neural Computation
Discriminative Reranking for Natural Language Parsing
Computational Linguistics
Maximizing agreements and coagnostic learning
Theoretical Computer Science - Algorithmic learning theory(ALT 2002)
On approximate learning by multi-layered feedforward circuits
Theoretical Computer Science - Algorithmic learning theory (ALT 2000)
Self-improved gaps almost everywhere for the agnostic approximation of monomials
Theoretical Computer Science
Minimum risk annealing for training log-linear models
COLING-ACL '06 Proceedings of the COLING/ACL on Main conference poster sessions
On learning linear ranking functions for beam search
Proceedings of the 24th international conference on Machine learning
Mining User preference using Spy voting for search engine personalization
ACM Transactions on Internet Technology (TOIT)
On ranking techniques for desktop search
ACM Transactions on Information Systems (TOIS)
Boosting method for local learning in statistical pattern recognition
Neural Computation
Robust support vector machine training via convex outlier ablation
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Some connections between learning and optimization
Discrete Applied Mathematics
Boosting with pairwise constraints
Neurocomputing
Learning Linear Ranking Functions for Beam Search with Application to Planning
The Journal of Machine Learning Research
Spying out accurate user preferences for search engine adaptation
WebKDD'04 Proceedings of the 6th international conference on Knowledge Discovery on the Web: advances in Web Mining and Web Usage Analysis
A framework for personalizing web search with concept-based user profiles
ACM Transactions on Internet Technology (TOIT)
Sparse weighted voting classifier selection and its linear programming relaxations
Information Processing Letters
An Epicurean learning approach to gene-expression data classification
Artificial Intelligence in Medicine
Measuring overlap in binary regression
Computational Statistics & Data Analysis
Hi-index | 0.00 |