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.
The Hungarian method for the assignment problem
H. W. Kuhn · 1955
Earlier work this paper cites.
Matrix differential calculus with applications in statistics and econometrics
J. R. Magnus and H. Neudecker · 1988
Earlier work this paper cites.
Matrix analysis
R. A. Horn and C. R. Johnson · 1990
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.
The incomplete Gamma functions since Tricomi
W. Gautschi · 1998
Earlier work this paper cites.
Decoupling: from dependence to independence
V. De la Peña and E. Giné · 1999
Earlier work this paper cites.
Metric characterization of random variables and random processes , volume 188
V. V. Buldygin and I. U. V. Kozachenko · 2000
Earlier work this paper cites.
Uncertainty principles and ideal atomic decomposition
D. L. Donoho and X. Huo · 2001
Earlier work this paper cites.
On the mathematical foundations of learning
F. Cucker and S. Smale · 2002
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.
Spike and slab variable selection: frequentist and Bayesian strategies
H. Ishwaran and J. S. Rao · 2005
Cited alongside, same era.
On model selection consistency of Lasso
P. Zhao and B. Yu · 2006
Cited alongside, same era.
Linear algebra in action
H. Dym · 2007
Cited alongside, same era.
Optimization algorithms on matrix manifolds
P. A. Absil, R. Mahony, and R. Sepulchre · 2008
Cited alongside, same era.
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.
Dictionary identification—sparse matrix-factorization via ℓ 1 \ell_{1} -minimization
R. Gribonval and K. Schnass · 2010
Later among the works it cites.
Submodular dictionary selection for sparse representation
A. Krause and V. Cevher · 2010
Later among the works it cites.
Online learning for matrix factorization and sparse coding
J. Mairal, F. Bach, J. Ponce, and G. Sapiro · 2010
Later among the works it cites.
k k -dimensional coding schemes in hilbert spaces
A. Maurer and M. Pontil · 2010
Later among the works it cites.
The sample complexity of dictionary learning
D. Vainsencher, S. Mannor, and A. M. Bruckstein · 2010
Later among the works it cites.
Introduction to the non-asymptotic analysis of random matrices
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
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.
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.
R. Vershynin · 2010
Later among the works it cites.
Optimization with sparsity-inducing penalties
F. Bach, R. Jenatton, J. Mairal, and G. Obozinski · 2011
Later among the works it cites.
On the Local Correctness of L1 Minimization for Dictionary Learning
Q. Geng, H. Wang, and J. Wright · 2011
Later among the works it cites.
Compressible distributions for high-dimensional statistics
R. Gribonval, V. Cevher, and M. E. Davies · 2011
Later among the works it cites.
A tail inequality for quadratic forms of subgaussian random vectors
D. Hsu, S. M. Kakade, and T. Zhang · 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.
On the sample complexity of predictive sparse coding
N. A. Mehta and A. G. Gray · 2012
Closest in time.