MétaCan
Menu
Back to cohort

EvoDNN - Evolving Weights, Biases, and Activation Functions in a Deep Neural Network

2022· article· en· W4293519282 on OpenAlexaff
Peiyu Cui, Kay C. Wiese

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicEvolutionary Algorithms and Applications
Canadian institutionsSimon Fraser University
Fundersnot available
KeywordsActivation functionComputer scienceDifferentiable functionArtificial neural networkArtificial intelligenceDeep neural networksSet (abstract data type)Flexibility (engineering)Feature (linguistics)Coding (social sciences)Function (biology)Code (set theory)Theoretical computer scienceMathematicsBiology

Abstract

fetched live from OpenAlex

Classification, such as classifying cell samples into cancer (malignant) or normal (benign), or the classification of genome regions into functional regions (for example coding regions or promoter regions) are important problems in Computational Biology. For such tasks, we have previously designed an evolutionary deep neural network that in addition to evolving the neuron's weights and biases also evolves (learns) the activation functions for each neuron and called this approach EvoDNN. EvoDNN can employ activation functions that are non-differentiable as it does not rely on back-propagation. This feature is adding flexibility in terms of activation functions EvoDNN can employ. The work presented here extends our previous work on EvoDNN by analyzing a more extensive set of data sets and studying variations of the internal topology of the EvoDNN model. In addition, we study the effect of evolving the weights and biases only while holding the activation function fixed and demonstrate that evolving activation functions indeed provides better performance. We also compare our model to several other popular models and demonstrate superior performance on several data sets. The current code for EvoDNN is available at https://github.com/Payuing/evoDNN.

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.001
metaresearch head score (Gemma)0.004
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: Empirical · Consensus signal: none
Teacher disagreement score0.008
Threshold uncertainty score0.015

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.004
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0000.001
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0020.001
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0020.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.018
GPT teacher head0.230
Teacher spread0.212 · 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
GenreEmpirical

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
Published2022
Admission routes1
Has abstractyes

Explore more

Same topicEvolutionary Algorithms and ApplicationsFrench-language works237,207