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

Improved Regret for Differentially Private Exploration in Linear MDP ICML 2022
The Importance of Non-Markovianity in Maximum State Entropy Exploration ICML 2022
Corruption-Robust Contextual Search through Density Updates COLT 2022
Learning Stochastic Shortest Path with Linear Function Approximation ICML 2022
Doubly Robust Distributionally Robust Off-Policy Evaluation and Learning ICML 2022
Can Q-learning be Improved with Advice? COLT 2022
Nearly Minimax Optimal Reinforcement Learning with Linear Function Approximation ICML 2022
Cascaded Gaps: Towards Logarithmic Regret for Risk-Sensitive Reinforcement Learning ICML 2022
Guarantees for Epsilon-Greedy Reinforcement Learning with Function Approximation ICML 2022
On the Sample Complexity of Learning Infinite-horizon Discounted Linear Kernel MDPs ICML 2022
Smoothed Adversarial Linear Contextual Bandits with Knapsacks ICML 2022
Learning Infinite-Horizon Average-Reward Restless Multi-Action Bandits via Index Awareness NIPS 2022
An Information-Theoretic Framework for Deep Learning NIPS 2022
Asymptotically-Optimal Gaussian Bandits with Side Observations ICML 2022
Revisiting Online Submodular Minimization: Gap-Dependent Regret Bounds, Best of Both Worlds and Adversarial Robustness ICML 2022
Near-Optimal Randomized Exploration for Tabular Markov Decision Processes NIPS 2022
Learn to Match with No Regret: Reinforcement Learning in Markov Matching Markets NIPS 2022
Stochastic Continuous Submodular Maximization: Boosting via Non-oblivious Function ICML 2022
Solving Multi-Arm Bandit Using a Few Bits of Communication AISTATS 2022
Towards Agnostic Feature-based Dynamic Pricing: Linear Policies vs Linear Valuation with Unknown Noise AISTATS 2022
Regret Bounds for Expected Improvement Algorithms in Gaussian Process Bandit Optimization AISTATS 2022
Hierarchical Bayesian Bandits AISTATS 2022
Nonstochastic Bandits with Composite Anonymous Feedback JMLR 2022
A Bandit Model for Human-Machine Decision Making with Private Information and Opacity AISTATS 2022
KL-UCB-Switch: Optimal Regret Bounds for Stochastic Bandits from Both a Distribution-Dependent and a Distribution-Free Viewpoints JMLR 2022