Pages that link to "Item:Q1207301"
From MaRDI portal
The following pages link to Lower bound methods and separation results for on-line learning models (Q1207301):
Displaying 21 items.
- Theory revision with queries: Horn, read-once, and parity formulas (Q814598) (← links)
- Learning conditional preference networks (Q991013) (← links)
- Noise-tolerant parallel learning of geometric concepts (Q1281499) (← links)
- On-line learning of rectangles and unions of rectangles (Q1342733) (← links)
- VC-dimensions of finite automata and commutative finite automata with \(k\) letters and \(n\) states (Q1356504) (← links)
- Efficient learning with virtual threshold gates (Q1383714) (← links)
- Learning unions of tree patterns using queries (Q1390942) (← links)
- Queries revisited. (Q1426146) (← links)
- Structural results about exact learning with unspecified attribute values (Q1567399) (← links)
- General lower bounds on the query complexity within the exact learning model (Q1841883) (← links)
- The query complexity of finding local minima in the lattice (Q1854471) (← links)
- Learning elementary formal systems with queries. (Q1874227) (← links)
- On the complexity of function learning (Q1900975) (← links)
- The bounded injury priority method and the learnability of unions of rectangles (Q1919530) (← links)
- Revising threshold functions (Q2381577) (← links)
- Complexity parameters for first order classes (Q2433181) (← links)
- Exact learning from an honest teacher that answers membership queries (Q2636406) (← links)
- Exact Learning of Discretized Geometric Concepts (Q4210170) (← links)
- (Q4998883) (← links)
- Combinatorial results on the complexity of teaching and learning (Q5096898) (← links)
- VC-dimensions of finite automata and commutative finite automata with \(k\) letters and \(n\) states (Q5967074) (← links)
