Efficient Consensus Model based on Proximal Gradient Method applied to Convolutional Sparse Problems

11/19/2020
by   Gustavo Silva, et al.
0

Convolutional sparse representation (CSR), shift-invariant model for inverse problems, has gained much attention in the fields of signal/image processing, machine learning and computer vision. The most challenging problems in CSR implies the minimization of a composite function of the form min_x ∑_i f_i(x) + g(x), where a direct and low-cost solution can be difficult to achieve. However, it has been reported that semi-distributed formulations such as ADMM consensus can provide important computational benefits. In the present work, we derive and detail a thorough theoretical analysis of an efficient consensus algorithm based on proximal gradient (PG) approach. The effectiveness of the proposed algorithm with respect to its ADMM counterpart is primarily assessed in the classic convolutional dictionary learning problem. Furthermore, our consensus method, which is generically structured, can be used to solve other optimization problems, where a sum of convex functions with a regularization term share a single global variable. As an example, the proposed algorithm is also applied to another particular convolutional problem for the anomaly detection task.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/22/2021

Converting ADMM to a Proximal Gradient for Convex Optimization Problems

In machine learning and data science, we often consider efficiency for s...
research
04/28/2021

Consensus ADMM for Inverse Problems Governed by Multiple PDE Models

The Alternating Direction Method of Multipliers (ADMM) provides a natura...
research
02/17/2022

A Distributed Algorithm for Measure-valued Optimization with Additive Objective

We propose a distributed nonparametric algorithm for solving measure-val...
research
05/09/2017

Convolutional Dictionary Learning via Local Processing

Convolutional Sparse Coding (CSC) is an increasingly popular model in th...
research
01/23/2019

Model Function Based Conditional Gradient Method with Armijo-like Line Search

The Conditional Gradient Method is generalized to a class of non-smooth ...
research
04/14/2014

Hybrid Conditional Gradient - Smoothing Algorithms with Applications to Sparse and Low Rank Regularization

We study a hybrid conditional gradient - smoothing algorithm (HCGS) for ...
research
12/03/2018

On learning with shift-invariant structures

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

Please sign up or login with your details

Forgot password? Click here to reset