K-Dimensional Coding Schemes in Hilbert Spaces

DOI10.1109/TIT.2010.2069250zbMATH Open1366.94305OpenAlexW2167349346MaRDI QIDQ5281235FDOQ5281235

Authors: Andreas Maurer, Massimiliano Pontil 

Publication date: 27 July 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2010.2069250

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

Mathematics Subject Classification ID

Source coding (94A29) Equations and inequalities involving linear operators, with vector unknowns (47A50)

Cited In (18)

• Testing the manifold hypothesis
• Convergence radius and sample complexity of ITKM algorithms for dictionary learning
• Dimensionality-dependent generalization bounds for \(k\)-dimensional coding schemes
• Alternating proximal regularized dictionary learning
• Lower bounds for sparse coding
• On the identifiability of overcomplete dictionaries via the minimisation principle underlying K-SVD
• Entropy encoding, Hilbert space, and Karhunen-Loève transforms
• Robust \(k\)-means clustering for distributions with two moments
• Learning finite-dimensional coding schemes with nonlinear reconstruction maps
• Adaptive geometric multiscale approximations for intrinsically low-dimensional data
• A chain rule for the expected suprema of Gaussian processes
• Local identifiability of \(\ell_1\)-minimization dictionary learning: a sufficient and almost necessary condition
• Empirical risk minimization for heavy-tailed losses
• Reprint of: A forward-backward greedy approach for sparse multiscale learning
• Learning sets with separating kernels
• A Vector-Contraction Inequality for Rademacher Complexities
• A forward-backward greedy approach for sparse multiscale learning
• On Hölder fields clustering

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)