K-Dimensional Coding Schemes in Hilbert Spaces

This paper presents a general coding method where data in a Hilbert space are represented by finite dimensional coding vectors. The method is based on empirical risk minimization within a certain class of linear operators, which map the set of coding vectors to the Hilbert space. Two results bounding the expected reconstruction error of the method are derived, which highlight the role played by the codebook and the class of linear operators. The results are specialized to some cases of practical importance, including K-means clustering, nonnegative matrix factorization and other sparse coding methods.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/03/2016

Dimensionality-Dependent Generalization Bounds for k-Dimensional Coding Schemes

The k-dimensional coding schemes refer to a collection of methods that a...
research
08/30/2014

Kernel Coding: General Formulation and Special Cases

Representing images by compact codes has proven beneficial for many visu...
research
05/31/2011

Approximation properties of certain operator-induced norms on Hilbert spaces

We consider a class of operator-induced norms, acting as finite-dimensio...
research
12/23/2018

Learning finite-dimensional coding schemes with nonlinear reconstruction maps

This paper generalizes the Maurer--Pontil framework of finite-dimensiona...
research
01/06/2016

Encoding and Decoding Algorithms for Arbitrary Dimensional Hilbert Order

Hilbert order is widely applied in many areas. However, most of the algo...

Please sign up or login with your details

Forgot password? Click here to reset