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)
68Q25: Analysis of algorithms and problem complexity
68T05: Learning and adaptive systems in artificial intelligence
Related Items
On-line learning of rectangles and unions of rectangles, Efficient learning with virtual threshold gates, On the limits of efficient teachability, The learnability of unions of two rectangles in the two-dimensional discretized space, The bounded injury priority method and the learnability of unions of rectangles, Sample Complexity Bounds on Differentially Private Learning via Communication Complexity