{"id":438240,"date":"2017-11-06T16:20:59","date_gmt":"2017-11-07T00:20:59","guid":{"rendered":"https:\/\/www.microsoft.com\/en-us\/research\/?post_type=msr-research-item&#038;p=438240"},"modified":"2018-10-16T22:31:41","modified_gmt":"2018-10-17T05:31:41","slug":"linear-convergence-frank-wolfe-type-algorithm-trace-norm-balls","status":"publish","type":"msr-research-item","link":"https:\/\/www.microsoft.com\/en-us\/research\/publication\/linear-convergence-frank-wolfe-type-algorithm-trace-norm-balls\/","title":{"rendered":"Linear Convergence of a Frank-Wolfe Type Algorithm over Trace-Norm Balls"},"content":{"rendered":"<p>We propose a rank-<span id=\"MathJax-Span-1\"><i><span id=\"MathJax-Element-1-Frame\" tabindex=\"0\"><span id=\"MathJax-Span-2\"><span id=\"MathJax-Span-3\">k<\/span><\/span><\/span><\/i><\/span> variant of the classical Frank-Wolfe algorithm to solve convex optimization over a trace-norm ball. Our algorithm replaces the top singular-vector computation (<span id=\"MathJax-Span-4\"><span id=\"MathJax-Element-2-Frame\" tabindex=\"0\"><span id=\"MathJax-Span-5\"><span id=\"MathJax-Span-6\">1<\/span><\/span><\/span><\/span> -SVD) in Frank-Wolfe with a top-<span id=\"MathJax-Span-7\"><i><span id=\"MathJax-Element-3-Frame\" tabindex=\"0\"><span id=\"MathJax-Span-8\"><span id=\"MathJax-Span-9\">k<\/span><\/span><\/span><\/i><\/span> singular-vector computation (<span id=\"MathJax-Span-10\"><i><span id=\"MathJax-Element-4-Frame\" tabindex=\"0\"><span id=\"MathJax-Span-11\"><span id=\"MathJax-Span-12\">k<\/span><\/span><\/span><\/i><\/span> -SVD), which can be done by repeatedly applying <span id=\"MathJax-Span-13\"><span id=\"MathJax-Element-5-Frame\" tabindex=\"0\"><span id=\"MathJax-Span-14\"><span id=\"MathJax-Span-15\">1<\/span><\/span><\/span><\/span> -SVD <span id=\"MathJax-Span-16\"><i><span id=\"MathJax-Element-6-Frame\" tabindex=\"0\"><span id=\"MathJax-Span-17\"><span id=\"MathJax-Span-18\">k<\/span><\/span><\/span><\/i><\/span> times. Alternatively, our algorithm can be viewed as a rank-<span id=\"MathJax-Span-19\"><i><span id=\"MathJax-Element-7-Frame\" tabindex=\"0\"><span id=\"MathJax-Span-20\"><span id=\"MathJax-Span-21\">k<\/span><\/span><\/span><\/i><\/span> restricted version of projected gradient descent. We show that our algorithm has a linear convergence rate when the objective function is smooth and strongly convex, and the optimal solution has rank at most <span id=\"MathJax-Span-22\"><i><span id=\"MathJax-Element-8-Frame\" tabindex=\"0\"><span id=\"MathJax-Span-23\"><span id=\"MathJax-Span-24\">k<\/span><\/span><\/span><\/i><\/span> . This improves the convergence rate and the total time complexity of the Frank-Wolfe method and its variants.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>We propose a rank-k variant of the classical Frank-Wolfe algorithm to solve convex optimization over a trace-norm ball. Our algorithm replaces the top singular-vector computation (1 -SVD) in Frank-Wolfe with a top-k singular-vector computation (k -SVD), which can be done by repeatedly applying 1 -SVD k times. Alternatively, our algorithm can be viewed as a [&hellip;]<\/p>\n","protected":false},"featured_media":0,"template":"","meta":{"msr-url-field":"","msr-podcast-episode":"","msrModifiedDate":"","msrModifiedDateEnabled":false,"ep_exclude_from_search":false,"_classifai_error":"","msr-author-ordering":null,"msr_publishername":"","msr_publisher_other":"","msr_booktitle":"","msr_chapter":"","msr_edition":"Advances in Neural Information Processing Systems 30 (NIPS 2017)","msr_editors":"","msr_how_published":"","msr_isbn":"","msr_issue":"","msr_journal":"","msr_number":"","msr_organization":"","msr_pages_string":"","msr_page_range_start":"","msr_page_range_end":"","msr_series":"","msr_volume":"","msr_copyright":"","msr_conference_name":"Advances in Neural Information Processing Systems 30 (NIPS 2017)","msr_doi":"","msr_arxiv_id":"","msr_s2_paper_id":"","msr_mag_id":"","msr_pubmed_id":"","msr_other_authors":"","msr_other_contributors":"","msr_speaker":"","msr_award":"","msr_affiliation":"","msr_institution":"","msr_host":"","msr_version":"","msr_duration":"","msr_original_fields_of_study":"","msr_release_tracker_id":"","msr_s2_match_type":"","msr_citation_count_updated":"","msr_published_date":"2017-08-07","msr_highlight_text":"","msr_notes":"","msr_longbiography":"","msr_publicationurl":"https:\/\/arxiv.org\/abs\/1708.02105","msr_external_url":"","msr_secondary_video_url":"","msr_conference_url":"","msr_journal_url":"","msr_s2_pdf_url":"","msr_year":0,"msr_citation_count":0,"msr_influential_citations":0,"msr_reference_count":0,"msr_s2_match_confidence":0,"msr_microsoftintellectualproperty":true,"msr_s2_open_access":false,"msr_s2_author_ids":[],"msr_pub_ids":[],"msr_hide_image_in_river":0,"footnotes":""},"msr-research-highlight":[],"research-area":[13561],"msr-publication-type":[193716],"msr-publisher":[],"msr-focus-area":[],"msr-locale":[268875],"msr-post-option":[],"msr-field-of-study":[],"msr-conference":[],"msr-journal":[],"msr-impact-theme":[],"msr-pillar":[],"class_list":["post-438240","msr-research-item","type-msr-research-item","status-publish","hentry","msr-research-area-algorithms","msr-locale-en_us"],"msr_publishername":"","msr_edition":"Advances in Neural Information Processing Systems 30 (NIPS 2017)","msr_affiliation":"","msr_published_date":"2017-08-07","msr_host":"","msr_duration":"","msr_version":"","msr_speaker":"","msr_other_contributors":"","msr_booktitle":"","msr_pages_string":"","msr_chapter":"","msr_isbn":"","msr_journal":"","msr_volume":"","msr_number":"","msr_editors":"","msr_series":"","msr_issue":"","msr_organization":"","msr_how_published":"","msr_notes":"","msr_highlight_text":"","msr_release_tracker_id":"","msr_original_fields_of_study":"","msr_download_urls":"","msr_external_url":"","msr_secondary_video_url":"","msr_longbiography":"","msr_microsoftintellectualproperty":1,"msr_main_download":"","msr_publicationurl":"https:\/\/arxiv.org\/abs\/1708.02105","msr_doi":"","msr_publication_uploader":[{"type":"url","title":"https:\/\/arxiv.org\/abs\/1708.02105","viewUrl":false,"id":false,"label_id":0}],"msr_related_uploader":"","msr_citation_count":0,"msr_citation_count_updated":"","msr_s2_paper_id":"","msr_influential_citations":0,"msr_reference_count":0,"msr_arxiv_id":"","msr_s2_author_ids":[],"msr_s2_open_access":false,"msr_s2_pdf_url":null,"msr_attachments":[{"id":0,"url":"https:\/\/arxiv.org\/abs\/1708.02105"}],"msr-author-ordering":[{"type":"user_nicename","value":"zeyuana","user_id":36569,"rest_url":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/microsoft-research\/v1\/researchers?person=zeyuana"},{"type":"text","value":"Elad Hazan","user_id":0,"rest_url":false},{"type":"text","value":"Wei Hu","user_id":0,"rest_url":false},{"type":"text","value":"Yuanzhi Li","user_id":0,"rest_url":false}],"msr_impact_theme":[],"msr_research_lab":[],"msr_event":[425610],"msr_group":[],"msr_project":[],"publication":[],"video":[],"msr-tool":[],"msr_publication_type":"inproceedings","related_content":[],"_links":{"self":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-research-item\/438240","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-research-item"}],"about":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/types\/msr-research-item"}],"version-history":[{"count":3,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-research-item\/438240\/revisions"}],"predecessor-version":[{"id":438261,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-research-item\/438240\/revisions\/438261"}],"wp:attachment":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/media?parent=438240"}],"wp:term":[{"taxonomy":"msr-research-highlight","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-research-highlight?post=438240"},{"taxonomy":"msr-research-area","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/research-area?post=438240"},{"taxonomy":"msr-publication-type","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-publication-type?post=438240"},{"taxonomy":"msr-publisher","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-publisher?post=438240"},{"taxonomy":"msr-focus-area","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-focus-area?post=438240"},{"taxonomy":"msr-locale","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-locale?post=438240"},{"taxonomy":"msr-post-option","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-post-option?post=438240"},{"taxonomy":"msr-field-of-study","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-field-of-study?post=438240"},{"taxonomy":"msr-conference","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-conference?post=438240"},{"taxonomy":"msr-journal","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-journal?post=438240"},{"taxonomy":"msr-impact-theme","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-impact-theme?post=438240"},{"taxonomy":"msr-pillar","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-pillar?post=438240"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}