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

Combining Online Learning Guarantees COLT 2019
Parameter-Free Online Convex Optimization with Sub-Exponential Noise COLT 2019
A Rank-1 Sketch for Matrix Multiplicative Weights COLT 2019
Contextual bandits with continuous actions: Smoothing, zooming, and adapting COLT 2019
A Unified Framework for Extensive-Form Game Abstraction with Bounds NIPS 2018
Multi-Fidelity Black-Box Optimization with Hierarchical Partitions ICML 2018
Causal Bandits with Propagating Inference ICML 2018
Feasible Arm Identification ICML 2018
Efficient Bias-Span-Constrained Exploration-Exploitation in Reinforcement Learning ICML 2018
Coordinated Exploration in Concurrent Reinforcement Learning ICML 2018
Learning to Coordinate with Coordination Graphs in Repeated Single-Stage Multi-Agent Decision Problems ICML 2018
Semiparametric Contextual Bandits ICML 2018
Practical Contextual Bandits with Regression Oracles ICML 2018
Weakly Consistent Optimal Pricing Algorithms in Repeated Posted-Price Auctions with Strategic Buyer ICML 2018
Online Learning with Abstention ICML 2018
Online Linear Quadratic Control ICML 2018
Projection-Free Online Optimization with Stochastic Gradient: From Convexity to Submodularity ICML 2018
Make the Minority Great Again: First-Order Regret Bound for Contextual Bandits ICML 2018
Contextual Pricing for Lipschitz Buyers NIPS 2018
Profitable Bandits ACML 2018
The Promise and Perils of Myopia in Dynamic Pricing With Censored Information IJCAI 2018
Improved Regret Bounds for Thompson Sampling in Linear Quadratic Control Problems ICML 2018
A Smoothed Analysis of the Greedy Algorithm for the Linear Contextual Bandit Problem NIPS 2018
Balanced Policy Evaluation and Learning NIPS 2018
Contextual bandits with surrogate losses: Margin bounds and efficient algorithms NIPS 2018