Multiplicative weight update method

The multiplicative weights update method is an algorithmic technique most commonly used for decision making and prediction, and also widely deployed in game theory and algorithm design. The simplest use case is the problem of prediction from expert advice, in which a decision maker needs to iteratively decide on an expert whose advice to follow. The method assigns initial weights to the experts (usually identical initial weights), and updates these weights multiplicatively and iteratively according to the feedback of how well an expert performed: reducing it in case of poor performance, and increasing it otherwise. [1] It was discovered repeatedly in very diverse fields such as machine learning (AdaBoost, Winnow, Hedge), optimization (solving linear programs), theoretical computer science (devising fast algorithm for LPs and SDPs), and game theory.

Name

"Multiplicative weights" implies the iterative rule used in algorithms derived from the multiplicative weight update method.[2] It is given with different names in the different fields where it was discovered or rediscovered.

History and background

The earliest known version of this technique was in an algorithm named "fictitious play" which was proposed in game theory in the early 1950s. Grigoriadis and Khachiyan[3] applied a randomized variant of "fictitious play" to solve two-player zero-sum games efficiently using the multiplicative weights algorithm. In this case, player allocates higher weight to the actions that had a better outcome and choose his strategy relying on these weights. In machine learning, Littlestone applied the earliest form of the multiplicative weights update rule in his famous winnow algorithm, which is similar to Minsky and Papert's earlier perceptron learning algorithm. Later, he generalized the winnow algorithm to weighted majority algorithm. Freund and Schapire followed his steps and generalized the winnow algorithm in the form of hedge algorithm.

The multiplicative weights algorithm is also widely applied in computational geometry such as Clarkson's algorithm for linear programming (LP) with a bounded number of variables in linear time.[4][5] Later, Bronnimann and Goodrich employed analogous methods to find set covers for hypergraphs with small VC dimension.[6]

In operation research and on-line statistical decision making problem field, the weighted majority algorithm and its more complicated versions have been found independently.

In computer science field, some researchers have previously observed the close relationships between multiplicative update algorithms used in different contexts. Young discovered the similarities between fast LP algorithms and Raghavan's method of pessimistic estimators for derandomization of randomized rounding algorithms; Klivans and Servedio linked boosting algorithms in learning theory to proofs of Yao's XOR Lemma; Garg and Khandekar defined a common framework for convex optimization problems that contains Garg-Konemann and Plotkin-Shmoys-Tardos as subcases.[7]

General setup

A binary decision needs to be made based on n experts’ opinions to attain an associated payoff. In the first round, all experts’ opinions have the same weight. The decision maker will make the first decision based on the majority of the experts' prediction. Then, in each successive round, the decision maker will repeatedly update the weight of each expert's opinion depending on the correctness of his prior predictions. Real life examples includes predicting if it is rainy tomorrow or if the stock market will go up or go down.

Algorithm analysis

Halving algorithm[2]

Given a sequential game played between an adversary and an aggregator who is advised by N experts, the goal is for the aggregator to make as few mistakes as possible. Assume there is an expert among the N experts who always gives the correct prediction. In the halving algorithm, only the consistent experts are retained. Experts who make mistakes will be dismissed. For every decision, the aggregator decides by taking a majority vote among the remaining experts. Therefore, every time the aggregator makes a mistake, at least half of the remaining experts are dismissed. The aggregator makes at most log₂(N) mistakes.[2]

Weighted majority algorithm[7][8]

Unlike halving algorithm which dismisses experts who have made mistakes, weighted majority algorithm discounts their advice. Given the same "expert advice" setup, suppose we have n decisions, and we need to select one decision for each loop. In each loop, every decision incurs a cost. All costs will be revealed after making the choice. The cost is 0 if the expert is correct, and 1 otherwise. this algorithm's goal is to limit its cumulative losses to roughly the same as the best of experts. The very first algorithm that makes choice based on majority vote every iteration does not work since the majority of the experts can be wrong consistently every time. The weighted majority algorithm corrects above trivial algorithm by keeping a weight of experts instead of fixing the cost at either 1 or 0.[7] This would make fewer mistakes compared to halving algorithm.

   Initialization: 
      Fix an ${\displaystyle \eta \leq 1/2}$. For each expert, associate the weight ${\displaystyle {w_{i}}^{1}}$≔1.
   For ${\displaystyle t}$ = ${\displaystyle {\mathit {1}}}$, ${\displaystyle {\mathit {2}}}$,…,${\displaystyle T}$
      1. Make the prediction given by the weighted majority of the experts' predictions based on their weights${\displaystyle \mathbb {w_{1}} ^{t},...,\mathbb {w_{n}} ^{t}}$. That is, choose 0 or 1 depending on which prediction has a higher total weight of experts advising it (breaking ties arbitrarily). 
      2. For every expert i that predicted wrongly, decrease his weight for the next round by multiplying it by a factor of (1-η):
           ${\displaystyle w_{i}^{t+1}}$=${\displaystyle (1-\eta )w_{i}^{t}}$ (update rule)

