A Reduction-Based Framework for Conservative Bandits and Reinforcement Learning

In this paper, we present a reduction-based framework for conservative bandits and RL, in which our core technique is to calculate the necessary and sufficient budget obtained from running the baseline policy. For lower bounds, we improve the existing lower bound for conservative multi-armed bandits...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2022-03
Main Authors: Yang, Yunchang, Wu, Tianhao, Han, Zhong, Evrard Garcelon, Pirotta, Matteo, Lazaric, Alessandro, Wang, Liwei, Du, Simon S
Format: Article
Language:English
Subjects:
Algorithms
Lower bounds
Upper bounds
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, we present a reduction-based framework for conservative bandits and RL, in which our core technique is to calculate the necessary and sufficient budget obtained from running the baseline policy. For lower bounds, we improve the existing lower bound for conservative multi-armed bandits and obtain new lower bounds for conservative linear bandits, tabular RL and low-rank MDP, through a black-box reduction that turns a certain lower bound in the nonconservative setting into a new lower bound in the conservative setting. For upper bounds, in multi-armed bandits, linear bandits and tabular RL, our new upper bounds tighten or match existing ones with significantly simpler analyses. We also obtain a new upper bound for conservative low-rank MDP.
ISSN:2331-8422