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

Multiple-Play Bandits in the Position-Based Model NIPS 2016
Pricing a Low-regret Seller ICML 2016
Heteroscedastic Sequences: Beyond Gaussianity ICML 2016
Time series prediction and online learning COLT 2016
On the Complexity of Best-Arm Identification in Multi-Armed Bandit Models JMLR 2016
Minimum Regret Search for Single- and Multi-Task Optimization ICML 2016
Minimizing Regret on Reflexive Banach Spaces and Nash Equilibria in Continuous Zero-Sum Games NIPS 2016
Gains and Losses are Fundamentally Different in Regret Minimization: The Sparse Case JMLR 2016
Online Learning and Blackwell Approachability in Quitting Games COLT 2016
Safe Policy Improvement by Minimizing Robust Baseline Regret NIPS 2016
Strongly Adaptive Online Learning ICML 2015
Simple regret for infinitely many armed bandits ICML 2015
Bandit Convex Optimization: \sqrtT Regret in One Dimension COLT 2015
Online Learning of Eigenvectors ICML 2015
Minimax Fixed-Design Linear Regression COLT 2015
Explore no more: Improved high-probability regret bounds for non-stochastic bandits NIPS 2015
Qualitative Multi-Armed Bandits: A Quantile-Based Approach ICML 2015
Copeland Dueling Bandits NIPS 2015
Exploiting easy data in online optimization NIPS 2014
On the convergence of no-regret learning in selfish routing ICML 2014
Multiarmed Bandits With Limited Expert Advice COLT 2014
Efficient Partial Monitoring with Prior Information NIPS 2014
Stochastic Multi-Armed-Bandit Problem with Non-stationary Rewards NIPS 2014
Online Decision-Making in General Combinatorial Spaces NIPS 2014
Beyond the Regret Minimization Barrier: Optimal Algorithms for Stochastic Strongly-Convex Optimization JMLR 2014