conftrace_

online mirror descent

40 papers

Explore in graph

Also known as

OMD

Co-occurring keywords

regret bound (1926) online learning (1777) multi-armed bandit (1098) nash equilibrium (398) extensive-form game (86) online convex optimization (165) game theory (854) stochastic optimization (1060) adversarial bandit (59) mirror descent (148)

Papers

A Closer Look at Small-loss Bounds for Bandits with Graph Feedback COLT 2020
Dual Mirror Descent for Online Allocation Problems ICML 2020
Regret Bounds without Lipschitz Continuity: Online Learning with Relative-Lipschitz Losses NIPS 2020
Online-Within-Online Meta-Learning NIPS 2019
Exponential Weights on the Hypercube in Polynomial Time AISTATS 2019
Multi-scale Online Learning: Theory and Applications to Online Auctions and Pricing JMLR 2019
An Optimal Algorithm for Stochastic and Adversarial Bandits AISTATS 2019
Nearly second-order optimality of online joint detection and estimation via one-sample update schemes AISTATS 2018
Efficient Online Portfolio with Logarithmic Regret NIPS 2018
More Adaptive Algorithms for Adversarial Bandits COLT 2018
On Equivalence of Martingale Tail Bounds and Deterministic Regret Inequalities COLT 2017
Corralling a Band of Bandit Algorithms COLT 2017
Countering Feedback Delays in Multi-Agent Learning NIPS 2017
Online Decision-Making in General Combinatorial Spaces NIPS 2014
On the Universality of Online Mirror Descent NIPS 2011