Pith. sign in

REVIEW 4 cited by

Implicit Behavioral Cloning

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 2109.00137 v1 pith:KUXHHZV5 submitted 2021-09-01 cs.RO cs.CVcs.LG

classification cs.ROcs.CVcs.LG
keywords tasksimplicitlearningpoliciesbehavioralcloningexplicitmodels
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

We find that across a wide range of robot policy learning scenarios, treating supervised policy learning with an implicit model generally performs better, on average, than commonly used explicit models. We present extensive experiments on this finding, and we provide both intuitive insight and theoretical arguments distinguishing the properties of implicit models compared to their explicit counterparts, particularly with respect to approximating complex, potentially discontinuous and multi-valued (set-valued) functions. On robotic policy learning tasks we show that implicit behavioral cloning policies with energy-based models (EBM) often outperform common explicit (Mean Square Error, or Mixture Density) behavioral cloning policies, including on tasks with high-dimensional action spaces and visual image inputs. We find these policies provide competitive results or outperform state-of-the-art offline reinforcement learning methods on the challenging human-expert tasks from the D4RL benchmark suite, despite using no reward information. In the real world, robots with implicit policies can learn complex and remarkably subtle behaviors on contact-rich tasks from human demonstrations, including tasks with high combinatorial complexity and tasks requiring 1mm precision.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 4 Pith papers

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

  1. SpeedTuning: Speeding Up Policy Execution with Lightweight Reinforcement Learning

    cs.RO 2026-08 conditional novelty 7.0 of 10

    SpeedTuning trains a lightweight RL policy to select per-phase speed multipliers and time-interpolates the base policy's action chunks, achieving over 2.4x faster execution with retained success.

  2. Latent World Models with Monotone Planning Costs for Image-Goal Navigation

    cs.RO 2026-08 conditional novelty 6.0 of 10

    An autoregressive latent world model with a monotone cost ranking loss outperforms four baselines on GNM image-goal navigation, including a 2.7x orientation-error cut over a reimplemented DINO-WM baseline.

  3. Weights or Skills? A Survey of Robot-Learning Techniques: from Action-Predicting Weights to Robots that Write their Own Skills

    cs.RO 2026-08 conditional novelty 6.0 of 10

    A taxonomy of robot learning on a weights-versus-skills axis, with a five-rung self-improvement ladder whose top cell (feedback plus memory plus search) holds only a few recent systems.

  4. Equivariant Action Sampling for Reinforcement Learning and Planning

    cs.RO 2024-12 conditional novelty 5.0 of 10

    Augmenting each sampled action with its full symmetry orbit makes finite-sample planning exactly equivariant and speeds up learning on several rotationally symmetric control tasks.

Pith tools