multiplicative weights update

Computational Intractability of Strategizing against Online Learners COLT 2025 Langevin Multiplicative Weights Update with Applications in Polynomial Portfolio Management AAAI 2025 On Distributional Discrepancy for Experimental Design with General Assignment Probabilities AISTATS 2025 Fast Last-Iterate Convergence of Learning in Games Requires Forgetful Algorithms NeurIPS 2024 Multiplicative Weights Update, Area Convexity and Random Coordinate Descent for Densest Subgraph Problems ICML 2024 Faster Last-iterate Convergence of Policy Optimization in Zero-Sum Markov Games ICLR 2023 Last-Iterate Convergence with Full and Noisy Feedback in Two-Player Zero-Sum Games AISTATS 2023 Robust Load Balancing with Machine Learned Advice JMLR 2023 Accelerated Multiplicative Weights Update Avoids Saddle Points Almost Always IJCAI 2022 Consensus Multiplicative Weights Update: Learning to Learn using Projector-based Game Signatures ICML 2022 Forward Looking Best-Response Multiplicative Weights Update Methods for Bilinear Zero-sum Games AISTATS 2022 Scalable and Memory-Efficient Algorithms for Controlling Networked Epidemic Processes Using Multiplicative Weights Update Method IJCAI 2022 The Evolution of Uncertainty of Learning in Games ICLR 2022 Chaos of Learning Beyond Zero-sum and Coordination via Game Decompositions ICLR 2021 Learning in Matrix Games can be Arbitrarily Complex COLT 2021 Linear Last-iterate Convergence in Constrained Saddle-point Optimization ICLR 2021 Near-Optimal No-Regret Learning in General Games NeurIPS 2021 Online k-means Clustering AISTATS 2021 Chaos, Extremism and Optimism: Volume Analysis of Learning in Games NeurIPS 2020 Robust and Heavy-Tailed Mean Estimation Made Simple, via Regret Minimization NeurIPS 2020 The route to chaos in routing games: When is price of anarchy too optimistic? NeurIPS 2020 Multiplicative Weights Updates as a distributed constrained optimization algorithm: Convergence to second-order stationary points almost always ICML 2019 Randomized Strategies for Robust Combinatorial Optimization AAAI 2019 Rethinking Generative Mode Coverage: A Pointwise Guaranteed Approach NeurIPS 2019 Vortices Instead of Equilibria in MinMax Optimization: Chaos and Butterfly Effects of Online Learning in Zero-Sum Games COLT 2019