atlas

Research map / Reinforcement learning / Offline RL

Stable Offline Value Function Learning with Bisimulation-based Representations

ICML 2025 · Reinforcement learning › Offline RL · approach: Pessimism and uncertainty in offline RL · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Proposes KROPE, a bisimulation-based kernel representation learning method that shapes state-action features so that linear LSPE value learning is provably stable and Bellman complete, and shows lower offline value error than baselines on Garnet, DMC, and D4RL.

Problem

Offline value function learning (off-policy evaluation with linear TD-style methods) can diverge depending on state-action representations; it is unclear whether bisimulation-based representations stabilize it.

Approach

Define a kernel over state-action pairs capturing pi-bisimilarity (reward similarity plus independently coupled similarity of next state-actions under the target policy), parameterize it with dot products of learned features, and prove the resulting representations give a spectral radius below 1 for LSPE and Bellman completeness under reward injectivity.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use KROPE representations rather than other auxiliary representation methodsOffline policy evaluation with LSPE · 10/13 offline datasetsstability and accuracy of normalized squared value errorHelped
Use KROPE instead of ROPEOffline policy evaluation with LSPE · DMC and D4RL datasetsnormalized squared value errorHelped
Use KROPE instead of FQEOffline policy evaluation with LSPE · Offline datasetsstability of value estimatesHelped
Tune across the reported hyperparameter combinations using KROPEOffline policy evaluation · All hyperparameter instancesfraction of runs with MSVE ≤ 1: 100%Helped
Use KROPE representations rather than non-bisimulation-based representationsGarnet MDP representation learning · Garnet MDPscorrelation of representation orthogonality with action-value differenceHelped
Sample good transitions in the second dataset rather than bad transition pairsKROPE representation learning · MRP divergence experimentKROPE training loss divergenceHelped
Sample bad transition pairs rather than pairing a bad transition with a good transitionKROPE representation learning · MRP divergence experimentKROPE training loss divergenceHurt
Add exploration maximization of the covariance matrixBCRL · Offline policy evaluationnormalized squared value errorHelped
Increase the rank of penultimate-layer features with DR3 or BEER regularizationOffline policy evaluation representations · Offline datasetsstability and accuracyHurt

Surprising findings

Limitations

Experimental setup

Datasets: Garnet MDPs DM Control CartPoleSwingUp DM Control CheetahRun DM Control FingerEasy DM Control WalkerStand D4RL cheetah D4RL hopper D4RL walker

Benchmarks: Garnet MDPs DM Control (CartPoleSwingUp, CheetahRun, FingerEasy, WalkerStand) D4RL (cheetah, hopper, walker)

Metrics: normalized squared value error (MSE) spectral radius stability fraction Pearson correlation of q-consistency performance profile

Baselines: FQE BCRL BEER DR3 DBC RoPE

Builds on: fitted q-evaluation deep bisimulation for control representations for offline policy evaluation bellman complete representation learning least-squares policy evaluation

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy