A case of exact recovery with OMP using continuous dictionaries

Clément Elvira 1 Rémi Gribonval 1 Cedric Herzet 2 Charles Soussen 3
1 PANAMA - Parcimonie et Nouveaux Algorithmes pour le Signal et la Modélisation Audio
Inria Rennes – Bretagne Atlantique , IRISA_D5 - SIGNAUX ET IMAGES NUMÉRIQUES, ROBOTIQUE
2 SIMSMART - SIMulation pARTiculaire de Modèles Stochastiques
IRMAR - Institut de Recherche Mathématique de Rennes, Inria Rennes – Bretagne Atlantique
Abstract : We present new theoretical results on sparse recovery guarantees for a greedy algorithm, orthogonal matching pursuit (OMP), in the context of continuous dictionaries. Consider a sparse linear combination of atoms from a dictionary parameterized by some real parameters, for example, a combination of shifted versions of a basic waveform as in the context of sparse spike deconvolution. Currently, performance guarantees for greedy algorithms are typically carried out in the discrete setting associated to a grid of atom parameters, and based on, e.g., the coherence of the considered discretized dictionary [1]. However, such analyses fail to be conclusive for grid-based approaches when the discretization step tends to zero, as the coherence goes to one. Instead, our analysis is directly conducted in the continuous setting. For atoms parametrized by a real parameter that are elements of the (infinite-dimensional) Hilbert space L 2 (R) of square integrable real functions, and such that the inner product between two atoms is the exponential of the negative absolute difference of the corresponding parameters, we show in the noise-free setting that OMP exactly recovers the atom parameters as well as their amplitudes, regardless of the number of distinct atoms. We exhibit a convolutive dictionary of exponentially decaying pulses for which the atoms have an analytic definition while their pairwise inner products have the prescribed form. The established guarantees rely on a proof technique which is the continuous equivalent of Tropps Exact Recovery Condition (ERC) [1]. The proof exploits specific properties of the positive definite kernel between atom parameters defined by the inner product between the corresponding atoms. Future work will aim at characterizing the class of kernels for which such an analysis holds in particular for higher dimensional parameters and the compatibility of the guarantees with dimension reduction techniques such as sketching, which would pave the way to provably good greedy algorithms for compressive statistical learning [2]. In light of the existing links between Tropps ERC and recovery guarantees for 1 minimization [3], an interesting question is whether these guarantees extend to sparse spike recovery with total variation norm minimization [4, 5]. Joint work with: Rémi Gribonval, Cédric Herzet, Charles Soussen. References [1] J. A. Tropp. Greed is good: algorithmic results for sparse approximation. IEEE Transactions on Information Theory, 50(10):
Type de document :
Communication dans un congrès
CS 2018 - 9th International Conference on Curves and Surfaces, Jun 2018, Arcachon, France. 2004
Liste complète des métadonnées

https://hal.inria.fr/hal-01937532
Contributeur : Cedric Herzet <>
Soumis le : jeudi 20 décembre 2018 - 14:03:02
Dernière modification le : jeudi 27 décembre 2018 - 15:56:09

Identifiants

  • HAL Id : hal-01937532, version 1

Citation

Clément Elvira, Rémi Gribonval, Cedric Herzet, Charles Soussen. A case of exact recovery with OMP using continuous dictionaries. CS 2018 - 9th International Conference on Curves and Surfaces, Jun 2018, Arcachon, France. 2004. 〈hal-01937532〉

Partager

Métriques

Consultations de la notice

247

Téléchargements de fichiers

28