Daily AI Paper

Daily AI Paper

2026-10-15

Archived
2026-10-15

Hierarchical Residual Policy Learning for Real-World Mobile Manipulation with Sparse Human Guidance

Zhefei Gong, Hefeifei Jiang, Zehao Wang, Jiachen Li

arXiv:2610.20607v1

Mobile manipulation is one of those robotics problems that sounds straightforward until you try to do it in the real world. A robot has to move its base through the environment, coordinate an arm, sometimes a torso or head, and do all of that while perceiving a messy, changing human-centric setting. That makes it a key step toward general-purpose robots, but also a very hard control problem. The challenge is not just perception or planning in isolation. It is the coupling between modules: if the base approaches a table a little off, the arm may suddenly be too far away, at the wrong angle, or forced into an awkward trajectory. In a tightly coupled system like this, small errors compound quickly. This paper is about how to fine-tune an already pre-trained mobile manipulation policy directly on a real robot, using only limited online interaction and sparse human guidance. That matters because pre-trained policies often work well in the narrow conditions they saw during training, but real deployment is full of variation: object positions shift, the robot starts from slightly different poses, and the world is less tidy than a benchmark. So some kind of post-training adaptation is usually needed. The difficulty is that real-world fine-tuning has to be sample-efficient, safe, and stable. You cannot collect huge amounts of robot data the way you might in simulation. And in mobile manipulation, the action space is high-dimensional and the modules are interdependent, which makes ordinary fine-tuning methods much less reliable. The authors place their work in the landscape between imitation learning and reinforcement learning. Supervised fine-tuning from demonstrations is stable, but it is limited by the amount and quality of expert data, and it tends not to explore beyond what was demonstrated. Reinforcement learning can explore and improve beyond the dataset, but in this setting it is difficult to apply directly, especially when the base policy is a modern generative model whose likelihood is hard to compute. That is one reason residual reinforcement learning is attractive: instead of replacing the existing policy, you freeze it and learn a correction on top. This gives you a practical way to adapt a strong prior without having to retrain everything from scratch. HiRe-MoMa, short for Hierarchical Residual Mobile Manipulation, builds on that idea but adds two important pieces tailored to the structure of mobile manipulation. First, it uses a policy-agnostic residual: the system learns additive corrections on top of a frozen base policy, so it can work across different kinds of pre-trained policies. The paper specifically says this makes the approach compatible with architectures such as Diffusion Policy and ACT. Second, it introduces hierarchical decoupling. Instead of treating the whole robot as one monolithic action vector, it separates the residual into a mobile-base part and a manipulator-arm part. The key idea is that the arm should be conditioned on the base’s correction, because physically the base sets up the arm’s reach. That unidirectional conditioning mirrors the robot’s actual hierarchy and is meant to reduce gradient interference between modules. There is also a third component that addresses sample efficiency in the real world: expert-guided value alignment. The authors use sparse human interventions not as full demonstrations, but as a signal to reshape the critic’s value landscape. In other words, when a human steps in during a difficult or risky moment, that intervention is treated as evidence about what behavior should be valued more highly. This is a clever middle ground between pure reinforcement learning and full imitation learning. The robot still explores autonomously, but the sparse expert corrections bias learning toward safer, more successful behavior. The paper emphasizes that this uses under 20% human coverage of the collected data. The overall training setup is an asynchronous actor-learner system running on a single real robot. An onboard rollout worker executes the current policy, while a central learner on a workstation updates the residual policy and critic. That matters because real-world robot learning needs to keep the robot operating while learning proceeds, and the asynchronous setup helps make the process practical. To understand the method more concretely, it helps to think about the residual policy as a small correction module sitting on top of a strong prior. The base policy proposes an action. The residual policy then adds a bounded correction, with the correction norm constrained so it does not drift too far from the base trajectory. The learning is off-policy and value-based, using temporal-difference updates and a conservative target derived from a critic ensemble. The paper also uses entropy regularization to keep exploration from collapsing too early, while still staying local to the base policy’s behavior. That local correction idea is important: rather than trying to rediscover the entire task from scratch, the system is learning how to nudge a mostly competent policy in the right direction. The hierarchical decoupling is the part that most directly addresses mobile manipulation. High-dimensional RL often struggles when all modules are optimized together, because the gradients for base and arm can interfere with one another. Here, the residual action is split into mobile and manipulator components. The mobile correction is treated as upstream context for the arm policy and its critic. So the arm’s refinement is conditioned on where the base is trying to go. This is a structural prior, but one grounded in the robot’s physical reality rather than in a hand-crafted task-specific controller. The authors suggest this design can extend naturally to deeper hierarchies as tasks become more complex. The expert-guided value alignment component uses a shared-control style setup. Human experts intervene during critical moments, and those interventions are stored in a dedicated buffer. During training, the system samples from this buffer in a balanced way so that the critic learns not just from task outcomes, but also from the expert’s corrective preferences. The paper frames this as reshaping the value surface, which is a useful way to think about it: instead of only rewarding final success, the learning process is nudged toward trajectories that a human would consider more promising or safer. The experiments are real-world, not simulated, and they are run on the TIAGo++ mobile manipulation platform. The paper says they evaluate three tasks of increasing complexity, though the extracted text does not list the task names. The important point is that these are genuine on-robot trials, and the method is tested across two different base policy architectures. That is a strong design choice because it checks whether the method is actually policy-agnostic rather than tuned to one specific pretrained model. The paper also emphasizes that the online interaction budget is small: roughly 25 to 40 minutes, with about 30 minutes highlighted in the abstract. That is a very limited amount of real robot time, which makes sample efficiency a central part of the claim. The reported results are that HiRe-MoMa consistently improves task performance over the frozen base policies, and it does so regardless of whether the base policy is Diffusion Policy or ACT. The authors present this as evidence that the method is robust to the choice of base architecture. They also claim that the expert-guided value alignment helps improve sample efficiency and accelerate convergence, especially when the human coverage is sparse. Taken together, the results suggest that the combination of residual adaptation, hierarchical decomposition, and sparse expert guidance is more effective than trying to fine-tune a whole mobile manipulation policy in a flat way. What do these results actually show? First, they show that real-world fine-tuning of mobile manipulation is feasible with a carefully structured residual approach. Second, they show that respecting the robot’s hierarchy matters: separating base and arm is not just an implementation detail, but a way to make optimization more stable. Third, they show that sparse human interventions can be used more strategically than simply as demonstration data. Instead of replacing RL, the human signal shapes where the critic thinks good behavior lies. At the same time, there are important limitations to keep in mind. The paper is still operating in a relatively controlled real-world setup on a specific platform, TIAGo++. That is valuable, but it is not the same as proving broad generalization across many robot embodiments, task families, or sensing setups. The method also assumes access to a reasonably competent frozen base policy to start from; it is a fine-tuning framework, not a solution for learning everything from scratch. And while the expert-guided component uses sparse interventions efficiently, it still depends on human availability and on the quality of those interventions. Another thing to watch is that the method is designed around the physical hierarchy of mobile manipulation. That is a strength, but also means its benefits may be strongest where the task structure is similarly hierarchical. Extending it to even more complex systems, or to settings where module dependencies are less clear, may require additional design choices. Overall, the paper’s main contribution is a practical recipe for real-world mobile manipulation fine-tuning: freeze a strong base policy, learn bounded residual corrections, split those corrections according to the robot’s hierarchy, and use sparse human interventions to guide the critic. The broader message is that in real robot learning, structure matters. If you want stable adaptation from limited data, it is not enough to throw reinforcement learning at the whole system. You need to respect how the robot is built, how its modules interact, and how little data you can actually afford to collect.

