Pages that link to "Item:Q1892207"
From MaRDI portal
The following pages link to Characterizations of learnability for classes of \(\{0,\dots,n\}\)-valued functions (Q1892207):
Displaying 11 items.
- Learning with stochastic inputs and adversarial outputs (Q439998) (← links)
- Corrigendum to ``Shifting: One-inclusion mistake bounds and sample compression'' (Q972387) (← links)
- Sphere packing numbers for subsets of the Boolean \(n\)-cube with bounded Vapnik-Chervonenkis dimension (Q1345876) (← links)
- Primal and dual combinatorial dimensions (Q2112665) (← links)
- Shifting: one-inclusion mistake bounds and sample compression (Q2517823) (← links)
- On the Complexity of Computing and Learning with Multiplicative Neural Networks (Q2780854) (← links)
- Sample Complexity of Classifiers Taking Values in ℝ<sup><i>Q</i></sup>, Application to Multi-Class SVMs (Q3562430) (← links)
- Inapproximability of Truthful Mechanisms via Generalizations of the Vapnik--Chervonenkis Dimension (Q4602545) (← links)
- Valid Generalisation from Approximate Interpolation (Q4715266) (← links)
- (Q5743481) (← links)
- Comments on: Support vector machines maximizing geometric margins for multi-class classification (Q5965492) (← links)
