MétaCan
Menu
Back to cohort

Application of Ant Colony Programming Approach for Solving Systems of Stochastic Differential Equations

2024· article· en· W4399970954 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.

venuePublished in a venue whose home country is Canada.
no affNo Canadian affiliation: this work is invisible to an affiliation-only frame.
No Canadian affiliation. An affiliation-only frame, the usual design, would never have seen this work. It is one of the works that make the case for inverting the frame.

Bibliographic record

VenueInternational Journal of Analysis and Applications · 2024
Typearticle
Languageen
FieldComputer Science
TopicMetaheuristic Optimization Algorithms Research
Canadian institutionsnot available
Fundersnot available
KeywordsMathematicsMathematical optimizationAnt colony optimization algorithmsAnt colonyStochastic differential equationStochastic programmingApplied mathematics

Abstract

fetched live from OpenAlex

Stochastic differential equations (SDE) have wide applications in natural phenomena, engineering, finance, and biological models. Obtaining analytic solutions for an SDE is often complex, and the complexity increases for an SDE system. The paper introduces ant colony programming (ACP) as a novel approach for solving SDE system. Ant colony programming was developed in two directions, the first is to add the Wiener process as a variable to the terminals and functions, and the second is to construct the appropriate fitness function . ACP constructs mathematical expressions and evaluates them using the fitness function . The ACP proposed effectiveness has been demonstrated by applying to 2,3 and 4-dimensional SDE systems. The most important finding of this work is that ACP generates symbolic stochastic processes that represent solutions for SDE system. Methods for solving SDE systems are important tools for study phenomena that involve noise or randomness.

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.001
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: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.867
Threshold uncertainty score0.271

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.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.022
GPT teacher head0.327
Teacher spread0.305 · 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