#### Authors

Raman Arora, Teodor Vanislavov Marinov, Poorya Mianjy, Nati Srebro

#### Abstract

We propose novel first-order stochastic approximation algorithms for canonical correlation analysis (CCA). Algorithms presented are instances of inexact matrix stochastic gradient (MSG) and inexact matrix exponentiated gradient (MEG), and achieve $\epsilon$-suboptimality in the population objective in $\operatorname{poly}(\frac{1}{\epsilon})$ iterations. We also consider practical variants of the proposed algorithms and compare them with other methods for CCA both theoretically and empirically.
{"ft_lang_label":"__label__en","ft_lang_prob":0.84164447,"math_prob":0.88483703,"size":639,"snap":"2020-45-2020-50","text_gpt3_token_len":139,"char_repetition_ratio":0.09291339,"word_repetition_ratio":0.0,"special_character_ratio":0.18466353,"punctuation_ratio":0.07608695,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9580323,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-12-03T08:02:26Z\",\"WARC-Record-ID\":\"<urn:uuid:63e787d9-e47f-42f9-8760-a6cf6d799882>\",\"Content-Length\":\"7466\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:d9bac146-baf0-4da6-90dc-16618ba24338>\",\"WARC-Concurrent-To\":\"<urn:uuid:c97c1eaa-dd57-4c9d-bc06-03d4156015b4>\",\"WARC-IP-Address\":\"198.202.70.94\",\"WARC-Target-URI\":\"https://proceedings.neurips.cc/paper/2017/hash/c30fb4dc55d801fc7473840b5b161dfa-Abstract.html\",\"WARC-Payload-Digest\":\"sha1:22YARUHSNM2IECJ75YD3YJWFUY5KEFEZ\",\"WARC-Block-Digest\":\"sha1:N6OWNZ2FNE75YEP6LZPZ4I2NJ53Q3N7G\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-50/CC-MAIN-2020-50_segments_1606141723602.80_warc_CC-MAIN-20201203062440-20201203092440-00157.warc.gz\"}"}