L* Algorithm
A classical active learning algorithm proposed by Dana Angluin in 1987. It infers a minimal deterministic finite automaton (DFA) from a black-box system through membership queries and equivalence queries with an oracle, and is noted for its strong interpretability.
Timeline (last 90 days)
The paper uses the L* grammar inference algorithm to learn a deterministic finite automaton (DFA) for routing decisions, rather than hand-coding rules.
In this learning framework, the SLM serves as the membership oracle and labeled data serves as the equivalence oracle.
The L* algorithm was proposed by Dana Angluin in 1987 for inferring a minimal deterministic finite automaton from a black-box system.
All Facts (3)
The paper uses the L* grammar inference algorithm to learn a deterministic finite automaton (DFA) for routing decisions, rather than hand-coding rules.
50%UnverifiedIn this learning framework, the SLM serves as the membership oracle and labeled data serves as the equivalence oracle.
50%UnverifiedThe L* algorithm was proposed by Dana Angluin in 1987 for inferring a minimal deterministic finite automaton from a black-box system.
50%