Pith. sign in

REVIEW 1 cited by

TW-CRL: Time-Weighted Contrastive Reward Learning for Efficient Inverse 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 2504.05585 v2 pith:UITG3DLH submitted 2025-04-08 cs.LG cs.AI

classification cs.LGcs.AI
keywords learningrewardtw-crlreinforcementstatestasksagentscontrastive
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Episodic tasks in Reinforcement Learning (RL) often pose challenges due to sparse reward signals and high-dimensional state spaces, which hinder efficient learning. Additionally, these tasks often feature hidden "trap states" -- irreversible failures that prevent task completion but do not provide explicit negative rewards to guide agents away from repeated errors. To address these issues, we propose Time-Weighted Contrastive Reward Learning (TW-CRL), an Inverse Reinforcement Learning (IRL) framework that leverages both successful and failed demonstrations. By incorporating temporal information, TW-CRL learns a dense reward function that identifies critical states associated with success or failure. This approach not only enables agents to avoid trap states but also encourages meaningful exploration beyond simple imitation of expert trajectories. Empirical evaluations on navigation tasks and robotic manipulation benchmarks demonstrate that TW-CRL surpasses state-of-the-art methods, achieving improved efficiency and robustness.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. DRIVE: Dynamic Rule Inference and Verified Evaluation for Constraint-Aware Autonomous Driving

    cs.RO 2025-08 unverdicted novelty 5.0 of 10

    DRIVE uses exponential-family likelihoods to learn soft driving constraints from expert data and injects them into convex optimization, reporting 0.0% constraint violations on inD, highD, and RoundD.

Pith tools