MétaCan
Menu
Back to cohort
Record W4412979458 · doi:10.1088/2632-2153/adf7fe

Uncertainty quantification from ensemble variance scaling laws in deep neural networks

2025· article· en· W4412979458 on OpenAlexaff
Ibrahim Elsharkawy, B. H. Hooberman, Yonatan Kahn

Bibliographic record

VenueMachine Learning Science and Technology · 2025
Typearticle
Languageen
FieldComputer Science
TopicAnomaly Detection Techniques and Applications
Canadian institutionsVector InstituteUniversity of Toronto
FundersHigh Energy Physics
KeywordsVariance (accounting)Artificial neural networkScaling lawDeep neural networksScalingLawComputer scienceArtificial intelligenceEconometricsStatistical physicsMathematicsPolitical scienceEconomicsPhysicsAccounting

Abstract

fetched live from OpenAlex

Abstract Quantifying the uncertainty from machine learning analyses is critical to their use in the physical sciences. In this work we focus on uncertainty inherited from the initialization distribution of neural networks. We compute the mean μ L and variance σ L 2 of the test loss L for an ensemble of multi-layer perceptrons with neural tangent kernel initialization in the infinite-width limit, and compare empirically to the results from finite-width networks for three example tasks: MNIST classification, CIFAR classification and calorimeter energy regression. We observe scaling laws as a function of training set size N D for both μ L and σ L , but find that the coefficient of variation ϵ L ≡ σ L / μ L becomes independent of N D at both infinite and finite width for sufficiently large N D . This implies that the coefficient of variation of a finite-width network may be approximated by its infinite-width value, and may in principle be calculable using finite-width perturbation theory.

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.005
metaresearch head score (Gemma)0.022
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: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.005
Threshold uncertainty score0.027

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0050.022
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0020.001
Science and technology studies0.0010.002
Scholarly communication0.0020.004
Open science0.0010.002
Research integrity0.0010.003
Insufficient payload (model declined to judge)0.0020.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.007
GPT teacher head0.253
Teacher spread0.246 · 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

Citations2
Published2025
Admission routes1
Has abstractyes

Explore more

Same venueMachine Learning Science and TechnologySame topicAnomaly Detection Techniques and ApplicationsFrench-language works237,207