MétaCan
Menu
Back to cohort
Record W4296870767 · doi:10.1016/j.ifacol.2022.09.071

Novel Representative Sampling for Improved Active Learning

2022· article· en· W4296870767 on OpenAlexaff
Debangsha Sarkar, A Shabani, Apurva Narayan

Bibliographic record

VenueIFAC-PapersOnLine · 2022
Typearticle
Languageen
FieldComputer Science
TopicMachine Learning and Algorithms
Canadian institutionsUniversity of the Fraser ValleyOkanagan University CollegeUniversity of British Columbia, Okanagan CampusUniversity of British Columbia
Fundersnot available
KeywordsComputer scienceArtificial intelligenceSampling (signal processing)Machine learningMNIST databaseActive learning (machine learning)Transformation (genetics)Set (abstract data type)Sampling distributionObject (grammar)Pattern recognition (psychology)Data miningDeep learningMathematicsComputer visionStatistics

Abstract

fetched live from OpenAlex

Active learning solves machine learning problems where acquiring labels for the data is costly. It allows for the learner to select training samples by asking intelligent questions. Various sampling strategies exist for choosing the training set for pool-based active learning. However, the existing representative querying approaches for active learning do not attempt to capture the underlying data distribution, which we believe is an important part of representative sampling. To that end, we propose an adaptation of the sigma point sampling technique from unscented transformation (UT) for constructing a representative subset. UT has shown to be very effective in non-linear transformation modeling in object tracking and robotics. When combined with the Gaussian mixture model, sigma points can estimate the statistical moments such as mean and co-variance of an unknown distribution with very few samples which are generated deterministically. Sigma point sampling being parameterized gives better control over the sampling process. We use sigma points for representative subset construction and train the learner on them. We compare our results with other sampling techniques and improve test accuracy on the handwritten digit recognition data set MNIST.

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.004
metaresearch head score (Gemma)0.012
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: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.004
Threshold uncertainty score0.020

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0040.012
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0020.001
Bibliometrics0.0010.001
Science and technology studies0.0010.001
Scholarly communication0.0020.003
Open science0.0030.003
Research integrity0.0020.002
Insufficient payload (model declined to judge)0.0020.001

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.030
GPT teacher head0.314
Teacher spread0.284 · 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
Published2022
Admission routes1
Has abstractyes

Explore more

Same venueIFAC-PapersOnLineSame topicMachine Learning and AlgorithmsFrench-language works237,207