The bounded injury priority method and the learnability of unions of rectangles

DOI10.1016/0168-0072(95)00019-4zbMath0852.68079OpenAlexW2068895479MaRDI QIDQ1919530

Zhixiang Chen, Homer, Steven

Publication date: 13 October 1996

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-0072(95)00019-4

zbMATH Keywords

recursion theorylearnabilityfinite injury priority method

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Abstract and axiomatic computability and recursion theory (03D75)

Related Items (5)

Efficient learning with virtual threshold gates ⋮ An optimal algorithm for proper learning of unions of two rectangles with queries ⋮ Learning unions of \(\omega(1)\)-dimensional rectangles ⋮ The learnability of unions of two rectangles in the two-dimensional discretized space ⋮ Noise-tolerant parallel learning of geometric concepts

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lower bound methods and separation results for on-line learning models
• Algorithms and lower bounds for on-line learning of geometrical concepts
• On-line learning of rectangles and unions of rectangles
• An efficient membership-query algorithm for learning DNF with respect to the uniform distribution
• Queries and concept learning
• TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
• Learnability and the Vapnik-Chervonenkis dimension
• A theory of the learnable
• Computational limitations on learning from examples
• Exact Learning of Discretized Geometric Concepts

This page was built for publication: The bounded injury priority method and the learnability of unions of rectangles