15 citations · 45 across the 14 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.LG2019★ 9 cited
Safe squeezing for antisparse coding
Clément Elvira, Cédric Herzet
Spreading the information over all coefficients of a representation is a desirable property in many applications such as digital communication or machine learning. This so-called a…
cs.IT2019★ 11 cited
When does OMP achieve exact recovery with continuous dictionaries?
Clément Elvira, Rémi Gribonval, Charles Soussen +1
This paper presents new theoretical results on sparse recovery guarantees for a greedy algorithm, Orthogonal Matching Pursuit (OMP), in the context of continuous parametric diction…