Algorithms and lower bounds for on-line learning of geometrical concepts
From MaRDI portal
Publication:1329679
zbMath0808.68064MaRDI QIDQ1329679
Publication date: 12 July 1994
Published in: Machine Learning (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05)
Related Items (10)
Learning union of integer hypercubes with queries (with applications to monadic decomposition) ⋮ A characterization of 2-threshold functions via pairs of prime segments ⋮ On-line learning of rectangles and unions of rectangles ⋮ Sample Complexity Bounds on Differentially Private Learning via Communication Complexity ⋮ The bounded injury priority method and the learnability of unions of rectangles ⋮ Efficient learning with virtual threshold gates ⋮ An optimal algorithm for proper learning of unions of two rectangles with queries ⋮ Unnamed Item ⋮ The learnability of unions of two rectangles in the two-dimensional discretized space ⋮ On the limits of efficient teachability
This page was built for publication: Algorithms and lower bounds for on-line learning of geometrical concepts
