Fetching the paper…
Reading the bibliography…
A popular approach within the signal processing and machine learning communities consists in modelling signals as sparse linear combinations of atoms selected from a learned dictionary.
Matrix analysis
R. A. Horn and C. R. Johnson · 1990
Earlier work this paper cites.
Emergence of simple-cell receptive field properties by learning a sparse code for natural images
D J Field and B A Olshausen · 1996
Earlier work this paper cites.
Regression shrinkage and selection via the Lasso
R. Tibshirani · 1996
Earlier work this paper cites.
Sparse coding with an overcomplete basis set: A strategy employed by V1?
B. A. Olshausen and D. J. Field · 1997
Earlier work this paper cites.
Atomic decomposition by basis pursuit
S. S. Chen, D. L. Donoho, and M. A. Saunders · 1998
Earlier work this paper cites.
Uncertainty principles and ideal atomic decomposition
D. L. Donoho and X. Huo · 2001
Earlier work this paper cites.
Blind Source Separation by Sparse Decomposition in a Signal Dictionary
Michael Zibulevsky and Barak A Pearlmutter · 2001
Earlier work this paper cites.
Concentration Inequalities and Model Selection: Ecole d’été de Probabilités de Saint-Flour 23
P. Massart · 2003
Earlier work this paper cites.
Greed is good: Algorithmic results for sparse approximation
J. A. Tropp · 2004
Earlier work this paper cites.
Recovery of exact sparse representations in the presence of bounded noise
J. J. Fuchs · 2005
Earlier work this paper cites.
Sparse Component Analysis and Blind Source Separation of Underdetermined Mixtures
P Georgiev, F J Theis, and Andrzej Cichocki · 2005
Earlier work this paper cites.
Spike and slab variable selection: frequentist and Bayesian strategies
H. Ishwaran and J. S. Rao · 2005
Earlier work this paper cites.
On the uniqueness of overcomplete dictionaries, and a practical way to retrieve them
Michal Aharon, Michael Elad, and Alfred M Bruckstein · 2006
Earlier work this paper cites.
On model selection consistency of Lasso
P. Zhao and B. Yu · 2006
Earlier work this paper cites.
Optimization algorithms on matrix manifolds
P. A. Absil, R. Mahony, and R. Sepulchre · 2008
Earlier work this paper cites.
Convex sparse matrix factorizations
F. Bach, J. Mairal, and J. Ponce · 2008
Cited alongside, same era.
A Wavelet Tour of Signal Processing
S. Mallat · 2008
Cited alongside, same era.
Convex coding
D. M. Bradley and J. A. Bagnell · 2009
Cited alongside, same era.
Near-ideal model selection by ℓ 1 \ell_{1} minimization
E. J. Candès and Y. Plan · 2009
Cited alongside, same era.
On the conditions used to prove oracle results for the Lasso
S. Van de Geer and P. Bühlmann · 2009
Cited alongside, same era.
Sharp thresholds for noisy and high-dimensional recovery of sparsity using ℓ 1 \ell_{1} - constrained quadratic programming
M. J. Wainwright · 2009
Cited alongside, same era.
On the Local Correctness of L1 Minimization for Dictionary Learning
Q. Geng, H. Wang, and J. Wright · 2011
Later among the works it cites.
Proximal methods for hierarchical sparse coding
R. Jenatton, J. Mairal, G. Obozinski, and F. Bach · 2011
Later among the works it cites.
Dictionary learning
I. Tosic and P. Frossard · 2011
Later among the works it cites.
The Sample Complexity of Dictionary Learning
D Vainsencher, S Mannor, and A M Bruckstein · 2011
Later among the works it cites.
A Mathematical Introduction to Compressive Sensing
Simon Foucart and Holger Rauhut · 2012
Later among the works it cites.
Compressible Distributions for High-Dimensional Statistics
Remi Gribonval, Volkan Cevher, and Michael E Davies · 2012
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Some sharp performance bounds for least squares regression with l1 regularization
T. Zhang · 2009
Cited alongside, same era.
Non-parametric Bayesian dictionary learning for sparse image representations
M. Zhou, H. Chen, J. Paisley, L. Ren, G. Sapiro, and L. Carin · 2009
Cited alongside, same era.
Handbook of Blind Source Separation, Independent Component Analysis and Applications
P. Comon and C. Jutten, editors · 2010
Cited alongside, same era.
Dictionary identification—sparse matrix-factorization via ℓ 1 \ell_{1} -minimization
R. Gribonval and K. Schnass · 2010
Cited alongside, same era.
Submodular dictionary selection for sparse representation
A. Krause and V. Cevher · 2010
Cited alongside, same era.
Online learning for matrix factorization and sparse coding
J. Mairal, F. Bach, J. Ponce, and G. Sapiro · 2010
Cited alongside, same era.
Rodolphe Jenatton, Remi Gribonval, and Francis Bach · 2012
Later among the works it cites.
On the sample complexity of predictive sparse coding
N. A. Mehta and A. G. Gray · 2012
Later among the works it cites.
Exact recovery of sparsely-used dictionaries
Daniel A Spielman, Huan Wang, and John Wright · 2012
Later among the works it cites.
New Algorithms for Learning Incoherent and Overcomplete Dictionaries
Sanjeev Arora, Rong Ge, and Ankur Moitra · 2013
Later among the works it cites.
Concentration Inequalities: A Nonasymptotic Theory of Independence
S. Boucheron, G. Lugosi, and P. Massart · 2013
Later among the works it cites.
Performance limits of dictionary learning for sparse coding
Alexander Jung, Yonina C. Eldar, and Norbert Görtz · 2014
Closest in time.
Sample Complexity of Dictionary Learning and Other Matrix Factorizations
Remi Gribonval, R Jenatton, F Bach, M Kleinsteuber, and M Seibert · 2015
Closest in time.
Model Selection with Low Complexity Priors
Samuel Vaiter, Mohammad Golbabaee, Jalal M Fadili, and Gabriel Peyré · 2015
Closest in time.