Pages that link to "Item:Q1209149"
From MaRDI portal
The following pages link to Bounding sample size with the Vapnik-Chervonenkis dimension (Q1209149):
Displaying 11 items.
- Learning with side information: PAC learning bounds (Q596314) (← links)
- Using the doubling dimension to analyze the generalization of learning algorithms (Q923877) (← links)
- Learning faster than promised by the Vapnik-Chervonenkis dimension (Q1124369) (← links)
- Combinatorics and connectionism (Q1313821) (← links)
- A result of Vapnik with applications (Q1314333) (← links)
- PAC-learning from general examples (Q1392015) (← links)
- A generalization of Sauer's lemma (Q1899068) (← links)
- An approach to guided learning of Boolean functions (Q1910784) (← links)
- The optimal sample complexity of PAC learning (Q2810825) (← links)
- Valid Generalisation from Approximate Interpolation (Q4715266) (← links)
- Improved bounds on the sample complexity of learning (Q5943102) (← links)