$K$-Dimensional Coding Schemes in Hilbert Spaces

DOI10.1109/TIT.2010.2069250zbMath1366.94305OpenAlexW2167349346MaRDI 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

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

Related Items (17)

Adaptive Geometric Multiscale Approximations for Intrinsically Low-dimensional Data ⋮ A chain rule for the expected suprema of Gaussian processes ⋮ Empirical risk minimization for heavy-tailed losses ⋮ Reprint of: A forward-backward greedy approach for sparse multiscale learning ⋮ On Hölder fields clustering ⋮ Dimensionality-Dependent Generalization Bounds for k-Dimensional Coding Schemes ⋮ Alternating Proximal Regularized Dictionary Learning ⋮ Convergence radius and sample complexity of ITKM algorithms for dictionary learning ⋮ Learning sets with separating kernels ⋮ Testing the manifold hypothesis ⋮ Unnamed Item ⋮ Lower Bounds for Sparse Coding ⋮ On the identifiability of overcomplete dictionaries via the minimisation principle underlying K-SVD ⋮ Robust \(k\)-means clustering for distributions with two moments ⋮ A Vector-Contraction Inequality for Rademacher Complexities ⋮ A forward-backward greedy approach for sparse multiscale learning ⋮ Learning Finite-Dimensional Coding Schemes with Nonlinear Reconstruction Maps

This page was built for publication: $K$-Dimensional Coding Schemes in Hilbert Spaces