Pages that link to "Item:Q923877"
From MaRDI portal
The following pages link to Using the doubling dimension to analyze the generalization of learning algorithms (Q923877):
Displaying 7 items.
- VC bounds on the cardinality of nearly orthogonal function classes (Q418881) (← links)
- Two proofs for shallow packings (Q728497) (← links)
- Localization of VC classes: beyond local Rademacher complexities (Q1663641) (← links)
- Non-uniform packings (Q2059874) (← links)
- When are epsilon-nets small? (Q2304628) (← links)
- Active Nearest-Neighbor Learning in Metric Spaces (Q4558521) (← links)
- On the Impossibility of Dimension Reduction for Doubling Subsets of $\ell_{p}$ (Q5499733) (← links)
