PAC learning of concept classes through the boundaries of their items
From MaRDI portal
(Redirected from Publication:1392018)
Recommendations
Cites work
- A formal theory of inductive inference. Part II
- A general lower bound on the number of examples needed for learning
- A theory of the learnable
- Estimation of dependences based on empirical data. Transl. from the Russian by Samuel Kotz
- scientific article; zbMATH DE number 53529 (Why is no real title available?)
- scientific article; zbMATH DE number 3277086 (Why is no real title available?)
- Learnability and the Vapnik-Chervonenkis dimension
- Non-Parametric Estimation II. Statistically Equivalent Blocks and Tolerance Regions--The Continuous Case
- Nonparametric Estimation, III. Statistically Equivalent Blocks and Multivariate Tolerance Regions--The Discontinuous Case
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Some special Vapnik-Chervonenkis classes
Cited in
(6)- Trial and error: A new approach to space-bounded learning
- \(P\)-sufficient statistics for PAC learning \(k\)-term-DNF formulas through enumeration
- The optimal PAC bound for intersection-closed concept classes
- Learning Theory
- Gaining degrees of freedom in subsymbolic learning
- Playing monotone games to understand learning behaviors
This page was built for publication: PAC learning of concept classes through the boundaries of their items
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1392018)