pith. sign in

The Unreasonable Effectiveness of Discrete-Time Gaussian Process Mixtures for Robot Policy Learning

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
abstract

We present Mixture of Discrete-time Gaussian Processes (MiDiGap), a novel approach for flexible policy representation and imitation learning in robot manipulation. MiDiGap enables learning from as few as five demonstrations using only camera observations and generalizes across a wide range of challenging tasks. It excels at long-horizon behaviors such as making coffee, highly constrained motions such as opening doors, dynamic actions such as scooping with a spatula, and multimodal tasks such as hanging a mug. MiDiGap learns these tasks on a CPU in less than a minute and scales linearly to large datasets. We also develop a rich suite of tools for inference-time steering using evidence such as collision signals and robot kinematic constraints. This steering enables novel generalization capabilities, including obstacle avoidance and cross-embodiment policy transfer. MiDiGap achieves state-of-the-art performance on diverse few-shot manipulation benchmarks. On constrained RLBench tasks, it improves policy success by 76 percentage points and reduces trajectory cost by 67%. On multimodal tasks, it improves policy success by 48 percentage points and increases sample efficiency by a factor of 20. In cross-embodiment transfer, it more than doubles policy success. We make the code publicly available at https://midigap.cs.uni-freiburg.de.

fields

cs.RO 1

years

2026 1

verdicts

CONDITIONAL 1

representative citing papers

Difference-Aware Retrieval Policies for Imitation Learning

cs.RO · 2026-06-08 · conditional · novelty 6.0 · 2 refs

DARP reparameterizes imitation learning around local neighborhood structure using k-NN expert states, actions, and relative distance vectors, delivering 15-46% gains over behavior cloning in control and manipulation tasks.

citing papers explorer

Showing 1 of 1 citing paper.

  • Difference-Aware Retrieval Policies for Imitation Learning cs.RO · 2026-06-08 · conditional · none · ref 10 · 2 links · internal anchor

    DARP reparameterizes imitation learning around local neighborhood structure using k-NN expert states, actions, and relative distance vectors, delivering 15-46% gains over behavior cloning in control and manipulation tasks.