MétaCan
Menu
Back to cohort
Record W2080622633 · doi:10.1137/050630246

Finding Numerical Derivatives for Unstructured and Noisy Data by Multiscale Kernels

2006· article· en· W2080622633 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

VenueSIAM Journal on Numerical Analysis · 2006
Typearticle
Languageen
FieldMathematics
TopicNumerical methods in inverse problems
Canadian institutionsToronto Metropolitan University
Fundersnot available
KeywordsTikhonov regularizationMathematicsNoisy dataThin plate splineSpline (mechanical)Regularization (linguistics)Applied mathematicsNumerical analysisNoise (video)Kernel (algebra)Numerical differentiationRepresenter theoremDimension (graph theory)AlgorithmKernel methodMathematical optimizationMathematical analysisComputer scienceDiscrete mathematicsPure mathematicsInverse problemSpline interpolationStatisticsArtificial intelligenceKernel embedding of distributionsSupport vector machine

Abstract

fetched live from OpenAlex

The recently developed multiscale kernel of R. Opfer [Adv. Comput. Math., 25 (2006), pp. 357–380] is applied to approximate numerical derivatives. The proposed method is truly mesh‐free and can handle unstructured data with noise in any dimension. The method of Tikhonov and the method of L‐curve are employed for regularization; no information about the noise level is required. An error analysis is provided in a general setting for all dimensions. Numerical comparisons are given in two dimensions which show competitive results with recently published thin plate spline methods.

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.002
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.510
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.002
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.000
Research integrity0.0000.001
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.083
GPT teacher head0.381
Teacher spread0.298 · 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