Sample Complexity of Dictionary Learning and Other Matrix Factorizations

DOI10.1109/TIT.2015.2424238zbMath1359.62287arXiv1312.3790OpenAlexW2024254345WikidataQ114084356 ScholiaQ114084356MaRDI QIDQ2978588

Matthias Seibert, Rodolphe Jenatton, Francis Bach, Rémi Gribonval, Martin Kleinsteuber

Publication date: 28 April 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1312.3790

Mathematics Subject Classification ID

Inequalities; stochastic orderings (60E15) General nonlinear regression (62J02) Learning and adaptive systems in artificial intelligence (68T05)

Related Items

On statistical learning of simplices: unmixing problem revisited ⋮ Tensor Regression Using Low-Rank and Sparse Tucker Decompositions ⋮ Adaptive Geometric Multiscale Approximations for Intrinsically Low-dimensional Data ⋮ Unnamed Item ⋮ Reprint of: A forward-backward greedy approach for sparse multiscale learning ⋮ Dimensionality-Dependent Generalization Bounds for k-Dimensional Coding Schemes ⋮ Alternating Proximal Regularized Dictionary Learning ⋮ Generalization Error in Deep Learning ⋮ Learning semidefinite regularizers ⋮ Convergence radius and sample complexity of ITKM algorithms for dictionary learning ⋮ Unnamed Item ⋮ Customized dictionary learning for subdatasets with fine granularity ⋮ On the Purity and Entropy of Mixed Gaussian States ⋮ A forward-backward greedy approach for sparse multiscale learning ⋮ Compressive sensing and neural networks from a statistical learning perspective ⋮ Multilinear Compressive Sensing and an Application to Convolutional Linear Networks

This page was built for publication: Sample Complexity of Dictionary Learning and Other Matrix Factorizations