MétaCan
Menu
Back to cohort
Record W4281483494 · doi:10.36227/techrxiv.19808446.v1

Performance Evaluation of Few-shot Learning-based System Identification

2022· preprint· en· W4281483494 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

Venuenot available
Typepreprint
Languageen
FieldComputer Science
TopicMachine Learning and ELM
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsIdentification (biology)Computer scienceBounded functionArtificial intelligenceAlgorithmWhite noiseSystem identificationMachine learningNoise (video)Norm (philosophy)Data miningMathematicsImage (mathematics)

Abstract

fetched live from OpenAlex

This paper proposes a performance evaluation method for few-shot learning-based system identification. The basic idea behind the proposed approach is to use “probably approximately correct (PAC)” to assess the obtained boundary of identification errors. The study demonstrates effectiveness of the proposed solution when the noise is not white and there are only limited data samples for the identification in practical applications. The contributions of this study include: 1) modeling errors are quantified via the $L_\infty$ norm; 2) the bounded noises are considered; 3) it is shown that both the modeling and prediction errors can be reduced by increasing the size of training data. Rigorous mathematical analysis and a case study demonstrate the effectiveness of the proposed performance evaluation strategy.

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.005
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.397
Threshold uncertainty score0.693

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0050.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.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.047
GPT teacher head0.312
Teacher spread0.265 · 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

Quick stats

Citations2
Published2022
Admission routes1
Has abstractyes

Explore more

Same topicMachine Learning and ELMFrench-language works237,207