MétaCan
Menu
Back to cohort
Record W3136996429 · doi:10.1109/tcsii.2021.3067014

Dynamic Quaternion Extreme Learning Machine

2021· article· en· W3136996429 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

VenueIEEE Transactions on Circuits & Systems II Express Briefs · 2021
Typearticle
Languageen
FieldComputer Science
TopicMachine Learning and ELM
Canadian institutionsLakehead University
FundersNational Natural Science Foundation of China
KeywordsExtreme learning machineHypercomplex numberGeneralizationComputer scienceBenchmark (surveying)QuaternionArtificial neural networkBasis (linear algebra)Early stoppingNetwork architectureArtificial intelligenceAlgorithmMathematics

Abstract

fetched live from OpenAlex

Quaternion random neural network trained by extreme learning machine (Q-ELM) becomes attractive for its good learning capability and generalization performance in 3 or 4-dimensional (3/4-D) hypercomplex data learning. But how to determine the optimal network architecture is always challenging in Q-ELM. To this end, a novel error-minimization-based Q-ELM (QEM-ELM) that only needs to optimize the output weights of the newly added neuron is developed in this brief. On this basis, a dynamic network construction scheme is further extended on Q-ELM, leading to a novel DQ-ELM, where the hidden nodes can be dynamically recruited or deleted according to the significance to network performance. The network parameters can be optimized and the architecture can be self-adapted simultaneously. Simulation results on many benchmark datasets demonstrate that the proposed QEM-ELM and DQ-ELM achieve good generalization performance by preserving a compact network size.

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 categoriesMeta-epidemiology (narrow)
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.972
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.001
Science and technology studies0.0010.000
Scholarly communication0.0000.001
Open science0.0010.000
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.019
GPT teacher head0.238
Teacher spread0.219 · 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