Pages that link to "Item:Q1183606"
From MaRDI portal
The following pages link to Equivalence of models for polynomial learnability (Q1183606):
Displaying 24 items.
- Four types of noise in data for PAC learning (Q673611) (← links)
- Teachability in computational learning (Q749233) (← links)
- From learning in the limit to stochastic finite learning (Q860825) (← links)
- Learning recursive functions: A survey (Q924164) (← links)
- Learning indexed families of recursive languages from positive data: A survey (Q924177) (← links)
- Knowing what doesn't matter: exploiting the omission of irrelevant data (Q1127363) (← links)
- Learning in parallel (Q1187024) (← links)
- Decision theoretic generalizations of the PAC model for neural net and other learning applications (Q1198550) (← links)
- Prediction, learning, uniform convergence, and scale-sensitive dimensions (Q1271550) (← links)
- Learning with unreliable boundary queries (Q1271553) (← links)
- Learning with restricted focus of attention (Q1271613) (← links)
- Noise-tolerant parallel learning of geometric concepts (Q1281499) (← links)
- Efficient distribution-free learning of probabilistic concepts (Q1329154) (← links)
- Nonuniform learnability (Q1329161) (← links)
- Halfspace learning, linear programming, and nonmalicious distributions (Q1336756) (← links)
- A theory for memory-based learning (Q1342731) (← links)
- A geometric approach to leveraging weak learners (Q1603593) (← links)
- Exploiting random walks for learning (Q1854545) (← links)
- Some connections between learning and optimization (Q1885804) (← links)
- Efficient algorithms for learning functions with bounded variation (Q1887165) (← links)
- Can PAC learning algorithms tolerate random attribute noise? (Q1894713) (← links)
- Learning from positive and unlabeled examples (Q2581364) (← links)
- PAC Learning under Helpful Distributions (Q2771492) (← links)
- On the non-efficient PAC learnability of conjunctive queries (Q6072217) (← links)
