Information Filtering via Variational Regularization for Robot Manipulation
Jinhao Zhang, Wenlong Xia, Yaojia Wang, Zhexuan Zhou, Huizhe Li, Yichen Lai, Haoming Song, Youmin Gong, Jie Me
TL;DR
The paper addresses inefficiencies in diffusion-based visuomotor policies caused by oversized decoders that introduce task-irrelevant noise in intermediate features. It presents Variational Regularization (VR), a timestep-conditioned Gaussian bottleneck with a KL regularizer, theoretically linked to the variational information bottleneck, to adaptively filter backbone features. Empirically, VR yields notable improvements over DP3 on RoboTwin2.0 (+6.1 percentage points) and Adroit/MetaWorld (+4.1), plus positive real-world deployments like cup-stacking with a 13.4% gain, demonstrating enhanced SNR and generalization with minimal overhead. The method offers a practical, plug-in solution to tighten information flow in diffusion-based robotic manipulation, potentially benefiting a broad class of scene-conditioned generative policies.
Abstract
Diffusion-based visuomotor policies built on 3D visual representations have achieved strong performance in learning complex robotic skills. However, most existing methods employ an oversized denoising decoder. While increasing model capacity can improve denoising, empirical evidence suggests that it also introduces redundancy and noise in intermediate feature blocks. Crucially, we find that randomly masking backbone features at inference time (without changing training) can improve performance, confirming the presence of task-irrelevant noise in intermediate features. To this end, we propose Variational Regularization (VR), a lightweight module that imposes a timestep-conditioned Gaussian over backbone features and applies a KL-divergence regularizer, forming an adaptive information bottleneck. Extensive experiments on three simulation benchmarks (RoboTwin2.0, Adroit, and MetaWorld) show that, compared to the baseline DP3, our approach improves the success rate by 6.1% on RoboTwin2.0 and by 4.1% on Adroit and MetaWorld, achieving new state-of-the-art results. Real-world experiments further demonstrate that our method performs well in practical deployments. Code will released.
