Random Coordinate Descent

Randomized (Block) Coordinate Descent Method is an optimization algorithm popularized by Nesterov (2010) and Richtárik and Takáč (2011). The first analysis of this method, when applied to the problem of minimizing a smooth convex function, was performed by Nesterov (2010). In Nesterov's analysis the method needs to be applied to a quadratic perturbation of the original function with an unknown scaling factor. Richtárik and Takáč (2011) give iteration complexity bounds which do not require this, i.e., the method is applied to the objective function directly. Furthermore, they generalize the setting to the problem of minimizing a composite function, i.e., sum of a smooth convex and a (possibly nonsmooth) convex block-separable function:

$F(x) = f(x) + \Psi(x),$

where $\Psi(x) = \sum_^n \Psi_i(x^),$ $x\in R^N$ is decomposed into $n$ blocks of variables/coordinates: $x = (x^,\dots,x^)$ and $\Psi_1,\dots, \Psi_n$ are (simple) convex functions.

Example (block decomposition): If $x = (x_1,x_2,\dots,x_5) \in R^5$ and $n = 3$, one may choose $x^ = (x_1,x_3), x^ = (x_2,x_5)$ and $x^ = x_4$.

Example (block-separable regularizers):
# $n=N; \Psi(x) = \, x\, _1 = \sum_^n , x_i,$
# $N = N_1 + N_2 + \dots + N_n; \Psi(x) = \sum_^n \, x^\, _2$, where $x^\in R^$ and $\, \cdot\, _2$ is the standard Euclidean norm.

Algorithm

Consider the optimization problem

:$\min_ f(x),$

where $f$ is a convex and smooth function.

Smoothness: By smoothness we mean the following: we assume
the gradient of $f$ is coordinate-wise Lipschitz continuous
with constants $L_1, L_2, \dots , L_n$. That is, we assume that

:$, \nabla_i f(x + h e_i) - \nabla_i f(x), \leq L_i , h, ,$

for all $x \in R^n$ and $h \in R$, where $\nabla_i$ denotes the partial derivative with respect to variable $x^$.

Nesterov, and Richtarik and Takac showed that the following algorithm converges to the optimal point:

Input: $x_0 \in R^n$ //starting point
Output: $x$

set ''x'' := x_0

for ''k'' := 1, ... do
choose coordinate $i\in \$, uniformly at random
update $x^ = x^ - \frac1 \nabla_i f(x)$
end for

Convergence rate

Since the iterates of this algorithm are random vectors, a complexity result would give a bound on the number of iterations needed for the method to output an approximate solution with high probability. It was shown in that if
$k\geq \frac \log \left(\frac\right)$,
where $R_L(x)=\max_ \max_ \$,
$f^*$ is an optimal solution ($f^* = \min_\$),
$\rho\in(0,1)$ is a confidence level and $\epsilon>0$ is target accuracy,
then $Prob(f(x_k)-f^*> \epsilon) \leq \rho$.

Example on particular function

The following Figure shows
how $x_k$ develops during iterations, in principle.
The problem is

: $f(x) = \tfrac x^T \left(\begin 1 & 0.5 \\ 0.5 & 1 \end \right) x -\left(\begin 1.5 & 1.5 \end \right)x,\quad x_0=\left(\begin 0 & 0 \end \right)^T$

Extension to block coordinate setting

One can naturally extend this algorithm not only just to coordinates, but to blocks of coordinates. Assume that we have space $R^5$. This space has 5 coordinate directions, concretely
$e_1 = (1,0,0,0,0)^T, e_2 = (0,1,0,0,0)^T, e_3 = (0,0,1,0,0)^T, e_4 = (0,0,0,1,0)^T, e_5 = (0,0,0,0,1)^T$
in which Random Coordinate Descent Method can move. However, one can group some coordinate directions into blocks and we can have instead of those 5 coordinate directions 3 block coordinate directions (see image).

See also

* Coordinate descent
* Gradient descent
* Mathematical optimization

References

{{reflist

Gradient methods