Skip to content
AI News HubLIVE
Original source2 min read

Learning Correct Behavior from Examples: Validating Sequential Execution in Autonomous Agents

Summary

A novel algorithm that learns correct sequential behavior from as few as 2-10 successful execution traces, combining dominator analysis with multimodal LLM semantic understanding to validate new executions. It achieves high accuracy with only 3 training traces across domains like UI testing, code generation, and robotic processes.

SourcearXiv AIAuthor: Reshabh K Sharma, Gaurav Mittal, Yu Hu
Learning Correct Behavior from Examples: Validating Sequential Execution in Autonomous Agents
Report an error

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

Correction instructions
Read article

[2605.03159] Learning Correct Behavior from Examples: Validating Sequential Execution in Autonomous Agents

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.03159

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 > Artificial Intelligence

arXiv:2605.03159 (cs)

[Submitted on 4 May 2026]

Title:Learning Correct Behavior from Examples: Validating Sequential Execution in Autonomous Agents

Authors:Reshabh K Sharma, Gaurav Mittal, Yu Hu

View a PDF of the paper titled Learning Correct Behavior from Examples: Validating Sequential Execution in Autonomous Agents, by Reshabh K Sharma and Gaurav Mittal and Yu Hu

View PDF HTML (experimental)

Abstract:As autonomous agents become increasingly sophisticated, validating their sequential behavior presents a significant challenge. Traditional testing approaches require manual specification, exact sequence matching, or thousands of training examples. We present a novel algorithm that automatically learns correct behavior from just 2-10 passing execution traces and validates new executions against this learned model. Our approach combines dominator analysis from compiler theory with multimodal large language model-powered semantic understanding to identify essential states and handle non-deterministic behavior. The system constructs a generalized ground truth model using Prefix Tree Acceptors, merges traces through multi-tiered equivalence detection, and validates new executions via topological subsequence matching. In controlled experiments, our system achieved high accuracy in detecting product bugs and false successes using only 3 training traces. This approach provides explainable validation results with coverage metrics and works across diverse domains including UI testing, code generation, and robotic processes.

Subjects:

Artificial Intelligence (cs.AI); Software Engineering (cs.SE)

Cite as: arXiv:2605.03159 [cs.AI]

(or arXiv:2605.03159v1 [cs.AI] for this version)

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

Focus to learn more

arXiv-issued DOI via DataCite (pending registration)

Submission history

From: Reshabh K Sharma [view email] [v1] Mon, 4 May 2026 21:07:56 UTC (67 KB)

Full-text links:

Access Paper:

View a PDF of the paper titled Learning Correct Behavior from Examples: Validating Sequential Execution in Autonomous Agents, by Reshabh K Sharma and Gaurav Mittal and Yu Hu

View PDF

HTML (experimental)

TeX Source

view license

Current browse context:

cs.AI

new | recent | 2026-05

Change to browse by:

cs cs.SE

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

EngineersAdvanced

Key points

  • Learns correct behavior from just 2-10 passing execution traces without manual specification
  • Combines dominator analysis from compiler theory with multimodal LLM semantic understanding
  • Uses Prefix Tree Acceptors and topological subsequence matching for validation
  • Achieves high accuracy with only 3 training traces in diverse domains

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