MétaCan
Menu
Back to cohort
Record W4200139099 · doi:10.1109/ictai52525.2021.00111

Incremental Feature Learning Using Constructive Neural Networks

2021· article· en· W4200139099 on OpenAlex
Armin Sadreddin, Samira Sadaoui

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

Venue2021 IEEE 33rd International Conference on Tools with Artificial Intelligence (ICTAI) · 2021
Typearticle
Languageen
FieldComputer Science
TopicData Stream Mining Techniques
Canadian institutionsUniversity of Regina
Fundersnot available
KeywordsConstructiveComputer scienceArtificial intelligenceFeature (linguistics)Artificial neural networkMachine learningPattern recognition (psychology)

Abstract

fetched live from OpenAlex

Data-driven applications often change over time by considering new features to improve predictive accuracy. Re-training a model from scratch for every change loses the learned knowledge and is very time-consuming. To fill the big literature gap, we devise an incremental feature learning algorithm using constructive neural networks to include new groups of features gradually and without re-learning from scratch. The algorithm dynamically constructs the final model by determining the optimal network topology leading to the best performance. We demonstrate our algorithm’s efficacy through a regression problem by evaluating the sequential models obtained after extending the feature space incrementally, using different feature rankings. We also assess our algorithm without feature grouping and with the non-incremental learning version.

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), Scholarly communication
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.872
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.0000.000
Scholarly communication0.0020.001
Open science0.0020.000
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0010.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.107
GPT teacher head0.328
Teacher spread0.221 · 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