Stochastic Optimization for Deep CCA via Nonlinear Orthogonal Iterations

October 07, 2015 ยท Declared Dead ยท ๐Ÿ› Allerton Conference on Communication, Control, and Computing

๐Ÿ‘ป CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Weiran Wang, Raman Arora, Karen Livescu, Nathan Srebro arXiv ID 1510.02054 Category cs.LG: Machine Learning Citations 68 Venue Allerton Conference on Communication, Control, and Computing Last Checked 5 months ago
Abstract
Deep CCA is a recently proposed deep neural network extension to the traditional canonical correlation analysis (CCA), and has been successful for multi-view representation learning in several domains. However, stochastic optimization of the deep CCA objective is not straightforward, because it does not decouple over training examples. Previous optimizers for deep CCA are either batch-based algorithms or stochastic optimization using large minibatches, which can have high memory consumption. In this paper, we tackle the problem of stochastic optimization for deep CCA with small minibatches, based on an iterative solution to the CCA objective, and show that we can achieve as good performance as previous optimizers and thus alleviate the memory requirement.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Machine Learning

Died the same way โ€” ๐Ÿ‘ป Ghosted