AbstractWhile most theoretical work in machine learning has focused on the complexity of learning, recently there has been increasing interest in formally studying the complexity of teaching. In this paper we study the complexity of teaching by considering a variant of the on-line learning model in which a helpful teacher selects the instances. We measure the complexity of teaching a concept from a given concept class by a combinatorial measure we call the teaching dimension, Informally, the teaching dimension of a concept class is the minimum number of instances a teacher must reveal to uniquely identify any target concept chosen from the class
AbstractA new view of learning is presented. The basis of this view is a natural notion of reduction...
In this paper we try to organize machine teaching as a coherent set of ideas. Each idea is presented...
We survey recent research concerning the qualitative complexity of Angluin's model of learning with ...
AbstractWhile most theoretical work in machine learning has focused on the complexity of learning, r...
While most theoretical work in machine learning has focused on the complexity of learning, recently ...
While most theoretical work in machine learning has focused on the complexity of learning, recently ...
AbstractIn a typical algorithmic learning model, a learner has to identify a target object from part...
AbstractIn a typical algorithmic learning model, a learner has to identify a target object from part...
Goldman and Kearns [GK91] recently introduced a notionof the teaching dimensionof a concept class. T...
We study the sample complexity of teaching, termed as ``teaching dimension" (TDim) in the literature...
New Generation Computing 8, 337-347, 1991This paper considers computationai learning from the viewp...
textabstractA stochastic model of learning from examples has been introduced by Valiant [1984]. This...
We investigate the teaching of infinite concept classes through the effect of the learning prior (wh...
Abstract. The present paper surveys recent developments in algorith-mic teaching. First, the traditi...
AbstractA new view of learning is presented. The basis of this view is a natural notion of reduction...
AbstractA new view of learning is presented. The basis of this view is a natural notion of reduction...
In this paper we try to organize machine teaching as a coherent set of ideas. Each idea is presented...
We survey recent research concerning the qualitative complexity of Angluin's model of learning with ...
AbstractWhile most theoretical work in machine learning has focused on the complexity of learning, r...
While most theoretical work in machine learning has focused on the complexity of learning, recently ...
While most theoretical work in machine learning has focused on the complexity of learning, recently ...
AbstractIn a typical algorithmic learning model, a learner has to identify a target object from part...
AbstractIn a typical algorithmic learning model, a learner has to identify a target object from part...
Goldman and Kearns [GK91] recently introduced a notionof the teaching dimensionof a concept class. T...
We study the sample complexity of teaching, termed as ``teaching dimension" (TDim) in the literature...
New Generation Computing 8, 337-347, 1991This paper considers computationai learning from the viewp...
textabstractA stochastic model of learning from examples has been introduced by Valiant [1984]. This...
We investigate the teaching of infinite concept classes through the effect of the learning prior (wh...
Abstract. The present paper surveys recent developments in algorith-mic teaching. First, the traditi...
AbstractA new view of learning is presented. The basis of this view is a natural notion of reduction...
AbstractA new view of learning is presented. The basis of this view is a natural notion of reduction...
In this paper we try to organize machine teaching as a coherent set of ideas. Each idea is presented...
We survey recent research concerning the qualitative complexity of Angluin's model of learning with ...