Authors: Sanjeev Arora , Elad Hazan , Satyen Kale - ACM Symposium on Theory of Computing, STOC 2005 cited by 925
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.”
✨ Checking sign-in… PDF Cited by View BibTeX Hide BibTeX View BibTeX Cite
Randomized Rounding Without Solving the… Randomized Rounding Without Solving the Linear Program A sublinear-time randomized approximatio… A sublinear-time randomized approximation algorithm for matrix games Faster and Simpler Algorithms for… Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems Adaptive Game Playing Using Multiplicative… Adaptive Game Playing Using Multiplicative Weights On the Number of Iterations for… On the Number of Iterations for Dantzig-Wolfe Optimization and Packing-Covering Approximation Algorithms Lagrangian relaxation based algorithms for… Lagrangian relaxation based algorithms for convex programming problems Fast Algorithms for Approximate Semide.nite… Fast Algorithms for Approximate Semide.nite Programming using the Multiplicative Weights Update Method Efficient algorithms for online convex… Efficient algorithms for online convex optimization and their applications Online Variance Minimization Online Variance Minimization Efficient algorithms using the multiplicativ… Efficient algorithms using the multiplicative weights update method A Combinatorial, Primal-Dual Approach to… A Combinatorial, Primal-Dual Approach to Semidefinite Programs Logarithmic regret algorithms for online… Logarithmic regret algorithms for online convex optimization Online Learning with Prior Knowledge Online Learning with Prior Knowledge Parallel Approximation of Non-interactive… Parallel Approximation of Non-interactive Zero-sum Quantum Games Near Optimal Online Algorithms and Fast… Near Optimal Online Algorithms and Fast Approximation Algorithms for Resource Allocation Problems Optimization, Learning, and Games with… Optimization, Learning, and Games with Predictable Sequences Fast Algorithms for Online Stochastic Conve… Fast Algorithms for Online Stochastic Convex Programming Access to Data and Number of Iterations Access to Data and Number of Iterations Online Learning with Adversarial Delays Online Learning with Adversarial Delays The Computational Power of Optimization in… The Computational Power of Optimization in Online Learning Online Learning with a Hint Online Learning with a Hint A Quantum Interior Point Method for LPs and SDPs A Quantum Interior Point Method for LPs and SDPs Online Learning Algorithms Online Learning Algorithms Memory Bounds for the Experts Problem Memory Bounds for the Experts Problem The Multiplicative Weights Update Method… The Multiplicative Weights Update Method: a Meta-Algorithm and Applications Earlier references Focus paper Citing papers Older Newer 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.