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

An Efficient Algorithm For Generalized Linear Bandit: Online Stochastic Gradient Descent and Thompson Sampling AISTATS 2021
Adaptive Algorithms for Multi-armed Bandit with Composite and Anonymous Feedback AAAI 2021
Logarithmic Regret from Sublinear Hints NIPS 2021
No-regret Online Learning over Riemannian Manifolds NIPS 2021
Towards Best-of-All-Worlds Online Learning with Feedback Graphs NIPS 2021
Almost Optimal Anytime Algorithm for Batched Multi-Armed Bandits ICML 2021
Online A-Optimal Design and Active Linear Regression ICML 2021
Local Differential Privacy for Bayesian Optimization AAAI 2021
A Hybrid Bandit Framework for Diversified Recommendation AAAI 2021
Lenient Regret for Multi-Armed Bandits AAAI 2021
Online DR-Submodular Maximization: Minimizing Regret and Constraint Violation AAAI 2021
Parametric Graph for Unimodal Ranking Bandit ICML 2021
Confidence-Budget Matching for Sequential Budgeted Learning ICML 2021
Convex Regularization in Monte-Carlo Tree Search ICML 2021
Online Optimization in Games via Control Theory: Connecting Regret, Passivity and Poincaré Recurrence ICML 2021
Lenient Regret and Good-Action Identification in Gaussian Process Bandits ICML 2021
Deciding What to Learn: A Rate-Distortion Approach ICML 2021
Federated Multi-Armed Bandits AAAI 2021
Breaking the Sample Complexity Barrier to Regret-Optimal Model-Free Reinforcement Learning NIPS 2021
Prediction against a limited adversary JMLR 2021
Robustness Guarantees for Mode Estimation with an Application to Bandits AAAI 2021
Stochastic Multi-Armed Bandits with Control Variates NIPS 2021
No Regrets for Learning the Prior in Bandits NIPS 2021
A One-Size-Fits-All Solution to Conservative Bandit Problems AAAI 2021
Online Non-Monotone DR-Submodular Maximization AAAI 2021