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

Optimal Exploitation of Clustering and History Information in Multi-armed Bandit IJCAI 2019
Cascading Non-Stationary Bandits: Online Learning to Rank in the Non-Stationary Cascade Model IJCAI 2019
Improved Algorithm on Online Clustering of Bandits IJCAI 2019
Unifying the Stochastic and the Adversarial Bandits with Knapsack IJCAI 2019
High Dimensional Bayesian Optimization via Supervised Dimension Reduction IJCAI 2019
Thompson Sampling on Symmetric Alpha-Stable Bandits IJCAI 2019
On Asymptotic and Finite-Time Optimality of Bayesian Predictors JMLR 2019
Multi-scale Online Learning: Theory and Applications to Online Auctions and Pricing JMLR 2019
On the optimality of the Hedge algorithm in the stochastic regime JMLR 2019
Variational Regret Bounds for Reinforcement Learning UAI 2019
Reducing Exploration of Dying Arms in Mortal Bandits UAI 2019
Problem-dependent Regret Bounds for Online Learning with Feedback Graphs UAI 2019
Policy Certificates: Towards Accountable Reinforcement Learning ICML 2019
Optimistic Policy Optimization via Multiple Importance Sampling ICML 2019
Sample-Optimal Parametric Q-Learning Using Linearly Additive Features ICML 2019
Tighter Problem-Dependent Regret Bounds in Reinforcement Learning without Domain Knowledge using Value Function Bounds ICML 2019
Incremental Randomized Sketching for Online Kernel Learning ICML 2019
Leveraging Observations in Bandits: Between Risks and Benefits AAAI 2019
Minimax Online Prediction of Varying Bernoulli Process under Variational Approximation ACML 2019
Dueling Bandits with Qualitative Feedback AAAI 2019
Semi-Parametric Sampling for Stochastic Bandits with Many Arms AAAI 2019
A Robust Non-Clairvoyant Dynamic Mechanism for Contextual Auctions NIPS 2019
Connections Between Mirror Descent, Thompson Sampling and the Information Ratio NIPS 2019
Recovering Bandits NIPS 2019
Stochastic Bandits with Context Distributions NIPS 2019