Flexible Multi-layer Sparse Approximations of Matrices and Applications - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year : 2015

Flexible Multi-layer Sparse Approximations of Matrices and Applications

Abstract

The computational cost of many signal processing and machine learning techniques is often dominated by the cost of applying certain linear operators to high-dimensional vectors. This paper introduces an algorithm aimed at reducing the complexity of applying linear operators in high dimension by approximately factorizing the corresponding matrix into few sparse factors. The approach relies on recent advances in non-convex optimization. It is first explained and analyzed in details and then demonstrated experimentally on various problems including dictionary learning for image denoising, and the approximation of large matrices arising in inverse problems.
Fichier principal
Vignette du fichier
ieeeJSTSP_hal.pdf (961.91 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-01167948 , version 1 (25-06-2015)
hal-01167948 , version 2 (29-03-2016)

Identifiers

Cite

Luc Le Magoarou, Rémi Gribonval. Flexible Multi-layer Sparse Approximations of Matrices and Applications. 2015. ⟨hal-01167948v1⟩
1554 View
1397 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More