Published on Tue Dec 30 2014

A note about the generalisation of the C-tests

Jose Hernandez-Orallo

A weighting of tasks based on a difficulty function. This difficulty function depends on the complexity of the solution for the task. The resulting aggregations and decompositions are seen as the natural (and trivial) interactive interactive generalisation of the C-tests.

0
0
0
Abstract

In this exploratory note we ask the question of what a measure of performance for all tasks is like if we use a weighting of tasks based on a difficulty function. This difficulty function depends on the complexity of the (acceptable) solution for the task (instead of a universal distribution over tasks or an adaptive test). The resulting aggregations and decompositions are (now retrospectively) seen as the natural (and trivial) interactive generalisation of the C-tests.