If ${\displaystyle \eta =0}$, the weight of the expert's advice will remain the same. When ${\displaystyle \eta }$ increases, the weight of the expert's advice will decrease. Note that some researchers fix ${\displaystyle \eta =1/2}$ in weighted majority algorithm.

After ${\displaystyle T}$ steps, let ${\displaystyle m_{i}^{T}}$ be the number of mistakes of expert i and ${\displaystyle M^{T}}$ be the number of mistakes our algorithm has made. Then we have the following bound for every ${\displaystyle i}$:

    ${\displaystyle M^{T}\leq 2(1+\eta )m_{i}^{T}+{\frac {2\ln(n)}{\eta }}}$.

In particular, this holds for i which is the best expert. Since the best expert will have the least ${\displaystyle m_{i}^{T}}$, it will give the best bound on the number of mistakes made by the algorithm as a whole.

Randomized weighted majority algorithm[2][9]

Given the same setup with N experts. Consider the special situation where the proportions of experts predicting positive and negative, counting the weights, are both close to 50%. Then, there might be a tie. Following the weight update rule in weighted majority algorithm, the predictions made by the algorithm would be randomized. The algorithm calculates the probabilities of experts predicting positive or negatives, and then makes a random decision based on the computed fraction:

predict

${\displaystyle f(x)={\begin{cases}1&{\text{with probability}}{\frac {q_{1}}{W}}\\0&{\text{otherwise}}\end{cases}}}$

where

 ${\displaystyle W=\sum _{i}{w_{i}}=q_{0}+q_{1}}$.

