Offline Behavioral Data Selection

Shiye Lei, Zhihao Cheng, Dacheng Tao
12/20/2025
cs.LGcs.AI

No official code found. Best implementation: LeavesLei/stepwise_dual_ranking (2 stars, last commit 2025-12-26).

Abstract

Behavioral cloning is a widely adopted approach for offline policy learning from expert demonstrations. However, the large scale of offline behavioral datasets often results in computationally intensive training when used in downstream tasks. In this paper, we uncover the striking data saturation in offline behavioral data: policy performance rapidly saturates when trained on a small fraction of the dataset. We attribute this effect to the weak alignment between policy performance and test loss, revealing substantial room for improvement through data selection. To this end, we propose a simple yet effective method, Stepwise Dual Ranking (SDR), which extracts a compact yet informative subset from large-scale offline behavioral datasets. SDR is build on two key principles: (1) stepwise clip, which prioritizes early-stage data; and (2) dual ranking, which selects samples with both high action-value rank and low state-density rank. Extensive experiments and ablation studies on D4RL benchmarks demonstrate that SDR significantly enhances data selection for offline behavioral data.

View on arXivView PDF

Code Implementations(1)

[KDD 2026] Official repository for "Offline Behavioral Data Selection"

20PythonDec 19, 20259 months ago

Similar Papers

Cite this paper

@article{lei2025offline,
  title  = {Offline Behavioral Data Selection},
  author = {Shiye Lei and Zhihao Cheng and Dacheng Tao},
  year   = {2025},
  eprint = {2512.18246},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2512.18246v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2512.18246.svg)](https://codeofpaper.com/paper/2512.18246)

Discussion