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):
Displaying 37 items.
- Real-valued embeddings and sketches for fast distance and similarity estimation (Q508585) (← links)
- 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)
- Approximate polytope ensemble for one-class classification (Q898344) (← links)
- Complexity measures of sign matrices (Q949752) (← links)
- Fast dimension reduction using Rademacher series on dual BCH codes (Q1042451) (← links)
- Efficient clustering on Riemannian manifolds: a kernelised random projection approach (Q1669725) (← links)
- The hardest halfspace (Q1983325) (← links)
- On the perceptron's compression (Q2106618) (← links)
- A simple test for zero multiple correlation coefficient in high-dimensional normal data using random projection (Q2189584) (← links)
- Distance geometry and data science (Q2192022) (← links)
- Randomized large distortion dimension reduction (Q2253922) (← links)
- MREKLM: a fast multiple empirical kernel learning machine (Q2289596) (← links)
- Random projections as regularizers: learning a linear discriminant from fewer observations than dimensions (Q2353006) (← links)
- Learning intersections of halfspaces with a margin (Q2462501) (← links)
- An algorithmic theory of learning: Robust concepts and random projection (Q2499543) (← links)
- Sparse Learning for Large-Scale and High-Dimensional Data: A Randomized Convex-Concave Optimization Approach (Q2830269) (← links)
- Random projections and Hotelling’s T2 statistics for change detection in high-dimensional data streams (Q2872879) (← links)
- Almost Optimal Explicit Johnson-Lindenstrauss Families (Q3088132) (← links)
- Sparser Johnson-Lindenstrauss Transforms (Q3189639) (← 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)
- Randomized Complete Pivoting for Solving Symmetric Indefinite Linear Systems (Q4556022) (← links)
- Randomized algorithms in numerical linear algebra (Q4594242) (← links)
- Sign rank versus Vapnik-Chervonenkis dimension (Q4610199) (← links)
- Optimal Bounds for Johnson-Lindenstrauss Transformations (Q4614115) (← links)
- Bioinspired Random Projections for Robust, Sparse Classification (Q5056926) (← links)
- (Q5090436) (← links)
- Structure from Randomness in Halfspace Learning with the Zero-One Loss (Q5139592) (← links)
- Visual Categorization with Random Projection (Q5380331) (← links)
- On the Impossibility of Dimension Reduction for Doubling Subsets of $\ell_{p}$ (Q5499733) (← links)
- (Q5743469) (← links)
- Optimal bounds for sign-representing the intersection of two halfspaces by polynomials (Q5891428) (← links)
- \( \varepsilon \)-isometric dimension reduction for incompressible subsets of \(\ell_p\) (Q6145674) (← links)
- Random Projection and Recovery for High Dimensional Optimization with Arbitrary Outliers (Q6173264) (← links)
