MétaCan
Menu
Back to cohort
Record W2042255956 · doi:10.1142/s0218213004001727

THE COMPUTATION OF INVERSE TIME VARIANT FUNCTIONS VIA PROPER PSEUDOINVERSE BOUNDING: A RADIAL BASIS FUNCTION NETWORK APPROACH

2004· article· en· W2042255956 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

VenueInternational Journal of Artificial Intelligence Tools · 2004
Typearticle
Languageen
FieldEngineering
TopicMetallurgy and Material Forming
Canadian institutionsUniversity of Regina
Fundersnot available
KeywordsMoore–Penrose pseudoinverseComputer scienceRadial basis function networkRadial basis functionBounding overwatchComputationInverseInverse functionAlgorithmGravitational singularityGeneralized inverseApplied mathematicsMathematical optimizationArtificial neural networkMathematicsArtificial intelligenceMathematical analysis

Abstract

fetched live from OpenAlex

In this article a Radial Basis Function Network (RBFN) approach for fast and efficient computation of inverse continuous time variant functions is presented. The approach is based on using a novel RBFN approach for computing inverse continuous time variant functions via a damped least squares formulation and also on a non-conventional implementation of an original approach for singularities prevention and conditioning improvement. The singularities avoidance approach in turn consists on establishing some characterizing matrices, in order to obtain a performance index and a null space vector, and then properly including it in the overall RBFN approach.

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: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.888
Threshold uncertainty score0.413

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.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.001
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.034
GPT teacher head0.248
Teacher spread0.213 · 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