Subsampled online matrix factorization with convergence guarantees
暂无分享,去创建一个
Bertrand Thirion | Gael Varoquaux | Arthur Mensch | Julien Mairal | G. Varoquaux | B. Thirion | J. Mairal | A. Mensch
[1] Guillermo Sapiro,et al. Online Learning for Matrix Factorization and Sparse Coding , 2009, J. Mach. Learn. Res..
[2] R. Tibshirani. Regression Shrinkage and Selection via the Lasso , 1996 .
[3] Mark W. Schmidt,et al. Minimizing finite sums with the stochastic average gradient , 2013, Mathematical Programming.
[4] Julien Mairal,et al. Stochastic Majorization-Minimization Algorithms for Large-Scale Optimization , 2013, NIPS.
[5] David J. Field,et al. Sparse coding with an overcomplete basis set: A strategy employed by V1? , 1997, Vision Research.
[6] Francis Bach,et al. SAGA: A Fast Incremental Gradient Method With Support for Non-Strongly Convex Composite Objectives , 2014, NIPS.
[7] Prateek Jain,et al. Learning Sparsely Used Overcomplete Dictionaries , 2014, COLT.
[8] Karen O. Egiazarian,et al. Nonlocal Transform-Domain Filter for Volumetric Data Denoising and Reconstruction , 2013, IEEE Transactions on Image Processing.
[9] Peter Richtárik,et al. Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function , 2011, Mathematical Programming.
[10] R. Tibshirani,et al. Sparse Principal Component Analysis , 2006 .
[11] Tong Zhang,et al. Accelerating Stochastic Gradient Descent using Predictive Variance Reduction , 2013, NIPS.
[12] Gaël Varoquaux,et al. Dictionary Learning for Massive Matrix Factorization , 2016, ICML.