Pith. sign in

REVIEW 2 cited by

Boosting Continuous Control with Consistency Policy

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 2310.06343 v2 pith:6N5IGTYC submitted 2023-10-10 cs.LG

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

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Due to its training stability and strong expression, the diffusion model has attracted considerable attention in offline reinforcement learning. However, several challenges have also come with it: 1) The demand for a large number of diffusion steps makes the diffusion-model-based methods time inefficient and limits their applications in real-time control; 2) How to achieve policy improvement with accurate guidance for diffusion model-based policy is still an open problem. Inspired by the consistency model, we propose a novel time-efficiency method named Consistency Policy with Q-Learning (CPQL), which derives action from noise by a single step. By establishing a mapping from the reverse diffusion trajectories to the desired policy, we simultaneously address the issues of time efficiency and inaccurate guidance when updating diffusion model-based policy with the learned Q-function. We demonstrate that CPQL can achieve policy improvement with accurate guidance for offline reinforcement learning, and can be seamlessly extended for online RL tasks. Experimental results indicate that CPQL achieves new state-of-the-art performance on 11 offline and 21 online tasks, significantly improving inference speed by nearly 45 times compared to Diffusion-QL. We will release our code later.

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. TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching

    cs.RO 2025-05 conditional novelty 6.0 of 10

    A GNN-encoded flow matching model learns to generate STL-satisfying trajectories across five robot simulation domains, with a 200K-specification dataset, reporting best-of-1024 satisfaction rates.

  2. FlowPolicy: Enabling Fast and Robust 3D Flow-based Policy via Consistency Flow Matching for Robot Manipulation

    cs.RO 2024-12 conditional novelty 5.0 of 10

    A consistency flow matching policy conditioned on 3D point clouds generates robot actions in a single inference step, running 7x faster than DP3 with comparable success rates.

Pith tools