A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
We study the average number of well-chosen labeled examples that are required for a helpful teacher to uniquely specify a target function within a concept class. This "average teaching dimension" has been studied in learning theory and combinatorics and is an attractive alternative to the "worst-case" teaching dimension of Goldman and Kearns  which is exponential for many interesting concept classes. Recently Balbach  showed that the classes of 1-decision lists and 2-term DNF each havedoi:10.1007/11776420_18 fatcat:xvjgunz2irhvvhmkjlscfbtdem