MétaCan
Menu
Back to cohort
Record W4386902952 · doi:10.1162/isal_a_00664

Finding Sparse Initialisations using Neuroevolutionary Ticket Search (NeTS)

2023· article· en· W4386902952 on OpenAlex
Alex Jackson, Nandi Schoots, Amin Ahantab, G. Flucke, Elizabeth Black

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
Typearticle
Languageen
FieldComputer Science
TopicEvolutionary Algorithms and Applications
Canadian institutionsArtificial Intelligence in Medicine (Canada)
FundersUK Research and Innovation
KeywordsTicketComputer scienceComputer network

Abstract

fetched live from OpenAlex

Deep learning, powered by overparameterised Deep Neural Networks (DNNs), has seen a surge in interest in recent years. Although these networks are often pruned to a fraction of their size post-training, the Lottery Ticket Hypothesis (LTH) suggests that equally trainable, sparser subnetworks exist within them. This paper presents a new evolutionary algorithm, Neuroevolutionary Ticket Search (NeTS), which finds these efficient subnetworks in feed-forward or convolutional DNN architectures. Tested on common training datasets, NeTS can prune DNNs prior to significant gradient descent training, leading to notable performance benefits.

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.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesInsufficient payload (model declined to judge)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.929
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.002
Science and technology studies0.0010.000
Scholarly communication0.0000.001
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.129
GPT teacher head0.336
Teacher spread0.207 · 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

Citations0
Published2023
Admission routes1
Has abstractyes

Explore more

Same topicEvolutionary Algorithms and ApplicationsFrench-language works237,207