Convex Regularization and Representer Theorems

Abstract

We establish a result which states that regularizing an inverse problem with the gauge of a convex set C yields solutions which are linear combinations of a few extreme points or elements of the extreme rays of C. These can be understood as the atoms of the regularizer. We then explicit that general principle by using a few popular applications. In particular, we relate it to the common wisdom that total gradient variation minimization favors the reconstruction of piecewise constant images.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…