arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2604.02244cs.FLcs.LG
收藏

从数据流中学习PAC学习PDFA

PAC learning PDFA from data streams

Delft University of Technology(代尔夫特理工大学)

Robert Baumgartner, Sicco Verwer

AI总结:

本文提出了一种从数据流中学习状态机的通用方法及合并启发式算法,通过sketches处理不完整前缀树,并在PAC框架内分析算法有效性,提升了运行效率和结果质量。

摘要:

本文提出了一种从数据流中学习状态机的通用方法及合并启发式算法,通过sketches处理不完整前缀树,并在PAC框架内分析算法有效性,提升了运行效率和结果质量。

英文摘要:

This is an extended version of our publication Learning state machines from data streams: A generic strategy and an improved heuristic, International Conference on Grammatical Inference (ICGI) 2023, Rabat, Morocco. It has been extended with a formal proof on PAC-bounds, and the discussion and analysis of a similar approach has been moved from the appendix and now has a full dedicated section. State machine models are models that simulate the behavior of discrete event systems, capable of representing systems such as software systems, network interactions, and control systems, and have been researched extensively. The nature of most learning algorithms however is the assumption that all data be available at the beginning of the algorithm, and little research has been done in learning state machines from streaming data. In this paper, we want to close this gap further by presenting a generic method for learning state machines from data streams, as well as a merge heuristic that uses sketches to account for incomplete prefix trees. We implement our approach in an open-source state merging library and compare it with existing methods. We show the effectiveness of our approach with respect to run-time, memory consumption, and quality of results on a well known open dataset. Additionally, we provide a formal analysis of our algorithm, showing that it is capable of learning within the PAC framework, and show a theoretical improvement to increase run-time, without sacrificing correctness of the algorithm in larger sample sizes.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