The Multiplicative Weights Update Method: a Meta-Algorithm and Applications

Algorithms in varied fields use the idea of maintaining a distribution over a certain set and use the multiplicative update rule to iteratively change these weights. Their analyses are usually very similar and rely on an exponential potential function. In this survey we present a simple meta-algorithm that unifies many of these disparate algorithms and derives them as simple instantiations of the meta-algorithm. We feel that since this meta-algorithm and its analysis are so simple, and its applications so broad, it should be a standard part of algorithms courses, like “divide and conquer.”

Randomized RoundingWithout Solving the…Randomized Rounding Without Solving the Linear ProgramA sublinear-timerandomized approximatio…A sublinear-time randomized approximation algorithm for matrix gamesFaster and SimplerAlgorithms for…Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing ProblemsAdaptive Game PlayingUsing Multiplicative…Adaptive Game Playing Using Multiplicative WeightsOn the Number ofIterations for…On the Number of Iterations for Dantzig-Wolfe Optimization and Packing-Covering Approximation AlgorithmsLagrangian relaxationbased algorithms for…Lagrangian relaxation based algorithms for convex programming problemsFast Algorithms forApproximate Semide.nite…Fast Algorithms for Approximate Semide.nite Programming using the Multiplicative Weights Update MethodEfficient algorithms foronline convex…Efficient algorithms for online convex optimization and their applicationsOnline VarianceMinimizationOnline Variance MinimizationEfficient algorithmsusing the multiplicativ…Efficient algorithms using the multiplicative weights update methodA Combinatorial,Primal-Dual Approach to…A Combinatorial, Primal-Dual Approach to Semidefinite ProgramsLogarithmic regretalgorithms for online…Logarithmic regret algorithms for online convex optimizationOnline Learning withPrior KnowledgeOnline Learning with Prior KnowledgeParallel Approximationof Non-interactive…Parallel Approximation of Non-interactive Zero-sum Quantum GamesNear Optimal OnlineAlgorithms and Fast…Near Optimal Online Algorithms and Fast Approximation Algorithms for Resource Allocation ProblemsOptimization, Learning,and Games with…Optimization, Learning, and Games with Predictable SequencesFast Algorithms forOnline Stochastic Conve…Fast Algorithms for Online Stochastic Convex ProgrammingAccess to Data andNumber of IterationsAccess to Data and Number of IterationsOnline Learning withAdversarial DelaysOnline Learning with Adversarial DelaysThe Computational Powerof Optimization in…The Computational Power of Optimization in Online LearningOnline Learning with aHintOnline Learning with a HintA Quantum Interior PointMethod for LPs and SDPsA Quantum Interior Point Method for LPs and SDPsOnline LearningAlgorithmsOnline Learning AlgorithmsMemory Bounds for theExperts ProblemMemory Bounds for the Experts ProblemThe MultiplicativeWeights Update Method…The Multiplicative Weights Update Method: a Meta-Algorithm and ApplicationsEarlier referencesFocus paperCiting papersOlderNewer

Click a node to pin it, click the empty canvas to go back to this paper, or hover to preview. Open a node’s page from its title.