K-Dimensional Coding Schemes in Hilbert Spaces
From MaRDI portal
Recommendations
- Generalization Bounds for K-Dimensional Coding Schemes in Hilbert Spaces
- scientific article; zbMATH DE number 3930883
- Dimensionality-dependent generalization bounds for \(k\)-dimensional coding schemes
- Canonical codings of \(\mathbb{N}{}^ k\)
- Entropy encoding, Hilbert space, and Karhunen-Loève transforms
- scientific article; zbMATH DE number 140079
- Optimal codes in the Enomoto-Katona space
- STACS 2005
- Varieties of codes and Kraft inequality
- Kneser-Hecke-operators in coding theory
Cited in
(18)- Convergence radius and sample complexity of ITKM algorithms for dictionary learning
- On Hölder fields clustering
- Robust \(k\)-means clustering for distributions with two moments
- A forward-backward greedy approach for sparse multiscale learning
- Learning sets with separating kernels
- Reprint of: A forward-backward greedy approach for sparse multiscale learning
- Lower bounds for sparse coding
- A Vector-Contraction Inequality for Rademacher Complexities
- A chain rule for the expected suprema of Gaussian processes
- Entropy encoding, Hilbert space, and Karhunen-Loève transforms
- Local identifiability of \(\ell_1\)-minimization dictionary learning: a sufficient and almost necessary condition
- Learning finite-dimensional coding schemes with nonlinear reconstruction maps
- Adaptive geometric multiscale approximations for intrinsically low-dimensional data
- Dimensionality-dependent generalization bounds for \(k\)-dimensional coding schemes
- Alternating proximal regularized dictionary learning
- Testing the manifold hypothesis
- On the identifiability of overcomplete dictionaries via the minimisation principle underlying K-SVD
- Empirical risk minimization for heavy-tailed losses
This page was built for publication: $K$-Dimensional Coding Schemes in Hilbert Spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5281235)
