Characterizations of learnability for classes of \0,,n\-valued functions
From MaRDI portal
Publication:1892207
Recommendations
Cited in
(31)- On the learnability of rich function classes
- A result of Vapnik with applications
- Sphere packing numbers for subsets of the Boolean \(n\)-cube with bounded Vapnik-Chervonenkis dimension
- PAC-learning from general examples
- Efficient algorithms for learning functions with bounded variation
- On the complexity of function learning
- Fat-shattering and the learnability of real-valued functions
- PAC learnability under non-atomic measures: a problem by Vidyasagar
- Primal and dual combinatorial dimensions
- Shifting: one-inclusion mistake bounds and sample compression
- On the complexity of computing and learning with multiplicative neural networks
- Higher dimensional PAC learning
- scientific article; zbMATH DE number 1804109 (Why is no real title available?)
- Probably Approximate Learning of Sets and Functions
- Learnability and the Vapnik-Chervonenkis dimension
- Learning-Related Complexity of Linear Ranking Functions
- Sample Complexity of Classifiers Taking Values in ℝQ, Application to Multi-Class SVMs
- scientific article; zbMATH DE number 67635 (Why is no real title available?)
- Scale-sensitive dimensions, uniform convergence, and learnability
- Learning with stochastic inputs and adversarial outputs
- Inapproximability of truthful mechanisms via generalizations of the Vapnik-Chervonenkis dimension
- Valid Generalisation from Approximate Interpolation
- PAC learnability of a concept class under non-atomic measures: a problem by Vidyasagar
- Learning Nested Halfspaces and Uphill Decision Trees
- Data reduction for weighted and outlier-resistant clustering
- Comments on: Support vector machines maximizing geometric margins for multi-class classification
- Multiclass learnability does not imply sample compression
- The dimension of self-directed learning
- A characterization of multioutput learnability
- Improved generalization bounds for robust learning
- Corrigendum to ``Shifting: One-inclusion mistake bounds and sample compression
This page was built for publication: Characterizations of learnability for classes of \(\{0,\dots,n\}\)-valued functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1892207)
