arXiv:1502.03255
Off-policy evaluation for MDPs with unknown structure
원문 초록
Off-policy learning in dynamic decision problems is essential for providing strong evidence that a new policy is better than the one in use. But how can we prove superiority without testing the new policy? To answer this question, we introduce the G-SCOPE algorithm that evaluates a new policy based on data generated by the existing policy. Our algorithm is both computationally and sample efficient because it greedily learns to exploit factored structure in the dynamics of the environment. We present a finite sample analysis of our approach and show through experiments that the algorithm scales well on high-dimensional problems with few samples.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
DOLCE: Decomposing Off-Policy Evaluation/Learning into Lagged and Current Effects
Trajectory World Models for Heterogeneous Environments
Two-way Deconfounder for Off-policy Evaluation in Causal Reinforcement Learning
Minimum Empirical Divergence for Sub-Gaussian Linear Bandits
Abstract Reward Processes: Leveraging State Abstraction for Consistent Off-Policy Evaluation
Causal Deepsets for Off-policy Evaluation under Spatial or Spatio-temporal Interferences
토론
이 논문과 연결된 포럼 글이 아직 없습니다.