Pages that link to "Item:Q1780448"
From MaRDI portal
The following pages link to New lower bounds for statistical query learning (Q1780448):
Displaying 6 items.
- A complete characterization of statistical query learning with applications to evolvability (Q439989) (← links)
- Unconditional lower bounds for learning intersections of halfspaces (Q1009217) (← links)
- General bounds on statistical query learning and PAC learning with noise via hypothesis boosting (Q1271468) (← links)
- General lower bounds on the query complexity within the exact learning model (Q1841883) (← links)
- Characterizing Statistical Query Learning: Simplified Notions and Proofs (Q3648752) (← links)
- Polynomial‐time universality and limitations of deep learning (Q6074573) (← links)