analiza aiqbench
This research addresses a critical gap in robotic imitation learning by integrating formal Lyapunov stability guarantees into flow matching models. By offering both soft penalty and hard structural constraint variants, the proposed framework ensures safe, generalizable motion policies while maintaining scalability across complex, multimodal tasks. The extension to Lie groups further broadens its applicability to high-dimensional state spaces, marking a significant step toward robust autonomous robot behaviors.
Let the Dynamics Flow: Stable Flow Matching Dynamical Systems
arXiv:2606.03834v1 Announce Type: new Abstract: Flow matching has recently emerged as a powerful approach for imitation learning, enabling scalable, expressive, and multimodal motion policies. However, incorporating formal stability guarantees into these generative models, a prerequisite to ensure safe and generalizable robot behaviors, remains a significant challenge. While modeling robot motions as dynamical systems allows for such stability-based inductive biases, existing frameworks struggle to capture the rich action distributions inherent in complex robotic tasks. This paper introduces Stable Flow Matching Dynamical Systems (SFMDS), a novel framework that bridges the gap between high-capacity generative modeling and formal Lyapunov stability guarantees. SFMDS parametrizes dynamical systems via flow matching while simultaneously constraining the model to a family of stable solutions. We propose two variants: a soft constraint based on a penalty term, and a hard structural constraint embedded directly in the model architecture. We further extend both formulations to Lie groups. Experiments on benchmark datasets, in simulation, and on a humanoid robot show that SFMDS learns stable, scalable, and multimodal dynamical systems in low- and high-dimensional state spaces, enabling safe and expressive robot motion generation.
Abstract:Flow matching has recently emerged as a powerful approach for imitation learning, enabling scalable, expressive, and multimodal motion policies. However, incorporating formal stability guarantees into these generative models, a prerequisite to ensure safe and generalizable robot behaviors, remains a significant challenge. While modeling robot motions as dynamical systems allows for such stability-based inductive biases, existing frameworks struggle to capture the rich action distributions inherent in complex robotic tasks. This paper introduces Stable Flow Matching Dynamical Systems (SFMDS), a novel framework that bridges the gap between high-capacity generative modeling and formal Lyapunov stability guarantees. SFMDS parametrizes dynamical systems via flow matching while simultaneously constraining the model to a family of stable solutions. We propose two variants: a soft constraint based on a penalty term, and a hard structural constraint embedded directly in the model architecture. We further extend both formulations to Lie groups. Experiments on benchmark datasets, in simulation, and on a humanoid robot show that SFMDS learns stable, scalable, and multimodal dynamical systems in low- and high-dimensional state spaces, enabling safe and expressive robot motion generation.
Robotics (cs.RO)
arXiv:2606.03834 [cs.RO]
(or arXiv:2606.03834v1 [cs.RO] for this version)
https://doi.org/10.48550/arXiv.2606.03834 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.
Text integral sub licența deschisă a publicației · 269 cuvinte
Subiecte conexe

Quantum Circuit Compresses Flow Surrogates to Fewer Than 100 Parameters
Quantum Zeitgeist · 1 aug. 2026
Equivariant Flow Matching for Symmetry-Breaking Bifurcation Problems
arXiv · 12 iun. 2026
Explainable quantum-compressed machine learning for complex fluid flows
arXiv · 27 iul. 2026

The Four Caches in LLM Serving
Analytics Vidhya · 8 sept. 2026