Skip to content
TheChatArchiveThe Chat Archive
Metallama-2-13b-chat· MetaHugging Face Arena Human Preference 55K

What is mirror descent ?

From a Chatbot Arena battleThe same person sent this prompt to two anonymous models at once. Compare it with vicuna-13b’s answer.
  1. User

    What is mirror descent ?

  2. Meta Assistant

    Mirror descent is an optimization algorithm used to solve constrained optimization problems of the form:

    min⁡x∈Xf(x)\min_{x \in \mathcal{X}} f(x)

    where X\mathcal{X} is a convex set and f:X→Rf: \mathcal{X} \to \mathbb{R} is a convex function. The mirror descent algorithm was introduced by Yoshua Bengio, Aaron Courville, and Pascal Vincent in 2007.

    The mirror descent algorithm is based on the idea of mirroring the constraint set X\mathcal{X} around the origin. Specifically, the algorithm starts by defining a mirrored version of the constraint set X′\mathcal{X}', which is obtained by reflecting X\mathcal{X} about the origin. The mirrored constraint set X′\mathcal{X}' is defined as:

    X′=−X+2{0}\mathcal{X}' = - \mathcal{X} + 2\left\lbrace 0 \right\rbrace

    where {0}\left\lbrace 0 \right\rbrace is the set of all zero vectors.

    The mirror descent algorithm then iteratively updates the parameters xx as follows:

    x^{t+1} = \underset{x \in \mathcal{X}'}{\text{argmin}} \left\lbrace f(x) + \left\langle g(x), x - x^t \right\rangle + \frac{L^2}{2} \left\lVertx - x^t\right\rVert^2 \right\rbrace

    where g(x)=∇f(x)g(x) = \nabla f(x) is the gradient of ff at xx, LL is a positive step size, and ⟨⋅,⋅⟩\left\langle \cdot, \cdot \right\rangle denotes the inner product.

    The mirror descent algorithm can be viewed as a hybrid of the projected gradient descent (PGD) algorithm and the gradient descent (GD) algorithm. Like PGD, mirror descent iteratively projects the current estimate xtx^t onto the constraint set X′\mathcal{X}', but unlike PGD, it does not require the computation of the projection operator. Instead, it uses the gradient g(x)g(x) to iteratively update the parameters xx. Like GD, mirror descent uses a step size LL to control the size of the updates, but it uses a different update rule that incorporates the gradient information.

    The mirror descent algorithm has several desirable properties. It is computationally efficient, as it only requires the computation of the gradient g(x)g(x) and the inner product ⟨g(x),x−xt⟩\left\langle g(x), x - x^t \right\rangle. It is also convergent, as it is guaranteed to converge to a stationary point of the objective function ff. Furthermore, the mirror descent algorithm can be easily parallelized, as each iteration can be computed independently.

    The mirror descent algorithm has been applied to a wide range of optimization problems, including logistic regression, support vector machines, and neural networks. It is particularly useful in situations where the constraint set X\mathcal{X} is complex or has a large dimensionality, as it can efficiently handle such problems using a simple and intuitive update rule.

Responses were produced in different, uncontrolled contexts (system prompts, settings, prior turns). This is not a benchmark.