aiqbench analysis
This research introduces HyperDCM, a novel memory mechanism for robotic navigation that leverages hyperbolic space geometry to mitigate catastrophic forgetting in continual learning scenarios. By integrating large vision-language models with relational graph convolutions, the method effectively preserves diverse scene knowledge while adapting diffusion policies across evolving environments. The approach represents significant progress in enabling autonomous agents to maintain performance over long-term, multi-scene operations without retraining from scratch.
HyperDCM: Dynamic Cluster Memory Replay in Hyperbolic Space for Continual Robotic Navigation Across Scenes
arXiv:2607.16267v1 Announce Type: new Abstract: Continual learning in visual navigation remains challenging due to catastrophic forgetting and the difficulties associated with adapting to diverse and evolving environments. To address these issues, we propose Hyperbolic Dynamic Cluster Memory (HyperDCM), a structure-aware memory mechanism that enhances diffusion policy-based navigation through scene graph modeling and principled memory replay. HyperDCM extracts semantic scene triples from RGB observations using large vision-language models, encodes them into scene graph embeddings via a Relational Graph Convolutional Network (R-GCN), and projects the embeddings into hyperbolic space to enhance structural separability and retention in continual navigation. A dynamic clustering and structure-sensitive update strategy selects representative samples for memory replay, thereby preserving knowledge diversity and mitigating catastrophic forgetting. Experiments on multi-scene indoor and outdoor datasets demonstrate that HyperDCM achieves superior retention of past navigation capabilities and improved generalization compared to representative continual learning baselines adapted to diffusion policy navigation.
Abstract:Continual learning in visual navigation remains challenging due to catastrophic forgetting and the difficulties associated with adapting to diverse and evolving environments. To address these issues, we propose Hyperbolic Dynamic Cluster Memory (HyperDCM), a structure-aware memory mechanism that enhances diffusion policy-based navigation through scene graph modeling and principled memory replay. HyperDCM extracts semantic scene triples from RGB observations using large vision-language models, encodes them into scene graph embeddings via a Relational Graph Convolutional Network (R-GCN), and projects the embeddings into hyperbolic space to enhance structural separability and retention in continual navigation. A dynamic clustering and structure-sensitive update strategy selects representative samples for memory replay, thereby preserving knowledge diversity and mitigating catastrophic forgetting. Experiments on multi-scene indoor and outdoor datasets demonstrate that HyperDCM achieves superior retention of past navigation capabilities and improved generalization compared to representative continual learning baselines adapted to diffusion policy navigation.
Robotics (cs.RO)
arXiv:2607.16267 [cs.RO]
(or arXiv:2607.16267v1 [cs.RO] for this version)
https://doi.org/10.48550/arXiv.2607.16267 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 236 words
Related coverage

Game Design Creativity evals
LessWrong · Oct 12, 2026

DynoSim: Simulating the Pareto Frontier
NVIDIA · May 29, 2026

How Generative Recommenders Are Redefining RecSys at Scale
NVIDIA · Aug 20, 2026
Technical Dive into AMD’s MLPerf Training v6.0 Submission
AMD · Jun 16, 2026