conftrace_

regret bound

1926 papers

Explore in graph

Also known as

RB

Co-occurring keywords

online learning (1777) multi-armed bandit (1098) contextual bandit (381) stochastic optimization (1060) reinforcement learning (4352) online algorithm (445) upper confidence bound (197) markov decision process (790) thompson sampling (237) online convex optimization (165)

Papers

Towards Minimax Optimal Reinforcement Learning in Factored Markov Decision Processes NIPS 2020
Risk-Sensitive Reinforcement Learning: Near-Optimal Risk-Sample Tradeoff in Regret NIPS 2020
Optimal Algorithms for Stochastic Multi-Armed Bandits with Heavy Tailed Rewards NIPS 2020
Frequentist Regret Bounds for Randomized Least-Squares Value Iteration AISTATS 2020
Conservative Exploration in Reinforcement Learning AISTATS 2020
Statistical Efficiency of Thompson Sampling for Combinatorial Semi-Bandits NIPS 2020
Geometric Exploration for Online Control NIPS 2020
Better Full-Matrix Regret via Parameter-Free Online Learning NIPS 2020
Exploiting Higher Order Smoothness in Derivative-free Optimization and Continuous Bandits NIPS 2020
A Tight Lower Bound and Efficient Reduction for Swap Regret NIPS 2020
Hedging in games: Faster convergence of external and swap regrets NIPS 2020
Active Learning of Conditional Mean Embeddings via Bayesian Optimisation UAI 2020
Generalized Policy Elimination: an efficient algorithm for Nonparametric Contextual Bandits UAI 2020
Semi-bandit Optimization in the Dispersed Setting UAI 2020
Nearly Optimal Regret for Stochastic Linear Bandits with Heavy-Tailed Payoffs IJCAI 2020
Zeroth Order Non-convex optimization with Dueling-Choice Bandits UAI 2020
Online Parameter-Free Learning of Multiple Low Variance Tasks UAI 2020
Constrained Upper Confidence Reinforcement Learning L4DC 2020
Parameterized Indexed Value Function for Efficient Exploration in Reinforcement Learning AAAI 2020
Provably efficient reinforcement learning with linear function approximation COLT 2020
On Efficiency in Hierarchical Reinforcement Learning NIPS 2020
Online Positive and Unlabeled Learning IJCAI 2020
Bayesian Optimization using Pseudo-Points IJCAI 2020
Adversarial Bandits with Corruptions: Regret Lower Bound and No-regret Algorithm NIPS 2020
Stochastic Linear Contextual Bandits with Diverse Contexts AISTATS 2020