Pith. sign in

REVIEW 2 cited by

PRISE: LLM-Style Sequence Compression for Learning Temporal Action Abstractions in Control

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 2402.10450 v3 pith:HGRCIWDR submitted 2024-02-16 cs.LG

classification cs.LG
keywords actionabstractionslearningprisesequencetemporalcompressioncontinuous
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Temporal action abstractions, along with belief state representations, are a powerful knowledge sharing mechanism for sequential decision making. In this work, we propose a novel view that treats inducing temporal action abstractions as a sequence compression problem. To do so, we bring a subtle but critical component of LLM training pipelines -- input tokenization via byte pair encoding (BPE) -- to the seemingly distant task of learning skills of variable time span in continuous control domains. We introduce an approach called Primitive Sequence Encoding (PRISE) that combines continuous action quantization with BPE to learn powerful action abstractions. We empirically show that high-level skills discovered by PRISE from a multitask set of robotic manipulation demonstrations significantly boost the performance of both multitask imitation learning as well as few-shot imitation learning on unseen tasks. Our code is released at https://github.com/FrankZheng2022/PRISE.

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. Fast Flow-based Visuomotor Policies via Conditional Optimal Transport Couplings

    cs.RO 2025-05 conditional novelty 6.0 of 10

    COT Policy, a flow-matching visuomotor policy that couples noise to action samples using observation-aware optimal transport, generates effective actions in 1 to 2 integration steps, outperforming CFM, OT-CFM, and Dif...

  2. SPECI: Skill Prompts based Hierarchical Continual Imitation Learning for Robot Manipulation

    cs.RO 2025-04 conditional novelty 6.0 of 10

    A hierarchical continual imitation learning policy with an expandable skill codebook and CP-decomposed task-specific attention parameters outperforms prior CIL methods on the LIBERO robot manipulation benchmark.

Pith tools