Previous daily papers

2026-10-17Discovering state-of-the-art quantum circuits with large language models2026-10-17FDE-Gym: The Last Mile of AI Delivery2026-10-17MLExpert: Towards a Generalist Agentic Model for Autonomous Machine Learning Engineering2026-10-15Your Transformer Is Secretly Elastic2026-10-15Latent Compaction with Test-Time Training2026-10-14Tev: Scaling Long-Horizon Agentic Environments with Dense Progress Rewards2026-10-14The Last Remote Sensing Model Built by Humans? Casting Any Earth Observation Task as Recursive Self-Improvement2026-10-14Hybrid Reasoning Agents2026-10-13AI Models Can Provably Hide Arbitrary Capabilities2026-10-13RATED: Reliability-Aware AI Agent Tool Retrieval via Execution Dynamics2026-10-13Designing Protein Structures from Natural Language2026-10-12RSI-Anything: Unlocking Recursive Self-Improvement with World Models2026-10-11A Balanced Data Diet: Addressing the Exploration Bottleneck in Mega-Scale RL for Robot Control2026-10-11FAITH: Feasibility-Aware Safety-Filtered RL for High-Dimensional Systems2026-10-11VioLA: Learning Generalist Humanoid Control Policies from Human Data2026-10-10FastBench: Can Streaming VLMs Perceive High-Dynamic Real-World Streams?2026-10-10Ecology of AI Agents: Collaboration Creates a Population Threshold for Takeoff2026-10-08Long-WAM: Scaling the Context of World-Action Models2026-10-08SciExam for ENSO: Can AI Agents Build Climate Models?2026-10-08RoboJEPA: Scaling Robotic Latent World Models2026-10-08RECAST: Learning to Compute the Right Context through Adaptive Evidence Routing2026-10-07WorldSonus: Bringing Sound to Worlds2026-10-07IdeaAnchor: Teaching LLMs to Turn Literature into Research Ideas2026-10-07Agent in a Bottle: Can LLM Agents Turn Their Capabilities Into Cheap, Scalable Artifacts?2026-10-06CLIFT: Conformal Self-Verification for Web Agent Training and Test-Time Scaling2026-10-06PlotGround: Grounding Plot Digitization in Real Scientific Figures and Their Source Data2026-10-06Base Models Can Reason By Taking a Cue From Training Data2026-10-05LESSER: Post-Training Data Selection with Output-Layer Gradients2026-10-05Language Models that Play Chess and Explain Their Moves2026-10-05Less Decoder is More Encoder: Geometric Representation Learning from Novel View Synthesis2026-10-04One Basis to Animate Them All: Gaussian Blendshape Distillation for Real-Time Avatars2026-10-04The Missing Primitive: Diagnosing and Repairing Mathematical Reasoning in Large Language Models2026-10-04DMAD: Distribution Matching as Adversarial Distillation for Fast Visual Generation2026-10-03VISTA: A Visual Harness for Reasoning in an Interactive World2026-10-01Looped Diffusion Transformer2026-10-01Scaling Laws for Looped Mixture of Experts2026-10-01EvoDuet: Bilevel Co-Evolution of Web Searching and Task Solving for Scientific Discovery2026-09-30Beyond the Timeline: Augmenting Long-Video Memory with Grounded Entity Biographies2026-09-30Thinking Before Thinking: Scaling Agentic Inference Through Meta-Reasoning2026-09-30Pretraining Latent Information Feedback Transformers with Teacher Supervision2026-09-29Unifying Distributional Training for One-Step Visual Generation2026-09-29Improving Test-Time Scaling with Adaptive Looped Transformers2026-09-29Telescopic Language Models2026-09-28Statistical attribute alignment for black-box generative AI via output post-processing2026-09-28User Model Extraction via Belief Self-Distillation2026-09-28Learning to Stop without Learning to Stop: Self-Supervised Confidence Training Improves Reasoning Efficiency2026-09-27TrackEverything: Long Horizon Dense Tracking via De-Duplicating 3D Scene Representations2026-09-27LLM Agents Can Easily Tamper With Their Own Traces2026-09-27Instrumental Monitor Evasion Emerges Under Ordinary Task Pressure2026-09-26PoEM: Predicting RL Outcomes from Existing Policies2026-09-24Frozen Flows Forget: Diagnosing and Restoring Lost Motion in a Latent-flow World Model2026-09-24StudentBench: AI and human tutoring yield equivalent GRE learning gains2026-09-24Agent-Editing World Model: Rethinking World Modeling for LLM Agents2026-09-23Grow the Harness, Not the Context: From Strategy-Free Scaffolds to Reusable Specialist Agents2026-09-23FleXray: Universal Clinical X-ray Segmentation2026-09-23SWE-Serve: Benchmarking Agentic Engineering For Production Inference Serving2026-09-22GameHorizon Suite: Multi-Horizon Data and Evaluation in Gameplay2026-09-22Emergent Collusion in Long-Horizon LLM Agent Interaction2026-09-22WorldCrafter: Consistent Video World Model with Implicit 3D-aware Memory