Approximate message-passing for convex optimization with non-separable penalties

Abstract

We introduce an iterative optimization scheme for convex objectives consisting of a linear loss and a non-separable penalty, based on the expectation-consistent approximation and the vector approximate message-passing (VAMP) algorithm. Specifically, the penalties we approach are convex on a linear transformation of the variable to be determined, a notable example being total variation (TV). We describe the connection between message-passing algorithms -- typically used for approximate inference -- and proximal methods for optimization, and show that our scheme is, as VAMP, similar in nature to the Peaceman-Rachford splitting, with the important difference that stepsizes are set adaptively. Finally, we benchmark the performance of our VAMP-like iteration in problems where TV penalties are useful, namely classification in task fMRI and reconstruction in tomography, and show faster convergence than that of state-of-the-art approaches such as FISTA and ADMM in most settings.

arXiv comment18 pages, 6 figures

References in corpus (1)

• Binary Linear Classification and Feature Selection via Generalized Approximate Message Passing

Cited by in corpus (5)

• Asymptotic errors for convex penalized linear regression beyond Gaussian matrices
• Inference in Multi-Layer Networks with Matrix-Valued Unknowns
• Generalization Error of Generalized Linear Models in High Dimensions
• Optimizing Binary Symptom Checkers via Approximate Message Passing
• Asymptotic Statistical Analysis of Sparse Group LASSO via Approximate Message Passing Algorithm