Composite geometric concepts and polynomial predictability

DOI10.1006/INCO.1994.1071MaRDI QIDQ1333260zbMATH OpenOpenAlexFDO

Authors Philip M. Long, Manfred K. Warmuth

Publication date 3 October 1995

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/inco.1994.1071

zbMATH Keywords

Occam algorithmprediction problem

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• scientific article; zbMATH DE number 996387
• Prediction and dimension
• scientific article; zbMATH DE number 2089375
• Exact Learning of Discretized Geometric Concepts

Cited in

(6)

• Noise-tolerant parallel learning of geometric concepts
• Learning an intersection of a constant number of halfspaces over a uniform distribution
• An efficient membership-query algorithm for learning DNF with respect to the uniform distribution
• On the complexity of function learning
• Learning unions of high-dimensional boxes over the reals
• scientific article; zbMATH DE number 996387 (Why is no real title available?)

This page was built for publication: Composite geometric concepts and polynomial predictability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1333260)