6533b870fe1ef96bd12cf0d8
RESEARCH PRODUCT
Active Learning of Recursive Functions by Ultrametric Algorithms
Rūsiņš FreivaldsThomas Zeugmannsubject
Nondeterministic algorithmTheoretical computer scienceActive learning (machine learning)Probabilistic logicNatural numberFunction (mathematics)Inductive reasoningUltrametric spaceAlgorithmMathematicsRandomized algorithmdescription
We study active learning of classes of recursive functions by asking value queries about the target function f, where f is from the target class. That is, the query is a natural number x, and the answer to the query is f(x). The complexity measure in this paper is the worst-case number of queries asked. We prove that for some classes of recursive functions ultrametric active learning algorithms can achieve the learning goal by asking significantly fewer queries than deterministic, probabilistic, and even nondeterministic active learning algorithms. This is the first ever example of a problem where ultrametric algorithms have advantages over nondeterministic algorithms.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 2014-01-01 |