12 citations · 19 across the 7 of their papers we have counts for
7 papers
MAP- and MLE-Based Teaching
Hans Ulrich Simon, Jan Arne Telle
Imagine a learner L who tries to infer a hidden concept from a collection of observations. Building on the work [4] of Ferri et al., we assume the learner to be parameterized by pr…
Minimum Tournaments with the Strong -Property and Implications for Teaching
Hans Ulrich Simon
A tournament is said to have the -property if, for any set of players, there is another player who beats them all. Minimum tournaments having this property have been explo…
Tournaments, Johnson Graphs, and NC-Teaching
Hans U. Simon
Quite recently a teaching model, called "No-Clash Teaching" or simply "NC-Teaching", had been suggested that is provably optimal in the following strong sense. First, it satisfies…
Primal and Dual Combinatorial Dimensions
Pieter Kleer, Hans Simon
We give tight bounds on the relation between the primal and dual of various combinatorial dimensions, such as the pseudo-dimension and fat-shattering dimension, for multi-valued fu…
Optimal Collusion-Free Teaching
David Kirkpatrick, Hans U. Simon, Sandra Zilles
Formal models of learning from teachers need to respect certain criteria to avoid collusion. The most commonly accepted notion of collusion-freeness was proposed by Goldman and Mat…
On the Containment Problem for Linear Sets
Hans U. Simon
It is well known that the containment problem (as well as the equivalence problem) for semilinear sets is -complete in . It had been shown quite recently that already…