An optimal algorithm for proper learning of unions of two rectangles with queries

DOI10.1007/bfb0030848zbMath1527.68100OpenAlexW1551980872MaRDI QIDQ6085720

Zhixiang Chen

Publication date: 12 December 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0030848

Mathematics Subject Classification ID

Computational learning theory (68Q32) Online algorithms; streaming algorithms (68W27)

Related Items (1)

Learning union of integer hypercubes with queries (with applications to monadic decomposition)

Cites Work

• Unnamed Item
• On the limits of proper learnability of subclasses of DNF formulas
• Algorithms and lower bounds for on-line learning of geometrical concepts
• On-line learning of rectangles and unions of rectangles
• Fast identification of geometric objects with membership queries
• The bounded injury priority method and the learnability of unions of rectangles
• Queries and concept learning
• Read-twice DNF formulas are properly learnable
• 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: An optimal algorithm for proper learning of unions of two rectangles with queries