Probably Approximate Learning of Sets and Functions
From MaRDI portal
(Redirected from Publication:3210201)
Recommendations
- Results on learnability and the Vapnik-Chervonenkis dimension
- Learnability and the Vapnik-Chervonenkis dimension
- Probably Approximate Learning over Classes of Distributions
- Learnability with respect to fixed distributions
- Characterizations of learnability for classes of \(\{0,\dots,n\}\)-valued functions
Cited in
(49)- Learning faster than promised by the Vapnik-Chervonenkis dimension
- On the relative sizes of learnable sets
- An introduction to some statistical aspects of PAC learning theory
- Learning dynamical systems in a stationary environment
- On the learnability of rich function classes
- Sparse approximate multiquadric interpolation
- First-order \(jk\)-clausal theories are PAC-learnable
- A sufficient condition for polynomial distribution-dependent learnability
- Learning distributions by their density levels: A paradigm for learning without a teacher
- On the complexity of learning from drifting distributions
- Learning nested differences in the presence of malicious noise
- A framework for incremental learning of logic programs
- Exact VC-dimension of Boolean monomials
- Apple tasting.
- Top-down decision tree learning as information based boosting
- Advanced elementary formal systems.
- Decision lists over regular patterns.
- Characterizations of learnability for classes of \(\{0,\dots,n\}\)-valued functions
- Fusion methods for multiple sensor systems with unknown error densities
- Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers
- Witness sets for families of binary vectors
- Learning figures with the Hausdorff metric by fractals -- towards computable binary classification
- PAC learning under helpful distributions
- Embeddings and the trace of finite sets
- Theory of Classification: a Survey of Some Recent Advances
- Learnability and the Vapnik-Chervonenkis dimension
- scientific article; zbMATH DE number 53984 (Why is no real title available?)
- Probably Approximate Learning over Classes of Distributions
- Learning Theory and Descriptive Set Theory
- Learning reliably and with one-sided error
- scientific article; zbMATH DE number 1081131 (Why is no real title available?)
- Learning with Natural Imprecision
- Learning with prior information
- scientific article; zbMATH DE number 1373681 (Why is no real title available?)
- Valid Generalisation from Approximate Interpolation
- scientific article; zbMATH DE number 1836430 (Why is no real title available?)
- Learning lipschitz functions
- Algorithmic Learning Theory
- Teaching randomized learners with feedback
- Learning logic programs with structured background knowledge
- Monotone term decision lists
- On approximately identifying concept classes in the limit
- Complexity of computing Vapnik-Chervonenkis dimension and some generalized dimensions
- Neural networks with quadratic VC dimension
- Results on learnability and the Vapnik-Chervonenkis dimension
- The learnability of voting rules
- Multi-class pattern classification using neural networks
- Measuring teachability using variants of the teaching dimension
- Implementing Valiant's learnability theory using random sets.
This page was built for publication: Probably Approximate Learning of Sets and Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3210201)
