ROSER: Few-Shot Robotic Sequence Retrieval for Scalable Robot Learning

• URL: http://arxiv.org/abs/2603.01474v2
• Date: Thu, 05 Mar 2026 04:48:26 GMT
• Title: ROSER: Few-Shot Robotic Sequence Retrieval for Scalable Robot Learning
• Abstract summary: A critical bottleneck in robot learning is the scarcity of task-labeled, segmented training data.<n>We introduce ROSER, a lightweight few-shot retrieval framework that learns task-agnostic metric spaces over temporal windows.<n>Our experiments demonstrate that ROSER consistently outperforms all prior methods in both accuracy and efficiency.
• Score: 40.51327348071904
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: A critical bottleneck in robot learning is the scarcity of task-labeled, segmented training data, despite the abundance of large-scale robotic datasets recorded as long, continuous interaction logs. Existing datasets contain vast amounts of diverse behaviors, yet remain structurally incompatible with modern learning frameworks that require cleanly segmented, task-specific trajectories. We address this data utilization crisis by formalizing robotic sequence retrieval: the task of extracting reusable, task-centric segments from unlabeled logs using only a few reference examples. We introduce ROSER, a lightweight few-shot retrieval framework that learns task-agnostic metric spaces over temporal windows, enabling accurate retrieval with as few as 3-5 demonstrations, without any task-specific training required. To validate our approach, we establish comprehensive evaluation protocols and benchmark ROSER against classical alignment methods, learned embeddings, and language model baselines across three large-scale datasets (e.g., LIBERO, DROID, and nuScenes). Our experiments demonstrate that ROSER consistently outperforms all prior methods in both accuracy and efficiency, achieving sub-millisecond per-match inference while maintaining superior distributional alignment. By reframing data curation as few-shot retrieval, ROSER provides a practical pathway to unlock underutilized robotic datasets, fundamentally improving data availability for robot learning.

Related papers

• Retrieval-Augmented Robots via Retrieve-Reason-Act [5.93914911947526]
  We argue that robots must evolve from passive executors into active Information Retrieval users.<n>In strictly zero-shot settings where no prior demonstrations exist, robots face a critical information gap.<n>We define the paradigm as Retrieval-Augmented Robotics (RAR), empowering the robot with the information-seeking capability.
  arXiv  Detail & Related papers  (2026-03-03T07:32:15Z)
• Robometer: Scaling General-Purpose Robotic Reward Models via Trajectory Comparisons [69.87766750714945]
  General-purpose robot reward models are typically trained to predict absolute task progress from expert demonstrations.<n>We introduce Robometer, a scalable reward modeling framework that combines intra-trajectory progress supervision with inter-trajectory preference supervision.<n>Robometer is trained with a dual objective: a frame-level progress loss that anchors reward magnitude on expert data, and a trajectory-comparison preference loss that imposes global ordering constraints.
  arXiv  Detail & Related papers  (2026-03-02T17:38:58Z)
• What Matters in Learning from Large-Scale Datasets for Robot Manipulation [12.703188997313223]
  We conduct a large-scale dataset composition study to answer this question.<n>We develop a data generation framework to procedurally emulate common sources of diversity in existing datasets.<n>We find that camera poses and spatial arrangements are crucial dimensions for both diversity in collection and alignment in retrieval.
  arXiv  Detail & Related papers  (2025-06-16T14:25:29Z)
• Coarse-to-fine Q-Network with Action Sequence for Data-Efficient Robot Learning [62.3886343725955]
  We introduce a novel value-based reinforcement learning algorithm that learns a critic network that outputs Q-values over a sequence of actions.<n>Experiments show that CQN-AS outperforms several baselines on a variety of sparse-reward humanoid control and tabletop manipulation tasks.
  arXiv  Detail & Related papers  (2024-11-19T01:23:52Z)
• Affordance-based Robot Manipulation with Flow Matching [7.51335919610328]
  We present a framework for assistive robot manipulation.<n>We tackle two challenges: first, efficiently adapting large-scale models to downstream scene affordance understanding tasks, and second, effectively learning robot action trajectories by grounding the visual affordance model.<n>We learn robot action trajectories guided by affordances in a supervised flow matching method.
  arXiv  Detail & Related papers  (2024-09-02T09:11:28Z)
• Interactive Planning Using Large Language Models for Partially Observable Robotics Tasks [54.60571399091711]
  Large Language Models (LLMs) have achieved impressive results in creating robotic agents for performing open vocabulary tasks. We present an interactive planning technique for partially observable tasks using LLMs.
  arXiv  Detail & Related papers  (2023-12-11T22:54:44Z)
• Pre-Training for Robots: Offline RL Enables Learning New Tasks from a Handful of Trials [97.95400776235736]
  We present a framework based on offline RL that attempts to effectively learn new tasks. It combines pre-training on existing robotic datasets with rapid fine-tuning on a new task, with as few as 10 demonstrations. To our knowledge, PTR is the first RL method that succeeds at learning new tasks in a new domain on a real WidowX robot.
  arXiv  Detail & Related papers  (2022-10-11T06:30:53Z)
• Learn Fast, Segment Well: Fast Object Segmentation Learning on the iCub Robot [20.813028212068424]
  We study different techniques that allow adapting an object segmentation model in presence of novel objects or different domains. We propose a pipeline for fast instance segmentation learning for robotic applications where data come in stream. We benchmark the proposed pipeline on two datasets and we deploy it on a real robot, iCub humanoid.
  arXiv  Detail & Related papers  (2022-06-27T17:14:04Z)
• Development of a robust cascaded architecture for intelligent robot grasping using limited labelled data [0.0]
  In the case of robots, we can not afford to spend that much time on making it to learn how to grasp objects effectively. We propose an efficient learning architecture based on VQVAE so that robots can be taught with sufficient data corresponding to correct grasping. A semi-supervised learning based model which has much more generalization capability even with limited labelled data set has been investigated.
  arXiv  Detail & Related papers  (2021-11-06T11:01:15Z)
• Lifelong Robotic Reinforcement Learning by Retaining Experiences [61.79346922421323]
  Many multi-task reinforcement learning efforts assume the robot can collect data from all tasks at all times. In this work, we study a practical sequential multi-task RL problem motivated by the practical constraints of physical robotic systems. We derive an approach that effectively leverages the data and policies learned for previous tasks to cumulatively grow the robot's skill-set.
  arXiv  Detail & Related papers  (2021-09-19T18:00:51Z)
• Laser2Vec: Similarity-based Retrieval for Robotic Perception Data [7.538482310185135]
  This paper implements a system for storing 2D LiDAR data from many deployments cheaply and evaluating top-k queries for complete or partial scans efficiently. We generate compressed representations of laser scans via a convolutional variational autoencoder and store them in a database. We find our system accurately and efficiently identifies similar scans across a number of episodes where the robot encountered the same location.
  arXiv  Detail & Related papers  (2020-07-30T21:11:50Z)
• Scalable Multi-Task Imitation Learning with Autonomous Improvement [159.9406205002599]
  We build an imitation learning system that can continuously improve through autonomous data collection. We leverage the robot's own trials as demonstrations for tasks other than the one that the robot actually attempted. In contrast to prior imitation learning approaches, our method can autonomously collect data with sparse supervision for continuous improvement.
  arXiv  Detail & Related papers  (2020-02-25T18:56:42Z)

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.