Dimensionality-Dependent Generalization Bounds for <i>k</i>-Dimensional Coding Schemes (Q5380581)

scientific article; zbMATH DE number 7062787

Language	Label	Description	Also known as
English	Dimensionality-Dependent Generalization Bounds for <i>k</i>-Dimensional Coding Schemes	scientific article; zbMATH DE number 7062787

Statements

instance of

scholarly article

0 references

title

Dimensionality-Dependent Generalization Bounds for <i>k</i>-Dimensional Coding Schemes (English)

0 references

0 references

0 references

0 references

0 references

5 June 2019

0 references

full work available at URL

https://arxiv.org/abs/1601.00238

0 references

describes a project that uses

0 references

0 references

0 references

0 references

Probability inequalities for empirical processes and a law of the iterated logarithm

0 references

Improved Sparse Coding Under the Influence of Perceptual Attention

0 references

Q4054519

0 references

Improved Minimax Bounds on the Test and Training Distortion of Empirically Designed Vector Quantizers

0 references

Individual Convergence Rates in Empirical Vector Quantizer Design

0 references

The minimax distortion redundancy in empirical quantizer design

0 references

10.1162/153244303321897690

0 references

On the Performance of Clustering in Hilbert Spaces

0 references

Q4907706

0 references

Atomic Decomposition by Basis Pursuit

0 references

On the mathematical foundations of learning

0 references

Q4881152

0 references

Nonnegative Matrix Factorization with the Itakura-Saito Divergence: With Application to Music Analysis

0 references

Semidefinite Programming Based Preconditioning for More Robust Near-Separable Nonnegative Matrix Factorization

0 references

Sample Complexity of Dictionary Learning and Other Matrix Factorizations

0 references

Manifold Regularized Discriminative Nonnegative Matrix Factorization With Fast Gradient Descent

0 references

NeNMF: An Optimal Gradient Method for Nonnegative Matrix Factorization

0 references

Probability Inequalities for Sums of Bounded Random Variables

0 references

Sparse Coding on the Spot: Spontaneous Retinal Waves Suffice for Orientation Selectivity

0 references

A local search approximation algorithm for k-means clustering

0 references

Learning the parts of objects by non-negative matrix factorization

0 references

Fast rates for empirical vector quantization

0 references

Nonasymptotic bounds for vector quantization in Hilbert spaces

0 references

On the training distortion of vector quantizers

0 references

Rates of convergence in the source coding theorem, in empirical quantizer design, and in universal lossy source coding

0 references

Q5617409

0 references

$K$-Dimensional Coding Schemes in Hilbert Spaces

0 references

Q2810898

0 references

A Hebbian/Anti-Hebbian Neural Network for Linear Subspace Learning: A Derivation from Multidimensional Scaling of Streaming Data

0 references

A central limit theorem for k-means clustering

0 references

Unsupervised Spike Detection and Sorting with Wavelets and Superparamagnetic Clustering

0 references

Adaptive Relevance Matrices in Learning Vector Quantization

0 references

Distance Learning in Discriminative Vector Quantization

0 references

Sharper bounds for Gaussian and empirical processes

0 references

Q5396727

0 references

Q4935997

0 references

10.1162/153244302760200713

0 references

Identifiers

zbMATH Open document ID

1474.68315

0 references

DOI

10.1162/NECO_a_00872

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5380581