scientific article; zbMATH DE number 67626

MaRDI QIDQ4013546zbMATH OpenFDO

Authors Shai Ben-David, Gyora M. Benedek, Yishay Mansour

Publication date 27 September 1992

zbMATH Keywords

proximityuniformitymodels of computational learnabilitysolid learnability

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Learnability with respect to fixed distributions
• Learnability and the Vapnik-Chervonenkis dimension
• scientific article; zbMATH DE number 4060753
• Nonuniform learnability
• Equivalence of models for polynomial learnability

Cited in

(8)

• A sufficient condition for polynomial distribution-dependent learnability
• A no-free-lunch theorem for multitask learning
• Parameterized learnability of juntas
• A learning theory approach to the construction of predictor models
• Parametric version space approach to concept learning
• Combinatorics and connectionism
• Learning the Parameters of a Non Compensatory Sorting Model
• On the complexity of learning from drifting distributions

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 Q4013546)