Skip to content
AI News HubLIVE
Original source3 min read

TAIL-Safe: Task-Agnostic Safety Monitoring for Imitation Learning Policies

Summary

TAIL-Safe introduces a safety monitoring framework for imitation learning policies, using a Q-function to identify safe state-action sets and a recovery mechanism to prevent task failure. Experiments show consistent success for flow-matching policies.

SourcearXiv RoboticsAuthor: Riad Ahmed, Momotaz Begum
TAIL-Safe: Task-Agnostic Safety Monitoring for Imitation Learning Policies
Report an error

The correction channel is not available yet. You can copy the article reference below for later.

Correction instructions
Read article

[2605.01195] TAIL-Safe: Task-Agnostic Safety Monitoring for Imitation Learning Policies

Skip to main content

Learn about arXiv becoming an independent nonprofit.

We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate

> cs > arXiv:2605.01195

Help | Advanced Search

All fields Title Author Abstract Comments Journal reference ACM classification MSC classification Report number arXiv identifier DOI ORCID arXiv author ID Help pages Full text

Search

GO

quick links

Login

Help Pages

About

-->

Computer Science > Robotics

arXiv:2605.01195 (cs)

[Submitted on 2 May 2026]

Title:TAIL-Safe: Task-Agnostic Safety Monitoring for Imitation Learning Policies

Authors:Riad Ahmed, Momotaz Begum

View a PDF of the paper titled TAIL-Safe: Task-Agnostic Safety Monitoring for Imitation Learning Policies, by Riad Ahmed and Momotaz Begum

View PDF HTML (experimental)

Abstract:Recent imitation learning (IL) algorithms such as flow-matching and diffusion policies demonstrate remarkable performance in learning complex manipulation tasks. However, these policies often fail even when operating within their training distribution due to extreme sensitivity to initial conditions and irreducible approximation errors that lead to compounding drift. This makes it unsafe to deploy IL policies in the field where out-of-distribution scenarios are prevalent. A prerequisite for safe deployment is enabling the policy to determine whether it can execute a task the way it was learned from demonstrations. This paper presents TAIL-Safe, a principled approach to identify, for a trained IL policy, a safe set from where the policy empirically succeeds in completing the learned task. We propose a Lipschitz-continuous Q-value function that maps state-action pairs to a long-term safety score based on three short-term task-agnostic criteria: visibility, recognizability, and graspability. The zero-superlevel set of this function characterizes an empirical control invariant set over state-action pairs. When the nominal policy proposes an action outside this set, we apply a recovery mechanism inspired by Nagumo's theorem that uses gradient ascent to the Q-function to steer the policy back to safety. To learn this Q-function, we construct a high-fidelity digital twin using Gaussian Splatting that enables systematic collection of failure data without risk to physical hardware. Experiments with a Franka Emika robot demonstrate that flow-matching policies, which fail under run-time perturbations, achieve consistent task success when guided by the proposed TAIL-Safe.

Subjects:

Robotics (cs.RO)

Cite as: arXiv:2605.01195 [cs.RO]

(or arXiv:2605.01195v1 [cs.RO] for this version)

https://doi.org/10.48550/arXiv.2605.01195

Focus to learn more

arXiv-issued DOI via DataCite (pending registration)

Submission history

From: Riad Ahmed [view email] [v1] Sat, 2 May 2026 02:16:53 UTC (4,004 KB)

Full-text links:

Access Paper:

View a PDF of the paper titled TAIL-Safe: Task-Agnostic Safety Monitoring for Imitation Learning Policies, by Riad Ahmed and Momotaz Begum

View PDF

HTML (experimental)

TeX Source

view license

Current browse context:

cs.RO

new | recent | 2026-05

Change to browse by:

cs

References & Citations

NASA ADS

Google Scholar

Semantic Scholar

export BibTeX citation Loading...

BibTeX formatted citation

×

loading...

Data provided by:

Bookmark

Bibliographic Tools

Bibliographic and Citation Tools

Bibliographic Explorer Toggle

Bibliographic Explorer (What is the Explorer?)

Connected Papers Toggle

Connected Papers (What is Connected Papers?)

Litmaps Toggle

Litmaps (What is Litmaps?)

scite.ai Toggle

scite Smart Citations (What are Smart Citations?)

Code, Data, Media

Code, Data and Media Associated with this Article

alphaXiv Toggle

alphaXiv (What is alphaXiv?)

Links to Code Toggle

CatalyzeX Code Finder for Papers (What is CatalyzeX?)

DagsHub Toggle

DagsHub (What is DagsHub?)

GotitPub Toggle

Gotit.pub (What is GotitPub?)

Huggingface Toggle

Hugging Face (What is Huggingface?)

ScienceCast Toggle

ScienceCast (What is ScienceCast?)

Demos

Demos

Replicate Toggle

Replicate (What is Replicate?)

Spaces Toggle

Hugging Face Spaces (What is Spaces?)

Spaces Toggle

TXYZ.AI (What is TXYZ.AI?)

Related Papers

Recommenders and Search Tools

Link to Influence Flower

Influence Flower (What are Influence Flowers?)

Core recommender toggle

CORE Recommender (What is CORE?)

Author

Venue

Institution

Topic

About arXivLabs

arXivLabs: experimental projects with community collaborators

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.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)

About

Help

contact arXivClick here to contact arXiv Contact

subscribe to arXiv mailingsClick here to subscribe Subscribe

Copyright

Privacy Policy

Web Accessibility Assistance

arXiv Operational Status

Key points and analysis

Article intelligence

ResearchersAdvanced

Key points

  • Imitation learning policies are sensitive to initial conditions and prone to compounding drift.
  • TAIL-Safe defines a safe set based on visibility, recognizability, and graspability criteria.
  • A recovery mechanism steers the policy back to safety using gradient ascent on the Q-function.
  • Experiments with a Franka Emika robot demonstrate improved task success.

Highlights and analysis are generated automatically and may contain errors. Check the original source.