paper-with-me

홈 › Papers

Abstract Reward Processes: Leveraging State Abstraction for Consistent Off-Policy Evaluation

2024-10-03 · Shreyas Chaudhari, Ameet Deshpande, Bruno Castro da Silva, Philip S. Thomas

Evaluating policies using off-policy data is crucial for applying reinforcement learning to real-world problems such as healthcare and autonomous driving. Previous methods for off-policy evaluation (OPE) generally suffer from high variance or irreducible bias, leading to unacceptably high prediction errors. In this work, we introduce STAR, a framework for OPE that encompasses a broad range of estimators -- which include existing OPE methods as special cases -- that achieve lower mean squared prediction errors. STAR leverages state abstraction to distill complex, potentially continuous problems into compact, discrete models which we call abstract reward processes (ARPs). Predictions from ARPs estimated from off-policy data are provably consistent (asymptotically correct). Rather than proposing a specific estimator, we present a new framework for OPE and empirically demonstrate that estimators within STAR outperform existing methods. The best STAR estimator outperforms baselines in all twelve cases studied, and even the median STAR estimator surpasses the baselines in seven out of the twelve cases.

📄 PDF Abstract BibTeX arXiv:2410.02172

Code (1)

shreyasc-13/star 공식 구현 pytorch

Tasks

Autonomous DrivingOff-policy evaluation

Similar Papers 제목 키워드 기반

Topology-Aware State Abstraction with Tangle Cores for Markov Decision Processes

2026-05-29 · Ibne Farabi Shihab, Sanjeda Akter, Anuj Sharma arxiv

State abstraction in reinforcement learning is usually formulated as a partition of states based on reward and transition similarity. This excludes a common structural pattern in navigation, graph, and hierarchical decis…

Reinforcement Learning

AUPO -- Abstracted Until Proven Otherwise: A Reward Distribution Based Abstraction Algorithm

2025-10-27 · Robin Schmöcker, Alexander Dockhorn, Bodo Rosenhahn arxiv

We introduce a novel, drop-in modification to Monte Carlo Tree Search's (MCTS) decision policy that we call AUPO. Comparisons based on a range of IPPC benchmark problems show that AUPO clearly outperforms MCTS. AUPO is a…

Grouping Nodes With Known Value Differences: A Lossless UCT-based Abstraction Algorithm

2025-10-29 · Robin Schmöcker, Alexander Dockhorn, Bodo Rosenhahn arxiv

A core challenge of Monte Carlo Tree Search (MCTS) is its sample efficiency, which can be improved by grouping state-action pairs and using their aggregate statistics instead of single-node statistics. On the Go Abstract…

Planning with State Abstractions for Non-Markovian Task Specifications

2019-05-28 · Yoonseon Oh, Roma Patel, Thao Nguyen, Baichuan Huang 외

Often times, we specify tasks for a robot using temporal language that can also span different levels of abstraction. The example command ``go to the kitchen before going to the second floor'' contains spatial abstractio…

Approximate State Abstraction for Markov Games

2024-12-20 · Hiroki Ishibashi, Kenshi Abe, Atsushi Iwasaki

This paper introduces state abstraction for two-player zero-sum Markov games (TZMGs), where the payoffs for the two players are determined by the state representing the environment and their respective actions, with stat…