Pith. sign in

REVIEW 4 cited by

Optimal Transport for Offline Imitation 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 2303.13971 v1 pith:NWI5UHKZ submitted 2023-03-24 cs.LG

classification cs.LG
keywords offlineoptimalrewardlearningtransportalgorithmdatasetdemonstration
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

With the advent of large datasets, offline reinforcement learning (RL) is a promising framework for learning good decision-making policies without the need to interact with the real environment. However, offline RL requires the dataset to be reward-annotated, which presents practical challenges when reward engineering is difficult or when obtaining reward annotations is labor-intensive. In this paper, we introduce Optimal Transport Reward labeling (OTR), an algorithm that assigns rewards to offline trajectories, with a few high-quality demonstrations. OTR's key idea is to use optimal transport to compute an optimal alignment between an unlabeled trajectory in the dataset and an expert demonstration to obtain a similarity measure that can be interpreted as a reward, which can then be used by an offline RL algorithm to learn the policy. OTR is easy to implement and computationally efficient. On D4RL benchmarks, we show that OTR with a single demonstration can consistently match the performance of offline RL with ground-truth rewards.

Discussion (0). Sign in to comment.

Forward citations

Cited by 4 Pith papers

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

  1. PINS: Proximal Iterations with Sparse Newton and Sinkhorn for Optimal Transport

    cs.LG 2025-02 conditional novelty 7.0 of 10

    PINS combines an outer proximal-point loop over shifted entropic OT problems with inner Sinkhorn warm-up and sparse-Newton refinement to reach unregularized OT solutions with global convergence and lower error than Si...

  2. Re:Frame -- Retrieving Experience From Associative Memory

    cs.LG 2025-08 conditional novelty 5.0 of 10

    A plug-in that retrieves expert actions from a small associative memory buffer improves offline Decision Transformer performance on three of four D4RL MuJoCo tasks, with gains up to 10.7 points.

  3. WorldWeaver: Generating Long-Horizon Video Worlds via Rich Perception

    cs.CV 2025-08 unverdicted novelty 5.0 of 10

    WorldWeaver reduces temporal drift in long-horizon video generation by jointly modeling RGB and depth perceptual conditions with segmented noise scheduling.

  4. Foundation Models for Cross-Domain EEG Analysis Application: A Survey

    cs.HC 2025-08 conditional novelty 4.0 of 10

    A survey that organizes EEG foundation-model research into five output-modality categories: native EEG, text, vision, audio, and multimodal fusion, with a claim to be the first such comprehensive taxonomy.

Pith tools