MétaCan
Menu
Back to cohort
Record W2465040775 · doi:10.5555/3122009.3122040

Preference-based teaching

2017· article· en· W2465040775 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueJournal of Machine Learning Research · 2017
Typearticle
Languageen
FieldComputer Science
TopicMachine Learning and Algorithms
Canadian institutionsUniversity of Regina
Fundersnot available
KeywordsClass (philosophy)MathematicsDimension (graph theory)Closure (psychology)PreferenceOperator (biology)Euclidean geometryDiscrete mathematicsConcept classAlgebra over a fieldCombinatoricsPure mathematicsComputer scienceArtificial intelligence

Abstract

fetched live from OpenAlex

We introduce a new model of named teaching and a corresponding complexity parameter--the preference-based dimension (PBTD)--representing the worstcase number of examples needed to teach any concept in a given concept class. Although the PBTD coincides with the well-known recursive dimension (RTD) on finite classes, it is radically different on infinite ones: the RTD becomes infinite already for trivial infinite classes (such as half-intervals) whereas the PBTD evaluates to reasonably small values for a wide collection of infinite classes including classes consisting of so-called closed sets w.r.t. a given closure operator, including various classes related to linear sets over N0 (whose RTD had been studied quite recently) and including the class of Euclidean half-spaces. On top of presenting these concrete results, we provide the reader with a theoretical framework (of a combinatorial flavor) which helps to derive bounds on the PBTD.

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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.012
metaresearch head score (Gemma)0.008
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesScience and technology studies, Scholarly communication, Research integrity
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Other design · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.824
Threshold uncertainty score0.999

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0120.008
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.000
Science and technology studies0.0030.000
Scholarly communication0.0020.001
Open science0.0040.001
Research integrity0.0000.005
Insufficient payload (model declined to judge)0.0000.000

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.124
GPT teacher head0.401
Teacher spread0.277 · 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