Information-Theoretic Considerations in Batch Reinforcement Learning
Jinglin Chen · Nan Jiang

Tue Jun 11th 05:15 -- 05:20 PM @ Room 103

Value-function approximation methods that operate in batch mode have foundational importance to reinforcement learning (RL). Finite sample guarantees for these methods often crucially rely on two types of assumptions: (1) mild distribution shift, and (2) representation conditions that are stronger than realizability. However, the necessity (“why do we need them?”) and the naturalness (“when do they hold?”) of such assumptions have largely eluded the literature. In this paper, we revisit these assumptions and provide theoretical results towards answering the above questions, and make steps towards a deeper understanding of value-function approximation.

Author Information

Jinglin Chen (University of Illinois at Urbana-Champaign)
Nan Jiang (University of Illinois at Urbana-Champaign)

Related Events (a corresponding poster, oral, or spotlight)

More from the Same Authors