MétaCan
Menu
Back to cohort
Record W3198159315 · doi:10.23977/acss.2021.050105

Research on Deep Neural Network Solution of Ordinary Differential Equations and Its Application

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

VenueAdvances in Computer Signals and Systems · 2021
Typearticle
Languageen
FieldEngineering
TopicAdvanced Sensor and Control Systems
Canadian institutionsnot available
Fundersnot available
KeywordsArtificial neural networkOrdinary differential equationComputer scienceDiscretizationMathematicsDifferential equationBoundary value problemSolution setNumerical partial differential equationsSet (abstract data type)Applied mathematicsAlgorithmMathematical analysisArtificial intelligence

Abstract

fetched live from OpenAlex

This article discusses the application of a single hidden layer neural network algorithm in solving numerical ordinary differential equations. Set the approximate solution with neural network structure to meet the initial boundary value conditions of ordinary differential equations, and discretize the weights of neural networks in the original equations. The optimization problem is transformed into the training problem of the neural network in the approximate solution, so that the approximate solution is close to the real solution. The changes in the structure, weights, and thresholds of the neural network are observed through network deduction. Numerical examples based on the python language prove the algorithm's performance Effectiveness.

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: Empirical · Consensus signal: none
Teacher disagreement score0.883
Threshold uncertainty score0.385

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.000
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.032
GPT teacher head0.302
Teacher spread0.270 · 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