Short and squeezed: accelerating the computation of antisparse representations with safe squeezing - Archive ouverte HAL Access content directly
Conference Papers Year :

Short and squeezed: accelerating the computation of antisparse representations with safe squeezing

, (1)
1
Clément Elvira

Abstract

Antisparse coding aims at spreading the information uniformly over representation coefficients and can be expressed as the solution of an ∞-norm regularized problem. In this paper, we propose a new methodology, coined "safe squeezing", accelerating the computation of antisparse representations. The idea consists in identifying saturated entries of the solution via simple tests and compact their contribution to achieve some form of dimensionality reduction. Numerical experiments show that the proposed approach leads to significant computational gain.
Fichier principal
Vignette du fichier
IcasspAntisparse.pdf (251.39 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03070344 , version 1 (15-12-2020)

Identifiers

Cite

Clément Elvira, Cédric Herzet. Short and squeezed: accelerating the computation of antisparse representations with safe squeezing. ICASSP 2020 - 2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), May 2020, Barcelona, Spain. pp.5615-5619, ⟨10.1109/ICASSP40776.2020.9053156⟩. ⟨hal-03070344⟩
42 View
112 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More