Adaptive metric dimensionality reduction
From MaRDI portal
Recommendations
Cites work
- 10.1162/153244303321897690
- 10.1162/153244303322753643
- 10.1162/1532443041424337
- A tree-based regressor that adapts to intrinsic dimension
- All of Nonparametric Statistics
- Dimension reduction: a guided tour
- Distance-based classification with Lipschitz functions
- Efficient Classification for Metric Data
- Empirical margin distributions and bounding the generalization error of combined classifiers
- Entropy and the combinatorial dimension
- Foundations of machine learning
- Generalization performance of regularization networks and support vector machines via entropy numbers of compact operators
- scientific article; zbMATH DE number 5957198 (Why is no real title available?)
- scientific article; zbMATH DE number 49190 (Why is no real title available?)
- scientific article; zbMATH DE number 6469222 (Why is no real title available?)
- Kernels as features: on kernels, margins, and low-dimensional mappings
- Learning Theory
- Linear Dimensionality Reduction for Margin-Based Classification: High-Dimensional Data and Sensor Networks
- Maximal margin classification for metric spaces
- Modern multidimensional scaling. Theory and applications.
- Nonlinear Dimensionality Reduction
- On the nonexistence of uniform homeomorphisms between \(L^ p\)-spaces
- Planar Earthmover Is Not in L₁
- Proximity algorithms for nearly-doubling spaces
- Random design analysis of ridge regression
- Reproducing kernel Banach spaces for machine learning
- Searching dynamic point sets in spaces with bounded doubling dimension
- Statistical performance of support vector machines
- Structural risk minimization over data-dependent hierarchies
- The computational hardness of estimating edit distance
- Understanding machine learning. From theory to algorithms
- Uniform Central Limit Theorems
Cited in
(10)- Non-uniform packings
- Adaptive Metric Dimensionality Reduction
- Active nearest-neighbor learning in metric spaces
- An Adaptive Estimation of Dimension Reduction Space
- Out-of-distributional risk bounds for neural operators with applications to the Helmholtz equation
- Efficient Kirszbraun extension with applications to regression
- Efficient agnostic learning with average smoothness
- Covering number of real algebraic varieties and beyond: improved bounds and applications
- Non-parametric binary regression in metric spaces with logarithmic loss
- A unified view of adaptive variable-metric projection algorithms
This page was built for publication: Adaptive metric dimensionality reduction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5964069)