Nonasymptotic bounds for vector quantization in Hilbert spaces
From MaRDI portal
Publication:2343956
DOI10.1214/14-AOS1293zbMath1314.62143arXiv1405.6672MaRDI QIDQ2343956
Publication date: 11 May 2015
Published in: The Annals of Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1405.6672
Related Items (8)
Robust Bregman clustering ⋮ Also for \(k\)-means: more data does not imply better performance ⋮ A \(k\)-points-based distance for robust geometric inference ⋮ A notion of stability for \(k\)-means clustering ⋮ Dimensionality-Dependent Generalization Bounds for k-Dimensional Coding Schemes ⋮ Clustering of measures via mean measure quantization ⋮ Robust \(k\)-means clustering for distributions with two moments ⋮ Nonasymptotic bounds for vector quantization in Hilbert spaces
Cites Work
- Unnamed Item
- Unnamed Item
- Fast rates for empirical vector quantization
- Optimal quantizers for Radon random vectors in a Banach space
- Risk bounds for statistical learning
- Concentration inequalities and model selection. Ecole d'Eté de Probabilités de Saint-Flour XXXIII -- 2003.
- Quantization and clustering with Bregman divergences
- Functional analysis, Sobolev spaces and partial differential equations
- A central limit theorem for k-means clustering
- Smooth discrimination analysis
- Foundations of quantization for probability distributions
- Nonasymptotic bounds for vector quantization in Hilbert spaces
- Local Rademacher complexities and oracle inequalities in risk minimization. (2004 IMS Medallion Lecture). (With discussions and rejoinder)
- Statistical performance of support vector machines
- Adaptive Noisy Clustering
- Improved Minimax Bounds on the Test and Training Distortion of Empirically Designed Vector Quantizers
- Individual Convergence Rates in Empirical Vector Quantizer Design
- On the Performance of Clustering in Hilbert Spaces
- The minimax distortion redundancy in empirical quantizer design
- 10.1162/153244303321897690
- Rates of convergence in the source coding theorem, in empirical quantizer design, and in universal lossy source coding
- Projection-based curve clustering
- Introduction to nonparametric estimation
This page was built for publication: Nonasymptotic bounds for vector quantization in Hilbert spaces
