$K$-Dimensional Coding Schemes in Hilbert Spaces

DOI10.1109/TIT.2010.2069250zbMath1366.94305MaRDI QIDQ5281235

Massimiliano Pontil, Andreas Maurer

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

Mathematics Subject Classification ID

47A50: Equations and inequalities involving linear operators, with vector unknowns

94A29: Source coding

Related Items

Unnamed Item, 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, A chain rule for the expected suprema of Gaussian processes, On the identifiability of overcomplete dictionaries via the minimisation principle underlying K-SVD, Empirical risk minimization for heavy-tailed losses, 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