Estimation of off-the grid sparse spikes with over-parametrized projected gradient descent: theory and application
In this article, we study the problem of recovering sparse spikes with over-parametrized
projected descent. We first provide a theoretical study of approximate recovery with our …
projected descent. We first provide a theoretical study of approximate recovery with our …
Projected gradient descent for non-convex sparse spike estimation
We propose a new algorithm for sparse spike estimation from Fourier measurements. Based
on theoretical results on non-convex optimization techniques for off-the-grid sparse spike …
on theoretical results on non-convex optimization techniques for off-the-grid sparse spike …
[HTML][HTML] Sparsest piecewise-linear regression of one-dimensional data
We study the problem of one-dimensional regression of data points with total-variation (TV)
regularization (in the sense of measures) on the second derivative, which is known to …
regularization (in the sense of measures) on the second derivative, which is known to …
Fast off-the-grid sparse recovery with over-parametrized projected gradient descent
We consider the problem of recovering off-the-grid spikes from Fourier measurements.
Successful methods such as sliding Frank-Wolfe and continuous orthogonal matching …
Successful methods such as sliding Frank-Wolfe and continuous orthogonal matching …
[PDF][PDF] Sparsest continuous piecewise-linear representation of data
We study the problem of interpolating one-dimensional data with total variation
regularization on the second derivative, which is known to promote piecewise-linear …
regularization on the second derivative, which is known to promote piecewise-linear …
The basins of attraction of the global minimizers of non-convex inverse problems with low-dimensional models in infinite dimension
Non-convex methods for linear inverse problems with low-dimensional models have
emerged as an alternative to convex techniques. We propose a theoretical framework where …
emerged as an alternative to convex techniques. We propose a theoretical framework where …
Projected Block Coordinate Descent for sparse spike estimation
We consider the problem of recovering off-the-grid spikes from linear measurements. The
state of the art Over-Parametrized Continuous Orthogonal Matching Pursuit (OP-COMP) with …
state of the art Over-Parametrized Continuous Orthogonal Matching Pursuit (OP-COMP) with …
Space-Scale Hybrid Continuous-Discrete Sliding Frank-Wolfe Method
C Lage, N Pustelnik, JM Arbona… - IEEE Signal Processing …, 2024 - ieeexplore.ieee.org
In this letter, we focus on the challenging problem of designing an off-the-grid method for
dictionaries involving both positional and scale shifts. To tackle this challenge, we introduce …
dictionaries involving both positional and scale shifts. To tackle this challenge, we introduce …
Efficient and privacy-preserving compressive learning
A Chatalic - 2020 - theses.hal.science
The topic of this Ph. D. thesis lies on the borderline between signal processing, statistics and
computer science. It mainly focuses on compressive learning, a paradigm for large-scale …
computer science. It mainly focuses on compressive learning, a paradigm for large-scale …
Codage espace-échelle parcimonieux en présence de bruit non-gaussien. Application à l'analyse de la réplication de l'ADN en molécule unique
Résumé La réplication de l'ADN est un processus hautement régulé dont la dynamique peut
être analysée par des expériences en molécule unique. La vitesse de réplication ie le taux …
être analysée par des expériences en molécule unique. La vitesse de réplication ie le taux …