conftrace_

minimax regret

74 papers

Explore in graph

Co-occurring keywords

online learning (1777) regret bound (1926) multi-armed bandit (1098) contextual bandit (381) partial monitoring (32) logarithmic loss (13) bandit feedback (118) markov decision process (790) online algorithm (445) sequential probability assignment (4)

Papers

Adaptively Tracking the Best Bandit Arm with an Unknown Number of Distribution Changes COLT 2019
An Information-Theoretic Approach to Minimax Regret in Partial Monitoring COLT 2019
Nearly Minimax-Optimal Regret for Linearly Parameterized Bandits COLT 2019
Confounding-Robust Policy Improvement NIPS 2018
Minimax-Regret Querying on Side Effects for Safe Optimality in Factored Markov Decision Processes IJCAI 2018
Minimax Regret Bounds for Reinforcement Learning ICML 2017
Algorithmic Chaining and the Role of Partial Feedback in Online Nonparametric Learning COLT 2017
On Explore-Then-Commit strategies NIPS 2016
Second-order Quantile Methods for Experts and Combinatorial Games COLT 2015
Bandit Convex Optimization: \sqrtT Regret in One Dimension COLT 2015
Minimax Fixed-Design Linear Regression COLT 2015
Online Learning with Feedback Graphs: Beyond Bandits COLT 2015
Sharp Oracle Bounds for Monotone and Convex Regression Through Aggregation JMLR 2015
Achievability of Asymptotic Minimax Regret by Horizon-Dependent and Horizon-Independent Strategies JMLR 2015
Online Learning with Composite Loss Functions COLT 2014
Near-Optimal Herding COLT 2014
On the Complexity of A/B Testing COLT 2014
Online Non-Parametric Regression COLT 2014
Regret based Robust Solutions for Uncertain Markov Decision Processes NIPS 2013
Minimax Optimal Algorithms for Unconstrained Linear Optimization NIPS 2013
Achievability of Asymptotic Minimax Regret in Online and Batch Prediction ACML 2013
Minimax Regret of Finite Partial-Monitoring Games in Stochastic Environments COLT 2011
Minimax Policies for Combinatorial Prediction Games COLT 2011
Minimax Regret Classifier for Imprecise Class Distributions JMLR 2007