Generalization Bounds for K-Dimensional Coding Schemes in Hilbert Spaces

Authors:
Andreas Maurer;Massimiliano Pontil
Affiliations:
, München, Germany D-80799;Dept. of Computer Science, University College London, Malet Pl, London, UK WC1E
Venue:
ALT '08 Proceedings of the 19th international conference on Algorithmic Learning Theory
Year:
2008

Citing 6
Cited 1

Rademacher and gaussian complexities: risk bounds and structural results

The Journal of Machine Learning Research
Non-negative Matrix Factorization with Sparseness Constraints

The Journal of Machine Learning Research
Statistical properties of kernel principal component analysis

Machine Learning
The minimax distortion redundancy in empirical quantizer design

IEEE Transactions on Information Theory
On the eigenspectrum of the gram matrix and the generalization error of kernel-PCA

IEEE Transactions on Information Theory
On the Performance of Clustering in Hilbert Spaces

IEEE Transactions on Information Theory

K-dimensional coding schemes in Hilbert spaces

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.06

Visualization

Abstract

We give a bound on the expected reconstruction error for a general coding method where data in a Hilbert space are represented by finite dimensional coding vectors. The result can be specialized to K-means clustering, nonnegative matrix factorization and the sparse coding techniques introduced by Olshausen and Field.