How to utilize failure demo data?: Effective data selection for imitation learning using distribution differences in attention mechanism

• URL: http://arxiv.org/abs/2605.07560v1
• Date: Fri, 08 May 2026 10:34:11 GMT
• Title: How to utilize failure demo data?: Effective data selection for imitation learning using distribution differences in attention mechanism
• Abstract summary: We propose a method that learns latent representations of success-failure discrepancies and incorporates them into the attention mechanism.<n>We introduce a post-training metric that quantifies the attention discrepancy between each failure sample and successful demonstrations to select failure data.
• Score: 3.4735198125706326
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Imitation learning for robotic tasks has relied primarily on policies trained only on successful demonstrations, although failures are unavoidable during human data collection. Many existing approaches for exploiting failure data require additional data processing or iterative policy updates through autonomous rollouts, making it difficult to directly and stably utilize failure data accumulated during data collection. In this work, we propose a method that learns latent representations of success-failure discrepancies and incorporates them into the attention mechanism. During inference, an appropriate latent mode is selected from the initial observation to improve action stability. Furthermore, we introduce a post-training metric that quantifies the attention discrepancy between each failure sample and successful demonstrations to select failure data. Simulation results show that the proposed method improves task success rates when trained with failure data and that the proposed metric identifies failure samples that are beneficial for learning when combined with successful demonstrations. These results suggest that the proposed method can support more efficient use of collected demonstrations in robotic data collection pipelines.

Related papers

• RECALL: Recovery Experience Collection for Active Lifelong Learning in Vision-Language-Action Models [1.7157586976839874]
  We propose an active, continual learning paradigm for Vision-Language-Action (VLA) models.<n>We demonstrate that active, uncertainty-guided data collection leads to more efficient fine-tuning than when using passively-collected demonstrations.<n>We also find that fine-tuning only on actively-collected recovery data leads to catastrophic forgetting.
  arXiv  Detail & Related papers  (2026-06-22T17:12:50Z)
• Quality over Quantity: Demonstration Curation via Influence Functions for Data-Centric Robot Learning [41.56474276521344]
  Quality of demonstration data remains a critical bottleneck for effective data-driven robot learning.<n>We propose Quality over Quantity (QoQ) to identify high-quality data by defining data quality as the contribution of each training sample to reducing loss on validation demonstrations.<n> Experiments in both simulated and real-world settings show that QoQ consistently improves policy performances over prior data selection methods.
  arXiv  Detail & Related papers  (2026-03-10T00:59:59Z)
• CCDP: Composition of Conditional Diffusion Policies with Guided Sampling [17.9632871021636]
  We propose an enhanced sampling strategy that refines the sampling distribution to avoid previously unsuccessful actions.<n>We demonstrate that our method can infer recovery actions without the need for additional exploratory behavior.<n>Our approach yields a low-level controller that dynamically adjusts its sampling space to improve efficiency when prior samples fall short.
  arXiv  Detail & Related papers  (2025-03-19T16:24:55Z)
• Curating Demonstrations using Online Experience [52.59275477573012]
  We show that Demo-SCORE can effectively identify suboptimal demonstrations without manual curation.<n>Demo-SCORE achieves over 15-35% higher absolute success rate in the resulting policy compared to the base policy trained with all original demonstrations.
  arXiv  Detail & Related papers  (2025-03-05T17:58:16Z)
• AdaDemo: Data-Efficient Demonstration Expansion for Generalist Robotic Agent [75.91274222142079]
  In this study, we aim to scale up demonstrations in a data-efficient way to facilitate the learning of generalist robotic agents. AdaDemo is a framework designed to improve multi-task policy learning by actively and continually expanding the demonstration dataset.
  arXiv  Detail & Related papers  (2024-04-11T01:59:29Z)
• Value function estimation using conditional diffusion models for control [62.27184818047923]
  We propose a simple algorithm called Diffused Value Function (DVF) It learns a joint multi-step model of the environment-robot interaction dynamics using a diffusion model. We show how DVF can be used to efficiently capture the state visitation measure for multiple controllers.
  arXiv  Detail & Related papers  (2023-06-09T18:40:55Z)
• Cluster-level pseudo-labelling for source-free cross-domain facial expression recognition [94.56304526014875]
  We propose the first Source-Free Unsupervised Domain Adaptation (SFUDA) method for Facial Expression Recognition (FER) Our method exploits self-supervised pretraining to learn good feature representations from the target data. We validate the effectiveness of our method in four adaptation setups, proving that it consistently outperforms existing SFUDA methods when applied to FER.
  arXiv  Detail & Related papers  (2022-10-11T08:24:50Z)
• On Modality Bias Recognition and Reduction [70.69194431713825]
  We study the modality bias problem in the context of multi-modal classification. We propose a plug-and-play loss function method, whereby the feature space for each label is adaptively learned. Our method yields remarkable performance improvements compared with the baselines.
  arXiv  Detail & Related papers  (2022-02-25T13:47:09Z)
• DEALIO: Data-Efficient Adversarial Learning for Imitation from Observation [57.358212277226315]
  In imitation learning from observation IfO, a learning agent seeks to imitate a demonstrating agent using only observations of the demonstrated behavior without access to the control signals generated by the demonstrator. Recent methods based on adversarial imitation learning have led to state-of-the-art performance on IfO problems, but they typically suffer from high sample complexity due to a reliance on data-inefficient, model-free reinforcement learning algorithms. This issue makes them impractical to deploy in real-world settings, where gathering samples can incur high costs in terms of time, energy, and risk. We propose a more data-efficient IfO algorithm
  arXiv  Detail & Related papers  (2021-03-31T23:46:32Z)
• Stochastic Action Prediction for Imitation Learning [1.6385815610837169]
  Imitation learning is a data-driven approach to acquiring skills that relies on expert demonstrations to learn a policy that maps observations to actions. We demonstrate inherentity in demonstrations collected for tasks including line following with a remote-controlled car. We find that accounting for adversariality in the expert data leads to substantial improvement in the success rate of task completion.
  arXiv  Detail & Related papers  (2020-12-26T08:02:33Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.