Towards Efficient Active Learning of PDFA
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 2 of its 15 references that are in the map. First posted on arXiv 17 Jun 2022.
Builds on
2 of 15 references.
References · 2
Built on by
Citing papers per year: 2024: 1; 2025: 1; 2026: 1.
3 papers.
Similar, not cited
Close in wording, no citation either way
- 2025Inference of Deterministic Finite Automata via Q-Learning
- 2025PCoreSet: Effective Active Learning through Knowledge Distillation from Vision-Language Models
- 2025LLM on a Budget: Active Knowledge Distillation for Efficient Classification of Large Text Corpora
- 2025An effective potential for generative modelling with active matter
- 2026The SIGReg Objective as Variational Free Energy: A Theoretical Active-Inference Account of JEPA World Models
- 2024Revisiting Active Learning in the Era of Vision Foundation Models
- 2025Efficient Process Reward Model Training via Active Learning
- 2026Spherical Flows for Sampling Categorical Data