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)- Fractional set cover in the streaming model
- scientific article; zbMATH DE number 7561520 (Why is no real title available?)
- Geometric distinguishability measures limit quantum channel estimation and discrimination
- Computing data distribution from query selectivities
- Mutation, Sexual Reproduction and Survival in Dynamic Environments
- From Darwin to Poincaré and von Neumann: recurrence and cycles in evolutionary and algorithmic game theory
- Electrical flows for polylogarithmic competitive oblivious routing
- Smooth Nash equilibria: algorithms and complexity
- Near-linear algorithms for geometric hitting sets and set covers
- Optimal partition trees
- Log-domain interior-point methods for convex quadratic programming
- Tree-packing revisited: faster fully dynamic min-cut and arboricity
- Predictive spreadsheet autocompletion with constraints
- A simple (1-)-approximation semi-streaming algorithm for maximum (weighted) matching
- Towards more practical linear programming-based techniques for algorithmic mechanism design
- A note on fractional coloring and the integrality gap of LP for maximum weight independent set
- Distributed dense subgraph detection and low outdegree orientation
- Nearly linear-time packing and covering LP solvers. Nearly linear-time packing and covering LP solvers, achieving width-independence and =(1/)-convergence
- An \(\alpha \)-regret analysis of adversarial bilateral trade
- Towards more practical linear programming-based techniques for algorithmic mechanism design
- Bounding the inefficiency of outcomes in generalized second price auctions
- Q-learning for Markov decision processes with a satisfiability criterion
- Solving zero-sum games using best-response oracles with applications to search games
- Solving maxmin optimization problems via population games
- Oracle-Based Primal-Dual Algorithms for Packing and Covering Semidefinite Programs
- New error measures and methods for realizing protein graphs from distance data
- Convergence of the exponentiated gradient method with Armijo line search
- Algorithms, games, and evolution
- Packing trees in communication networks
- Adversarial bandits with knapsacks
- On the Number of Iterations for Dantzig--Wolfe Optimization and Packing-Covering Approximation Algorithms
- Fast and deterministic approximations for \(k\)-cut
- 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
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)
