Exact Learning via Teaching Assistants (Extended Abstract)

@inproceedings{Arvind1997ExactLV,
  title={Exact Learning via Teaching Assistants (Extended Abstract)},
  author={Vikraman Arvind and N. V. Vinodchandran},
  booktitle={ALT},
  year={1997}
}
In continuation of our earlier paper [3], we study in detail the teaching assistant model of exact learning. In [3] we show that the exact learnability of some algebraic concept classes can be more sharply classified in this model than in Angluin's model. The teaching assistant model can be seen as an enhancement of Angluin's model. The new ingredient is that apart from the learner and teacher there is a third agent called teaching assistant which acts as an intermediary between the learner and… 

References

SHOWING 1-10 OF 14 REFERENCES

On the complexity of teaching

TLDR
This paper studies the complexity of teaching by considering a variant of the on-line learning model in which a helpful teacher selects the instances, and measures the teaching dimension by a combinatorial measure.

The Complexity of Exactly Learning Algebraic Concepts

TLDR
In this paper, the complexity of exact-learning classes of permutation groups and linear spaces over nite elds are investigated and the notion of a teaching assistant is introduced to answer the question whether the entire power of equivalence queries is needed to learn these concept classes.

The Complexity of Exactly Learning Algebraic Concepts. (Extended Abstract)

TLDR
It turns out that in Angluin's exact-learning model these concept classes are learnable with equivalence queries but not learningable with membership queries, indeed not even exact learnable in a probabilistic sense.

How many queries are needed to learn?

TLDR
It is shown that an honest class is exactly polynomial-query learnable if and only if it is learnable using an oracle for Γp4, and a new relationship between query complexity and time complexity in exact learning is shown.

Structural Complexity II

TLDR
This is the second volume of a systematic two-volume presentation of the various areas of research in the field of structural complexity, addressed to graduate students and researchers and assumes knowledge of the topics treated in the first volume but is otherwise nearly self-contained.

Gap-deenable Counting Classes

The function class #P lacks an important closure property: it is not closed under subtraction. To remedy this problem, we introduce the function class GapP as a natural alternative to #P. GapP is the

Gap-De nable Counting Classes

The function class #P lacks an important closure property: it is not closed under subtraction. To remedy this problem, we introduce the function class GapP as a natural alternative to #P. GapP is the

Gap-definable counting classes

TLDR
It is shown that most previously studied counting classes are gap-definable, i.e., definable using the values of GapP functions alone, and there is a smallest gap- definable class, SPP, which is still large enough to contain Few.

Polynomial-time algorithms for permutation groups

TLDR
It is demonstrated that the normal closure of a subgroup can be computed in polynomial time, and that this proceaure can be used to test a group for solvability.

Quantitative Relativizations of Complexity Classes

TLDR
This paper studies restrictions R on both the deterministic and also the nondeterministic polynomial time-bounded oracle machines such that the size of the set of strings queried by the oracle in computations of a machine on an input is bounded by aPolynomial in the length of the input.