MétaCan
Menu
Back to cohort
Record W4417163200 · doi:10.3390/math13243931

Asymptotic Confidence Intervals for the Mean with Increased Finite-Sample Coverage Probabilities

2025· article· en· W4417163200 on OpenAlexafffund
Sp Bhardwaj, Jervis Gallanosa, Yuliya V. Martsynyuk

Bibliographic record

VenueMathematics · 2025
Typearticle
Languageen
FieldDecision Sciences
TopicProbability and Risk Models
Canadian institutionsUniversity of ManitobaPublic Health Agency of Canada
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsConfidence intervalWiener processCentral limit theoremLimit (mathematics)Coverage probabilityRandom variableConvergence (economics)Interval (graph theory)Distribution (mathematics)

Abstract

fetched live from OpenAlex

We consider a Student process based on independent copies of a random variable X. If X is in the domain of attraction of the normal law (DAN), a weighted version of the Student process is known to follow a functional Central Limit Theorem (FCLT). Accordingly, appropriate functionals of such a process converge in distribution to the same functionals of the similarly weighted standard Wiener process. We use such a convergence for an integral functional and derive asymptotic confidence intervals (CIs) for the mean of X. For right-skewed distributions of X in DAN, we show that the obtained CIs have higher finite-sample coverage probabilities than, and may be preferred over, a CI I1 of the same asymptotic confidence level 1−α that is based on the CLT for the Student t-statistic, since the finite-sample coverage probabilities of the latter CI may be lower than 1−α. Moreover, for such distributions, the finite-sample coverage probabilities of our best two CIs are also higher than those of their respective equal-expected-length I1 counterparts.

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.030
metaresearch head score (Gemma)0.245
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.030
Threshold uncertainty score0.158

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0300.245
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0020.002
Bibliometrics0.0050.002
Science and technology studies0.0010.003
Scholarly communication0.0030.005
Open science0.0040.004
Research integrity0.0030.004
Insufficient payload (model declined to judge)0.0030.001

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.101
GPT teacher head0.359
Teacher spread0.259 · 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 designTheoretical or conceptual
Domainnot available
GenreMethods

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

Citations0
Published2025
Admission routes2
Has abstractyes

Explore more

Same venueMathematicsSame topicProbability and Risk ModelsFrench-language works237,207