Learning sparsely used overcomplete dictionaries, Conference on Learning Theory, 2014. ,
DOI : 10.1109/tit.2016.2614684
Saga: A fast incremental gradient method with support for non-strongly convex composite objectives, Advances in Neural Information Processing Systems, 2014. ,
URL : https://hal.archives-ouvertes.fr/hal-01016843
Accelerating stochastic gradient descent using predictive variance reduction, Advances in Neural Information Processing Systems, 2013. ,
Nonlocal Transform-Domain Filter for Volumetric Data Denoising and Reconstruction, IEEE Transactions on Image Processing, vol.22, issue.1, pp.119-133, 2013. ,
DOI : 10.1109/TIP.2012.2210725
Online learning for matrix factorization and sparse coding, The Journal of Machine Learning Research, vol.11, pp.19-60, 2010. ,
URL : https://hal.archives-ouvertes.fr/inria-00408716
Dictionary learning for massive matrix factorization, International Conference on Machine Learning, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01308934
Sparse coding with an overcomplete basis set: A strategy employed by V1? Vision Research, pp.3311-3325, 1997. ,
DOI : 10.1016/s0042-6989(97)00169-7
Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function, Mathematical Programming, pp.1-38, 2014. ,
DOI : 10.1007/s10107-012-0614-z
Minimizing finite sums with the stochastic average gradient, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-00860051
Regression shrinkage and selection via the lasso, Journal of the Royal Statistical Society. Series B (Methodological), pp.267-288, 1996. ,
DOI : 10.1111/j.1467-9868.2011.00771.x
Sparse Principal Component Analysis, Journal of Computational and Graphical Statistics, vol.15, issue.2, pp.265-286, 2006. ,
DOI : 10.1198/106186006X113430