|
|
|
|
Blocky models via the L1/L2 hybrid norm |
| (1) |
Let
be a convex function (
) of a scalar.
The penalty function (or norm of residuals is expressed by
| (2) |
with components | (3) |
We often update models in the direction of the gradient of the norm of the residual.
![]() |
(4) |
Define a model update direction by
.
Since
,
we see the residual update direction will be
.
To find the distance
to move in those directions
| (5) | |||
| (6) |
The sum in equation (7)
is a sum of ``dishes'', shapes between L2 parabolas and L1 V's.
The
-th dish is centered on
.
It is steep and narrow if
is large, and low and flat where
is small.
The positive sum of convex functions is convex.
There are no local minima.
We can get to the bottom by following the gradient.
Next we consider some choices for convex functions.
We'll need them, their first and second derivatives.
|
|
|
|
Blocky models via the L1/L2 hybrid norm |