Fetching the paper…
Reading the bibliography…
We consider dictionary learning and blind calibration for signals and matrices created from a random ensemble.
D. J. Thouless, P. W. Anderson, and R. G. Palmer, “Solution of ‘solvable model of a spin-glass’,” Phil. Mag. , vol. 35, pp. 593–601, 1977
1977
Earlier work this paper cites.
M. Mézard, G. Parisi, and M. A. Virasoro, Spin-Glass Theory and Beyond , ser. Lecture Notes in Physics. Singapore: World Scientific, 1987, vol. 9
1987
Earlier work this paper cites.
B. A. Olshausen and D. J. Field, “Sparse coding with an overcomplete basis set: A strategy employed by v1,” Vision Research , vol. 37, p. 3311, 1997
1997
Earlier work this paper cites.
K. Engan, S. O. Aase, and H. J. Husoy, “Method of optimal directions for frame design,” IEEE Acoustic, Speech and Signal Processing , vol. 5, p. 2443, 1999
1999
Earlier work this paper cites.
D. L. Donoho and J. Tanner, “Sparse nonnegative solution of underdetermined linear equations by linear programming,” Proceedings of the National Academy of Sciences of the United States of America , vol. 102, no. 27, pp. 9446–9451, 2005
2005
Earlier work this paper cites.
M. Aharon, M. Elad, and A. M. Bruckstein, “K-svd: An algorithm for designing overcomplete dictionaries for sparse representation,” IEEE Transactions on Signal Processing , vol. 54, p. 4311, 2006
2006
Earlier work this paper cites.
A. M. B. Michal Aharon, Michael Elad, “On the uniqueness of overcomplete dictionaries, and a practical way to retrieve them,” Linear Algebra and its Applications , vol. 416, pp. 48–67, 2006
2006
Earlier work this paper cites.
J. Mairal, F. Bach, J. Ponce, and G. Sapiro, “Online dictionary learning for sparse coding,” in Proceedings of the 26 th International Conference on Machine Learning, Montreal, Canada, 2009. , 2009
2009
Earlier work this paper cites.
D. L. Donoho, A. Maleki, and A. Montanari, “Message-passing algorithms for compressed sensing,” Proc. Natl. Acad. Sci. , vol. 106, no. 45, pp. 18 914–18 919, 2009
2009
Cited alongside, same era.
R. Gribonval and K. Schnass, “Dictionary identification - sparse matrix-factorisation via ℓ 1 \ell_{1} -minimisation,” IEEE Transactions on Information Theory , vol. 56, no. 7, pp. 3523–3539, 2010
2010
Cited alongside, same era.
R. Rubinstein, M. Zibulevsky, and M. Elad, “Double sparsity: Learning sparse dictionaries for sparse signal approximation,” IEEE Transactions on Signal Processing , vol. 58, p. 1553, 2010
2010
Cited alongside, same era.
D. Donoho, A. Maleki, and A. Montanari, “Message passing algorithms for compressed sensing: I. motivation and construction,” in Information Theory Workshop (ITW), 2010 IEEE , 2010, pp. 1 –5
2010
Cited alongside, same era.
M. Bayati and A. Montanari, “The dynamics of message passing on dense graphs, with applications to compressed sensing,” IEEE Transactions on Information Theory , vol. 57, no. 2, pp. 764 –785, 2011
2011
Later among the works it cites.
2011
Later among the works it cites.
P. Schniter, J. Parker, and V. Cevher, “Bilinear generalized approximate message passing (big-amp) for matrix recovery problem,” in Workshop on Information Theory and Applications (ITA), San Diego CA , 2012
2012
Later among the works it cites.
A. Sakata and Y. Kabashima, “Statistical mechanics of dictionary learning,” 2012, arXiv:1203.6178
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…
2011
Cited alongside, same era.
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
2011
Cited alongside, same era.
S. Rangan, “Generalized approximate message passing for estimation with random linear mixing,” in IEEE International Symposium on Information Theory Proceedings (ISIT) , 31 2011-aug. 5 2011, pp. 2168 –2172
2011
Cited alongside, same era.
J. Parker, V. Cevher, and P. Schniter, “Compressive sensing under matrix uncertainties: An approximate message passing approach,” in Conference Record of the Forty Fifth Asilomar , 2011
2011
Cited alongside, same era.
I. Carron, “The matrix factorization jungle,” https://sites.google.com/site/igorcarron2/matrixfactorizations
Cited in the paper.
Cited in the paper.
R. Gribonval, G. Chardon, and L. Daudet, “Blind calibration for compressed sensing by convex optimization,” in Acoustics, Speech and Signal Processing (ICASSP), 2012 IEEE International Conference on , 2012, pp. 2713 –2716
2012
Later among the works it cites.
F. Krzakala, M. Mézard, F. Sausset, Y. Sun, and L. Zdeborová, “Statistical physics-based reconstruction in compressed sensing,” Phys. Rev. X , vol. 2, p. 021005, 2012
2012
Later among the works it cites.
F. Krzakala, M. Mézard, F. Sausset, Y. Sun, and L. Zdeborová, “Probabilistic reconstruction in compressed sensing: Algorithms, phase diagrams, and threshold achieving matrices,” J. Stat. Mech. , vol. P08009, 2012
2012
Later among the works it cites.