Fast learning of fast transforms, with guarantees - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2022

Fast learning of fast transforms, with guarantees

Abstract

Approximating a matrix by a product of few sparse factors whose supports possess the butterfly structure, which is common to many fast transforms, is key to learn fast transforms and speedup algorithms for inverse problems. We introduce a hierarchical approach, that recursively approximates the considered matrix into two factors. Using recent advances on the well-posedness and tractability of the two-factor fixedsupport sparse matrix factorization problem, we establish exact recovery guarantees for the proposed algorithm. Experiments show that speed and accuracy of the factorization can be jointly improved by several orders of magnitude, compared to gradient-based optimization methods.This paper is associated to code for reproducible research available at https://hal.inria.fr/hal-03552956
Fichier principal
Vignette du fichier
main.pdf (297.62 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03438881 , version 1 (22-11-2021)
hal-03438881 , version 2 (15-02-2022)

Identifiers

Cite

Quoc-Tung Le, Léon Zheng, Elisa Riccietti, Rémi Gribonval. Fast learning of fast transforms, with guarantees. ICASSP 2022 - IEEE International Conference on Acoustics, Speech and Signal Processing, May 2022, Singapore, Singapore. ⟨10.1109/ICASSP43922.2022.9747791⟩. ⟨hal-03438881v2⟩
375 View
258 Download

Altmetric

Share

Gmail Facebook X LinkedIn More