Recovery and convergence rate of the Frank-Wolfe Algorithm for the m-EXACT-SPARSE Problem

Abstract : We study the properties of the Frank-Wolfe algorithm to solve the m-EXACT-SPARSE reconstruction problem, where a signal y must be expressed as a sparse linear combination of a predefined set of atoms, called dictionary. We prove that when the signal is sparse enough with respect to the coherence of the dictionary, then the iterative process implemented by the Frank-Wolfe algorithm only recruits atoms from the support of the signal, that is the smallest set of atoms from the dictionary that allows for a perfect reconstruction of y. We also prove that under this same condition, there exists an iteration beyond which the algorithm converges exponentially.
Document type :
Journal articles
Complete list of metadatas

Cited literature [22 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01919761
Contributor : Farah Cherfaoui <>
Submitted on : Friday, May 17, 2019 - 5:12:40 PM
Last modification on : Tuesday, May 28, 2019 - 1:29:38 AM

File

Franck_Wolfe_Cherfaoui_and_al_...
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01919761, version 2

Citation

Farah Cherfaoui, Valentin Emiya, Liva Ralaivola, Sandrine Anthoine. Recovery and convergence rate of the Frank-Wolfe Algorithm for the m-EXACT-SPARSE Problem. IEEE Transactions on Information Theory, Institute of Electrical and Electronics Engineers, In press. ⟨hal-01919761v2⟩

Share

Metrics

Record views

37

Files downloads

68