Dimensionality-dependent generalization bounds for k-dimensional coding schemes
From MaRDI portal
(Redirected from Dimensionality-dependent generalization bounds for k-dimensional coding schemes)
Dimensionality-dependent generalization bounds for \(k\)-dimensional coding schemes
Dimensionality-dependent generalization bounds for \(k\)-dimensional coding schemes
Lua error in Module:PublicationMSCList at line 28: attempt to call field 'getDbData' (a nil value).
Lua error in Module:PublicationShowAbstract at line 21: attempt to call field 'getDbData' (a nil value).
Recommendations
- Generalization Bounds for K-Dimensional Coding Schemes in Hilbert Spaces
- Learning finite-dimensional coding schemes with nonlinear reconstruction maps
- The sample complexity of dictionary learning
- Lower bounds for sparse coding
- Learning Bounds for Kernel Regression Using Effective Data Dimensionality
Cites work
- K-Dimensional Coding Schemes in Hilbert Spaces
- 10.1162/153244302760200713
- 10.1162/153244303321897690
- A central limit theorem for k-means clustering
- A Hebbian/Anti-Hebbian Neural Network for Linear Subspace Learning: A Derivation from Multidimensional Scaling of Streaming Data
- A local search approximation algorithm for \(k\)-means clustering
- Adaptive Relevance Matrices in Learning Vector Quantization
- Atomic Decomposition by Basis Pursuit
- Concentration inequalities. A nonasymptotic theory of independence
- Distance Learning in Discriminative Vector Quantization
- Fast rates for empirical vector quantization
- scientific article; zbMATH DE number 3469876 (Why is no real title available?)
- scientific article; zbMATH DE number 893887 (Why is no real title available?)
- scientific article; zbMATH DE number 1391397 (Why is no real title available?)
- scientific article; zbMATH DE number 3340881 (Why is no real title available?)
- Improved Minimax Bounds on the Test and Training Distortion of Empirically Designed Vector Quantizers
- Improved sparse coding under the influence of perceptual attention
- Individual Convergence Rates in Empirical Vector Quantizer Design
- Learning the parts of objects by non-negative matrix factorization
- Manifold Regularized Discriminative Nonnegative Matrix Factorization With Fast Gradient Descent
- NeNMF: An Optimal Gradient Method for Nonnegative Matrix Factorization
- Nonasymptotic bounds for vector quantization in Hilbert spaces
- Nonnegative Matrix Factorization with the Itakura-Saito Divergence: With Application to Music Analysis
- On the mathematical foundations of learning
- On the Performance of Clustering in Hilbert Spaces
- On the training distortion of vector quantizers
- Probability inequalities for empirical processes and a law of the iterated logarithm
- Probability Inequalities for Sums of Bounded Random Variables
- Rates of convergence in the source coding theorem, in empirical quantizer design, and in universal lossy source coding
- Sample Complexity of Dictionary Learning and Other Matrix Factorizations
- Semidefinite programming based preconditioning for more robust near-separable nonnegative matrix factorization
- Sharper bounds for Gaussian and empirical processes
- Sparse coding on the spot: spontaneous retinal waves suffice for orientation selectivity
- The benefit of multitask representation learning
- The minimax distortion redundancy in empirical quantizer design
- The sample complexity of dictionary learning
- Unsupervised Spike Detection and Sorting with Wavelets and Superparamagnetic Clustering
Cited in
(5)- Generalization Bounds for K-Dimensional Coding Schemes in Hilbert Spaces
- Strong optimality of the normalized ML models as universal codes and information in data
- Learning finite-dimensional coding schemes with nonlinear reconstruction maps
- K-Dimensional Coding Schemes in Hilbert Spaces
- Bucketing Coding and Information Theory for the Statistical High-Dimensional Nearest-Neighbor Problem
This page was built for publication: Dimensionality-dependent generalization bounds for \(k\)-dimensional coding schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5380581)
