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

Non-Exponentially Weighted Aggregation: Regret Bounds for Unbounded Loss Functions ICML 2021
Private Adaptive Gradient Methods for Convex Optimization ICML 2021
Meta-Thompson Sampling ICML 2021
An Algorithm for Stochastic and Adversarial Bandits with Switching Costs ICML 2021
Bayesian Optimistic Optimisation with Exponentially Decaying Regret ICML 2021
Understanding Bandits with Graph Feedback NIPS 2021
A Gang of Adversarial Bandits NIPS 2021
Finding the Stochastic Shortest Path with Low Regret: the Adversarial Cost and Unknown Transition Case ICML 2021
Adapting to Delays and Data in Adversarial Multi-Armed Bandits ICML 2021
Near-Optimal Representation Learning for Linear Bandits and Linear RL ICML 2021
Improved Regret Bounds of Bilinear Bandits using Action Space Analysis ICML 2021
Adapting to misspecification in contextual bandits with offline regression oracles ICML 2021
Achieving Near Instance-Optimality and Minimax-Optimality in Stochastic and Adversarial Linear Bandits Simultaneously ICML 2021
Online Learning in Unknown Markov Games ICML 2021
On the Optimality of Batch Policy Optimization Algorithms ICML 2021
Bandit Phase Retrieval NIPS 2021
Provably Efficient Fictitious Play Policy Optimization for Zero-Sum Markov Games with Structured Transitions ICML 2021
Online A-Optimal Design and Active Linear Regression ICML 2021
Almost Optimal Anytime Algorithm for Batched Multi-Armed Bandits ICML 2021
Collaborative Bayesian Optimization with Fair Regret ICML 2021
Stochastic Shortest Path with Adversarially Changing Costs IJCAI 2021
Towards Reducing Biases in Combining Multiple Experts Online IJCAI 2021
Mean Field Equilibrium in Multi-Armed Bandit Game with Continuous Reward IJCAI 2021
Smooth Convex Optimization Using Sub-Zeroth-Order Oracles AAAI 2021
DART: Adaptive Accept Reject Algorithm for Non-Linear Combinatorial Bandits AAAI 2021