The following pages link to (Q4013527):
Displaying 6 items.
- Equivalence of models for polynomial learnability (Q1183606) (← links)
- Decision theoretic generalizations of the PAC model for neural net and other learning applications (Q1198550) (← links)
- A statistical approach to adaptive problem solving (Q1391900) (← links)
- The PAC-learnability of planning algorithms: Investigating simple planning domains (Q1818761) (← links)
- Sample Complexity of Classifiers Taking Values in ℝ<sup><i>Q</i></sup>, Application to Multi-Class SVMs (Q3562430) (← links)
- The gap between abstract and concrete results in machine learning (Q4009244) (← links)
