R. Gribonval, R. Jenatton, F. Bach, M. Kleinsteuber, and M. Seibert, Sample complexity of dictionary learning and other matrix factorizations, " pre-print, 2014.

B. A. Olshausen and D. J. Field, Sparse coding with an overcomplete basis set: A strategy employed by V1?, Vision Research, vol.37, issue.23, pp.3311-3326, 1997.
DOI : 10.1016/S0042-6989(97)00169-7

M. Aharon, M. Elad, and A. Bruckstein, <tex>$rm K$</tex>-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation, IEEE Transactions on Signal Processing, vol.54, issue.11, pp.4311-4322, 2006.
DOI : 10.1109/TSP.2006.881199

R. Rubinstein, M. Zibulevsky, and M. Elad, Double Sparsity: Learning Sparse Dictionaries for Sparse Signal Approximation, IEEE Transactions on Signal Processing, vol.58, issue.3, pp.1553-1564, 2010.
DOI : 10.1109/TSP.2009.2036477
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.159.7953

S. Hawe, M. Seibert, and M. Kleinsteuber, Separable Dictionary Learning, 2013 IEEE Conference on Computer Vision and Pattern Recognition, 2013.
DOI : 10.1109/CVPR.2013.63
URL : http://arxiv.org/abs/1303.5244

A. Maurer and M. Pontil, <formula formulatype="inline"><tex Notation="TeX">$K$</tex> </formula>-Dimensional Coding Schemes in Hilbert Spaces, IEEE Transactions on Information Theory, vol.56, issue.11, pp.5839-5846, 2010.
DOI : 10.1109/TIT.2010.2069250

D. Vainsencher, S. Mannor, and A. M. Bruckstein, The sample complexity of dictionary learning, Journal of Machine Learning Research, vol.12, pp.3259-3281, 2011.

M. Anthony and P. L. Bartlett, Neural network learning: Theoretical foundations, 2009.
DOI : 10.1017/CBO9780511624216