MétaCan
Menu
Back to cohort
Record W2947061402 · doi:10.22215/etd/2018-13392

On Designing Adaptive Data Structures with Adaptive Data "Sub"-Structures

2018· dissertation· en· W2947061402 on OpenAlexaff
Ekaba Bisong

Bibliographic record

Venuenot available
Typedissertation
Languageen
FieldComputer Science
TopicOptimization and Search Problems
Canadian institutionsCarleton University
Fundersnot available
KeywordsComputer scienceHierarchyProbabilistic logicReinforcement learningAutomatonLocalityObject (grammar)Process (computing)Transitive relationState (computer science)Adaptation (eye)Artificial intelligenceTheoretical computer scienceData miningAlgorithmProgramming languageMathematics

Abstract

fetched live from OpenAlex

Data structures are key pillars for optimizing computational efficiency, as they contribute in no small measure to enhancing the "speed" in the accessing and subsequent processing of data. The need for enhancing speed is critical for almost all applications and domains, and this is most relevant when real-time or near real-time efficiency is desired.

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 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.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow), Open science
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.910
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0010.002
Open science0.0080.001
Research integrity0.0000.001
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.094
GPT teacher head0.323
Teacher spread0.229 · 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 teacher head, not a consensus.

Study designSimulation or modeling
Domainnot available
GenreMethods

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

Citations1
Published2018
Admission routes1
Has abstractyes

Explore more

Same topicOptimization and Search ProblemsFrench-language works237,207