scientific article; zbMATH DE number 67636
From MaRDI portal
Publication:4013557
Recommendations
Cited in
(23)- Equivalence of models for polynomial learnability
- Efficient distribution-free population learning of simple concepts
- Efficient distribution-free learning of probabilistic concepts
- Nonuniform learnability
- Three fundamental concepts of the capacity of learning machines
- Simple translation-invariant concepts are hard to learn
- Characterizing rational versus exponential learning curves
- Equivalences between learning of data and probability distributions, and their applications
- Learning by distances
- PAC learning under helpful distributions
- On the learnability of discrete distributions
- On universal learning algorithms
- A theory of the learnable
- scientific article; zbMATH DE number 4060753 (Why is no real title available?)
- Learning Simple Concepts under Simple Distributions
- scientific article; zbMATH DE number 67611 (Why is no real title available?)
- scientific article; zbMATH DE number 1081131 (Why is no real title available?)
- scientific article; zbMATH DE number 2077159 (Why is no real title available?)
- scientific article; zbMATH DE number 2080654 (Why is no real title available?)
- Some contributions to fixed-distribution learning theory
- scientific article; zbMATH DE number 1400207 (Why is no real title available?)
- Algorithmic Learning Theory
- Implementing Valiant's learnability theory using random sets.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4013557)