MétaCan
Menu
Back to cohort
Record W2406596203 · doi:10.7202/1043909ar

Botcrafting and Botbreeding : A Simplified Economics of Evolutionary Algorithms

2016· article· en· W2406596203 on OpenAlexvenueno aff
Idriss Aberkane

Bibliographic record

VenueSens public · 2016
Typearticle
Languageen
FieldDecision Sciences
TopicAuction Theory and Applications
Canadian institutionsnot available
Fundersnot available
KeywordsGenetic programmingLeverage (statistics)DomesticationComputer sciencePurchasing powerGenetic algorithmEconomicsArtificial intelligenceMachine learningBiologyEcology

Abstract

fetched live from OpenAlex

Let us consider the industrial and economic impact of genetic programming and its generic availability to the masses. Is the interaction between genetic programming and the so-called “cognitariat” the beginning of a “genetic revolution” in the industrial sense ? Can we theorise a genetic marketplace, based on the dynamic of bids and asks for genetic algorithms to be made-to-order and leverage any daily routine, thus trading value ? Can genetic algorithms be crossbred to achieve a phenomenon similar to animal domestication, with a transition from wild to domestic type and heterosis, and can such a pressure for domestication percolate to macroeconomic value ? Which economic marketplace would allow such an economic phenomenon to happen and percolate least impeded ? Here I consider the economic implication of evolving genetic algorithms to address any repetitive human task, within a grand genetic marketplace composed of bidders and askers that would be using, evolving and breeding genetic programs (“bots”) and manipulating them as “bot breeders” to leverage their own economic output. I define a cryptocurrency on the buyer’s side, conceived to represent a unit of genetic purchasing power, which I call a “botcoin”.

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.005
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: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.009
Threshold uncertainty score0.030

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.005
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0010.004
Scholarly communication0.0040.006
Open science0.0010.002
Research integrity0.0020.002
Insufficient payload (model declined to judge)0.0090.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.343
Teacher spread0.214 · 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
Published2016
Admission routes1
Has abstractyes

Explore more

Same venueSens publicSame topicAuction Theory and ApplicationsFrench-language works237,207