2000 character limit reached
Towards Efficient Active Learning of PDFA
Published 17 Jun 2022 in cs.FL, cs.AI, and cs.LG | (2206.09004v1)
Abstract: We propose a new active learning algorithm for PDFA based on three main aspects: a congruence over states which takes into account next-symbol probability distributions, a quantization that copes with differences in distributions, and an efficient tree-based data structure. Experiments showed significant performance gains with respect to reference implementations.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.