Skip to content
AI News HubLIVE
Original source2 min read

Offline Policy Evaluation for Manipulation Policies via Discounted Liveness Formulation

Summary

This paper proposes a framework for offline policy evaluation from sparse rewards using a liveness-based Bellman operator. It addresses challenges in robotic manipulation: sparse rewards, non-monotonic task progression due to recovery behaviors, and truncation bias from finite-length rollouts. The formulation yields a conservative fixed-point value function robust to finite-horizon truncation. Evaluated on simulated manipulation tasks with VLA and diffusion policies, and a cloth folding task with human demonstrations, the method outperforms TD(0) and Monte Carlo baselines.

SourcearXiv RoboticsAuthor: Hao Wang, Joshua Bowden, Colton Crosby, Somil Bansal
Offline Policy Evaluation for Manipulation Policies via Discounted Liveness Formulation
Report an error

The correction channel is not available yet. You can copy the article reference below for later.

Correction instructions
Read article

[2605.11479] Offline Policy Evaluation for Manipulation Policies via Discounted Liveness Formulation

[Submitted on 12 May 2026]

Title:Offline Policy Evaluation for Manipulation Policies via Discounted Liveness Formulation

View a PDF of the paper titled Offline Policy Evaluation for Manipulation Policies via Discounted Liveness Formulation, by Hao Wang and 3 other authors

View PDF HTML (experimental)

Abstract:Policy evaluation is a fundamental component of the development and deployment pipeline for robotic policies. In modern manipulation systems, this problem is particularly challenging: rewards are often sparse, task progression of evaluation rollouts are often non-monotonic as the policies exhibit recovery behaviors, and evaluation rollouts are necessarily of finite length. This finite length introduces truncation bias, breaking the infinite-horizon assumptions underlying standard methods relying on Bellman equations/principle of optimality. In this work, we propose a framework for offline policy evaluation from sparse rewards based on a liveness-based Bellman operator. Our formulation interprets policy evaluation as a task-completion problem and yields a conservative fixed-point value function that is robust to finite-horizon truncation. We analyze the theoretical properties of the proposed operator, including contraction guarantees, and show how it encodes task progression while mitigating truncation bias. We evaluate our method on two simulated manipulation tasks using both a Vision-Language-Action model and a diffusion policy, and a cloth folding task using human demonstrations. Empirical results demonstrate that our approach more accurately reflects task progress and substantially reduces truncation bias, outperforming classical baselines such as TD(0) and Monte Carlo policy evaluation.

Comments: Published at RSS 2026

Subjects:

Robotics (cs.RO); Artificial Intelligence (cs.AI)

Cite as: arXiv:2605.11479 [cs.RO]

(or arXiv:2605.11479v1 [cs.RO] for this version)

https://doi.org/10.48550/arXiv.2605.11479

arXiv-issued DOI via DataCite (pending registration)

Submission history

From: Hao Wang [view email] [v1] Tue, 12 May 2026 03:54:30 UTC (2,285 KB)

Full-text links:

Access Paper:

View a PDF of the paper titled Offline Policy Evaluation for Manipulation Policies via Discounted Liveness Formulation, by Hao Wang and 3 other authors

View PDF

HTML (experimental)

TeX Source

view license

Current browse context:

cs.RO

new | recent | 2026-05

Change to browse by:

cs cs.AI

References & Citations

NASA ADS

Google Scholar

Semantic Scholar

Loading...

Data provided by:

Bibliographic Tools

Bibliographic and Citation Tools

Bibliographic Explorer Toggle

Bibliographic Explorer (What is the Explorer?)

Connected Papers Toggle

Connected Papers (What is Connected Papers?)

Litmaps Toggle

Litmaps (What is Litmaps?)

scite.ai Toggle

scite Smart Citations (What are Smart Citations?)

Code, Data, Media

Code, Data and Media Associated with this Article

alphaXiv Toggle

alphaXiv (What is alphaXiv?)

Links to Code Toggle

CatalyzeX Code Finder for Papers (What is CatalyzeX?)

DagsHub Toggle

DagsHub (What is DagsHub?)

GotitPub Toggle

Gotit.pub (What is GotitPub?)

Huggingface Toggle

Hugging Face (What is Huggingface?)

ScienceCast Toggle

ScienceCast (What is ScienceCast?)

Demos

Demos

Replicate Toggle

Replicate (What is Replicate?)

Spaces Toggle

Hugging Face Spaces (What is Spaces?)

Spaces Toggle

TXYZ.AI (What is TXYZ.AI?)

Related Papers

Recommenders and Search Tools

Link to Influence Flower

Influence Flower (What are Influence Flowers?)

Core recommender toggle

CORE Recommender (What is CORE?)

Author

Venue

Institution

Topic

About arXivLabs

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)

Key points and analysis

Article intelligence

EngineersAdvanced

Key points

  • Introduces a liveness-based Bellman operator for offline policy evaluation to mitigate truncation bias
  • Frames policy evaluation as a task-completion problem, producing robust value functions
  • Outperforms classical methods on manipulation tasks with sparse rewards

Highlights and analysis are generated automatically and may contain errors. Check the original source.