MétaCan
Menu
Back to cohort
Record W1521450751

Teaching Dimensions based on Cooperative Learning.

2008· article· en· W1521450751 on OpenAlexaff
Sandra Zilles, Steffen Lange, Robert C. Holte, Martin Zinkevich

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicMachine Learning and Algorithms
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsComputer scienceMonomialExploitCoding (social sciences)Dimension (graph theory)Class (philosophy)Monotonic functionTheoretical computer scienceSample complexityArtificial intelligenceMathematicsDiscrete mathematics
DOInot available

Abstract

fetched live from OpenAlex

The problem of how a teacher and a learner can cooperate in the process of learning concepts from examples in order to minimize the required sample size without “coding tricks ” has been widely addressed, yet without achieving teaching and learning protocols that meet what seems intuitively an optimal choice for selecting samples in teaching. We introduce the model of subset teaching sets, based on the idea that both teacher and learner can exploit the assumption that the partner is cooperative. We show how this can reduce the sample size drastically without using coding tricks. For instance, monomials can be taught with only two examples independent of the number of variables. The corresponding variant of the teaching dimension (STD) turns out to be nonmonotonic with respect to subclasses of concept classes. We discuss why this nonmonotonicity might be inherent in optimal cooperative teaching scenarios. Nevertheless, trying to overcome nonmonotonicity, we introduce a second variant, the recursive teaching dimension (RTD), which is monotonic and yields the same positive results for some concept classes, such as the class of all monomials, yet can be arbitrarily worse than the STD.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.006
metaresearch head score (Gemma)0.028
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.006
Threshold uncertainty score0.033

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0060.028
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0010.003
Scholarly communication0.0020.005
Open science0.0020.005
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0040.001

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.014
GPT teacher head0.252
Teacher spread0.238 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations17
Published2008
Admission routes1
Has abstractyes

Explore more

Same topicMachine Learning and AlgorithmsFrench-language works237,207