Pages that link to "Item:Q1329679"
From MaRDI portal
The following pages link to Algorithms and lower bounds for on-line learning of geometrical concepts (Q1329679):
Displayed 6 items.
- On-line learning of rectangles and unions of rectangles (Q1342733) (← links)
- Efficient learning with virtual threshold gates (Q1383714) (← links)
- On the limits of efficient teachability (Q1603392) (← links)
- The learnability of unions of two rectangles in the two-dimensional discretized space (Q1807675) (← links)
- The bounded injury priority method and the learnability of unions of rectangles (Q1919530) (← links)
- Sample Complexity Bounds on Differentially Private Learning via Communication Complexity (Q3454521) (← links)