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

Near-Optimal Goal-Oriented Reinforcement Learning in Non-Stationary Environments NIPS 2022
Regret Bounds for Risk-Sensitive Reinforcement Learning NIPS 2022
Anytime Guarantees under Heavy-Tailed Data AAAI 2022
Optimal Rates of (Locally) Differentially Private Heavy-tailed Multi-Armed Bandits AISTATS 2022
k-experts - Online Policies and Fundamental Limits AISTATS 2022
Robust Imitation via Mirror Descent Inverse Reinforcement Learning NIPS 2022
Computationally Efficient Horizon-Free Reinforcement Learning for Linear Mixture MDPs NIPS 2022
Conservative Dual Policy Optimization for Efficient Model-Based Reinforcement Learning NIPS 2022
Norm-Agnostic Linear Bandits AISTATS 2022
Distributionally Adaptive Meta Reinforcement Learning NIPS 2022
Near-Optimal Regret Bounds for Multi-batch Reinforcement Learning NIPS 2022
Exponential Family Model-Based Reinforcement Learning via Score Matching NIPS 2022
Optimal Dynamic Regret in Proper Online Learning with Strongly Convex Losses and Beyond AISTATS 2022
Procrastinated Tree Search: Black-Box Optimization with Delayed, Noisy, and Multi-Fidelity Feedback AAAI 2022
Regret Bounds for Information-Directed Reinforcement Learning NIPS 2022
Dynamic Bandits with Temporal Structure IJCAI 2022
Online Competitive Influence Maximization AISTATS 2022
On the Expressivity of Markov Reward (Extended Abstract) IJCAI 2022
Optimistic Posterior Sampling for Reinforcement Learning with Few Samples and Tight Guarantees NIPS 2022
Corruption-Robust Contextual Search through Density Updates COLT 2022
Society of Agents: Regret Bounds of Concurrent Thompson Sampling NIPS 2022
Provably Efficient Model-Free Constrained RL with Linear Function Approximation NIPS 2022
A Simple yet Universal Strategy for Online Convex Optimization ICML 2022
PDE-Based Optimal Strategy for Unconstrained Online Learning ICML 2022
Horizon-Free Reinforcement Learning in Polynomial Time: the Power of Stationary Policies COLT 2022