Pith. sign in

REVIEW 2 cited by

S-EPOA: Overcoming the Indistinguishability of Segments with Skill-Driven Preference-Based Reinforcement Learning

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2408.12130 v3 pith:R5EIXFYI submitted 2024-08-22 cs.AI

classification cs.AI
keywords learningindistinguishabilitypbrls-epoamethodsovercomingpreferencepreference-based
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Preference-based reinforcement learning (PbRL) stands out by utilizing human preferences as a direct reward signal, eliminating the need for intricate reward engineering. However, despite its potential, traditional PbRL methods are often constrained by the indistinguishability of segments, which impedes the learning process. In this paper, we introduce Skill-Enhanced Preference Optimization Algorithm (S-EPOA), which addresses the segment indistinguishability issue by integrating skill mechanisms into the preference learning framework. Specifically, we first conduct the unsupervised pretraining to learn useful skills. Then, we propose a novel query selection mechanism to balance the information gain and distinguishability over the learned skill space. Experimental results on a range of tasks, including robotic manipulation and locomotion, demonstrate that S-EPOA significantly outperforms conventional PbRL methods in terms of both robustness and learning efficiency. The results highlight the effectiveness of skill-driven learning in overcoming the challenges posed by segment indistinguishability.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. CLARIFY: Contrastive Preference Reinforcement Learning for Untangling Ambiguous Queries

    cs.LG 2025-05 conditional novelty 6.0 of 10

    CLARIFY uses contrastive learning on preference data to embed trajectories, then rejection-samples queries that humans can distinguish clearly, improving offline preference-based RL.

  2. Preference-based Multi-Objective Reinforcement Learning

    cs.LG 2025-07 reject novelty 4.0 of 10

    Pb-MORL learns a multi-objective reward model from preference comparisons and claims to achieve Pareto-optimal policies, outperforming an oracle in energy and highway tasks.

Pith tools