Online sparsifying transform learning - Part II: Convergence analysis

IEEE Journal on Selected Topics in Signal Processing

Volumn 9, Issue 4, 2015, Pages 637-646

  Ravishankar, Saiprasad ^a   Bresler, Yoram ^a  

^a University of Illinois at Urbana Champaign   (United States)

Author keywords

big data; convergence guarantees; dictionary learning; machine learning; online learning; Sparse representations; sparsifying transforms

Indexed keywords

ARTIFICIAL INTELLIGENCE; BIG DATA; COMPRESSED SENSING; LEARNING ALGORITHMS; LEARNING SYSTEMS; NUMERICAL METHODS; OPTIMIZATION; SIGNAL DENOISING; SIGNAL PROCESSING; SOCIAL NETWORKING (ONLINE);

CONVERGENCE ANALYSIS; CONVERGENCE GUARANTEES; DICTIONARY LEARNING; NUMERICAL EXPERIMENTS; ONLINE LEARNING; OPTIMIZATION PROBLEMS; SIGNAL PROCESSING APPLICATIONS; SPARSE REPRESENTATION;

E-LEARNING;

EID: 84929327416     PISSN: 19324553     EISSN: None     Source Type: Journal    
DOI: 10.1109/JSTSP.2015.2407860     Document Type: Article

References (17)

1. S. Ravishankar, B. Wen, and Y. Bresler, "Online sparsifying transform learning-Part I: Algorithms," IEEE J. Sel. Topics Signal Process., vol. 9, no. 4, pp. XXX-XXX, Jun. 2015.
2. S. Ravishankar and Y. Bresler, "Learning sparsifying transforms," IEEE Trans. Signal Process., vol. 61, no. 5, pp. 1072-1086, 2013.
3. S. Ravishankar and Y. Bresler, "Learning doubly sparse transforms for images," IEEE Trans. Image Process., vol. 22, no. 12, pp. 4598-4612, Dec. 2013.
4. S. Ravishankar and Y. Bresler, "Closed-form solutions within sparsifying transform learning," in Proc. IEEE Int. Conf. Acoust., Speech, Signal Process. (ICASSP), 2013, pp. 5378-5382.
5. J. Mairal, F. Bach, J. Ponce, and G. Sapiro, "Online learning for matrix factorization and sparse coding," J. Mach. Learn. Res., vol. 11, pp. 19-60, 2010.
6. Y. Z. Tsypkin, Adaptation and Learning in Automatic Systems. New York, NY, USA: Academic, 1971.
7. Y. Z. Tsypkin, Foundations of the Theory of Learning Systems. New York, NY, USA: Academic, 1973.
8. L. Bottou, "Online algorithms and stochastic approximations," in Online Learning and Neural Networks, D. Saad, Ed. Cambridge, U.K.: Cambridge Univ. Press, 1998.
9. L. Bottou and O. Bousquet, "The tradeoffs of large scale learning," in Advances in Neural Information Processing Systems. Cambridge, MA, USA: MIT Press, 2008, vol. 20, pp. 161-168.
10. A. W. van der Vaart, Asymptotic Statistics. New York, NY, USA: Cambridge Univ. Press, 1998.
11. N. G. Markley, Principles of Differential Equations. Hoboken, NJ, USA: Wiley, 2004.
12. G. W. Stewart, "Perturbation theory for the singular value decomposition," in SVD and Signal Processing, II: Algorithms, Analysis and Applications. Amsterdam, The Netherlands: Elsevier, 1990, pp. 99-109.
13. F. M. Dopico, "A note on sinθ theorems for singular subspace variations," BIT Numer. Math., vol. 40, no. 2, pp. 395-403, 2000.
14. L. Hogben, Handbook of Linear Algebra. Boca Raton, FL, USA: CRC, 2006.
15. D. L. Fisk, "Quasi-martingales," Trans. Amer. Math. Soc., vol. 120, pp. 369-389, 1965.
16. J. M. Danskin, The Theory of Max-Min and Its Applications toWeapons Allocation Problems. Heidelberg, Germany: Springer, 1967.
17. J. F. Bonnans and A. Shapiro, "Optimization problems with perturbations: A guided tour," SIAM Rev., vol. 40, no. 2, pp. 202-227, 1998.