Dictionary Learning Using Rank-One Atomic Decomposition (ROAD)

by   Cheng Cheng, et al.

Dictionary learning aims at seeking a dictionary under which the training data can be sparsely represented. Methods in the literature typically formulate the dictionary learning problem as an optimization w.r.t. two variables, i.e., dictionary and sparse coefficients, and solve it by alternating between two stages: sparse coding and dictionary update. The key contribution of this work is a Rank-One Atomic Decomposition (ROAD) formulation where dictionary learning is cast as an optimization w.r.t. a single variable which is a set of rank one matrices. The resulting algorithm is hence single-stage. Compared with two-stage algorithms, ROAD minimizes the sparsity of the coefficients whilst keeping the data consistency constraint throughout the whole learning process. An alternating direction method of multipliers (ADMM) is derived to solve the optimization problem and the lower bound of the penalty parameter is computed to guarantees a global convergence despite non-convexity of the optimization formulation. From practical point of view, ROAD reduces the number of tuning parameters required in other benchmark algorithms. Numerical tests demonstrate that ROAD outperforms other benchmark algorithms for both synthetic data and real data, especially when the number of training samples is small.


page 1

page 14

page 15


Dictionary Learning with Convex Update (ROMD)

Dictionary learning aims to find a dictionary under which the training d...

Dictionary Learning with BLOTLESS Update

Algorithms for learning a dictionary under which a data in a given set h...

Convergence of alternating minimisation algorithms for dictionary learning

In this paper we derive sufficient conditions for the convergence of two...

Performance Limits of Dictionary Learning for Sparse Coding

We consider the problem of dictionary learning under the assumption that...

An Efficient Approximate Method for Online Convolutional Dictionary Learning

Most existing convolutional dictionary learning (CDL) algorithms are bas...

On learning with shift-invariant structures

We describe new results and algorithms for two different, but related, p...

A Tensor-Train Dictionary Learning algorithm based on Spectral Proximal Alternating Linearized Minimization

Dictionary Learning (DL) is one of the leading sparsity promoting techni...

Please sign up or login with your details

Forgot password? Click here to reset