Passer à la navigation principale Passer à la recherche Passer au contenu principal

A projection-free decentralized algorithm for non-convex optimization

  • Arizona State University
  • CNRS LTCI

Résultats de recherche: Le chapitre dans un livre, un rapport, une anthologie ou une collectionContribution à une conférenceRevue par des pairs

Résumé

This paper considers a decentralized projection free algorithm for non-convex optimization in high dimension. More specifically, we propose a Decentralized Frank-Wolfe (DeFW) algorithm which is suitable when high dimensional optimization constraints are difficult to handle by conventional projection/proximal-based gradient descent methods. We present conditions under which the DeFW algorithm converges to a stationary point and prove that the rate of convergence is as fast as O(l/√T), where T is the iteration number. This paper provides the first convergence guarantee for FrankWolfe methods applied to non-convex decentralized optimization. Utilizing our theoretical findings, we formulate a novel robust matrix completion problem and apply DeFW to give an efficient decentralized solution. Numerical experiments are performed on realistic and synthetic data to support our findings.

langue originaleAnglais
titre2016 IEEE Global Conference on Signal and Information Processing, GlobalSIP 2016 - Proceedings
EditeurInstitute of Electrical and Electronics Engineers Inc.
Pages475-479
Nombre de pages5
ISBN (Electronique)9781509045457
Les DOIs
étatPublié - 19 avr. 2017
Evénement2016 IEEE Global Conference on Signal and Information Processing, GlobalSIP 2016 - Washington, États-Unis
Durée: 7 déc. 20169 déc. 2016

Série de publications

Nom2016 IEEE Global Conference on Signal and Information Processing, GlobalSIP 2016 - Proceedings

Une conférence

Une conférence2016 IEEE Global Conference on Signal and Information Processing, GlobalSIP 2016
Pays/TerritoireÉtats-Unis
La villeWashington
période7/12/169/12/16

Empreinte digitale

Examiner les sujets de recherche de « A projection-free decentralized algorithm for non-convex optimization ». Ensemble, ils forment une empreinte digitale unique.

Contient cette citation