arXiv:2509.01657cs.ROcs.AI2025-09被引 10

用重要性加权提升少样本模仿学习的检索效果

Data Retrieval with Importance Weights for Few-Shot Imitation Learning

  • 基于高斯核密度估计计算目标与先验数据分布比值,改进检索权重
  • 在仿真和真实机器人数据集上均显著提升现有检索方法性能
  • 无需大改动,适合部署于新环境的少样本模仿学习任务

尽管大规模机器人数据集推动了模仿学习的发展,但在新环境和未见任务中,从少量特定任务数据中学习依然至关重要。一种少样本模仿学习的方法是基于检索的模仿学习,即从广泛可用的大规模先验数据集中提取相关样本以补充有限的示范数据集。现有方法通常通过计算先验数据点到目标数据集的最小距离来确定相关性,但本文证明该策略等价于目标数据分布的极限高斯核密度估计(KDE)。这揭示了两个缺陷:一是依赖高方差的近邻估计,易受噪声干扰;二是未考虑先验数据分布。为此,我们提出重要性加权检索(IWR),使用高斯KDE估计目标与先验数据分布的比值作为重要性权重。通过考虑概率比,IWR缓解了以往选择规则的偏差,并利用合理建模参数有效平滑所有数据点的估计。在仿真环境和真实世界桥接任务(Bridge dataset)上的实验表明,仅需微小修改,IWR始终优于现有检索方法。

原文摘要 · Abstract (English)

While large-scale robot datasets have propelled recent progress in imitation learning, learning from smaller task specific datasets remains critical for deployment in new environments and unseen tasks. One such approach to few-shot imitation learning is retrieval-based imitation learning, which extracts relevant samples from large, widely available prior datasets to augment a limited demonstration dataset. To determine the relevant data from prior datasets, retrieval-based approaches most commonly calculate a prior data point's minimum distance to a point in the target dataset in latent space. While retrieval-based methods have shown success using this metric for data selection, we demonstrate its equivalence to the limit of a Gaussian kernel density (KDE) estimate of the target data distribution. This reveals two shortcomings of the retrieval rule used in prior work. First, it relies on high-variance nearest neighbor estimates that are susceptible to noise. Second, it does not account for the distribution of prior data when retrieving data. To address these issues, we introduce Importance Weighted Retrieval (IWR), which estimates importance weights, or the ratio between the target and prior data distributions for retrieval, using Gaussian KDEs. By considering the probability ratio, IWR seeks to mitigate the bias of previous selection rules, and by using reasonable modeling parameters, IWR effectively smooths estimates using all data points. Across both simulation environments and real-world evaluations on the Bridge dataset we find that our method, IWR, consistently improves performance of existing retrieval-based methods, despite only requiring minor modifications.

模仿学习少样本数据检索重要性加权

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。