Proximal operator
Consider the following optimization problem:
where is a differentiable convex function and is a proper closed convex function as a regularizer, which may be non-differentiable.
At iteration , we have current point and a first-order direction . Then the next iterate is obtained by
- could be any first-order direction (e.g., gradient, subgradient, stochastic gradient, or even just some arbitrary direction by some first-order oracle).
The three-point identities
The first-order optimality condition of the above problem is , which is equivalent to, for some ,
Given any reference point , since is convex, we have , then adding to both sides, we have .
A useful identity is that for any ,
Let , we have . Thus, we have the following three-point identity:
Several notes:
- The inequality is due to the convexity of . If , then and the inequality becomes an equality.
- The three-point identity transforms the first-order quantity to distance-based quantities, which is useful in convergence analysis, especially can be telescoped over iterations.
Mirror Descent version of the three-point identity
In a more general sense, we could consider the Mirror Descent method, where the Euclidean distance is replaced by a Bregman divergence for some strongly convex function . Then the mirror step is (we first temporarily ignore the regularizer and is the step size):
- It still follows the first-order direction + proximal geometry structure.
Similar to the Euclidean case, we have the following basic equality: for any ,
Proof
(Basically directly obtained) by the definition of Bregman divergence, we have
Then, let , we have
For Mirror Descent, given that , the first-order optimality condition is
Then plugging in the three-point equality, we have the following three-point identity for Mirror Descent:
- If let , then , and the Mirror Descent three-point identity reduces to the Euclidean three-point identity.
We could further consider the Mirror Descent with a regularizer , then the composite Mirror Descent step is
Let , then the first-order optimality condition is
which gives
By the convexity of , we have
combining the above two inequalities, we have the three-point identity for composite Mirror Descent: