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

Information-Theoretic Confidence Bounds for Reinforcement Learning NIPS 2019
Large Scale Markov Decision Processes with Changing Rewards NIPS 2019
Near-Optimal Reinforcement Learning in Dynamic Treatment Regimes NIPS 2019
Mo' States Mo' Problems: Emergency Stop Mechanisms from Observation NIPS 2019
Regret Bounds for Learning State Representations in Reinforcement Learning NIPS 2019
Maximum Expected Hitting Cost of a Markov Decision Process and Informativeness of Rewards NIPS 2019
XNAS: Neural Architecture Search with Expert Advice NIPS 2019
Prior-Free Dynamic Auctions with Low Regret Buyers NIPS 2019
Personalizing Many Decisions with High-Dimensional Covariates NIPS 2019
SIC-MMAB: Synchronisation Involves Communication in Multiplayer Multi-Armed Bandits NIPS 2019
Nonstochastic Multiarmed Bandits with Unrestricted Delays NIPS 2019
Dynamic Incentive-Aware Learning: Robust Pricing in Contextual Auctions NIPS 2019
Linear Stochastic Bandits Under Safety Constraints NIPS 2019
Non-Asymptotic Gap-Dependent Regret Bounds for Tabular MDPs NIPS 2019
Online Stochastic Shortest Path with Bandit Feedback and Unknown Transition Function NIPS 2019
On the Optimality of Perturbations in Stochastic and Adversarial Multi-armed Bandit Problems NIPS 2019
Online Continuous Submodular Maximization: From Full-Information to Bandit Feedback NIPS 2019
Oracle-Efficient Algorithms for Online Linear Optimization with Bandit Feedback NIPS 2019
On-Line Learning of Linear Dynamical Systems: Exponential Forgetting in Kalman Filters AAAI 2019
Fast and Furious Learning in Zero-Sum Games: Vanishing Regret with Non-Vanishing Step Sizes NIPS 2019
Semi-Parametric Dynamic Contextual Pricing NIPS 2019
Thompson Sampling for Multinomial Logit Contextual Bandits NIPS 2019
Equipping Experts/Bandits with Long-term Memory NIPS 2019
Bootstrapping Upper Confidence Bound NIPS 2019
Dynamic Local Regret for Non-convex Online Forecasting NIPS 2019