Tiered Reinforcement Learning: Pessimism in the Face of Uncertainty and Constant Regret

Tao Qin, Tie-Yan Liu, Wei Chen, Li Zhao, Nan Jiang, Jiawei Huang

arXiv · PDF · Open in the Atlas

Code that ran

We lifted 1 functions out of this paper's own repositories and ran 1 of them in a sandbox. "Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results.

Repositories linked to this paper

• jiaweihhuang/tiered-rl-experiments — marked official in Papers with Code; named in the paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

Abstract

We propose a new learning framework that captures the tiered structure of many real-world user-interaction applications, where the users can be divided into two groups based on their different tolerance on exploration risks and should be treated separately. In this setting, we simultaneously maintain two policies π O and π E : π O ("O" for "online") interacts with more risk-tolerant users from the first tier and minimizes regret by balancing exploration and exploitation as usual, while π E ("E" for "exploit") exclusively focuses on exploitation for risk-averse users from the second tier utilizing the data collected so far. An important question is whether such a separation yields advantages over the standard online setting (i.e., π E = π O ) for the risk-averse users. We individually consider the gap-independent vs. gap-dependent settings. For the former, we prove that the separation is indeed not beneficial from a minimax perspective. For the latter, we show that if choosing Pessimistic Value Iteration as the exploitation algorithm to produce π E , we can achieve a constant regret for risk-averse users independent of the number of episodes K, which is in sharp contrast to the Ω(log K) regret for any online RL algorithms in the same setting, while the regret of π O (almost) maintains its online regret optimality and does not need to compromise for the success of π E .

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("2205.12418")
get_code_for_paper("2205.12418")
have("2205.12418")

Connect an agent — have() is free.