Novel min-max reformulations of Linear Inverse Problems

by   Mohammed Rayyan Sheriff, et al.

In this article, we dwell into the class of so-called ill-posed Linear Inverse Problems (LIP) which simply refers to the task of recovering the entire signal from its relatively few random linear measurements. Such problems arise in a variety of settings with applications ranging from medical image processing, recommender systems, etc. We propose a slightly generalized version of the error constrained linear inverse problem and obtain a novel and equivalent convex-concave min-max reformulation by providing an exposition to its convex geometry. Saddle points of the min-max problem are completely characterized in terms of a solution to the LIP, and vice versa. Applying simple saddle point seeking ascend-descent type algorithms to solve the min-max problems provides novel and simple algorithms to find a solution to the LIP. Moreover, the reformulation of an LIP as the min-max problem provided in this article is crucial in developing methods to solve the dictionary learning problem with almost sure recovery constraints.



There are no comments yet.


page 16


Dictionary Learning with Almost Sure Error Constraints

A dictionary is a database of standard vectors, so that other vectors / ...

Convex geometry of the Coding problem for error constrained Dictionary Learning

In this article we expose the convex geometry of the class of coding pro...

The limits of min-max optimization algorithms: convergence to spurious non-critical sets

Compared to minimization problems, the min-max landscape in machine lear...

Hybrid Block Successive Approximation for One-Sided Non-Convex Min-Max Problems: Algorithms and Applications

The min-max problem, also known as the saddle point problem, is a class ...

Zeroth-Order Methods for Convex-Concave Minmax Problems: Applications to Decision-Dependent Risk Minimization

Min-max optimization is emerging as a key framework for analyzing proble...

Coordinate Linear Variance Reduction for Generalized Linear Programming

We study a class of generalized linear programs (GLP) in a large-scale s...

Divide-and-Conquer Learning by Anchoring a Conical Hull

We reduce a broad class of machine learning problems, usually addressed ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.