Journal ArticleDOI
Learnability and the Vapnik-Chervonenkis dimension
Reads0
Chats0
TLDR
This paper shows that the essential condition for distribution-free learnability is finiteness of the Vapnik-Chervonenkis dimension, a simple combinatorial parameter of the class of concepts to be learned.Abstract:
Valiant's learnability model is extended to learning classes of concepts defined by regions in Euclidean space En. The methods in this paper lead to a unified treatment of some of Valiant's results, along with previous results on distribution-free convergence of certain pattern recognition algorithms. It is shown that the essential condition for distribution-free learnability is finiteness of the Vapnik-Chervonenkis dimension, a simple combinatorial parameter of the class of concepts to be learned. Using this parameter, the complexity and closure properties of learnable classes are analyzed, and the necessary and sufficient conditions are provided for feasible learnability.read more
Citations
More filters
Posted Content
Quadratic Upper Bound for Recursive Teaching Dimension of Finite VC Classes
TL;DR: In this article, the authors studied the relation between the recursive teaching dimension (RTD) and the VC dimension (VCD) of concept classes of finite sizes, and they showed a quadratic upper bound:
Journal ArticleDOI
The complexity of exact learning of acyclic conditional preference networks from swap examples
TL;DR: This article focuses on the frequently studied case of exact learning from so-called swap examples, which express preferences among objects that differ in only one attribute, and presents bounds on or exact values of some well-studied information complexity parameters, namely the VC dimension, the teaching dimension, and the recursive teaching dimension for classes of acyclic CP-nets.
Posted Content
On statistical learning via the lens of compression
TL;DR: In this article, it was shown that learnability is equivalent to compression of logarithmic sample size, and that uniform convergence implies compression of constant size for general learning problems.
Dynamic Automatic Model Selection
TL;DR: This thesis proposal investigates the issues involved in the selection of the appropriate model class for automatic model selection and describes the approach, which combines different model classes in the form of a model combination decision tree, which allows the best representation to be found for each subconcept of the learning task.
Posted Content
Stable Sample Compression Schemes: New Applications and an Optimal SVM Margin Bound
Steve Hanneke,Aryeh Kontorovich +1 more
TL;DR: A new margin bound for SVM is proved, removing a log factor, which is provably optimal and resolves a long-standing open question about the PAC margin bounds achievable by SVM.
References
More filters
Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Book
The Art of Computer Programming
TL;DR: The arrangement of this invention provides a strong vibration free hold-down mechanism while avoiding a large pressure drop to the flow of coolant fluid.
Journal ArticleDOI
Pattern Classification and Scene Analysis.
Book
Pattern classification and scene analysis
Richard O. Duda,Peter E. Hart +1 more
TL;DR: In this article, a unified, comprehensive and up-to-date treatment of both statistical and descriptive methods for pattern recognition is provided, including Bayesian decision theory, supervised and unsupervised learning, nonparametric techniques, discriminant analysis, clustering, preprosessing of pictorial data, spatial filtering, shape description techniques, perspective transformations, projective invariants, linguistic procedures, and artificial intelligence techniques for scene analysis.