We explore the aggregation of tasks by weighting them using a difficulty function that depends on the complexity of the (acceptable) policy 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 generalization of the C-tests.
CITATION STYLE
Hernández-Orallo, J. (2015). C-tests revisited: Back and forth with complexity. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9205, pp. 272–282). Springer Verlag. https://doi.org/10.1007/978-3-319-21365-1_28
Mendeley helps you to discover research relevant for your work.