Results on learnability and the Vapnik-Chervonenkis dimension

Recommendations

Learnability and the Vapnik-Chervonenkis dimension
Probably Approximate Learning of Sets and Functions
Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers
scientific article; zbMATH DE number 67631
Deciding the Vapnik-Červonenkis dimension is \(\Sigma_3^p\)-complete

Cites work

A general lower bound on the number of examples needed for learning
A theory of the learnable
Convergence of stochastic processes
Estimation of dependences based on empirical data. Transl. from the Russian by Samuel Kotz
scientific article; zbMATH DE number 4060753 (Why is no real title available?)
Inferring decision trees using the minimum description length principle
Learnability and the Vapnik-Chervonenkis dimension
Modeling by shortest data description
On finding a minimum dominating set in a tournament
On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities

Cited in

(39)

Learning faster than promised by the Vapnik-Chervonenkis dimension
The Vapnik-Chervonenkis dimension of decision trees with bounded rank
Bounding sample size with the Vapnik-Chervonenkis dimension
Self-directed learning and its relation to the VC-dimension and to teacher-directed learning
Localization vs. identification of semi-algebraic sets
Deciding the Vapnik-Červonenkis dimension is \(\Sigma_3^p\)-complete
Combinatorics and connectionism
Vapnik-Chervonenkis dimension and (pseudo-)hyperplane arrangements
PAC-learning from general examples
Sample complexity of model-based search
The complexity of theory revision
On limited nondeterminism and the complexity of the V-C dimension
A general lower bound on the number of examples needed for learning
On data classification by iterative linear partitioning
Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers
Using Vapnik-Chervonenkis dimension to analyze the testing complexity of program segments
Sample complexity for computational classification problems
On universal learning algorithms
scientific article; zbMATH DE number 434672 (Why is no real title available?)
Probably Approximate Learning of Sets and Functions
Estimate of a VCD image of a \(k\)-parametric template \(t = t[+,\cdot]\).
Learnability and the Vapnik-Chervonenkis dimension
scientific article; zbMATH DE number 4060740 (Why is no real title available?)
scientific article; zbMATH DE number 67609 (Why is no real title available?)
scientific article; zbMATH DE number 67631 (Why is no real title available?)
VC Dimension and Uniform Learnability of Sparse Polynomials and Rational Functions
The functions of finite support: a canonical learning problem
Extension of the PAC framework to finite and countable Markov chains
On the relations and differences between popper dimension, exclusion dimension and VC-dimension
Algorithmic Learning Theory
On ordinal VC-dimension and some notions of complexity
Quasipolynomiality of the Smallest Missing Induced Subgraph
From undecidability of non-triviality and finiteness to undecidability of learnability
The VC-dimension of a class of multiples of the primes and a connection to AdaBoost
Complexity of computing Vapnik-Chervonenkis dimension and some generalized dimensions
-approximations of k-label spaces
Metric entropy duality and the sample complexity of outcome indistinguishability
On ordinal VC-dimension and some notions of complexity
PAC learning, VC dimension, and the arithmetic hierarchy

This page was built for publication: Results on learnability and the Vapnik-Chervonenkis dimension

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q751859)