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

Sub-linear Regret Bounds for Bayesian Optimisation in Unknown Search Spaces NIPS 2020
Logarithmic Regret Bound in Partially Observable Linear Dynamical Systems NIPS 2020
Simultaneously Learning Stochastic and Adversarial Episodic MDPs with Known Transition NIPS 2020
Bias no more: high-probability data-dependent regret bounds for adversarial bandits and MDPs NIPS 2020
Online learning with dynamics: A minimax perspective NIPS 2020
Adapting to Misspecification in Contextual Bandits NIPS 2020
Bandit Linear Control NIPS 2020
Adversarial Blocking Bandits NIPS 2020
Online Continuous DR-Submodular Maximization with Long-Term Budget Constraints AISTATS 2020
Crush Optimism with Pessimism: Structured Bandits Beyond Asymptotic Optimality NIPS 2020
Tight First- and Second-Order Regret Bounds for Adversarial Linear Bandits NIPS 2020
Unreasonable Effectiveness of Greedy Algorithms in Multi-Armed Bandit with Many Arms NIPS 2020
Locally-Adaptive Nonparametric Online Learning NIPS 2020
A single algorithm for both restless and rested rotting bandits AISTATS 2020
Regret Bounds for Decentralized Learning in Cooperative Multi-Agent Dynamical Systems UAI 2020
Optimal Algorithms for Multiplayer Multi-Armed Bandits AISTATS 2020
An Asymptotically Optimal Primal-Dual Incremental Algorithm for Contextual Linear Bandits NIPS 2020
A Farewell to Arms: Sequential Reward Maximization on a Budget with a Giving Up Option AISTATS 2020
Dynamic Assortment Optimization with Changing Contextual Information JMLR 2020
Improved Algorithms for Online Submodular Maximization via First-order Regret Bounds NIPS 2020
Adaptive Exploration in Linear Contextual Bandit AISTATS 2020
An Optimal Algorithm for Adversarial Bandits with Arbitrary Delays AISTATS 2020
A Novel Confidence-Based Algorithm for Structured Bandits AISTATS 2020
Online Convex Optimization with Perturbed Constraints: Optimal Rates against Stronger Benchmarks AISTATS 2020
Model Selection in Contextual Stochastic Bandit Problems NIPS 2020