MétaCan
Menu
Back to cohort
Record W2484895019

Evolutionary optimization of logic-oriented systems

2001· article· en· W2484895019 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

VenueGenetic and Evolutionary Computation Conference · 2001
Typearticle
Languageen
FieldComputer Science
TopicEvolutionary Algorithms and Applications
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsComputer scienceGenetic programmingArtificial intelligenceCurse of dimensionalityFuzzy logicParametric statisticsArtificial neural networkEvolutionary algorithmEvolutionary computationTheoretical computer scienceMathematics
DOInot available

Abstract

fetched live from OpenAlex

This study is concerned with an evolutionary methodology of designing logic-based models. These models dwell on a logic fabric of granular computing and learning capabilities of fuzzy neural networks. The proposed design comprises two fundamental phases, namely an evolutionary optimization (via Genetic Programming, GP) of the generic structure of the model that is followed by its parametric refinement completed in the form of a detailed gradient-based learning. We discuss the underlying algorithm and elaborate on the way in which GP helps cope with high dimensionality of the modeling problem (it is known that a significant number of variables leads to the failure of the parametric learning). The study is illustrated with the aid of a numeric example that provides a detailed insight into the performance of the logic-oriented models and quantifies crucial design issues.

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 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: none
Teacher disagreement score0.662
Threshold uncertainty score0.738

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.0000.000
Open science0.0000.000
Research integrity0.0000.000
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.021
GPT teacher head0.242
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