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

Communication-Constrained Bandits under Additive Gaussian Noise ICML 2023
Dynamical Linear Bandits ICML 2023
Failure-Aware Gaussian Process Optimization with Regret Bounds NIPS 2023
Bandits with Knapsacks: Advice on Time-Varying Demands ICML 2023
Multiplier Bootstrap-based Exploration ICML 2023
One Arrow, Two Kills: A Unified Framework for Achieving Optimal Regret Guarantees in Sleeping Bandits AISTATS 2023
Max-Quantile Grouped Infinite-Arm Bandits ALT 2023
Efficient Online Clustering with Moving Costs NIPS 2023
Nearest Neighbour with Bandit Feedback NIPS 2023
Generalized test utilities for long-tail performance in extreme multi-label classification NIPS 2023
A Near-Optimal Algorithm for Safe Reinforcement Learning Under Instantaneous Hard Constraints ICML 2023
Bandit Online Linear Optimization with Hints and Queries ICML 2023
Noise-Adaptive Thompson Sampling for Linear Contextual Bandits NIPS 2023
Online Convex Optimization with Unbounded Memory NIPS 2023
Interpolating Classifiers Make Few Mistakes JMLR 2023
Nonstochastic Contextual Combinatorial Bandits AISTATS 2023
The Regret of Exploration and the Control of Bad Episodes in Reinforcement Learning ICML 2023
Lower Bounds for Learning in Revealing POMDPs ICML 2023
Refined Regret for Adversarial MDPs with Linear Function Approximation ICML 2023
Alternation makes the adversary weaker in two-player games NIPS 2023
Efficient Rate Optimal Regret for Adversarial Contextual MDPs Using Online Function Approximation ICML 2023
Nearly Minimax Optimal Regret for Learning Linear Mixture Stochastic Shortest Path ICML 2023
Nearly Minimax Optimal Reinforcement Learning for Linear Markov Decision Processes ICML 2023
Langevin Thompson Sampling with Logarithmic Communication: Bandits and Reinforcement Learning ICML 2023
Distributionally Robust Bayesian Optimization with $\varphi$-divergences NIPS 2023