The multiplicative weights update method: a meta-algorithm and applications
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1256751 (Why is no real title available?)
- scientific article; zbMATH DE number 1342139 (Why is no real title available?)
- A threshold of ln n for approximating set cover
- Almost optimal set covers in finite VC-dimension
- Online primal-dual algorithms for covering and packing
- Regret in the on-line decision problem
- The weighted majority algorithm
Cited in
(only showing first 100 items - show all)- Optimization over a probability simplex
- Dynamic resource allocation in the cloud with near-optimal efficiency
- Linear programming in the semi-streaming model with application to the maximum matching problem
- On the convergence time of a natural dynamics for linear programming
- A bicriteria approximation algorithm for the minimum hitting set problem in measurable range spaces
- On the convergence time of a natural dynamics for linear programming
- Replicator dynamics: old and new
- Sex with no regrets: how sexual reproduction uses a no regret learning algorithm for evolutionary advantage
- Better bin packing approximations via discrepancy theory
- Fast approximation of matroid packing and covering
- Linear coupling: an ultimate unification of gradient and mirror descent
- Active learning for cost-sensitive classification
- Faster approximate covering of subcurves under the Fréchet distance
- Resource sharing revisited: local weak duality and optimal convergence
- A natural adaptive process for collective decision-making
- Near-optimal distributed maximum flow
- Efficient primal-dual graph algorithms for MapReduce
- Dynamic pricing with multiple products and partially specified demand distribution
- An improved deterministic algorithm for the online min-sum set cover problem
- No-regret learning for repeated non-cooperative games with lossy bandits
- On learning algorithms for Nash equilibria
- Deciding probabilistic automata weak bisimulation: theory and practice
- On incremental approximate saddle-point computation in zero-sum matrix games
- An SDP primal-dual algorithm for approximating the Lovász-theta function
- Bandit-based task assignment for heterogeneous crowdsourcing
- On the discrete-time origins of the replicator dynamics: from convergence to instability and chaos
- Learning in games with continuous action sets and unknown payoff functions
- The complexity of the distributed constraint satisfaction problem
- In pursuit of the dynamic optimality conjecture
- A unifying learning framework for building artificial game-playing agents
- Efficient use of quantum linear system algorithms in inexact infeasible IPMs for linear optimization
- Online learning of quantum states
- The attractor of the replicator dynamic in zero-sum games
- A stochastic variant of replicator dynamics in zero-sum games and its invariant measures
- A multiplicative weights update algorithm for MINLP
- Sublinear time algorithms for approximate semidefinite programming
- The replicator dynamic, chain components and the response graph
- Exponentiated gradient meets gradient descent
- A poly-log competitive posted-price algorithm for online metrical matching on a spider
- Efficient Kirszbraun extension with applications to regression
- Graph matching via convex relaxation to the simplex
- Smoothed analysis with adaptive adversaries
- Last round convergence and no-dynamic regret in asymmetric repeated games
- Efficient and optimal fixed-time regret with two experts
- Semi-iterative minimum cross-entropy algorithms for rare-events, counting, combinatorial and integer programming
- Inferring Sparse Preference Lists from Partial Information
- Privacy and truthful equilibrium selection for aggregative games
- Costly circuits, submodular schedules and approximate Carathéodory theorems
- Exponential weight approachability, applications to calibration and regret minimization
- Finding Sparse Solutions for Packing and Covering Semidefinite Programs
- Two-player games for efficient non-convex constrained optimization
- Generalize across tasks: efficient algorithms for linear representation learning
- Approximation and online algorithms for multidimensional bin packing: a survey
- Swim till you sink: computing the limit of a game
- Constrained no-regret learning
- Mirror descent algorithms for minimizing interacting free energy
- Learning the follower's objective function in sequential bilevel games
- A practitioner’s guide to quantum algorithms for optimisation problems
- Dual space preconditioning for gradient descent
- Correlation clustering in data streams
- A nearly optimal deterministic online algorithm for non-metric facility location
- Optimal anytime regret with two experts
- Committee polyhedral separability: complexity and polynomial approximation
- The complexity of the distributed constraint satisfaction problem
- Dynamics of Bayesian updating with dependent data and misspecified models
- Multi-scale online learning: theory and applications to online auctions and pricing
- The power of vertex sparsifiers in dynamic graph algorithms
- Multi-Finger Binary Search Trees
- Solving MIPs via scaling-based augmentation
- Online learning of Nash equilibria in congestion games
- A Laplacian approach to _1-norm minimization
- On the convergence of mirror descent beyond stochastic convex programming
- Interval maps mimicking circle rotations
- Family of chaotic maps from game theory
- The online min-sum set cover problem
- Clarkson's algorithm for violator spaces
- Learning equilibria of a stochastic game on Gaussian interference channels with incomplete information
- Oracle-based robust optimization via online learning
- Near-optimal algorithms for online matrix prediction
- scientific article; zbMATH DE number 7559394 (Why is no real title available?)
- Online max-min fair allocation
- Partitioning well-clustered graphs: spectral clustering works!
- SVM via saddle point optimization: new bounds and distributed algorithms
- A nearly linear-time PTAS for explicit fractional packing and covering linear programs
- Hedge algorithm and dual averaging schemes
- Optimization with Non-Differentiable Constraints with Applications to Fairness, Recall, Churn, and Other Goals
- Autobidding with constraints
- Efficient semidefinite branch-and-cut for MAP-MRF inference
- Parallel approximation of min-max problems
- scientific article; zbMATH DE number 7662168 (Why is no real title available?)
- Approximate cut \& packing ratios for multi-commodity arborescences
- Resonator Networks, 2: Factorization Performance and Capacity Compared to Optimization-Based Methods
- Convergence time of power-control dynamics
- Epsilon-net method for optimizations over separable states
- Eigenvalue problems via the multiplicative weights update method
- Globally optimal strategy against the hedge algorithm in repeated games
- Optimal multi-distribution learning
- Optimistic optimisation of composite objective with exponentiated update
- Asymmetric replicator dynamics on Polish spaces: invariance, stability, and convergence
- The evolutionary dynamics of soft-max policy gradient in multi-agent settings
This page was built for publication: The multiplicative weights update method: a meta-algorithm and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2913806)
