Search Results for author:
Found 5 papers, 1 papers with code
Support Exploration Algorithm for Sparse Support Recovery
We introduce a new algorithm promoting sparsity called {\it Support Exploration Algorithm (SEA)} and analyze it in the context of support recovery/model selection problems. The algorithm can be interpreted as an instance of the {\it straight-through estimator (STE)} applied to the resolution of a sparse linear inverse problem.
QuicK-means: Acceleration of K-means by learning a fast transform
K-means -- and the celebrated Lloyd algorithm -- is more than the clustering method it was originally designed to be.
Frank-Wolfe Algorithm for the Exact Sparse Problem
In this paper, we study the properties of the Frank-Wolfe algorithm to solve the \ExactSparse reconstruction problem.
Optimal spectral transportation with application to music transcription
Many spectral unmixing methods rely on the non-negative decomposition of spectral data onto a dictionary of spectral templates.
Dynamic Screening: Accelerating First-Order Algorithms for the Lasso and Group-Lasso
Recent computational strategies based on screening tests have been proposed to accelerate algorithms addressing penalized sparse regression problems such as the Lasso.
