conftrace_

regret minimization

315 papers

Explore in graph

Co-occurring keywords

online learning (1777) multi-armed bandit (1098) regret bound (1926) stochastic optimization (1060) game theory (854) online algorithm (445) reinforcement learning (4352) markov decision process (790) nash equilibrium (398) extensive-form game (86)

Papers

The adversarial stochastic shortest path problem with unknown transition probabilities AISTATS 2012
Robust approachability and regret minimization in games with partial monitoring COLT 2011
Adaptive Hedge NIPS 2011
Bandits, Query Learning, and the Haystack Dimension COLT 2011
Beyond the regret minimization barrier: an optimal algorithm for stochastic strongly-convex optimization COLT 2011
A Finite-Time Analysis of Multi-armed Bandits Problems with Kullback-Leibler Divergences COLT 2011
Prediction strategies without loss NIPS 2011
Online Learning: Beyond Regret COLT 2011
Random Walk Approach to Regret Minimization NIPS 2010
Non-Stochastic Bandit Slate Problems NIPS 2010
Online Classification with Specificity Constraints NIPS 2010
A Parameter-free Hedging Algorithm NIPS 2009
Adaptive Online Gradient Descent NIPS 2007
Regret Minimization in Games with Incomplete Information NIPS 2007
Convex Repeated Games and Fenchel Duality NIPS 2006