MétaCan
Menu
Back to cohort
Record W3084274250 · doi:10.3233/aic-200630

Empirical scaling analyzer: An automated system for empirical analysis of performance scaling

2020· article· en· W3084274250 on OpenAlexaff
Yasha Pushak, Zongxu Mu, Holger H. Hoos

Bibliographic record

VenueAI Communications · 2020
Typearticle
Languageen
FieldComputer Science
TopicMachine Learning and Data Classification
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsComputer scienceScalingFunction (biology)Empirical researchAlgorithmKey (lock)Spectrum analyzerData miningStatisticsMathematics

Abstract

fetched live from OpenAlex

The time complexity of algorithms, i.e., the scaling of the time required for solving a problem instance as a function of instance size, is of key interest in theoretical computer science and practical applications. In this work, we present a fully automated tool – Empirical Scaling Analyzer (ESA) – for performing sophisticated and detailed empirical scaling analyses. The methodological approach underlying ESA is based on a combination of automatic function fitting and bootstrap sampling; previous versions of the methodology have been used in prior work to characterize the empirical scaling behaviour of several prominent, high-performance SAT and TSP solvers. ESA is applicable to any algorithm or system, as long as running time data can be collected on sets of problem instances of various sizes. We present results from rigorous stress-testing to critically assess ESA on scenarios with challenging characteristics. We also give an overview of empirical scaling results obtained using ESA.

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.012
metaresearch head score (Gemma)0.081
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
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.012
Threshold uncertainty score0.065

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0120.081
Meta-epidemiology (narrow)0.0030.002
Meta-epidemiology (broad)0.0020.001
Bibliometrics0.0060.004
Science and technology studies0.0010.001
Scholarly communication0.0040.006
Open science0.0030.004
Research integrity0.0020.005
Insufficient payload (model declined to judge)0.0120.007

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.119
GPT teacher head0.413
Teacher spread0.295 · 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 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

Citations2
Published2020
Admission routes1
Has abstractyes

Explore more

Same venueAI CommunicationsSame topicMachine Learning and Data ClassificationFrench-language works237,207