Tree-Based Adaptive Model Learning
Not on the map. Why?
Abstract (arXiv)
We extend the Kearns-Vazirani learning algorithm to be able to handle systems that change over time. We present a new learning algorithm that can reuse and update previously learned behavior, implement it in the LearnLib library, and evaluate it on large examples, to which we make small adjustments between two runs of the algorithm. In these experiments our algorithm significantly outperforms both the classic Kearns-Vazirani learning algorithm and the current state-of-the-art adaptive algorithm.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 1 of its 16 references that are in the map. First posted on arXiv 31 Aug 2022.
Builds on
1 of 16 references.
References · 1
Built on by
Citing papers per year: 2023: 2; 2024: 1; 2025: 0; 2026: 1.
4 papers.
- 2024State Matching and Multiple References in Adaptive Active Automata Learningcited by 1
- 2023Conflict-Aware Active Automata Learning (Extended Version)cited by 0
- 2023Conflict-Aware Active Automata Learningcited by 0
- 2026Error-awareness Accelerates Active Automata Learningcited by 0
- 2026Error-awareness Accelerates Active Automata Learning25 Feb 2026
- 2024State Matching and Multiple References in Adaptive Active Automata Learning28 Jun 2024
- 2023Conflict-Aware Active Automata Learning2 Oct 2023
- 2023Conflict-Aware Active Automata Learning (Extended Version)28 Aug 2023