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):
Displaying 16 items.
- Learning union of integer hypercubes with queries (with applications to monadic decomposition) (Q832265) (← links)
- Lower bound methods and separation results for on-line learning models (Q1207301) (← links)
- 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)
- Intrinsic complexity of learning geometrical concepts from positive data (Q1877693) (← links)
- The bounded injury priority method and the learnability of unions of rectangles (Q1919530) (← links)
- A characterization of 2-threshold functions via pairs of prime segments (Q2136278) (← links)
- Learning and geometry: computational approaches. Based on the workshop, College Park, MD, USA, January 1991 (Q2563843) (← links)
- Behavioral shaping for geometric concepts (Q3174143) (← links)
- Sample Complexity Bounds on Differentially Private Learning via Communication Complexity (Q3454521) (← links)
- Learning Integer Lattices (Q3990652) (← links)
- Exact Learning of Discretized Geometric Concepts (Q4210170) (← links)
- (Q4998883) (← links)
- An optimal algorithm for proper learning of unions of two rectangles with queries (Q6085720) (← links)
