Probably Approximate Learning over Classes of Distributions
From MaRDI portal
Publication:4016907
Recommendations
Cited in
(17)- Embedding sample points uncertainty measures in learning algorithms
- Learning Structure Illuminates Black Boxes – An Introduction to Estimation of Distribution Algorithms
- Learning from rounded-off data.
- Lifting uniform learners via distributional decomposition
- Learning distributions by their density levels: A paradigm for learning without a teacher
- Decision theoretic generalizations of the PAC model for neural net and other learning applications
- Valid Generalisation from Approximate Interpolation
- Learning dynamical systems in a stationary environment
- Probably almost discriminative learning
- Sample size lower bounds in PAC learning by Algorithmic Complexity Theory
- On Learning Functions from Noise-Free and Noisy Samples via Occam's Razor
- Learnability with respect to fixed distributions
- Implementing Valiant's learnability theory using random sets.
- Equivalences between learning of data and probability distributions, and their applications
- Probably Approximate Learning of Sets and Functions
- Efficient distribution-free population learning of simple concepts
- PAC learning of probability distributions over a discrete domain.
This page was built for publication: Probably Approximate Learning over Classes of Distributions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4016907)
