Pages that link to "Item:Q2499543"
From MaRDI portal
The following pages link to An algorithmic theory of learning: Robust concepts and random projection (Q2499543):
Displayed 10 items.
- On the hardness of learning intersections of two halfspaces (Q619909) (← links)
- Randomized anisotropic transform for nonlinear dimensionality reduction (Q623745) (← links)
- An algorithmic theory of learning: robust concepts and random projection (Q851862) (← links)
- Kernels as features: on kernels, margins, and low-dimensional mappings (Q851869) (← links)
- Complexity measures of sign matrices (Q949752) (← links)
- Fast dimension reduction using Rademacher series on dual BCH codes (Q1042451) (← links)
- Learning intersections of halfspaces with a margin (Q2462501) (← links)
- An algorithmic theory of learning: Robust concepts and random projection (Q2499543) (← links)
- Random Projection RBF Nets for Multidimensional Density Estimation (Q3601357) (← links)
- Fast Parallel Estimation of High Dimensional Information Theoretical Quantities with Low Dimensional Random Projection Ensembles (Q3614946) (← links)