pith. sign in

arxiv: 1902.06522 · v1 · pith:XKB276ZBnew · submitted 2019-02-18 · 💻 cs.LG · stat.ML

Designing recurrent neural networks by unfolding an l1-l1 minimization algorithm

classification 💻 cs.LG stat.ML
keywords networkl1-l1minimizationneuralrecurrentsignalsparseunfolding
0
0 comments X
read the original abstract

We propose a new deep recurrent neural network (RNN) architecture for sequential signal reconstruction. Our network is designed by unfolding the iterations of the proximal gradient method that solves the l1-l1 minimization problem. As such, our network leverages by design that signals have a sparse representation and that the difference between consecutive signal representations is also sparse. We evaluate the proposed model in the task of reconstructing video frames from compressive measurements and show that it outperforms several state-of-the-art RNN models.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.