Pages that link to "Item:Q751859"
From MaRDI portal
The following pages link to Results on learnability and the Vapnik-Chervonenkis dimension (Q751859):
Displaying 28 items.
- On universal learning algorithms (Q287154) (← links)
- Complexity of computing Vapnik-Chervonenkis dimension and some generalized dimensions (Q674405) (← links)
- \(\varepsilon\)-approximations of \(k\)-label spaces (Q674408) (← links)
- On ordinal VC-dimension and some notions of complexity (Q860824) (← links)
- PAC learning, VC dimension, and the arithmetic hierarchy (Q892140) (← links)
- Learning faster than promised by the Vapnik-Chervonenkis dimension (Q1124369) (← links)
- The Vapnik-Chervonenkis dimension of decision trees with bounded rank (Q1182084) (← links)
- Bounding sample size with the Vapnik-Chervonenkis dimension (Q1209149) (← links)
- Self-directed learning and its relation to the VC-dimension and to teacher-directed learning (Q1275348) (← links)
- Localization vs. identification of semi-algebraic sets (Q1275351) (← links)
- Deciding the Vapnik-Červonenkis dimension is \(\Sigma_3^p\)-complete (Q1305933) (← links)
- Combinatorics and connectionism (Q1313821) (← links)
- Vapnik-Chervonenkis dimension and (pseudo-)hyperplane arrangements (Q1338464) (← links)
- PAC-learning from general examples (Q1392015) (← links)
- Sample complexity of model-based search (Q1567400) (← links)
- The complexity of theory revision (Q1606294) (← links)
- On limited nondeterminism and the complexity of the V-C dimension (Q1816725) (← links)
- A general lower bound on the number of examples needed for learning (Q1823011) (← links)
- On data classification by iterative linear partitioning (Q1885803) (← links)
- Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers (Q1900973) (← links)
- Using Vapnik-Chervonenkis dimension to analyze the testing complexity of program segments (Q1923104) (← links)
- Fat-shattering and the learnability of real-valued functions (Q1924381) (← links)
- Sample complexity for computational classification problems (Q2461637) (← links)
- Scale-sensitive dimensions, uniform convergence, and learnability (Q4377590) (← links)
- The functions of finite support: a canonical learning problem (Q4421250) (← links)
- Algorithmic Learning Theory (Q5897378) (← links)
- Quasipolynomiality of the Smallest Missing Induced Subgraph (Q6051910) (← links)
- From undecidability of non-triviality and finiteness to undecidability of learnability (Q6064265) (← links)
