Pith. sign in

REVIEW 6 cited by

AdaFlow: Imitation Learning with Variance-Adaptive Flow-Based Policies

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.04292 v2 pith:X3R5VFAU submitted 2024-02-06 cs.LG cs.AI

AdaFlow: Imitation Learning with Variance-Adaptive Flow-Based Policies

classification cs.LG cs.AI
keywords adaflowinferenceimitationlearningflow-basedodespolicypropose
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

Diffusion-based imitation learning improves Behavioral Cloning (BC) on multi-modal decision-making, but comes at the cost of significantly slower inference due to the recursion in the diffusion process. It urges us to design efficient policy generators while keeping the ability to generate diverse actions. To address this challenge, we propose AdaFlow, an imitation learning framework based on flow-based generative modeling. AdaFlow represents the policy with state-conditioned ordinary differential equations (ODEs), which are known as probability flows. We reveal an intriguing connection between the conditional variance of their training loss and the discretization error of the ODEs. With this insight, we propose a variance-adaptive ODE solver that can adjust its step size in the inference stage, making AdaFlow an adaptive decision-maker, offering rapid inference without sacrificing diversity. Interestingly, it automatically reduces to a one-step generator when the action distribution is uni-modal. Our comprehensive empirical evaluation shows that AdaFlow achieves high performance with fast inference speed.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 6 Pith papers

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

  1. DSSP: Diffusion State Space Policy with Full-History Encoding

    cs.RO 2026-05 conditional novelty 7.0

    DSSP is a history-conditioned diffusion state space policy that uses SSMs to encode full observation streams with an auxiliary dynamics objective and hierarchical fusion, achieving SOTA results with reduced model size...

  2. SID: Sliding into Distribution for Robust Few-Demonstration Manipulation

    cs.RO 2026-05 unverdicted novelty 6.0

    SID achieves approximately 90% success on six real-world manipulation tasks with only two demonstrations under out-of-distribution initializations, with less than 10% performance drop under distractors and disturbances.

  3. Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees

    cs.LG 2025-08 conditional novelty 6.0

    A flow-matching policy guides RRT tree expansion, preserving completeness while raising success rates on out-of-distribution kinodynamic planning tasks.

  4. GR00T N1: An Open Foundation Model for Generalist Humanoid Robots

    cs.RO 2025-03 unverdicted novelty 6.0

    GR00T N1 is a new open VLA foundation model for humanoid robots that outperforms imitation learning baselines in simulation and shows strong performance on real-world bimanual manipulation tasks.

  5. HumanoidMimicGen: Data Generation for Loco-Manipulation via Whole-Body Planning

    cs.RO 2026-05 unverdicted novelty 5.0

    HumanoidMimicGen automatically generates large loco-manipulation datasets from few source demonstrations using whole-body planning, enabling visuomotor policies that outperform real-data-only training by 20% on a new ...

  6. SeFA-Policy: Fast and Accurate Visuomotor Policy Learning with Selective Flow Alignment

    cs.RO 2025-11 conditional novelty 5.0

    Selective Flow Alignment replaces reflow-generated actions with nearby expert actions during training, yielding a one-step flow policy that beats diffusion baselines on 66 simulated and 7 real tasks.