The number of mistakes made by the randomized weighted majority algorithm is bounded as:

 ${\displaystyle E\left[\#{\text{mistakes of the learner}}\right]\leq \alpha _{\beta }\left(\#{\text{ mistakes of the best expert}}\right)+c_{\beta }\ln(N)}$

where ${\displaystyle \alpha _{\beta }={\frac {\ln({\frac {1}{\beta }})}{1-\beta }}}$ and ${\displaystyle c_{\beta }={\frac {1}{1-\beta }}}$.

Note that only the learning algorithm is randomized. The underlying assumption is that the examples and experts' predictions are not random. The only randomness is the randomness where the learner makes his own prediction. In this randomized algorithm, ${\displaystyle \alpha _{\beta }\rightarrow 1}$ if ${\displaystyle \beta \rightarrow 1}$. Compared to weighted algorithm, this randomness halved the number of mistakes the algorithm is going to make.[10] However, it is important to note that in some research, people define ${\displaystyle \eta =1/2}$ in weighted majority algorithm and allow ${\displaystyle 0\leq \eta \leq 1}$ in randomized weighted majority algorithm.[2]

Applications

The multiplicative weights method is usually used to solve a constrained optimization problem. Let each expert be the constraint in the problem, and the events represent the points in the area of interest. The punishment of the expert corresponds to how well its corresponding constraint is satisfied on the point represented by an event.[1]

Solving zero-sum games approximately (Oracle algorithm):[1][7][10]

Suppose we were given the distribution ${\displaystyle P}$ on experts. Let ${\displaystyle A}$ = payoff matrix of a finite two-player zero-sum game, with ${\displaystyle n}$ rows.

When the row player ${\displaystyle p_{r}}$ uses plan ${\displaystyle i}$ and the column player ${\displaystyle p_{c}}$ uses plan ${\displaystyle j}$, the payoff of player ${\displaystyle p_{c}}$ is ${\displaystyle A\left(i,j\right)}$≔${\displaystyle A_{ij}}$, assuming ${\displaystyle A\left(i,j\right)\in \left[0,1\right]}$.

If player ${\displaystyle p_{r}}$ chooses action ${\displaystyle i}$ from a distribution ${\displaystyle P}$ over the rows, then the expected result for player ${\displaystyle p_{c}}$ selecting action ${\displaystyle j}$ is ${\displaystyle A\left(P,j\right)=E_{i\in P}\left[A\left(i,j\right)\right]}$.

To maximize ${\displaystyle A\left(P,j\right)}$, player ${\displaystyle p_{c}}$ should choose plan ${\displaystyle j}$. Similarly, the expected payoff for player ${\displaystyle p_{l}}$ is ${\displaystyle A\left(i,P\right)=E_{j\in P}\left[A\left(i,j\right)\right]}$. Choosing plan ${\displaystyle i}$ would minimize this payoff. By John Von Neumann's Min-Max Theorem, we obtain:

                                          ${\displaystyle \min _{P}\max _{j}A\left(P,j\right)=\max _{Q}\min _{i}A\left(i,Q\right)}$

where P and i changes over the distributions over rows, Q and j changes over the columns.

Then, let ${\displaystyle \lambda ^{*}}$ denote the common value of above quantities, also named as the "value of the game". Let ${\displaystyle \delta >0}$ be an error parameter. To solve the zero-sum game bounded by additive error of ${\displaystyle \delta }$,

                                                 ${\displaystyle \lambda ^{*}-\delta \leq \min _{i}A\left(i,q\right)}$
                                                 ${\displaystyle \max _{j}A\left(p,j\right)\leq \lambda ^{*}+\delta }$

So there is an algorithm solving zero-sum game up to an additive factor of δ using O(log₂(n)/${\displaystyle \delta ^{2}}$) calls to ORACLE, with an additional processing time of O(n) per call[10]

Bailey and Piliouras showed that although the time average behavior of multiplicative weights update converges to Nash equilibria in zero-sum games the day-to-day (last iterate) behavior diverges away from it.[11]

Machine learning

In machine learning, Littlestone and Warmuth generalized the winnow algorithm to the weighted majority algorithm.[12] Later, Freund and Schapire generalized it in the form of hedge algorithm.[13] AdaBoost Algorithm formulated by Yoav Freund and Robert Schapire also employed the Multiplicative Weight Update Method.[7]

Winnow algorithm

Based on current knowledge in algorithms, multiplicative weight update method was first used in Littlestone's winnow algorithm.[7] It is used in machine learning to solve a linear program.

Given ${\displaystyle m}$ labeled examples ${\displaystyle \left(a_{1},l_{1}\right),{\text{…}},\left(a_{m},l_{m}\right)}$ where ${\displaystyle a_{j}\in \mathbb {R} ^{n}}$ are feature vectors, and ${\displaystyle l_{j}\in \left\{-1,1\right\}\quad }$ are their labels.

The aim is to find non-negative weights such that for all examples, the sign of the weighted combination of the features matches its labels. That is, require that ${\displaystyle l_{j}a_{j}x\geq 0}$ for all ${\displaystyle j}$. Without loss of generality, assume the total weight is 1 so that they form a distribution. Thus, for notational convenience, redefine ${\displaystyle a_{j}}$ to be ${\displaystyle l_{j}a_{j}}$, the problem reduces to finding a solution to the following LP:

                     ${\displaystyle \forall j=1,2,{\text{…}},m:a_{j}x\geq 0}$,
                     ${\displaystyle 1*x=1}$,
                     ${\displaystyle \forall i:x_{i}\geq 0}$.

This is general form of LP.

Hedge algorithm [2]

The hedge algorithm is similar to the weighted majority algorithm. However, their exponential update rules are different.[2] It is generally used to solve the problem of binary allocation in which we need to allocate different portion of resources into N different options. The loss with every option is available at the end of every iteration. The goal is to reduce the total loss suffered for a particular allocation. The allocation for the following iteration is then revised, based on the total loss suffered in the current iteration using multiplicative update.[14]

Analysis

Assume the learning rate ${\displaystyle \eta >0}$ and for ${\displaystyle t\in [T]}$, ${\displaystyle p^{t}}$ is picked by Hedge. Then for all experts ${\displaystyle i}$,

                                ${\displaystyle \sum _{t\leq T}p^{t}m^{t}\leq \sum _{t\leq T}m_{i}^{t}+{\frac {\ln(N)}{\eta }}+\eta T}$

Initialization: Fix an ${\displaystyle \eta >0}$. For each expert, associate the weight ${\displaystyle w_{i}^{1}}$ ≔1 For t=1,2,…,T:

      1. Pick the distribution ${\displaystyle p_{i}^{t}={\frac {w_{i}^{t}}{\Phi t}}}$ where ${\displaystyle \Phi t=\sum _{i}w_{i}^{t}}$.
      2. Observe the cost of the decision ${\displaystyle m^{t}}$. 
      3. Set 
                              ${\displaystyle w_{i}^{t+1}=w_{i}^{t}\exp(-\eta m_{i}^{t}}$).

AdaBoost algorithm

This algorithm[13] maintains a set of weights ${\displaystyle w^{t}}$ over the training examples. On every iteration ${\displaystyle t}$, a distribution ${\displaystyle p^{t}}$ is computed by normalizing these weights. This distribution is fed to the weak learner WeakLearn which generates a hypothesis ${\displaystyle h_{t}}$ that (hopefully) has small error with respect to the distribution. Using the new hypothesis ${\displaystyle h_{t}}$, AdaBoost generates the next weight vector ${\displaystyle w^{t+1}}$. The process repeats. After T such iterations, the final hypothesis ${\displaystyle h_{f}}$ is the output. The hypothesis ${\displaystyle h_{f}}$ combines the outputs of the T weak hypotheses using a weighted majority vote.[13]

Input: 
      Sequence of ${\displaystyle N}$ labeled examples (${\displaystyle x_{1}}$,${\displaystyle y_{1}}$),…,(${\displaystyle x_{N}}$, ${\displaystyle y_{N}}$)
      Distribution ${\displaystyle D}$ over the ${\displaystyle N}$ examples
      Weak learning algorithm "'WeakLearn"'
      Integer ${\displaystyle T}$ specifying number of iterations
Initialize the weight vector: ${\displaystyle w_{i}^{1}=D(i)}$ for ${\displaystyle i=1}$,..., ${\displaystyle N}$.
Do for ${\displaystyle t=1}$,..., ${\displaystyle N}$
      1. Set ${\displaystyle p^{t}={\frac {w^{t}}{\sum _{i=1}^{N}w_{i}^{t}}}}$.
      2. Call WeakLearn, providing it with the distribution ${\displaystyle p^{t}}$; get back a hypothesis ${\displaystyle h_{t}:X\rightarrow }$ [0,1].
      3. Calculate the error of ${\displaystyle h_{t}:\epsilon _{t}=\sum _{i=1}^{N}p_{i}^{t}}$|${\displaystyle h_{t}(x_{i})}$.
      4. Set ${\displaystyle \beta _{t}={\frac {\epsilon _{t}}{1-\epsilon _{t}}}}$.                                     
      5. Set the new weight vector to be ${\displaystyle w_{i}^{t+1}=w_{i}^{t}\beta _{t}^{1-|h_{t}(x_{i})-y_{i}|}}$.

Output the hypothesis:

      ${\displaystyle f(x)={\begin{cases}1&{\text{if}}\sum _{t=1}^{T}\log(1/\beta _{t})h_{t}(x)\geq {\frac {1}{2}}\sum _{t=1}^{T}\log(1/\beta _{t}){\frac {q_{1}}{W}}\\0&{\text{otherwise}}\end{cases}}}$

Solving linear programs approximately[15]

Problem

Given a ${\displaystyle m\times n}$ matrix ${\displaystyle A}$ and ${\displaystyle b\in \mathbb {R} ^{n}}$, is there a ${\displaystyle x}$ such that ${\displaystyle Ax\geq b}$?

                      ${\displaystyle \exists ?x:Ax\geq b}$              (1)

Assumption

Using the oracle algorithm in solving zero-sum problem, with an error parameter ${\displaystyle \epsilon >0}$, the output would either be a point ${\displaystyle x}$ such that ${\displaystyle Ax\geq b-\epsilon }$ or a proof that ${\displaystyle x}$ does not exist, i.e., there is no solution to this linear system of inequalities.

solution

Given vector ${\displaystyle p\in \Delta _{n}}$, solves the following relaxed problem

                     ${\displaystyle \exists ?x:p^{\textsf {T}}\!\!Ax\geq p^{\textsf {T}}\!b}$             (2)

If there exists a x satisfying (1), then x satisfies (2) for all ${\displaystyle p\in \Delta _{n}}$. The contrapositive of this statement is also true. Suppose if oracle returns a feasible solution for a ${\displaystyle p}$, the solution ${\displaystyle x}$ it returns has bounded width ${\displaystyle \max _{i}|{(Ax)}_{i}-b_{i}|\leq 1}$. So if there is a solution to (1), then there is an algorithm that its output x satisfies the system (2) up to an additive error of ${\displaystyle 2\epsilon }$. The algorithm makes at most ${\displaystyle {\frac {\ln(m)}{\epsilon ^{2}}}}$ calls to a width-bounded oracle for the problem (2). The contrapositive stands true as well. The multiplicative updates is applied in the algorithm in this case.

Other applications

Evolutionary game theory

Multiplicative weights update is the discrete-time variant of the replicator equation (replicator dynamics), which is a commonly used model in evolutionary game theory. It converges to Nash equilibrium when applied to a congestion game.[16]

Operations research and online statistical decision-making[7]

In operations research and on-line statistical decision making problem field, the weighted majority algorithm and its more complicated versions have been found independently.

Computational geometry

The multiplicative weights algorithm is also widely applied in computational geometry[7], such as Clarkson's algorithm for linear programming (LP) with a bounded number of variables in linear time.[4][5] Later, Bronnimann and Goodrich employed analogous methods to find Set Covers for hypergraphs with small VC dimension.[6]

Gradient descent method[1]

Matrix multiplicative weights update[1]

Plotkin, Shmoys, Tardos framework for packing/covering LPs[7]

Approximating multi-commodity flow problems[7]

O (logn)- approximation for many NP-hard problems[7]

Learning theory and boosting[7]

Hard-core sets and the XOR lemma[7]

Hannan's algorithm and multiplicative weights[7]

Online convex optimization[7]

References

1. "The Multiplicative Weights Update Method: A Meta-Algorithm and Applications" (PDF). May 2012.
2. "The Multiplicative Weights Algorithm*" (PDF). Retrieved 9 November 2016.
3. "A sublinear-time randomized approximation algorithm for matrix games". 1995. Missing or empty |url= (help)
4. KENNETH L. CLARKSON. A Las Vegas algorithm for linear programming when the dimension is small., In Proc. 29th FOCS, pp. 452–456. IEEE Comp. Soc. Press, 1988.[doi:10.1109/SFCS.1988.21961] 123, 152.
5. KENNETH L. CLARKSON. A Las Vegas algorithm for linear and integer programming when the dimension is small., J. ACM, 42:488–499, 1995. [doi:10.1145/201019.201036] 123, 152.
6. H. BRONNIMANN AND ¨ M.T. GOODRICH. Almost optimal set covers in finite VC-dimension., Discrete Comput. Geom., 14:463–479, 1995. Preliminary version in 10th Ann. Symp. Comp. Geom. (SCG'94). [doi:10.1007/BF02570718] 123, 152
7. "The Multiplicative Weights Update Method: A Meta-Algorithm and Applications" (PDF). 2012.
8. "Lecture 8: Decision-making under total uncertainty: the multiplicative weight algorithm" (PDF). 2013.
9. "COS 511: Foundations of Machine Learning" (PDF). 20 March 2006.
10. "An Algorithmist's Toolkit". 8 December 2009. Retrieved 9 November 2016.
11. Bailey, James P., and Georgios Piliouras. "Multiplicative weights update in zero-sum games." Proceedings of the 2018 ACM Conference on Economics and Computation. ACM, 2018.
12. DEAN P. FOSTER AND RAKESH VOHRA (1999). Regret in the on-line decision problem, p. 29. Games and Economic Behaviour
13. Yoav, Freund. Robert, E. Schapire (1996). TA Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting*, p. 55. journal of computer and system sciences.
14. "Online Learning from Experts: Weighed Majority and Hedge" (PDF). Retrieved 7 December 2016.
15. "Fundamentals of Convex Optimization" (PDF). Retrieved 9 November 2016.
16. Kleinberg, Robert, Georgios Piliouras, and Eva Tardos. "Multiplicative updates outperform generic no-regret learning in congestion games." Proceedings of the forty-first annual ACM symposium on Theory of computing. ACM, 2009.

External links