MétaCan
Menu
Back to cohort

Building Resilient ML Applications using Ensembles against Faulty Training Data

2023· article· en· W4388212577 on OpenAlexaff
Abraham Chan

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicAdversarial Robustness in Machine Learning
Canadian institutionsUniversity of British Columbia HospitalUniversity of British Columbia
Fundersnot available
KeywordsComputer scienceResilience (materials science)ReuseProcess (computing)Training setTraining (meteorology)Machine learningArtificial intelligenceData modelingSoftware engineeringEngineering

Abstract

fetched live from OpenAlex

Supervised machine learning (ML) applications are data-driven, and thus require large amounts of data for training. Whether the training data is manually collected or automatically generated, it is prone to faults like mislabelling, accidental deletion, or repetition. Our research focuses on developing the most effective and efficient techniques with minimal human effort to improve the resilience of ML applications against faulty training data. We find that ensembles have a higher resilience to faulty training data than individual models, especially when using ensembles with architecturally diverse constituent models. We also find that ensembles are more effective than many existing techniques against mislabelled training data, even in safety-critical domains such as autonomous vehicles and healthcare. Hence, we aim to improve the applicability of ensembles in real-world systems by (1) optimizing the process of searching for resilient ensembles, and (2) reducing the training cost by maximizing reuse of trained weights and (3) examining methods to make ensembles more explainable to stakeholders.

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.001
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: Methods · Consensus signal: Methods
Teacher disagreement score0.426
Threshold uncertainty score0.631

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0010.000
Scholarly communication0.0000.001
Open science0.0020.002
Research integrity0.0000.000
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.142
GPT teacher head0.376
Teacher spread0.234 · 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.

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

Citations0
Published2023
Admission routes1
Has abstractyes

Explore more

Same topicAdversarial Robustness in Machine LearningFrench-language works237,207