The multiplicative weights update method: a meta-algorithm and applications
From MaRDI portal
Recommendations
Cites work
- A threshold of ln n for approximating set cover
- Almost optimal set covers in finite VC-dimension
- scientific article; zbMATH DE number 1256751 (Why is no real title available?)
- scientific article; zbMATH DE number 1342139 (Why is no real title available?)
- 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)- Packing trees in communication networks
- Costly circuits, submodular schedules and approximate Carathéodory theorems
- Solving MIPs via scaling-based augmentation
- Sex with no regrets: how sexual reproduction uses a no regret learning algorithm for evolutionary advantage
- Learning in games with continuous action sets and unknown payoff functions
- Fast approximation of matroid packing and covering
- Q-learning for Markov decision processes with a satisfiability criterion
- Efficient semidefinite branch-and-cut for MAP-MRF inference
- Dynamics of Bayesian updating with dependent data and misspecified models
- On the convergence time of a natural dynamics for linear programming
- Correlation clustering in data streams
- A Laplacian approach to _1-norm minimization
- A poly-log competitive posted-price algorithm for online metrical matching on a spider
- Constrained no-regret learning
- Mirror descent algorithms for minimizing interacting free energy
- An SDP primal-dual algorithm for approximating the Lovász-theta function
- Bounding the inefficiency of outcomes in generalized second price auctions
- Near-linear algorithms for geometric hitting sets and set covers
- Predictive spreadsheet autocompletion with constraints
- Exponential weight approachability, applications to calibration and regret minimization
- A unifying learning framework for building artificial game-playing agents
- Hedge algorithm and dual averaging schemes
- A multiplicative weights update algorithm for MINLP
- Approximation and online algorithms for multidimensional bin packing: a survey
- Nearly linear-time packing and covering LP solvers. Nearly linear-time packing and covering LP solvers, achieving width-independence and =(1/)-convergence
- Convergence of the exponentiated gradient method with Armijo line search
- Geometric distinguishability measures limit quantum channel estimation and discrimination
- Better bin packing approximations via discrepancy theory
- Deciding probabilistic automata weak bisimulation: theory and practice
- In pursuit of the dynamic optimality conjecture
- On incremental approximate saddle-point computation in zero-sum matrix games
- On the Number of Iterations for Dantzig--Wolfe Optimization and Packing-Covering Approximation Algorithms
- Efficient primal-dual graph algorithms for MapReduce
- Algorithms, games, and evolution
- Linear programming in the semi-streaming model with application to the maximum matching problem
- Convergence time of power-control dynamics
- Sublinear time algorithms for approximate semidefinite programming
- On learning algorithms for Nash equilibria
- Resonator Networks, 2: Factorization Performance and Capacity Compared to Optimization-Based Methods
- Towards more practical linear programming-based techniques for algorithmic mechanism design
- Oracle-based robust optimization via online learning
- Privacy and truthful equilibrium selection for aggregative games
- Parallel approximation of min-max problems
- Optimal partition trees
- Near-optimal distributed maximum flow
- Learning equilibria of a stochastic game on Gaussian interference channels with incomplete information
- Linear coupling: an ultimate unification of gradient and mirror descent
- Mutation, Sexual Reproduction and Survival in Dynamic Environments
- A nearly linear-time PTAS for explicit fractional packing and covering linear programs
- Epsilon-net method for optimizations over separable states
- Family of chaotic maps from game theory
- Fractional set cover in the streaming model
- Towards more practical linear programming-based techniques for algorithmic mechanism design
- Finding Sparse Solutions for Packing and Covering Semidefinite Programs
- Oracle-Based Primal-Dual Algorithms for Packing and Covering Semidefinite Programs
- Fast and deterministic approximations for \(k\)-cut
- scientific article; zbMATH DE number 7559394 (Why is no real title available?)
- Multi-Finger Binary Search Trees
- Quantum SDP solvers: large speed-ups, optimality, and applications to quantum learning
- Dynamic resource allocation in the cloud with near-optimal efficiency
- A note on fractional coloring and the integrality gap of LP for maximum weight independent set
- The power of vertex sparsifiers in dynamic graph algorithms
- SVM via saddle point optimization: new bounds and distributed algorithms
- Solving zero-sum games using best-response oracles with applications to search games
- On the convergence time of a natural dynamics for linear programming
- Inferring Sparse Preference Lists from Partial Information
- New error measures and methods for realizing protein graphs from distance data
- Optimization with Non-Differentiable Constraints with Applications to Fairness, Recall, Churn, and Other Goals
- Dynamic pricing with multiple products and partially specified demand distribution
- Online learning of Nash equilibria in congestion games
- Bandit-based task assignment for heterogeneous crowdsourcing
- Multi-scale online learning: theory and applications to online auctions and pricing
- Active learning for cost-sensitive classification
- Partitioning well-clustered graphs: spectral clustering works!
- Near-optimal algorithms for online matrix prediction
- On the convergence of mirror descent beyond stochastic convex programming
- Online learning of quantum states
- Dual space preconditioning for gradient descent
- scientific article; zbMATH DE number 7662168 (Why is no real title available?)
- Optimal anytime regret with two experts
- A practitioner’s guide to quantum algorithms for optimisation problems
- A stochastic variant of replicator dynamics in zero-sum games and its invariant measures
- Optimistic optimisation of composite objective with exponentiated update
- Online max-min fair allocation
- No-regret learning for repeated non-cooperative games with lossy bandits
- Log-domain interior-point methods for convex quadratic programming
- Clarkson's algorithm for violator spaces
- Distributed dense subgraph detection and low outdegree orientation
- Solving maxmin optimization problems via population games
- Adversarial bandits with knapsacks
- A bicriteria approximation algorithm for the minimum hitting set problem in measurable range spaces
- A natural adaptive process for collective decision-making
- An improved deterministic algorithm for the online min-sum set cover problem
- Efficient use of quantum linear system algorithms in inexact infeasible IPMs for linear optimization
- Efficient Kirszbraun extension with applications to regression
- The complexity of the distributed constraint satisfaction problem
- Asymmetric replicator dynamics on Polish spaces: invariance, stability, and convergence
- The evolutionary dynamics of soft-max policy gradient in multi-agent settings
- An \(\alpha \)-regret analysis of adversarial bilateral trade
- The online min-sum set cover problem
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)
